1758 search results - page 107 / 352 » Schedule processes, not VCPUs |
189
click to vote
ASPLOS
2010
ACM
15 years 9 months ago
2010
ACM
Many parallel applications exhibit unpredictable communication between threads, leading to contention for shared objects. The choice of contention management strategy impacts stro...
159
click to vote
AOR
2007
15 years 6 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
207
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
198
click to vote
TON
2010
15 years 1 months ago
2010
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
168
click to vote
INTERACT
2003
15 years 8 months ago
2003
: Models from methods like Contextual Design (CD) are a sound basis for requirements engineering. But current software engineering processes are not prepared to use such models. To...