173 search results - page 22 / 35 » Special Cases of Online Parallel Job Scheduling |
ANOR
2005
15 years 10 days ago
2005
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
128
click to vote
CASES
2007
ACM
15 years 4 months ago
2007
ACM
The key to increasing performance without a commensurate increase in power consumption in modern processors lies in increasing both parallelism and core specialization. Core speci...
123
click to vote
ISPA
2004
Springer
15 years 5 months ago
2004
Springer
In a multicluster architecture, where jobs can be submitted through each constituent cluster, the job arrival rates in individual clusters may be uneven and the load therefore need...
94
Voted
ESA
2006
Springer
15 years 4 months ago
2006
Springer
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
112
click to vote
CASES
2005
ACM
15 years 2 months ago
2005
ACM
In Simultaneous Multithreaded (SMT) architectures most hardware resources are shared between threads. This provides a good cost/performance trade-off which renders these architec...