Jeremy Hanford Brown, "Sparsely Faceted Arrays: A Mechanism Supporting Parallel Allocation, Communication, and Garbage Collection", Ph.D. Thesis, Dept. of EECS, M.I.T., June 2001, 126 pp. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Design and Evaluation of the Hamal Parallel Computer - Grossman (2002) (1 citation) (Correct)
....of novel memory system features to support a scalable, efficient parallel system. A capability format is introduced which supports pointer arithmetic and nearly tight object bounds without the use of capability or segment tables. We present an implementation of sparsely faceted arrays (SFAs) [Brown02a] which allow distributed objects to be allocated with minimal overhead. SFAs are contrasted with extended address partitioning, a technique that assigns a separate 64 bit address space to each node. We describe a flexible scheme for synchronization within the memory system. A number of ....
....this makes poor use of the virtual address bits: an N node system would require 2logN bits of virtual address to specify both location and ownership. In this section we describe two different approaches to distributed object allocation: Extended Address Partitioning and Sparsely Faceted Arrays [Brown02a]. These techniques share the characteristic that a node atomically and without communication allocates a portion of the virtual address space a facet on each node in the system, but actual physical memory is lazily allocated only on those nodes which make use of the object. Both of these ....
[Article contains additional citation context not shown here]
Jeremy Hanford Brown, "Sparsely Faceted Arrays: A Mechanism Supporting Parallel Allocation, Communication, and Garbage Collection", Ph.D. Thesis, Dept. of EECS, M.I.T., June 2001, 126 pp.
ADAM: A Decentralized Parallel Computer Architecture Featuring.. - Huang (2002) (Correct)
....to simplify the building of fan in and fan out trees. Also required is run time support for garbage collection. For an efficient implementation of parallel garbage collection, please refer to Jeremy Brown s thesis on Sparsely Faceted Arrays (SFAs) and scalable parallel garbage collection. Bro02] 7.2.3 Hardware Implementation An important step in any architecture s evolution is its hardware implementation. Fortunately, the very nature of an abstract machine architecture lends itself to incremental implementation. In addition, Q Machine implementation s dilation 2 fat tree network has ....
Jeremy Hanford Brown. Sparsely Faceted Arrays: A Mechanism Supporting Parallel Allocation, Communication, and Garbage Collection. PhD thesis, Massachusetts Institute of Technology, 2002.
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