Back to Results
First PageMeta Content
Computer programming / Data types / Primitive types / Cross-platform software / Procedural programming languages / Reference counting / Quicksort / Garbage collection / Pointer / Computing / Software engineering / Memory management


Sparsely Faceted Arrays: A Mechanism Supporting Parallel Allocation, Communication, and Garbage Collection by Jeremy Hanford Brown
Add to Reading List

Document Date: 2002-08-05 18:13:19

Open Document

File Size: 657,91 KB

Share Result on Facebook

Company

Andrew / /

Facility

MASSACHUSETTS INSTITUTE OF TECHNOLOGY June / Massachusetts Institute of Technology / store O(log(N / /

IndustryTerm

research / memory parallel processing system / rubber room weeks / parallel systems / automatic memory management / parallel marking algorithm / /

Organization

SFA / SFAs / Department Committee on Graduate Students Sparsely Faceted Arrays / MASSACHUSETTS INSTITUTE OF TECHNOLOGY / Department of Electrical Engineering and Computer Science / using SFAs / /

Person

Thomas F. Knight / Jr. / Laurie Wile / Arthur C. Smith / Marilyn Pierce / Josie Ammer / Tom Knight / Ben Vandiver / Thesis Supervisor / Anthony Zolnik / Jan Maessen / Marc Horowitz / Michelle Goldberg / Gill Pratt / Katie Hayes / Gerry Sussman / Jeremy Hanford Brown Submitted / Huang / Nick Papadakis / Thesis Supervisor Accepted / /

Position

Author / Supervisor / advisor / Senior Research Scientist / Chairman / consultant / Scientist / programmer / /

ProgrammingLanguage

C / /

ProvinceOrState

Massachusetts / /

RadioStation

Work 2.1 / /

Technology

parallel processing system / 1.2 Implementation Technology / artificial intelligence / parallel marking algorithm / 3.2 The GC algorithm / Dom / Simulation / shared memory / /

SocialTag