A Runtime Framework for Parallel Programs

dc.contributor.authorMukherjee, Joyen
dc.contributor.committeechairVaradarajan, Srinidhien
dc.contributor.committeememberRamakrishnan, Narenen
dc.contributor.committeememberArthur, James D.en
dc.contributor.committeememberRibbens, Calvin J.en
dc.contributor.committeememberMidkiff, Scott F.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2014-03-14T20:15:32Zen
dc.date.adate2006-09-25en
dc.date.available2014-03-14T20:15:32Zen
dc.date.issued2006-08-16en
dc.date.rdate2006-09-25en
dc.date.sdate2006-08-22en
dc.description.abstractThis dissertation proposes the Weaves runtime framework for the execution of large scale parallel programs over lightweight intra-process threads. The goal of the Weaves framework is to help process-based legacy parallel programs exploit the scalability of threads without any modifications. The framework separates global variables used by identical, but independent, threads of legacy parallel programs without resorting to thread-based re-programming. At the same time, it also facilitates low-overhead collaboration among threads of a legacy parallel program through multi-granular selective sharing of global variables. Applications that follow the tenets of the Weaves framework can load multiple identical, but independent, copies of arbitrary object files within a single process. They can compose the runtime images of these object files in graph-like ways and run intra-process threads through them to realize various degrees of multi-granular selective sharing or separation of global variables among the threads. Using direct runtime control over the resolution of individual references to functions and variables, they can also manipulate program composition at fine granularities. Most importantly, the Weaves framework does not entail any modifications to either the source codes or the native codes of the object files. The framework is completely transparent. Results from experiments with a real-world process-based parallel application show that the framework can correctly execute a thousand parallel threads containing non-threadsafe global variables on a single machine - nearly twice as many as the traditional process-based approach can - without any code modifications. On increasing the number of machines, the application experiences super-linear speedup, which illustrates scalability. Results from another similar application, chosen from a different software area to emphasize the breadth of this research, show that the framework's facilities for low-overhead collaboration among parallel threads allows for significantly greater scales of achievable parallelism than technologies for inter-process collaboration allow. Ultimately, larger scales of parallelism enable more accurate software modeling of real-world parallel systems, such as computer networks and multi-physics natural phenomena.en
dc.description.degreePh. D.en
dc.identifier.otheretd-08222006-002829en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-08222006-002829/en
dc.identifier.urihttp://hdl.handle.net/10919/28756en
dc.publisherVirginia Techen
dc.relation.haspartDissertation_Mukherjee_2006.pdfen
dc.relation.haspartTex.zipen
dc.relation.haspartGraphics.zipen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectDynamic Adaptationen
dc.subjectRuntime Linking and Loadingen
dc.subjectLightweight Threadsen
dc.subjectComponent Compositionen
dc.subjectParallel Programsen
dc.subjectLegacy Procedural codesen
dc.titleA Runtime Framework for Parallel Programsen
dc.typeDissertationen
thesis.degree.disciplineComputer Scienceen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.leveldoctoralen
thesis.degree.namePh. D.en

Files

Original bundle
Now showing 1 - 3 of 3
Loading...
Thumbnail Image
Name:
Dissertation_Mukherjee_2006.pdf
Size:
933.5 KB
Format:
Adobe Portable Document Format
Name:
Tex.zip
Size:
68.36 KB
Format:
Unknown data format
Name:
Graphics.zip
Size:
518.84 KB
Format:
Unknown data format