6105 search results - page 753 / 1221 » A Parallel Algorithm for Bound-Smoothing |
127
Voted
IPPS
1998
IEEE
15 years 12 months ago
1998
IEEE
Fully-populated tori, where every node has a processor attached, do not scale well since load on edges increases superlinearly with network size under heavy communication, resulti...
169
Voted
IPPS
1998
IEEE
15 years 12 months ago
1998
IEEE
Fault-tolerant programs are typically not only difficult to implement but also incur extra costs in terms of performance or resource consumption. Failures are typically relatively ...
197
Voted
IPPS
1998
IEEE
15 years 12 months ago
1998
IEEE
In distributed-memory message-passing architectures reducing communication cost is extremely important. In this paper, we present a technique to optimize communication globally. O...
192
Voted
IPPS
1998
IEEE
15 years 12 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...
192
Voted
IPPS
1998
IEEE
15 years 12 months ago
1998
IEEE
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...