Katherine Yelick, Soumen Chakrabarti, Etienne Deprit, Jeff Jones, Arvind Krishnamurthy, Chih-Po Wen  Home/Search
Context Related
| berkeley.edu/projects/multi...psls95.ps berkeley.edu/Research/Proje...psls95.ps berkeley.edu/projects/paral...psls95.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/projects/mu...papers (more) From: berkeley.edu/projects/pa...papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Symbolic applications often require dynamic irregular data structures, such as linked lists, unbalanced trees, and graphs, and they exhibit unpredictable computational patterns that lead to asynchronous communication and load imbalance when parallelized. In this paper we describe several symbolic applications and their parallelizations. The main problem in parallelization of each application was to replace the primary data structures with parallel versions that allow for high throughput, low... (Update)
Context of citations to this paper: More
.... [66] multifiles see design of parallel I O software, ParFiSys (Parallel File System) Multipol abstract: Multipol is a publicly available [153] library of distributed data structures designed for irregular applications (see irregular problems) Furthermore, it contains a thread...
.... (see irregular problems) Furthermore, it contains a thread system which allows overlapping communication latency with computation [45]. nCUBE The proposed file system for the nCUBE is based on a two step mapping of a file into the compute node memorie, where the first...
Cited by: More
Randomized Shared Queues - Lee, Welch (Correct)
Distributed Dynamic Hash Tables Using IBM LAPI - Malard, Stewart (2002) (Correct)
Glossary on Parallel Input/Output - Stockinger (Correct)
Similar documents (at the sentence level):
45.0%: Portable Parallel Irregular Applications - Yelick, Wen, Chakrabarti.. (1995) (Correct)
36.7%: Multipol: A Distributed Data Structure Library - Chakrabarti (1995) (Correct)
Active bibliography (related documents): More All
0.3: Performance Modeling and Composition: A Case Study in.. - Steinberg, Yang, Yelick (1996) (Correct)
0.2: Portable Library Support for Irregular Applications - Wen (1995) (Correct)
0.2: Parallel Bandreduction and Tridiagonalization - Christian Bischof (1993) (Correct)
Similar documents based on text: More All
0.3: Runtime Support For Portable Distributed Data Structures - Wen, Chakrabarti.. (1995) (Correct)
0.2: Efficient Resource Scheduling in Multiprocessors - Chakrabarti (1996) (Correct)
0.2: Data Structures for Irregular Applications - Yelick, Chakrabarti, Deprit.. (1993) (Correct)
Related documents from co-citation: More All
2: MPI: A Message-Passing Interface Standard - Interface - 1994
2: Randomized load balancing for tree structured computation - Chakrabarti, Ranade et al. - 1994
2: Support for massive data input/output on parallel computers (context) - Trabado, Zapata - 1995
BibTeX entry: (Update)
K. A. Yelick, S. Chakrabarti, E. Deprit, J. Jones, A. Krishnamurthy, and C. Wen. Parallel data structures for symbolic computation. In Workshop on Parallel Symbolic Languages and Systems, October 1995. http://citeseer.ist.psu.edu/yelick95parallel.html More
@misc{ yelick95parallel,
author = "K. Yelick and S. Chakrabarti and E. Deprit and J. Jones and A. Krishnamurthy
and C. Wen",
title = "Parallel data structures for symbolic computation",
text = "K. A. Yelick, S. Chakrabarti, E. Deprit, J. Jones, A. Krishnamurthy, and
C. Wen. Parallel data structures for symbolic computation. In Workshop on
Parallel Symbolic Languages and Systems, October 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/yelick95parallel.html" }
Citations (may not include all citations):606 How to make a multiprocessor computer that correctly execute.. (context) - Lamport - 1979
384 Simple Word Problems in Universal Algebras (context) - Knuth, Bendix - 1970
341 Parallel programming in Split-C - Culler, Dusseau et al. - 1993
157 Scheduling multithreaded computations by work stealing - Blumofe, Leiserson - 1994
21 Randomized load balancing for tree-structured computation - Chakrabarti, Ranade et al. - 1994
12 Optimizing parallel spmd programs - Krishnamurthy, Yelick - 1994
9 Parallelizing the phylogeny problem - Jones, Yelick - 1995
8 the correctness of parallel bisection in floating point - Demmel, Dhillon et al. - 1994
8 Work crews: An abstraction for controlling parallelism (context) - Roberts, Vandevoorde - 1989
7 A parallel completion procedure for term rewriting systems - Yelick, Garland - 1992
4 LAPACK for distributed memory machines: the next generation (context) - Demmel, Dongarra et al. - 1993
3 Parallelizing a cell simulation: Analysis (context) - Steinberg - 1994
2 the correctness of a distributed memory Grobner basis comput.. (context) - Chakrabarti, Yelick - 1993
Documents on the same site (http://www.cs.berkeley.edu/projects/multipol/papers.html): More
Parallel Timing Simulation on a Distributed Memory Multiprocessor - Wen, Yelick (1993) (Correct)
Parallelizing the Phylogeny Problem - Jones (1994) (Correct)
Randomized Load Balancing for Tree-structured Computation - Chakrabarti, Ranade, Yelick (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC