Instructional footprinting: a basis for exploiting concurrency through instructional decomposition and code motion

Simple item page
dc.contributor.authorLandry, Kenneth D.en
dc.contributor.committeememberArthur, James D.en
dc.contributor.committeememberRibbens, Calvin J.en
dc.contributor.committeememberAbrams, Marcen
dc.contributor.committeememberKafura, Dennis G.en
dc.contributor.committeememberBloss, Adrienne G.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2014-03-14T21:14:01Zen
dc.date.adate2008-06-06en
dc.date.available2014-03-14T21:14:01Zen
dc.date.issued1993-12-05en
dc.date.rdate2008-06-06en
dc.date.sdate2008-06-06en
dc.description.abstractIn many languages, the programmer is provided the capability of communicating through the use of function calls with other, separate, independent processes. This capability can be as simple as a service request made to the operating system or as advanced as Tuple Space operations specific to a Linda programming system. The problem with such calls, however, is that they block while waiting for data or information to be returned. This synchronous nature and lack of concurrency can be avoided by initiating a non-blocking request for data earlier in the code and retrieving the returned data later when it is needed. To facilitate a better understanding of how this type of concurrency can be exploited, we introduce an instructional footprint model and application framework that formally describes instructional decomposition and code motion activities. To demonstrate the effectiveness of such an approach, we apply instructional footprinting to programs using the Linda coordination language. <i>Linda Primitive Transposition</i> (LPT) and <i>Instruction Piggybacking</i> are discussed as techniques to increase the size of instructional footprints, and thereby improve the performance of Linda programs. We also present the concept of <i>Lexical Proximity</i> to demonstrate how the overlapping of footprints contributes to the speedup of Linda programs.en
dc.description.degreePh. D.en
dc.format.extentxi, 185 leavesen
dc.format.mediumBTDen
dc.format.mimetypeapplication/pdfen
dc.identifier.otheretd-06062008-165834en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-06062008-165834/en
dc.identifier.urihttp://hdl.handle.net/10919/38359en
dc.language.isoenen
dc.publisherVirginia Techen
dc.relation.haspartLD5655.V856_1993.L365.pdfen
dc.relation.isformatofOCLC# 30797562en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.lccLD5655.V856 1993.L365en
dc.subject.lcshParallel processing (Electronic computers)en
dc.subject.lcshParallel programming (Computer science)en
dc.titleInstructional footprinting: a basis for exploiting concurrency through instructional decomposition and code motionen
dc.typeDissertationen
dc.type.dcmitypeTexten
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 - 1 of 1
Thumbnail Image
Name:
LD5655.V856_1993.L365.pdf
Size:
11.49 MB
Format:
Adobe Portable Document Format
Description:
Download

Collections

Doctoral Dissertations