Papers by Lawrence Rauchwerger
Proceedings of the 8th international conference on Supercomputing - ICS '94, 1994
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '01, 2001
Proceedings 2001 International Conference on Parallel Architectures and Compilation Techniques, 2001
The traditional, serial, algorithm for finding the strongly connected components in a graph is ba... more The traditional, serial, algorithm for finding the strongly connected components in a graph is based on depth first search and has complexity which is linear in the size of the graph. Depth first search is difficult to parallelize, which creates a need for a different parallel algorithm for this problem. We describe the implementation of a recently proposed parallel algorithm that finds strongly connected components in d istributedgraphs, andd iscuss how it is usedin a rad iation transport solver. © 2005 Elsevier Inc. All rights reserved.
The method of discrete ordinates is commonly used to solve the Boltzmann transport equation. The ... more The method of discrete ordinates is commonly used to solve the Boltzmann transport equation. The solution in each ordinate direction is most efficiently computed by sweeping the radiation flux across the computational grid. For unstructured grids this poses many challenges, particularly when implemented on distributed-memory parallel machines where the grid geometry is spread across processors. We present several algorithms relevant to this approach: (a) an asynchronous message-passing algorithm that performs sweeps simultaneously in multiple ordinate directions, (b) a simple geometric heuristic to prioritize the computational tasks that a processor works on, (c) a partitioning algorithm that creates columnar-style decompositions for unstructured grids, and (d) an algorithm for detecting and eliminating cycles that sometimes exist in unstructured grids and can prevent sweeps from successfully completing. Algorithms (a) and (d) are fully parallel; algorithms (b) and (c) can be used i...
Recently, a technique known as Hybrid Analysis has demonstrated the possibility of automatic coar... more Recently, a technique known as Hybrid Analysis has demonstrated the possibility of automatic coarse grain program parallelization through an integrated combination of static and dynamic analysis techniques. The recent introduction of multi-cores for the mass market has on the one hand exacerbated the need for such a technology and, on the other hand, changed the cost/benefit ratio of paralleliza-tion. Multi-Cores have low communication costs but the degree of parallelism is relatively small (¡100 processors for the next 5 years). Therefore hybrid parallelization techniques (static/dynamic analysis) need to keep their dynamic overhead very low in order to benefit multi-core systems. The Sensitivity Analysis (SA), presented in this paper is a novel technique that can reduce the dynamic overhead of previous Hybrid Analysis technology. Instead of dynamically evaluating the ag-gregated memory reference sets representing the potential data dependences, SA can frequently extract light weig...
The Ninth International Symposium on High-Performance Computer Architecture, 2003. HPCA-9 2003. Proceedings., 2003
Oceans 2002 Conference and Exhibition. Conference Proceedings (Cat. No.02CH37362), 2003
Lecture Notes in Computer Science, 2000
Lecture Notes in Computer Science, 2000
Lecture Notes in Computer Science, 2000
Proceedings of the 26th Annual International Symposium on Microarchitecture, 1993
Lecture Notes in Computer Science, 2007
Proceedings of 9th International Parallel Processing Symposium, 1995
Proceedings of the 29th ACM on International Conference on Supercomputing - ICS '15, 2015
Lecture Notes in Computer Science, 2015
Proceedings of the 29th ACM on International Conference on Supercomputing - ICS '15, 2015
Proceedings of the 14th international conference on Supercomputing - ICS '00, 2000
Uploads
Papers by Lawrence Rauchwerger