Show simple item record

dc.creatorKanthadai, Sundarrajan S
dc.date.accessioned2012-06-07T22:45:11Z
dc.date.available2012-06-07T22:45:11Z
dc.date.created1996
dc.date.issued1996
dc.identifier.urihttp://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-K35
dc.descriptionDue to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to digital@library.tamu.edu, referencing the URI of the item.en
dc.descriptionIncludes bibliographical references: p. 35-37.en
dc.descriptionIssued also on microfiche from Lange Micrographics.en
dc.description.abstractDistributed Shared Memory (DSM) is a model for interprocess communication, implemented on top of message passing systems. In this model, processes running on separate hosts can access a shared, coherent memory address space, provided by the underlying DSM system, through the normal read and write operations. Thus, by avoiding the programming complexities of message passing, it has become a convenient model to work with. It is a natural extension of parallel programming on uniprocessors to distributed environments, As the number of processors in the system and the running time of applications executing on such a system increases, the likelihood of processor failure due to machine malfunction, power failure, user error, etc., increases. The benefits given by these systems can possibly be achieved only if the whole system behaves like a failure-free system. Many algorithms that have been proposed for implementing a reliable DSM, require the processes to take checkpoints whenever there is a data transfer, thus resulting in high overhead during failure-free execution. We propose a new recoverable DSM algorithm to tolerate multiple node failures and where the checkpointing interval can be tailored to balance the cost of checkpointing versus the savings in recovery obtained by taking checkpoints often. The technique uses independent checkpointing and keeps track of the dependencies by logging writes and some additional information about the occurrence of reads. Unlike previous recovery techniques, this one reduces both the message and the logging overheads.en
dc.format.mediumelectronicen
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherTexas A&M University
dc.rightsThis thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use.en
dc.subjectcomputer science.en
dc.subjectMajor computer science.en
dc.titleRecoverable distributed shared memoryen
dc.typeThesisen
thesis.degree.disciplinecomputer scienceen
thesis.degree.nameM.S.en
thesis.degree.levelMastersen
dc.type.genrethesisen
dc.type.materialtexten
dc.format.digitalOriginreformatted digitalen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.

Request Open Access