{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T15:33:29Z","timestamp":1655307209394},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1996,6]]},"abstract":"<jats:p> Many algorithms were devised for the reconfigurable mesh model (RN-mesh) for parallel computing which involve only a constant number of broadcasting steps. It was not known, however, how tight are the constants involved. Consider an n\u00d7n directed reconfigurable mesh (DRN-mesh) that computes a function f(n) in T steps, where T is a constant. In this paper we show that T can always be reduced to a single step, still using a polynomial size DRN-mesh. Furthermore, we show that this is in fact a general tradeoff: namely, the number of steps may be reduced to any value between 1 and T, paying by an exponential growth of the size of the DRN-mesh in the number of eliminated steps. <\/jats:p>","DOI":"10.1142\/s0129626496000236","type":"journal-article","created":{"date-parts":[[2004,10,28]],"date-time":"2004-10-28T18:29:23Z","timestamp":1098988163000},"page":"231-245","source":"Crossref","is-referenced-by-count":5,"title":["TIME-SIZE TRADEOFFS FOR RECONFIGURABLE MESHES"],"prefix":"10.1142","volume":"06","author":[{"given":"YOSI","family":"BEN-ASHER","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, The Haifa University, Haifa"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ASSAF","family":"SCHUSTER","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Technion, Haifa, 32000, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626496000236","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:18:43Z","timestamp":1565108323000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626496000236"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":0,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1996,6]]}},"alternative-id":["10.1142\/S0129626496000236"],"URL":"https:\/\/doi.org\/10.1142\/s0129626496000236","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}