eCommons

 

Techniques for Simplifying the Programming of Distributed Systems

dc.contributor.authorKoo, Richarden_US
dc.date.accessioned2007-04-23T17:21:29Z
dc.date.available2007-04-23T17:21:29Z
dc.date.issued1987-08en_US
dc.description.abstractIt is difficult to design and verify distributed programs that execute correctly despite transient processor failures, or despite variable and unpredictable processor speeds and message transmission times. In this thesis, we describe a checkpointing/rollback mechanism that allows programmers to write distributed programs with the simplifying assumption that processors do not fail, and then run these programs correctly on systems with transient processor failures. We also describe a translation mechanism that can be used to write programs with the simplifying assumptions that processors execute in synchronized steps and messages take exactly one step to arrive, and then run these programs correctly on systems that violate these assumptions. Both mechanisms are transparent to the programmer, and they can be applied to solve a large class of problems.en_US
dc.format.extent6301469 bytes
dc.format.extent1396247 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-858en_US
dc.identifier.urihttps://hdl.handle.net/1813/6698
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleTechniques for Simplifying the Programming of Distributed Systemsen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
87-858.pdf
Size:
6.01 MB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
87-858.ps
Size:
1.33 MB
Format:
Postscript Files