{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:45Z","timestamp":1757629545243,"version":"3.44.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0743-7315(92)90032-i","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"185-197","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"title":["Fault-tolerant sorting algorithm on hypercube multicomputers"],"prefix":"10.1016","volume":"16","author":[{"given":"Jang-Ping","family":"Sheu","sequence":"first","affiliation":[]},{"given":"Yuh-shyan","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Chih-Yung","family":"Chang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(92)90032-I_BIB1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/71.80194","article-title":"An efficient modular spare allocation scheme and its application to fault tolerant binary hypercubes","volume":"2","author":"Alam","year":"1991","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"issue":"8","key":"10.1016\/0743-7315(92)90032-I_BIB2","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1109\/TC.1981.1675844","article-title":"Fault diagnosis in a Boolean n cube array of microprocessors","volume":"30","author":"Armstrong","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"10.1016\/0743-7315(92)90032-I_BIB3","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1109\/12.57055","article-title":"Algorithm-based fault tolerance on a hypercube multiprocessor","volume":"39","author":"Banerjee","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90032-I_BIB4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0167-8191(89)90091-4","article-title":"Communication efficient matrix multiplication on hypercubes","volume":"12","author":"Berntsen","year":"1989","journal-title":"Parallel Comput."},{"issue":"11","key":"10.1016\/0743-7315(92)90032-I_BIB5","first-page":"1070","article-title":"An efficient approach for fault diagnosis in a Boolean n-cube array of microprocessors","volume":"32","author":"Kabekode","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90032-I_BIB6","series-title":"Digest of Papers International Symposium Fault-Tolerant Computing","first-page":"323","article-title":"A proposal for a fault-tolerance binary hypercube architecture","author":"Chau","year":"1989"},{"issue":"12","key":"10.1016\/0743-7315(92)90032-I_BIB7","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1109\/12.61061","article-title":"Adaptive fault-tolerant routing in hypercube multicomputers","volume":"39","author":"Chen","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90032-I_BIB8","first-page":"169","article-title":"Fault-tolerant matrix operations on hypercube multiprocessors","volume":"Vol. 3","author":"Elster","year":"1989"},{"key":"10.1016\/0743-7315(92)90032-I_BIB9","series-title":"Proc. 19th Annual ACM Symposium on Theory of Computing","first-page":"274","article-title":"Reconfiguring a hypercube in the presence of faults","author":"Hastad","year":"1987"},{"key":"10.1016\/0743-7315(92)90032-I_BIB10","series-title":"Proc. 1984 International Conference on Parallel Processing","first-page":"21","article-title":"Combining parallel and sequential sorting on a Boolean n-cube","author":"Johnsson","year":"1984"},{"key":"10.1016\/0743-7315(92)90032-I_BIB11","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/2.56849","article-title":"Fault-tolerant computing: Fundamental concepts","author":"Nelson","year":"1990","journal-title":"Computer"},{"issue":"5","key":"10.1016\/0743-7315(92)90032-I_BIB12","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0020-0190(88)90117-2","article-title":"A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor","volume":"29","author":"\u00d6zg\u00fcner","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-7315(92)90032-I_BIB13","series-title":"Digest of Papers, International Symposium Fault-Tolerant Computing","first-page":"344","article-title":"On implementing fault-tolerance in binary hypercubes","author":"Rennels","year":"1986"},{"issue":"7","key":"10.1016\/0743-7315(92)90032-I_BIB14","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","article-title":"Topological properties of hypercube","volume":"37","author":"Saad","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90032-I_BIB15","series-title":"Proc. of the Second Conference on Hypercube Multiprocessors","first-page":"285","article-title":"Sorting on hypercubes","author":"Seidel","year":"1987"},{"issue":"1","key":"10.1016\/0743-7315(92)90032-I_BIB16","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","article-title":"The cosmic cube","volume":"28","author":"Seitz","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-7315(92)90032-I_BIB17","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0167-8191(89)90044-6","article-title":"Selection of the first k largest processes in hypercubes","volume":"11","author":"Sheu","year":"1989","journal-title":"Parallel Comput."},{"key":"10.1016\/0743-7315(92)90032-I_BIB18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0167-8191(90)90151-X","article-title":"Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model","volume":"13","author":"Sheu","year":"1990","journal-title":"Parallel Comput"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290032I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290032I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:28:51Z","timestamp":1757514531000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159290032I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["074373159290032I"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(92)90032-i","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1992,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fault-tolerant sorting algorithm on hypercube multicomputers","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(92)90032-I","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}