44 search results - page 1 / 9 » Gang Scheduling with Memory Considerations |
IPPS
2000
IEEE
13 years 12 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...
CLUSTER
2004
IEEE
13 years 11 months ago
2004
IEEE
Gang Scheduling and related techniques are widely believed to be necessary for efficientjob scheduling on distributed memory parallel computers. This is hecause they minimize cont...
HPDC
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...
ISCA
1997
IEEE
13 years 11 months ago
1997
IEEE
ICPP
2003
IEEE
14 years 24 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...