Show simple item record

dc.contributor.advisor Briggs, Faye A.
dc.creatorPatil, Indira M.
dc.date.accessioned 2009-06-04T00:39:34Z
dc.date.available 2009-06-04T00:39:34Z
dc.date.issued 1989
dc.identifier.citation Patil, Indira M.. "Performance of multiprocessors and parallel algorithms: Quicksort, a case study." (1989) Diss., Rice University. https://hdl.handle.net/1911/16278.
dc.identifier.urihttps://hdl.handle.net/1911/16278
dc.description.abstract Performance of parallel algorithms on multiprocessors has been traditionally analyzed by looking at either the algorithm or the architecture of the multiprocessor system. However, it is important to study the combined effect of both these factors in order to evaluate and predict performance. A different methodology based on approximate trace-driven simulation is adopted in this thesis to study the performance of a class of non-numerical algorithms. Performance of parallel quick-sort and parallel quick-merge sort is investigated in order to demonstrate the methodology as well as develop an understanding of the limitations imposed by a cache-based single bus environment on achievable speedup. A wide range of issues including the effect of cache parameters, coherency protocol, scheduling mechanisms and technology effects are discussed in the context of performance of the two versions of parallel quick-sort.
dc.format.extent 145 p.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.subjectElectronics
Electrical engineering
dc.title Performance of multiprocessors and parallel algorithms: Quicksort, a case study
dc.type Thesis
dc.type.material Text
thesis.degree.department Electrical Engineering
thesis.degree.discipline Engineering
thesis.degree.grantor Rice University
thesis.degree.level Doctoral
thesis.degree.name Doctor of Philosophy
dc.identifier.callno THESIS E.E. 1989 PATIL


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record