EFFICIENT ALGORITHMS FOR K-OUT-OF-N AND CONSECUTIVE-WEIGHTED-K-OUT-OF-N-F SYSTEM

Full metadata record

DC Field	Value	Language
dc.contributor.author	WU, JS	en_US
dc.contributor.author	CHEN, RJ	en_US
dc.date.accessioned	2014-12-08T15:03:40Z	-
dc.date.available	2014-12-08T15:03:40Z	-
dc.date.issued	1994-12-01	en_US
dc.identifier.issn	0018-9529	en_US
dc.identifier.uri	http://dx.doi.org/10.1109/24.370213	en_US
dc.identifier.uri	http://hdl.handle.net/11536/2190	-
dc.description.abstract	A new reliability model, consecutive-weighted-k-out-of-n:F system, is proposed and an O(n) algorithm is provided to evaluate its reliability. An O(n.min(n,k)) algorithm is also presented for the circular case of this model. We design an O(n) parallel algorithm using k processors to compute the reliability of k-out-of-n systems, that achieves linear speedup.	en_US
dc.language.iso	en_US	en_US
dc.subject	K-OUT-OF-N SYSTEM	en_US
dc.subject	CONSECUTIVE-WEIGHTED-K-OUT-OF-N-F SYSTEM	en_US
dc.subject	SYSTEM RELIABILITY	en_US
dc.subject	ALGORITHM	en_US
dc.subject	PARALLEL COMPUTATION	en_US
dc.title	EFFICIENT ALGORITHMS FOR K-OUT-OF-N AND CONSECUTIVE-WEIGHTED-K-OUT-OF-N-F SYSTEM	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1109/24.370213	en_US
dc.identifier.journal	IEEE TRANSACTIONS ON RELIABILITY	en_US
dc.citation.volume	43	en_US
dc.citation.issue	4	en_US
dc.citation.spage	650	en_US
dc.citation.epage	655	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1994QC59900025	-
dc.citation.woscount	14	-
Appears in Collections:	Articles

Files in This Item:

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.