Sciweavers

375 search results - page 7 / 75
» On-Line Scheduling of Parallel Jobs
Sort
View
CCGRID
2002
IEEE
14 years 18 days ago
A Malleable-Job System for Timeshared Parallel Machines
Malleable jobs are parallel programs that can change the number of processors on which they are executing at run time in response to an external command. One of the advantages of ...
Laxmikant V. Kalé, Sameer Kumar, Jayant DeS...
GSEM
2007
Springer
14 years 1 months ago
FIFO Queuing of Constant Length Fully Synchronous Jobs
Abstract. The paper examines the behaviour of a saturated multiprocessor system to which fully synchronous parallel jobs are submitted. In order to simplify the analysis, we assume...
Vandy Berten, Raymond R. Devillers, Guy Louchard
ESA
2007
Springer
131views Algorithms» more  ESA 2007»
14 years 1 months ago
Online Scheduling of Equal-Length Jobs on Parallel Machines
We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio de
Jihuan Ding, Tomás Ebenlendr, Jiri Sgall, G...
ICPP
1998
IEEE
13 years 12 months ago
Response Time Analysis for Distributed Real-Time Systems with Bursty Job Arrivals
This paper presents a new schedulability analysis methodology for distributed hard real-time systems with bursty job arrivals. The schedulability is analyzed by comparing worst-ca...
Chengzhi Li, Riccardo Bettati, Wei Zhao