Browsing by Subject "Scheduling"
Now showing items 2140 of 53

Article
Disorder considerations in resourceconstrained scheduling
A method is presented for allocating resources to construction activities and for scheduling construction projects under resource constraints by considering the effects that such resource limitations may have on the tendency ...

Conference Object
Distributed Cooperation and Adversity: Complexity TradeOffs
(2003)The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundamental problems in distributed computing. Such ...

Conference Object

Conference Object
Efficiency of oblivious versus nonoblivious schedulers for optimistic, ratebased flow control
(ACM, 1997)Lower and upper bounds on convergence complexity, under varying degrees of locality, for optimistic, ratebased flow control algorithms are established. It is shown that randomness can be exploited to yield an even simpler ...

Article
Efficiency of oblivious versus nonoblivious schedulers for optimistic, ratebased flow control
(2005)Two important performance parameters of distributed, ratebased flow control algorithms are their locality and convergence complexity. The former is characterized by the amount of global knowledge that is available to their ...

Article
A Family of ResourceBound RealTime Process Algebras
(2006)The Algebra of Communicating Shared Resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the timing behavior of a realtime system depends ...

Conference Object
Fault detection and recovery in a datadriven realtime multiprocessor
(Publ by IEEE, 1994)This paper introduces the mechanisms required to perform fault detection and recovery in the DART multiprocessor architecture. The DART multiprocessors uses prioritized datadriven scheduling to ensure that multiple hard ...

Conference Object

Conference Object
Heterogeneous and NUMAaware scheduling for manycore architectures
(Association for Computing Machinery, Inc, 2017)As the number of cores increases in a single chip processor, several challenges arise: wire delays, contention for outofchip accesses, and core heterogeneity. In order to address these issues and the applications demands, ...

Article
Measuring the impact of adversarial errors on packet scheduling strategies
(2013)In this paper we explore the problem of achieving efficient packet transmission over unreliable links with worst case occurrence of errors. In such a setup, even an omniscient offline scheduling strategy cannot achieve ...

Article
Measuring the impact of adversarial errors on packet scheduling strategies
(2016)In this paper, we explore the problem of achieving efficient packet transmission over unreliable links with worstcase occurrence of errors. In such a setup, even an omniscient offline scheduling strategy cannot achieve ...

Article
Metadata ranking and pruning for failure detection in grids
(2008)The objective of Grid computing is to make processing power as accessible and easy to use as electricity and water. The last decade has seen an unprecedented growth in Grid infrastructures which nowadays enables largescale ...

Conference Object
The micropulse framework for adaptive waking windows in sensor networks
(2007)In this paper we present MicroPulse, a novel framework for adapting the waking window of a sensing device S based on the data workload incurred by a query Q. Assuming a typical treebased aggregation scenario, the waking ...

Article
Minimizing Expectation Plus Variance
(2015)We consider strategic games in which each player seeks a mixed strategy to minimize her cost evaluated by a concave valuationV (mapping probability distributions to reals)

Article
Minimizing expectation plus variance
(2012)We consider strategic games in which each player seeks a mixed strategy to minimize her cost evaluated by a concave valuation V (mapping probability distributions to reals)

Article
Online parallel scheduling of nonuniform tasks: Trading failures for energy
(2015)Consider a system in which tasks of different execution times arrive continuously and have to be executed by a set of machines that are prone to crashes and restarts. In this paper we model and study the impact of parallelism ...

Article
Online parallel scheduling of nonuniform tasks: Trading failures for energy
(2013)Consider a system in which tasks of different execution times arrive continuously and have to be executed by a set of processors that are prone to crashes and restarts. In this paper we model and study the impact of ...

Article
PADS: An approach to modeling resource demand and supply for the formal analysis of hierarchical scheduling
(2012)As realtime embedded systems become more complex, resource partitioning is increasingly used to guarantee realtime performance. Recently, several compositional frameworks of resource partitioning have been proposed using ...

Article
Periodic scheduling with costs revisited: A novel approach for wireless broadcasting
(2012)Periodic broadcast scheduling typically considers a set of discrete data items, characterized by their popularity, size and scheduling cost. A classic goal is the definition of an infinite, periodic schedule that yields ...

Article
The Price of Anarchy for restricted parallel links
(2006)In the model of restricted parallel links, n users must be routed on m parallel links under the restriction that the link for each user be chosen from a certain set of allowed links for the user. In a (pure) Nash equilibrium, ...