THE PARALLEL ASYNCHRONOUS RECURSION MODEL

Simple item page
dc.contributor.authorSchenk, Ericeng
dc.date.accessioned2008-05-20T23:30:08Z
dc.date.available2008-05-20T23:30:08Z
dc.date.computerscience1999-05-27eng
dc.date.issued1992-04-01eng
dc.description.abstractThis 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.notesWe 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.caeng
dc.identifier.department1992-473-11eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/31374
dc.identifier.urihttp://hdl.handle.net/1880/46540
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleTHE PARALLEL ASYNCHRONOUS RECURSION MODELeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1992-473-11.pdf
Size:
12.51 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications