{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T11:44:57Z","timestamp":1698147897468},"reference-count":12,"publisher":"Wiley","issue":"10","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":4827,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp; Computers in Japan"],"published-print":{"date-parts":[[1994,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Massively parallel computers are being realized for aiming at high performance. Bitonic sort is an efficient algorithm for network computers. But generally, it is impossible to use a bitonic sort algorithm on a network computer with a node failure.<\/jats:p><jats:p>This paper presents a fault\u2010tolerant scheme of bitonic sort algorithm for a network computer that makes it possible to tolerate a node failure without an additional hardware cost. The method does not have hardware redundancy but has software redundancy. The method does not depend on the network topology. However, the method takes about two times as many steps as that of original bitonic sort.<\/jats:p><jats:p>This paper also shows that the method is applicable to a chordal ring connected computer as an example.<\/jats:p>","DOI":"10.1002\/scj.4690251002","type":"journal-article","created":{"date-parts":[[2007,7,8]],"date-time":"2007-07-08T01:43:57Z","timestamp":1183859037000},"page":"15-23","source":"Crossref","is-referenced-by-count":0,"title":["Bitonic sort on a network computer with a node failure"],"prefix":"10.1002","volume":"25","author":[{"given":"Hiromi","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hidetake","family":"Funaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroaki","family":"Yamamaoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroo","family":"Yamaura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"issue":"1","key":"e_1_2_1_2_2","first-page":"94","volume":"28","author":"Koike N.","year":"1987","journal-title":"IPS Japan"},{"issue":"4","key":"e_1_2_1_3_2","first-page":"348","article-title":"The Way to Massively Parallel Computers","volume":"32","author":"Baba T.","year":"1991","journal-title":"J.IPS Japan"},{"issue":"9","key":"e_1_2_1_4_2","first-page":"1005","article-title":"Interconnection Networks","volume":"27","author":"Kurokawa T.","year":"1986","journal-title":"J.IPS Japan"},{"issue":"3","key":"e_1_2_1_5_2","first-page":"253","article-title":"Sorting on a Chordal\u2010Ring\u2010Connected Parallel Computer","volume":"68","author":"Kobayashi H.","year":"1985","journal-title":"Trans. IECE (in Japanese)"},{"key":"e_1_2_1_6_2","first-page":"307","volume-title":"Proc. AFIPS 1968 SJCC","author":"Batcher K. E.","year":"1968"},{"key":"e_1_2_1_7_2","first-page":"220","volume-title":"The Art of Computer Programming","author":"Knuth D. E.","year":"1973"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/359461.359481"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/358645.358660"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675777"},{"issue":"5","key":"e_1_2_1_11_2","first-page":"280","article-title":"Sorting on a Chordal\u2010Ring\u2010Connected Parallel Computer with Link Failures","volume":"75","author":"Kobayashi H.","year":"1992","journal-title":"Trans. IEICE (in Japanese)"},{"issue":"10","key":"e_1_2_1_12_2","first-page":"958","article-title":"Bitonic Sorting on a Network Computer with a Node Failure without Additional Steps","volume":"75","author":"Kobayashi H.","year":"1992","journal-title":"Trans. IEICE (in Japanese)"},{"issue":"3","key":"e_1_2_1_13_2","first-page":"266","article-title":"A Better Solution to Bitonic Sort on a Network Computer with a Node Failure","volume":"77","author":"Kobayashi H.","year":"1994","journal-title":"Trans. IEICE (in Japanese)"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690251002","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690251002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T01:19:20Z","timestamp":1698110360000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690251002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":12,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["10.1002\/scj.4690251002"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690251002","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}