Sciweavers

841 search results - page 6 / 169
» Job Scheduling in Rings
Sort
View
IPPS
2000
IEEE
13 years 11 months ago
Improving Throughput and Utilization in Parallel Machines through Concurrent Gang
In this paper we propose a new class of scheduling policies, dubbed Concurrent Gang, that combines the advantages of gang scheduling for communication and synchronization intensiv...
Fabrício Alves Barbosa da Silva, Isaac D. S...
IPPS
2006
IEEE
14 years 1 months ago
An evaluation of heuristics for SLA based parallel job scheduling
In the context of SLA based job scheduling for high performance grid computing, this paper investigates the behaviour of various scheduling heuristics to schedule SLA-bounded jobs...
Viktor Yarmolenko, Rizos Sakellariou
IPPS
1999
IEEE
13 years 11 months ago
On the Design and Evaluation of Job Scheduling Algorithms
Abstract. In this paper we suggest a strategy to design job scheduling systems. To this end, we first split a scheduling system into three components: Scheduling policy, objective ...
Jochen Krallmann, Uwe Schwiegelshohn, Ramin Yahyap...
JDA
2008
93views more  JDA 2008»
13 years 7 months ago
On-line scheduling of parallel jobs on two machines
We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case ...
Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochu...
TCS
2008
13 years 7 months ago
Dense open-shop schedules with release times
We study open-shop scheduling problems with job release times. The objective is to minimize the makespan. Dense schedules, easy to construct, are often used as approximate solutio...
Rongjun Chen, Wanzhen Huang, Guochun Tang