Supporting Dynamic Data Structures on Distributed Memory Machines (1995)(Make Corrections)(101 citations) Anne Rogers, Martin C. Carlisle, John H. Reppy, Laurie J. Hendren
ACM Transactions on Programming Languages and Systems
Abstract: this paper, we describe an execution model for supporting programs that use pointer-based
dynamic data structures. This model uses a simple mechanism for migrating a thread of control
based on the layout of heap-allocated data and introduces parallelism using a technique based on
futures and lazy task creation. We intend to exploit this execution model using compiler analyses
and automatic parallelization techniques. We have implemented a prototype system, which we
call Olden, that runs on the... (Update)
.... network enabled servers can be composed, typically applications consist of a large number of more or less independent tasks [1, 3, 17, 26, 30, 32, 33]. One major difference of our approach is that the application processing structure is implemented as a set of interacting...
...additional bottleneck so as to focus the results on the register file. As benchmarks, we use a wide variety of programs, from the Olden [22], SPEC2000, SPEC95, UCLA Mediabench [14] and NAS parallel benchmark [7] suites. The benchmark set represents a mix of both integer and...
A. Rogers, M. Carlisle, J. Reppy, and L. Hendren. Supporting dynamic data structures on distributed memory machines. ACM Trans. on Programming Languages and Systems, 17(2), March 1995. http://citeseer.nj.nec.com/rogers95supporting.html More
@article{ rogers95supporting,
author = "Anne Rogers and Martin C. Carlisle and John H. Reppy and Laurie J. Hendren",
title = "Supporting Dynamic Data Structures on Distributed-Memory Machines",
journal = "ACM Transactions on Programming Languages and Systems",
volume = "17",
number = "2",
month = "March",
publisher = "ACM Press",
pages = "233--263",
year = "1995",
url = "citeseer.nj.nec.com/rogers95supporting.html" }