{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:35:31Z","timestamp":1648989331699},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1997,9]]},"abstract":"<jats:p> Reconfigurable communication networks for massively parallel multiprocessor systems offer the possibility to realize a number of application demands like special communication patterns or real-time requirements. This paper presents the design principle of a reconfigurable network which is able to realize any graph of maximal degree four. The architecture is based on a special multistage Clos network, constructed out of a number of static routing switches of equal size. Upper bounds on the cut size of 4-regular graphs, if split into a number of clusters, allow minimizing the number of switches and connections while still offering the desired reconfiguration capabilities as well as large scalability and flexible multi-user access. Efficient algorithms configuring the architecture are based on an old result by Petersen<jats:sup>27<\/jats:sup> about the decomposition of regular graphs. <\/jats:p><jats:p> The concept presented here is the basis for the Parsytec SC series of reconfigurable MPP-systems. The currently largest realization with 320 processors is presented in greater detail. <\/jats:p>","DOI":"10.1142\/s0129054197000227","type":"journal-article","created":{"date-parts":[[2003,10,16]],"date-time":"2003-10-16T00:35:19Z","timestamp":1066264519000},"page":"347-361","source":"Crossref","is-referenced-by-count":2,"title":["The Construction of Large Scale Reconfigurable Parallel Computing Systems (The Architecture of the SC320)"],"prefix":"10.1142","volume":"08","author":[{"given":"Burkhard","family":"Monien","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Paderborn, Germany"}]},{"given":"Ralf","family":"Diekmann","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Paderborn, Germany"}]},{"given":"Reinhard","family":"L\u00fcling","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Paderborn, Germany"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054197000227","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:46:03Z","timestamp":1565138763000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054197000227"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":0,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1997,9]]}},"alternative-id":["10.1142\/S0129054197000227"],"URL":"https:\/\/doi.org\/10.1142\/s0129054197000227","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}