Sciweavers

82 search results - page 3 / 17
» How much parallelism is there in irregular applications
Sort
View
AAAI
1996
13 years 7 months ago
Comet: An Application of Model-Based Reasoning to Accounting Systems
An important problem faced by auditors is gauging how much reliance can be placed on the accounting systems that process millions of transactions to produce the numbers summarized...
Robert Nado, Melanie Chams, Jeff Delisio, Walter H...
HIPC
2005
Springer
13 years 11 months ago
Application of Reduce Order Modeling to Time Parallelization
We recently proposed a new approach to parallelization, by decomposing the time domain, instead of the conventional space domain. This improves latency tolerance, and we demonstrat...
Ashok Srinivasan, Yanan Yu, Namas Chandra
PARELEC
2006
IEEE
14 years 6 days ago
Scientific Programming for Heterogeneous Systems - Bridging the Gap between Algorithms and Applications
High performance computing in heterogeneous environments is a dynamically developing area. A number of highly efficient heterogeneous parallel algorithms have been designed over l...
Alexey L. Lastovetsky
PPOPP
2012
ACM
12 years 1 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
13 years 11 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader