{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T07:40:02Z","timestamp":1698133202592},"reference-count":13,"publisher":"Wiley","issue":"9","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":5923,"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":[[1991,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents a new algorithm for task mapping onto a hypercube. The structure of parallel programs can be expressed by a task graph. With this graph, the algorithm generates a mapping that reduces communications costs considerably.<\/jats:p><jats:p>When the target computer is an <jats:italic>n<\/jats:italic>\u2010dimensional cube (<jats:italic>n<\/jats:italic>\u2010cube), the algorithm is composed of <jats:italic>n<\/jats:italic> stages. It starts with an initial state in which the tasks are mapped onto 2<jats:sup>+<\/jats:sup> 0\u2010cubes. At each stage <jats:italic>k<\/jats:italic>, the task graph is mapped onto 2<jats:sup><jats:italic>n\u2010k<\/jats:italic><\/jats:sup> <jats:italic>k<\/jats:italic>\u2010cubes. The mapping onto <jats:italic>k<\/jats:italic>\u2010cube can be accomplished by combining two (<jats:italic>k<\/jats:italic> \u20101)\u2010cubes.<\/jats:p>","DOI":"10.1002\/scj.4690220902","type":"journal-article","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T12:20:00Z","timestamp":1195042800000},"page":"14-22","source":"Crossref","is-referenced-by-count":1,"title":["A task mapping method for a hypercube"],"prefix":"10.1002","volume":"22","author":[{"given":"Satoshi","family":"Horiike","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Solving Problems on Concurrent Processors","author":"Fox G.","year":"1988"},{"key":"e_1_2_1_3_2","volume-title":"The Connection Machine","author":"Hillis W. D.","year":"1985"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2003-6"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676925"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675884"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"W. K.ChenandE. F.Gehringer.A graph oriented mapping strategy for a hypercube. 3rd Hypercube Concurrent Computers and Applications pp.200\u2013209(1988).","DOI":"10.1145\/62297.62322"},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"F.Ercal J.Rmanujam andP.Sadayappan.Task allocation onto a hypercube by recursive mincut bipartitioning. 3rd Hypercube Concurrent Computers and Applications pp.210\u2013221(1988).","DOI":"10.1145\/62297.62323"},{"key":"e_1_2_1_9_2","volume-title":"Combinatorial Optimization Network and Matroids","author":"Lawler E. L.","year":"1976"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288324"},{"issue":"7","key":"e_1_2_1_11_2","first-page":"792","article-title":"A practical optimal\/approximate algorithm for multiprocessor scheduling problem","volume":"67","author":"Kasahara H.","year":"1984","journal-title":"I.E.I.C.E. Trans."},{"key":"e_1_2_1_12_2","unstructured":"S.Horiike.Task Allocation Method for Hypercube. IEICEJ Technical Reports COMP88\u201086 December 1988."},{"key":"e_1_2_1_13_2","article-title":"A Hypercube Task Allocation Method Based on Communication Distance Estimation","volume":"89","author":"Horiike S.","year":"1989","journal-title":"I.E.I.C.E. Trans."},{"key":"e_1_2_1_14_2","article-title":"Recursive Task Mapping in a Hypercube","volume":"89","author":"Horiike","year":"1989","journal-title":"I.E.I.C.E. Trans."}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690220902","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690220902","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690220902","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T02:38:29Z","timestamp":1698028709000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690220902"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":13,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["10.1002\/scj.4690220902"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690220902","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}