Sciweavers

841 search results - page 58 / 169
» Job Scheduling in Rings
Sort
View
SCHEDULING
2008
97views more  SCHEDULING 2008»
14 years 11 months ago
Effective on-line algorithms for reliable due date quotation and large-scale scheduling
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job's arrival time, a due date must be quoted for the job, and the job must...
Philip Kaminsky, Zu-Hsu Lee
PDPTA
2004
15 years 1 months ago
On the Use of NSGrid for Accurate Grid Schedule Evaluation
Abstract Computational Grids consist of a multitude of geographically distributed resources. The co-allocation of several of those resources allows for the execution of highly comp...
Bruno Volckaert, Pieter Thysebaert, Marc De Leenhe...
CCGRID
2005
IEEE
15 years 5 months ago
Experiences with the KOALA co-allocating scheduler in multiclusters
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multip...
Hashim H. Mohamed, Dick H. J. Epema
ICALP
2000
Springer
15 years 3 months ago
Parallel Machine Scheduling Problems with Controllable Processing Times
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
Klaus Jansen, Monaldo Mastrolilli
JCO
2007
100views more  JCO 2007»
14 years 11 months ago
Semi-online scheduling with "end of sequence" information
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
Leah Epstein, Deshi Ye