Sciweavers

1156 search results - page 115 / 232
» Optimal scheduling of task graphs on parallel systems
Sort
View
ISSS
1996
IEEE
114views Hardware» more  ISSS 1996»
15 years 4 months ago
Flow Graph Balancing for Minimizing the Required Memory Bandwidth
In this paper we present the problem of flow graph balancing for minimizingthe required memory bandwidth. Our goal is to minimize the required memory bandwidth within the given cy...
Sven Wuytack, Francky Catthoor, Gjalt G. de Jong, ...
SOSP
1989
ACM
15 years 1 months ago
Process Control and Scheduling Issues for Multiprogrammed Shared-Memory Multiprocessors
Shared-memory multiprocessors are frequently used in a timesharing style with multiple parallel applications executing at the same time. In such an environment, where the machine ...
Andrew Tucker, Anoop Gupta
ICPP
2003
IEEE
15 years 5 months ago
Scheduling Algorithms with Bus Bandwidth Considerations for SMPs
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...
Christos D. Antonopoulos, Dimitrios S. Nikolopoulo...
IPPS
2000
IEEE
15 years 3 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
ICDCS
1997
IEEE
15 years 4 months ago
Load Profiling In Distributed Real-Time Systems
Load balancing is often used to ensure that nodes in a distributed systems are equally loaded. In this paper, we show that for real-time systems, load balancing is not desirable. ...
Azer Bestavros