THE PARALLEL ASYNCHRONOUS RECURSION MODEL
dc.contributor.author | Schenk, Eric | eng |
dc.date.accessioned | 2008-05-20T23:30:08Z | |
dc.date.available | 2008-05-20T23:30:08Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1992-04-01 | eng |
dc.description.abstract | This 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. | eng |
dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
dc.identifier.department | 1992-473-11 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/31374 | |
dc.identifier.uri | http://hdl.handle.net/1880/46540 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | THE PARALLEL ASYNCHRONOUS RECURSION MODEL | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |