Parallel sorting and Star-P data movement and tree flattening
Name
62233716-MIT.pdf
Description
Full printable version
Size
3.75 MB
Format
Adobe PDF
Checksum (MD5)
b708d1ac28853fe612aa4e8d85eae856
Author(s)
Cheng David R. (David Rolin)
Advisor(s)
Alan Edelman.
Date Issued
2005
Publisher
Massachusetts Institute of Technology
Abstract
This thesis studies three problems in the field of parallel computing. The first result provides a deterministic parallel sorting algorithm that empirically shows an improvement over two sample sort algorithms. When using a comparison sort, this algorithm is 1-optimal in both computation and communication. The second study develops some extensions to the Star-P system [7, 6] that allows it to solve more real problems. The timings provided indicate the scalability of the implementations on some systems. The third problem concerns automatic parallelization. By representing a computation as a binary tree, which we assume is given, it can be shown that the height corresponds to the parallel execution time, given enough processors. The main result of the chapter is an algorithm that uses tree rotations to reduce the height of an arbitrary binary tree to become logarithmic in the number of its inputs. This method can solve more general problems as the definition of tree rotation is slightly altered; examples are given that derive the parallel prefix algorithm, and give a speedup in the dynamic programming approach to the computation of Fibonacci numbers.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Includes bibliographical references (p. 81-84).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
