<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

A NEW RECURSIVE ALGORITHM FOR THE RELIABILITY EVALUATION OF A DISTRIBUTED PROGRAM

dc.citation.epage33en_US
dc.citation.issue1-2en_US
dc.citation.spage25en_US
dc.citation.volume32en_US
dc.citation.woscount0
dc.contributor.authorCHEN, DJen_US
dc.contributor.authorSHENG, MCen_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.date.accessioned2014-12-08T15:05:03Z
dc.date.available2014-12-08T15:05:03Z
dc.date.issued1992-01-01en_US
dc.description.abstractThe reliability of a distributed program is very sensitive to the ways of file distribution, and communication system topology. It is usually much more complex to analyze the reliability of distributed program than that of the network reliability. This paper presents a distributed program reliability analysis algorithm that is developed based on the concept of sharp operation. The algorithm provides a (E - n + 2) * E memory space requirement and O(n + E + E * N(t)) computation time, where E is the number of edges, n is the number of nodes, and N(t) is the number of file spanning trees in the corresponding graph of distributed system, respectively. Compared with existing algorithms, the proposed algorithm is considered more economic both in time and space.en_US
dc.identifier.doi10.1016/0026-2714(92)90084-Xen_US
dc.identifier.issn0026-2714en_US
dc.identifier.journalMICROELECTRONICS AND RELIABILITYen_US
dc.identifier.urihttp://dx.doi.org/10.1016/0026-2714(92)90084-Xen_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/3588
dc.identifier.wosnumberWOS:A1992GY44500006
dc.language.isoen_USen_US
dc.titleA NEW RECURSIVE ALGORITHM FOR THE RELIABILITY EVALUATION OF A DISTRIBUTED PROGRAMen_US
dc.typeArticleen_US

Files

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: