ACM Home Page
Please provide us with feedback. Feedback
Software caching and computation migration in Olden
Full text PdfPdf (1.20 MB)
Source Principles and Practice of Parallel Programming archive
Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming table of contents
Santa Barbara, California, United States
Pages: 29 - 38  
Year of Publication: 1995
ISBN:0-89791-701-6
Also published in ...
Authors
Martin C. Carlisle  Princeton University
Anne Rogers  Princeton University
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 38,   Citation Count: 32
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/209936.209941
What is a DOI?

ABSTRACT

The goal of the Olden project is to build a system that provides parallelism for general purpose C programs with minimal programmer annotations. We focus on programs using dynamic structures such as trees, lists, and DAGs. We demonstrate that providing both software caching and computation migration can improve the performance of these programs, and provide a compile-time heuristic that selects between them for each pointer dereference. We have implemented a prototype system on the Thinking Machines CM-5. We describe our implementation and report on experiments with ten benchmarks.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
J. Barnes and P. Hut. A hierarchical (o)(NlogN) forcecalculation algorithm. Nature, 324:446-449, December 1986.
 
4
J Bentley A parallel algorithm for constructing minimum spanning trees. J. of Algorithms, 1:51-59, 1980.
 
5
 
6
M. Carlisle and A. Rogers. Software caching and computation migration in Olden. Technical Report PU-CS-TR 483- 95, Princeton University, 1995.
7
8
9
10
11
 
12
 
13
14
15
16
17
18
19
 
20
R. Karp. Probabilistic analysis of partitioning algorithms for the traveling-salesman problemin the plane. Mathematics of Operations Research, 2(3):209-224, August 1977.
21
 
22
L. Lamport. How to make a multiprocessor that correctly executes multiprocess programs. IEEE Trans. on Computers, C-28(9), September 1979.
 
23
G. Lomow, J. Cleary, B. Unger, and D. West. A performance study of Time Warp. In SCS Multiconference on Distributed S, muIation, pages 50-55, February 1988.
24
 
25
 
26
27
28
 
29
H. Samet. Computing perimeters of regions in images represented by quadtrees. IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-3(6):683-687, November 1981.
30
31

CITED BY  32

Collaborative Colleagues:
Martin C. Carlisle: colleagues
Anne Rogers: colleagues