Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHEN, RSen_US
dc.contributor.authorCHEN, DJen_US
dc.contributor.authorYEH, YSen_US
dc.date.accessioned2014-12-08T15:03:33Z-
dc.date.available2014-12-08T15:03:33Z-
dc.date.issued1995-02-01en_US
dc.identifier.issn0898-1221en_US
dc.identifier.urihttp://hdl.handle.net/11536/2090-
dc.description.abstractIn this paper, we propose a simple, easily programmed exact method for obtaining the optimal design of a distributed computing system in terms of maximizing reliability subject to memory capacity constraints. We assume that a given amount of resources are available for linking the distributed computing system. The method is based on the partial order relation. To speed up the procedure, some rules are proposed to indicate conditions under which certain vectors in the numerical ordering that do not satisfy the capacity constraints can be skipped over. Simulation results show that the proposed algorithm requires less time and space than exhaustive method.en_US
dc.language.isoen_USen_US
dc.subjectDISTRIBUTED COMPUTER SYSTEMen_US
dc.subjectRELIABILITYen_US
dc.subjectEXACT APPROACHen_US
dc.subjectCAPACITY CONSTRAINTen_US
dc.titleRELIABILITY OPTIMIZATION OF DISTRIBUTED COMPUTING SYSTEMS SUBJECT TO CAPACITY CONSTRAINTSen_US
dc.typeArticleen_US
dc.identifier.journalCOMPUTERS & MATHEMATICS WITH APPLICATIONSen_US
dc.citation.volume29en_US
dc.citation.issue4en_US
dc.citation.spage93en_US
dc.citation.epage99en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.identifier.wosnumberWOS:A1995QL20700011-
dc.citation.woscount8-
Appears in Collections:Articles


Files in This Item:

  1. A1995QL20700011.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.