Distributed program reliability based on minimum file spanning trees

dc.creatorKrishnan, Kirti
dc.date.available2011-02-18T19:05:46Z
dc.date.issued2000-12
dc.description.abstractThe objective of this thesis was to develop a generalized modeling technique using Petri Nets based on Minimum File Sparming trees and to generate reliability measures for a distributed program in the given distributed computing environment. A global repair state was also incorporated into the final model to measure the availability of the program. (The idea proposed features the concept of using Minimum File Spanning trees as the major component in the Petri Net model rather than the individual components of the system, thereby achieving a reduction in the state space and improved efficiency in the generation of reliability results.
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/2346/9382en_US
dc.language.isoeng
dc.publisherTexas Tech Universityen_US
dc.rights.availabilityUnrestricted.
dc.subjectPetri netsen_US
dc.subjectComputer networksen_US
dc.subjectElectronic data processingen_US
dc.subjectComputer networksen_US
dc.titleDistributed program reliability based on minimum file spanning trees
dc.typeThesis
thesis.degree.departmentComputer Science
thesis.degree.grantorTexas Tech University
thesis.degree.levelMasters
thesis.degree.nameM.S.

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
31295015765646.pdf
Size:
2.5 MB
Format:
Adobe Portable Document Format