Show simple item record

dc.creatorSundararajan, Sriram
dc.date.available2011-02-18T21:54:40Z
dc.date.issued2003-12
dc.identifier.urihttp://hdl.handle.net/2346/17176en_US
dc.description.abstractSequenceL is an implicitly parallelizing language that determines all the parallelisms in a computer program. This thesis is a preliminary investigation into a Tuple space based implementation of SequenceL. The results of the research are: • Tuple space was identified as a simple and straight forward approach to distributed evaluation of SequenceL programs. The tuple space concept matches closely with the SequenceL tableau, parts of which are distributed, evaluated and the result of the evaluation are gathered back. • A SequenceL interpreter and a communication architecture that communicates with a tuple space was developed. • The Gather Work Distribute cycle of the communication architecture was identified to be equivalent to the Consume Simplify Produce strategy followed by SequenceL. • Preliminary testing was conducted and certain enhancements were proposed and implemented.
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherTexas Tech Universityen_US
dc.subjectParallel programming (Computer science) -- Researchen_US
dc.subjectParallel programming (Computer science)en_US
dc.titleA SequenceL interpreter using tuplespaces
dc.typeThesis
thesis.degree.nameM.S.
thesis.degree.levelMasters
thesis.degree.disciplineComputer Science
thesis.degree.grantorTexas Tech University
thesis.degree.departmentComputer Science
dc.degree.departmentComputer Scienceen_US
dc.rights.availabilityUnrestricted.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record