Show simple item record

dc.contributor.advisorAlan Edelman.en_US
dc.contributor.authorSundaresh, Harish Peruvambaen_US
dc.contributor.otherMassachusetts Institute of Technology. Computation for Design and Optimization Program.en_US
dc.date.accessioned2007-10-22T17:36:36Z
dc.date.available2007-10-22T17:36:36Z
dc.date.copyright2007en_US
dc.date.issued2007en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/39328
dc.descriptionThesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2007.en_US
dc.descriptionIncludes bibliographical references (leaves 68-69).en_US
dc.description.abstractPrevailing Parallel Linear Algebra software block cyclically distributes data across its processors for good load balancing and communication between its nodes. The block cyclic distribution schema characterized by cyclic order allocation of row and column data blocks followed by consecutive elimination is widely used in scientific computing and is the default approach in ScaLA-PACK. The fact that we are not familiar with any software outside of linear algebra that has considered cyclic distributions for their execution presents incompatibility. This calls for possible change in approach as advanced computing platforms like Star-P are emerging allowing for interoperability of algorithms. This work demonstrates a data parallel column block cyclic elimination technique for LU and QR factorization. This technique yields good load balance and communication between nodes, and also eliminates superfluous overheads. The algorithms are implemented with consecutive allocation and cyclic elimination using the high level platform, Star-P. Block update tenders extensive performance enhancement making use of Basic Linear Algebra Subroutine-3 for delivering tremendous speedup. This project also provides an overview of threading in parallel systems through implementation of important task parallel algorithms: prefix, hexadecimal Pi digits and Monte-Carlo simulation.en_US
dc.description.statementofresponsibilityby Harish Peruvamba Sundaresh.en_US
dc.format.extent69 leavesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectComputation for Design and Optimization Program.en_US
dc.titleMust linear algebra be block cyclic? : and other explorations into the expressivity of data parallel and task parallel languagesen_US
dc.typeThesisen_US
dc.description.degreeS.M.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computation for Design and Optimization Program
dc.identifier.oclc173414655en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record