206 search results - page 15 / 42 » Better Bounds for Online Scheduling |
SPAA
2009
ACM
16 years 2 months ago
2009
ACM
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
101
Voted
ECRTS
2002
IEEE
15 years 6 months ago
2002
IEEE
—Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s fo...
113
click to vote
RTSS
2005
IEEE
15 years 7 months ago
2005
IEEE
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...
120
Voted
FSTTCS
2010
Springer
14 years 11 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
105
click to vote
ICDCN
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. The availability of multiple orthogonal channels in a wireless network can lead to substantial performance improvement by alleviating contention and interference. However...