Browsing by Author "Schenk, Eric"
Now showing 1 - 4 of 4
Results Per Page
Sort Options
- ItemOpen AccessMAINTAINING B-TREES ON AN EREW PRAM(1991-08-25) Higham, Lisa; Schenk, EricEfficient and practical algorithms for maintaining general B-trees on an EREW PRAM are presented. Given a B-tree of order b with m distinct records, the search (respectively, insert and delete) problem for n input keys is solved on an n-processor EREW PRAM in $0( log n + b log sub b m)$ (respectively, $0(b( log n + log sub b m))$ and $0(b sup 2 ( log sub b n + log sub b m))$) time.
- ItemOpen AccessTHE PARALLEL ASYNCHRONOUS RECURSION MODEL(1992-04-01) Schenk, EricThis thesis proposes a new model of parallel computation, the Parallel Asynchronous Recursion (PAR) model. The model is asynchronous, and provides a high level process based abstraction, eliminating the need to explicitly schedule tasks on processors. It is shown that the PAR model can be efficiently simulated on both a RAM (Random Access Machine) and a PRAM (Parallel Random Access Machine). Therefore, the extra level of abstraction provided by the PAR Model can be obtained at a reasonable cost.
- ItemOpen AccessPRAM MEMORY ALLOCATION AND INITIALIZATION(1992-08-01) Higham, Lisa; Schenk, EricTwo 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.
- ItemOpen AccessThe parallel asynchronous recursion model(1992) Schenk, Eric; Higham, Lisa