223 search results - page 6 / 45 » Scheduling Memory Constrained Jobs on Distributed Memory Par... |
ICPP
2003
IEEE
14 years 25 days ago
2003
IEEE
The bus that connects processors to memory is known to be a major architectural bottleneck in SMPs. However, both software and scheduling policies for these systems generally focu...
EUROPAR
2005
Springer
14 years 1 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
JSSPP
2004
Springer
14 years 28 days ago
2004
Springer
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
JSSPP
2001
Springer
14 years 7 hour ago
2001
Springer
This paper characterizes the production workload that highly utilizes the NCSA Origin 2000. The characterization includes the distributions of job interarrival time, requested num...
ICA3PP
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we present an algorithm for scheduling of distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring ...