474 search results - page 8 / 95 » Search-based Job Scheduling for Parallel Computer Workloads |
EUROPAR
1998
Springer
14 years 20 days ago
1998
Springer
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
JSSPP
1997
Springer
14 years 17 days ago
1997
Springer
In this paper we have characterized the inter-arrival time and service time distributions for jobs at a large MPP supercomputing center. Our findings show that the distributions ...
IPPS
2000
IEEE
14 years 25 days ago
2000
IEEE
As communication and I/O traffic increase on the interconnection network of high-performance systems, network contention becomes a critical problem drastically reducing performan...
HPDC
2010
IEEE
13 years 8 months ago
2010
IEEE
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
HPDC
2003
IEEE
14 years 1 months ago
2003
IEEE
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...