6105 search results - page 276 / 1221 » A Parallel Algorithm for Bound-Smoothing |
230
click to vote
ICPP
1996
IEEE
15 years 10 months ago
1996
IEEE
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
205
click to vote
SPAA
1993
ACM
15 years 10 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
175
click to vote
EUROPAR
2008
Springer
15 years 8 months ago
2008
Springer
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
147
click to vote
SBACPAD
2004
IEEE
15 years 8 months ago
2004
IEEE
Seismic tomography enables to model the internal structure of the Earth. In order to improve the precision of existing models, a huge amount of acquired seismic data must be analy...
171
click to vote
HPCC
2010
Springer
15 years 7 months ago
2010
Springer
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...