Results 1 - 10 of 16,464

On Optimal Scheduling under Uncertainty

by Yasmina Abdeddaïm, Eugene Asarin, Oded Maler - In Proceedings of TACAS 2003 , 2003
"... In this work we treat the problem of scheduling under two types of temporal uncertainty, setbased and probabilistic. For the former we define appropriate optimality criteria and develop an algorithm for finding optimal scheduling strategies using a backward reachability algorithm for timed automata. ..."
Abstract - Cited by 15 (4 self) - Add to MetaCart
In this work we treat the problem of scheduling under two types of temporal uncertainty, setbased and probabilistic. For the former we define appropriate optimality criteria and develop an algorithm for finding optimal scheduling strategies using a backward reachability algorithm for timed automata

Scheduling Multithreaded Computations by Work Stealing

by Robert D. Blumofe , Charles E. Leiserson , 1994
"... This paper studies the problem of efficiently scheduling fully strict (i.e., well-structured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMD-style computation is “work stealing," in which processors needing work steal com ..."
Abstract - Cited by 568 (34 self) - Add to MetaCart
of the algorithm is at most O(TmS,,,P), where S, is the site of the largest activation record of any thread, thereby justify-ing the folk wisdom that work-stealing schedulers are more communication eficient than their work-sharing counterparts. All three of these bounds are existentially optimal to within a

On Optimal Scheduling under Uncertainty

by Yasmina Abdedda Eugene, Eugene Asarin, Oded Maler
"... In this work we treat the problem of scheduling under two types of temporal uncertainty, setbased and probabilistic. For the former we define appropriate optimality criteria and develop an algorithm for finding optimal scheduling strategies using a backward reachability algorithm for timed automa ..."
Abstract - Add to MetaCart
In this work we treat the problem of scheduling under two types of temporal uncertainty, setbased and probabilistic. For the former we define appropriate optimality criteria and develop an algorithm for finding optimal scheduling strategies using a backward reachability algorithm for timed

A reconfigurable optimizing scheduler

by David J. Montana , 2001
"... We have created a framework that provides a way to represent a wide range of scheduling and assignment problems across many domains. We have also created an optimizing scheduler that can, without modification, solve any problem represented using this framework. The three components of a problem repr ..."
Abstract - Cited by 6 (4 self) - Add to MetaCart
We have created a framework that provides a way to represent a wide range of scheduling and assignment problems across many domains. We have also created an optimizing scheduler that can, without modification, solve any problem represented using this framework. The three components of a problem

Software pipelining: An effective scheduling technique for VLIW machines

by Monica Lam , 1988
"... This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software pipe ..."
Abstract - Cited by 581 (3 self) - Add to MetaCart
This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software

Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks

by Ros Tassiulas, Anthony Ephremides - IEEE Transactions on Automatic Control , 1992
"... Abstruct-The stability of a queueing network with interdependent servers is considered. The dependency of servers is described by the definition of their subsets that can be activated simultaneously. Multihop packet radio networks (PRN’s) provide a motivation for the consideration of this system. We ..."
Abstract - Cited by 949 (19 self) - Add to MetaCart
is stable. A policy m,, is obtained which is optimal in the sense that its stability region Cn0 is a superset of the stability region of every other scheduling policy. The stability region Cmo is characterized. Finally, we study the behavior of the network for arrival rates that lie outside the stability

Optimal Scheduling for Disconnected Cooperation

by Grzegorz Greg Malewicz, Alexander Russell, Alex A. Shvartsman , 2001
"... We consider a distributed environment consisting of n processors that need to perform t tasks. We assume that communication is initially unavailable and that processors begin work in isolation. At some unknown point of time an unknown collection of processors may establish communication. Before proc ..."
Abstract - Cited by 9 (3 self) - Add to MetaCart
range of t tasks. Our new result is asymptotically optimal: the tails of these schedules are within a 1 +O(n 1 4 ) factor of the lower bound. We also present two new deterministic constructions one for t n, and the other for t n 3=2 , which substantially improve pairwise waste for all prexes

Optimal Scheduling for OFDMA Systems

by Rajeev Agrawal, Randall Berry, Jianwei Huang, Vijay Subramanian - 40TH ANNUAL ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS , 2006
"... Abstract — We consider a scheduling and resource allocation problem for the downlink of an OFDMA-based wireless network, where the channel estimation error is modeled by a self-noise term in the decoding process. During each time-slot this involves selecting a subset of users for transmission, det ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
, determining the assignment of available subcarriers to selected users, and for each subcarrier determining the transmission power and the coding and modulation scheme used. We address this in the context of a utility-based scheduling scheme presented in earlier papers. This results in an optimization problem

Revisiting the optimal scheduling problem

by Sastry Kompella, Jeffrey E. Wieselthier, Anthony Ephremides - In Proceedings of Conference on Information Sciences and Systems (CISS , 2008
"... Abstract — In this paper, we revisit the problem of determining the minimum-length schedule that satisfies certain traffic demands in a wireless network. Traditional approaches for the determination of minimum-length schedules are based on a collision channel model, in which neighboring transmission ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
Abstract — In this paper, we revisit the problem of determining the minimum-length schedule that satisfies certain traffic demands in a wireless network. Traditional approaches for the determination of minimum-length schedules are based on a collision channel model, in which neighboring

Is tail-optimal scheduling possible?

by Adam Wierman, Bert Zwart
"... ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
Abstract not found
Results 1 - 10 of 16,464