Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6910Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Brown, Jeremy Hanford | - |
| dc.date | 2004-10-20T20:06:13Z | - |
| dc.date | 2004-10-20T20:06:13Z | - |
| dc.date | 2002-06-01 | - |
| dc.date.accessioned | 2013-10-09T02:47:33Z | - |
| dc.date.available | 2013-10-09T02:47:33Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AITR-2002-005 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6910 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | Conventional parallel computer architectures do not provide support for non-uniformly distributed objects. In this thesis, I introduce sparsely faceted arrays (SFAs), a new low-level mechanism for naming regions of memory, or facets, on different processors in a distributed, shared memory parallel processing system. Sparsely faceted arrays address the disconnect between the global distributed arrays provided by conventional architectures (e.g. the Cray T3 series), and the requirements of high-level parallel programming methods that wish to use objects that are distributed over only a subset of processing elements. A sparsely faceted array names a virtual globally-distributed array, but actual facets are lazily allocated. By providing simple semantics and making efficient use of memory, SFAs enable efficient implementation of a variety of non-uniformly distributed data structures and related algorithms. I present example applications which use SFAs, and describe and evaluate simple hardware mechanisms for implementing SFAs. Keeping track of which nodes have allocated facets for a particular SFA is an important task that suggests the need for automatic memory management, including garbage collection. To address this need, I first argue that conventional tracing techniques such as mark/sweep and copying GC are inherently unscalable in parallel systems. I then present a parallel memory-management strategy, based on reference-counting, that is capable of garbage collecting sparsely faceted arrays. I also discuss opportunities for hardware support of this garbage collection strategy. I have implemented a high-level hardware/OS simulator featuring hardware support for sparsely faceted arrays and automatic garbage collection. I describe the simulator and outline a few of the numerous details associated with a "real" implementation of SFAs and SFA-aware garbage collection. Simulation results are used throughout this thesis in the evaluation of hardware support mechanisms. | - |
| dc.format | 115 p. | - |
| dc.format | 3145524 bytes | - |
| dc.format | 677754 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AITR-2002-005 | - |
| dc.subject | AI | - |
| dc.subject | sparsely faceted arrays | - |
| dc.subject | shared memory | - |
| dc.subject | garbage collection | - |
| dc.subject | data structures | - |
| dc.title | Sparsely Faceted Arrays: A Mechanism Supporting Parallel Allocation, Communication, and Garbage Collection | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.