80 search results - page 10 / 16 » A tight lower bound for job scheduling with cancellation |
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...
ALDT
2009
Springer
14 years 2 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
ISPA
2007
Springer
2007
Springer
A Performance Comparison of the Contiguous Allocation Strategies in 3D Mesh Connected Multicomputers
14 years 1 months ago
The performance of contiguous allocation strategies can be significantly affected by the distribution of job execution times. In this paper, the performance of the existing contigu...