Understanding supercritical speedup
Abstract
References
Index Terms
- Understanding supercritical speedup
Recommendations
Understanding supercritical speedup
PADS '94: Proceedings of the eighth workshop on Parallel and distributed simulationSimulations running under Time Warp using lazy cancellation can beat the bound given by the critical path. We explain this phenomenon to be the result of a kind of intra-object parallelism. Specifically, we show that instances of beating the critical ...
Extracting Speedup From C-Code With Poor Instruction-Level Parallelism
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 14 - Volume 15Scientific computing and multimedia applications frequently call loop-intensive functions that dominate execution time. Applying homogeneous, parallel processors (e.g. single-instruction, multiple-data (SIMD) and very-long instruction word (VLIW)) is a ...
Partitioning graphs to speedup Dijkstra's algorithm
We study an acceleration method for point-to-point shortest-path computations in large and sparse directed graphs with given nonnegative arc weights. The acceleration method is called the arc-flag approach and is based on Dijkstra's algorithm. In the ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
- Editors:
- D. K. Arvind,
- Rajive Bagrodia,
- Jason Yi-Bing Lin
- August 1994196 pages
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations15Total Citations
- 249Total Downloads
- Downloads (Last 12 months)67
- Downloads (Last 6 weeks)19
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in