Please use this identifier to cite or link to this item:
Authors: Higham, Lisa
Schenk, Eric
Keywords: Computer Science
Issue Date: 1-Aug-1992
Abstract: Two useful and practical techniques for managing memory on a parallel random access machine (PRAM) are presented. One is a scheme for an nlog n processor EREW PRAM that dynamically allocates and deallocates at most n records in O(log n) time. The other is a simulation of a PRAM with initialized memory by one with uninitialized memory. A CREW PRAM variant of the technique justifies the assumption that memory can be assumed to be appropriately initialized with no asymptotic increase in time but a factor of n increase in space. An EREW PRAM solution incurs a factor of O(log n) increase in time but only a constant factor increase in space.
Appears in Collections:Higham, Lisa

Files in This Item:
File Description SizeFormat 
1992-484-22.pdf1 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.