Sciweavers

52 search results - page 9 / 11
» Greedy multiprocessor server scheduling
Sort
View
SPAA
2009
ACM
14 years 8 months ago
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs
TOCS
2008
154views more  TOCS 2008»
13 years 7 months ago
Adaptive work-stealing with parallelism feedback
We present an adaptive work-stealing thread scheduler, ASTEAL, for fork-join multithreaded jobs, like those written using the Cilk multithreaded language or the Hood work-stealing...
Kunal Agrawal, Charles E. Leiserson, Yuxiong He, W...
ESA
2009
Springer
99views Algorithms» more  ESA 2009»
14 years 2 months ago
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...
Chandra Chekuri, Sungjin Im, Benjamin Moseley
VLDB
1998
ACM
82views Database» more  VLDB 1998»
13 years 11 months ago
Resource Scheduling for Composite Multimedia Objects
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
Minos N. Garofalakis, Yannis E. Ioannidis, Banu &O...
IPPS
2005
IEEE
14 years 1 months ago
Runtime Empirical Selection of Loop Schedulers on Hyperthreaded SMPs
Hyperthreaded (HT) and simultaneous multithreaded (SMT) processors are now available in commodity workstations and servers. This technology is designed to increase throughput by e...
Yun Zhang, Michael Voss