113,265 research outputs found
The Power of Choice in Priority Scheduling
Consider the following random process: we are given queues, into which
elements of increasing labels are inserted uniformly at random. To remove an
element, we pick two queues at random, and remove the element of lower label
(higher priority) among the two. The cost of a removal is the rank of the label
removed, among labels still present in any of the queues, that is, the distance
from the optimal choice at each step. Variants of this strategy are prevalent
in state-of-the-art concurrent priority queue implementations. Nonetheless, it
is not known whether such implementations provide any rank guarantees, even in
a sequential model.
We answer this question, showing that this strategy provides surprisingly
strong guarantees: Although the single-choice process, where we always insert
and remove from a single randomly chosen queue, has degrading cost, going to
infinity as we increase the number of steps, in the two choice process, the
expected rank of a removed element is while the expected worst-case
cost is . These bounds are tight, and hold irrespective of the
number of steps for which we run the process.
The argument is based on a new technical connection between "heavily loaded"
balls-into-bins processes and priority scheduling.
Our analytic results inspire a new concurrent priority queue implementation,
which improves upon the state of the art in terms of practical performance
Heavy-tailed Distributions In Stochastic Dynamical Models
Heavy-tailed distributions are found throughout many naturally occurring
phenomena. We have reviewed the models of stochastic dynamics that lead to
heavy-tailed distributions (and power law distributions, in particular)
including the multiplicative noise models, the models subjected to the
Degree-Mass-Action principle (the generalized preferential attachment
principle), the intermittent behavior occurring in complex physical systems
near a bifurcation point, queuing systems, and the models of Self-organized
criticality. Heavy-tailed distributions appear in them as the emergent
phenomena sensitive for coupling rules essential for the entire dynamics
Queue Length Asymptotics for Generalized Max-Weight Scheduling in the presence of Heavy-Tailed Traffic
We investigate the asymptotic behavior of the steady-state queue length
distribution under generalized max-weight scheduling in the presence of
heavy-tailed traffic. We consider a system consisting of two parallel queues,
served by a single server. One of the queues receives heavy-tailed traffic, and
the other receives light-tailed traffic. We study the class of throughput
optimal max-weight-alpha scheduling policies, and derive an exact asymptotic
characterization of the steady-state queue length distributions. In particular,
we show that the tail of the light queue distribution is heavier than a
power-law curve, whose tail coefficient we obtain explicitly. Our asymptotic
characterization also contains an intuitively surprising result - the
celebrated max-weight scheduling policy leads to the worst possible tail of the
light queue distribution, among all non-idling policies. Motivated by the above
negative result regarding the max-weight-alpha policy, we analyze a
log-max-weight (LMW) scheduling policy. We show that the LMW policy guarantees
an exponentially decaying light queue tail, while still being throughput
optimal
A Multi-objective Perspective for Operator Scheduling using Fine-grained DVS Architecture
The stringent power budget of fine grained power managed digital integrated
circuits have driven chip designers to optimize power at the cost of area and
delay, which were the traditional cost criteria for circuit optimization. The
emerging scenario motivates us to revisit the classical operator scheduling
problem under the availability of DVFS enabled functional units that can
trade-off cycles with power. We study the design space defined due to this
trade-off and present a branch-and-bound(B/B) algorithm to explore this state
space and report the pareto-optimal front with respect to area and power. The
scheduling also aims at maximum resource sharing and is able to attain
sufficient area and power gains for complex benchmarks when timing constraints
are relaxed by sufficient amount. Experimental results show that the algorithm
that operates without any user constraint(area/power) is able to solve the
problem for most available benchmarks, and the use of power budget or area
budget constraints leads to significant performance gain.Comment: 18 pages, 6 figures, International journal of VLSI design &
Communication Systems (VLSICS
Planning complex engineer-to-order products
The design and manufacture of complex Engineer-to-Order products is characterised by uncertain operation durations, finite capacity resources and multilevel product structures. Two scheduling methods are presented to minimise expected costs for multiple products across multiple finite capacity resources. The first sub-optimises the operations sequence, using mean operation durations, then refines the schedule by perturbation. The second method generates a schedule of start times directly by random search with an embedded simulation of candidate schedules for evaluation. The methods are compared for industrial examples
A Comprehensive Experimental Comparison of Event Driven and Multi-Threaded Sensor Node Operating Systems
The capabilities of a sensor network are strongly influenced by the operating system used on the sensor nodes. In general, two different sensor network operating system types are currently considered: event driven and multi-threaded. It is commonly assumed that event driven operating systems are more suited to sensor networks as they use less memory and processing resources. However, if factors other than resource usage are considered important, a multi-threaded system might be preferred. This paper compares the resource needs of multi-threaded and event driven sensor network operating systems. The resources considered are memory usage and power consumption. Additionally, the event handling capabilities of event driven and multi-threaded operating systems are analyzed and compared. The results presented in this paper show that for a number of application areas a thread-based sensor network operating system is feasible and preferable
- …