474 search results - page 33 / 95 » Search-based Job Scheduling for Parallel Computer Workloads |
100
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job’s processes. An alternative is to...
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Scheduling jobs on the IBM SP2 system is usually done by giving each job a partition of the machine for its exclusive use. Allocating such partitions in the order that the jobs ar...
137
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
JSSPP
2007
Springer
15 years 8 months ago
2007
Springer
Performance evaluation in multi-cluster processor co-allocation - like in many other parallel job scheduling problems- is mostly done by computing the average metric value for the ...
109
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper presents a comprehensive statistical analysis of workloads collected on data-intensive clusters and Grids. The analysis is conducted at different levels, including Virt...