10106 search results - page 393 / 2022 » Algorithm Selection and Scheduling |
182
click to vote
HPDC
2007
IEEE
16 years 1 months ago
2007
IEEE
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
157
Voted
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Adding SDMA capabilities to modern wireless communication systems like IEEE 802.16 WiMAX promises high system capacity gains but raises the problem of combining orthogo...
178
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
The duration of time for which each application locks each shared resource is critically important in composing multiple independently-developed applications upon a shared “open...
195
click to vote
EMSOFT
2005
Springer
16 years 10 days ago
2005
Springer
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
176
click to vote
MFCS
2004
Springer
16 years 4 days ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...