Sciweavers

6939 search results - page 413 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
HPCC
2005
Springer
15 years 9 months ago
Trace-Based Parallel Performance Overhead Compensation
Abstract. Tracing parallel programs to observe their performance introduces intrusion as the result of trace measurement overhead. If post-mortem trace analysis does not compensate...
Felix Wolf, Allen D. Malony, Sameer Shende, Alan M...
JSSPP
2004
Springer
15 years 9 months ago
Reconfigurable Gang Scheduling Algorithm
 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...
Luís Fabrício Wanderley Góes,...
CAP
2010
14 years 11 months ago
Accuracy versus time: a case study with summation algorithms
In this article, we focus on numerical algorithms for which, in practice, parallelism and accuracy do not cohabit well. In order to increase parallelism, expressions are reparsed,...
Philippe Langlois, Matthieu Martel, Laurent Th&eac...
IPPS
2006
IEEE
15 years 10 months ago
A self-stabilizing minimal dominating set algorithm with safe convergence
A self-stabilizing distributed system is a faulttolerant distributed system that tolerates any kind and any finite number of transient faults, such as message loss and memory cor...
Hirotsugu Kakugawa, Toshimitsu Masuzawa
APCCAS
2006
IEEE
261views Hardware» more  APCCAS 2006»
15 years 10 months ago
Area/Delay Efficient Recoding Methods for Parallel CORDIC Rotations
—In this paper, an area/delay efficient recoding method for parallel CORDIC (COordinate Rotation DIgital Computer) rotation algorithm is proposed. This recoding method can reduce...
Tso-Bing Juang