Debankur Mukherjee

Learn More
Efficiency and certainty of payback have not yet attained desired level for solar photovoltaic energy systems. Despite huge development in prediction of solar radiation data, a clear disconnect in extraction and effective engineering utilization of pertinent information from such data is acting as a major roadblock towards penetration of this emerging(More)
Accurate prediction of solar PV cell and module behaviour under actual environmental conditions of the application site and selection of the best performing module out of available alternatives is a big challenge for guaranteed payback and reliable operation of any solar PV energy project. The authors have come out with a quick yet reliable methodology for(More)
Despite huge development in prediction of solar radiation data, there is a clear disconnect in extraction and effective utilization of pertinent information from such data. Use of quality function deployment (QFD) can smartly identify the most significant statistics representing insolation availability for a solar PV installation. A MATLAB program has been(More)
A fundamental challenge in large-scale cloud networks and data centers is to achieve highly efficient server utilization and limit energy consumption, while providing excellent user-perceived performance in the presence of uncertain and time-varying demand patterns. Auto-scaling provides a popular paradigm for automatically adjusting service capacity in(More)
We consider a system of <i>N</i> parallel queues with unit exponential service rates and a single dispatcher where tasks arrive as a Poisson process of rate &#955;(<i>N</i>). When a task arrives, the dispatcher assigns it to a server with the shortest queue among <i>d</i>(<i>N</i>) &#8804; <i>N</i> randomly selected servers. This load balancing policy is(More)
We consider a system of N identical parallel server pools and a single dispatcher where tasks arrive as a Poisson process. Arriving tasks cannot be queued, and must immediately be assigned to one of the server pools to start execution. The execution times are assumed to be exponentially distributed, and do not depend on the number of tasks contending for(More)
The k-section width and the Max-Cut for the configuration model are shown to exhibit phase transitions according to the values of certain parameters of the asymptotic degree distribution. These transitions mirror those observed on Erd˝ os-Rényi random graphs, established by Luczak and McDiarmid (2001), and Coppersmith et al. (2004), respectively.
Traditionally, reconfiguration problems ask the question whether a given solution of an optimization problem can be transformed to a target solution in a sequence of small steps that preserve feasibility of the intermediate solutions. In this paper, rather than asking this question from an algorithmic perspective, we analyze the combinatorial structure(More)
  • 1