223 search results - page 4 / 45 » Improving First-Come-First-Serve Job Scheduling by Gang Sche... |
IPPS
2003
IEEE
14 years 23 days ago
2003
IEEE
Fine-grained parallel applications require all their processes to run simultaneously on distinct processors to achieve good efficiency. This is typically accomplished by space sl...
JSSPP
2004
Springer
14 years 26 days ago
2004
Springer
Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
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...
ANSS
2002
IEEE
14 years 14 days ago
2002
IEEE
Clusters of workstations have emerged as a costeffective solution to high performance computing problem. To take advantage of any opportunities, however, effective scheduling tech...
ITCC
2003
IEEE
14 years 23 days ago
2003
IEEE
Real-time applications often have mixed hard and soft deadlines, can be preempted subject to the cost of context switching or the restart of computation, and have various data dep...