Sciweavers

223 search results - page 10 / 45
» Improving First-Come-First-Serve Job Scheduling by Gang Sche...
Sort
View
JPDC
2007
81views more  JPDC 2007»
14 years 9 months ago
Improved scheduling in rings
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
Dekel Tsur
WAOA
2004
Springer
76views Algorithms» more  WAOA 2004»
15 years 2 months ago
Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria
Rajiv Gandhi, Magnús M. Halldórsson,...
TALG
2008
74views more  TALG 2008»
14 years 9 months ago
Improved bounds for scheduling conflicting jobs with minsum criteria
Rajiv Gandhi, Magnús M. Halldórsson,...
ICPP
2007
IEEE
15 years 3 months ago
Fault-Driven Re-Scheduling For Improving System-level Fault Resilience
The productivity of HPC system is determined not only by their performance, but also by their reliability. The conventional method to limit the impact of failures is checkpointing...
Yawei Li, Prashasta Gujrati, Zhiling Lan, Xian-He ...
ISCA
1999
IEEE
124views Hardware» more  ISCA 1999»
15 years 1 months ago
Speculation Techniques for Improving Load Related Instruction Scheduling
State of the art microprocessors achieve high performance by executing multiple instructions per cycle. In an out-oforder engine, the instruction scheduler is responsible for disp...
Adi Yoaz, Mattan Erez, Ronny Ronen, Stéphan...