Sciweavers

1125 search results - page 51 / 225
» On the job rotation problem
Sort
View
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
14 years 3 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 10 months ago
Path-independent load balancing with unreliable machines
We consider algorithms for load balancing on unreliable machines. The objective is to optimize the two criteria of minimizing the makespan and minimizing job reassignments in resp...
James Aspnes, Yang Richard Yang, Yitong Yin
CCGRID
2005
IEEE
14 years 3 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
JCO
2007
100views more  JCO 2007»
13 years 9 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
SCHEDULING
2008
97views more  SCHEDULING 2008»
13 years 9 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