Return to search

A thread-based parallel programming library for numerical algorithms

Thesis: S.M., Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2014. / Cataloged from PDF version of thesis. / Includes bibliographical references (page 47). / This thesis presents a new simple lightweight C++ thread based parallelization library, intended for use in numerical algorithms. It provides simple multitasking and task synchronization functions. The library hides all internal system calls from the developer and utilizes thread pooling to provide better performance and utilization of system time and resources. The library is lightweight and platform independent, and has been tested on Linux, and Windows. Experiments were conducted to verify the proper functionality of the library and to show that parallelized algorithms on a single machine are more efficient than using the Message Passing Interface (MPI) using shared memory. In the opinion of several researchers who have used this library, the parallelized code is more easily understood and debugged than MPI. The results of initial experiments show that algorithms are as efficient or better than those using MPI. / by Maitham Makki Alhubail. / S.M.

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/90080
Date January 2014
CreatorsAlhubail, Maitham Makki (Maitham Makki Hussain)
ContributorsJohn R. Williams., Massachusetts Institute of Technology. Computation for Design and Optimization Program., Massachusetts Institute of Technology. Program in Computation for Design and Optimization
PublisherMassachusetts Institute of Technology
Source SetsM.I.T. Theses and Dissertation
LanguageEnglish
Detected LanguageEnglish
TypeThesis
Format47 pages, application/pdf
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., http://dspace.mit.edu/handle/1721.1/7582

Page generated in 0.0022 seconds