{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T05:46:41Z","timestamp":1649137601540},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1992,3]]},"abstract":"<jats:p> This paper formulates and discusses a processor assignment problem arising in partitionable parallel architectures. A partitionable hypercube multiprocessor can simultaneously execute multiple tasks where each task is independently executed on a subcube. Given a p processor hypercube and n independent tasks, where a task can be assigned a subcube of any size, an assignment determines the size of the subcube \u2014 i.e., the number of processors \u2014 to be assigned to each task. The objective of our problem is to find the optimal assignment which minimizes the maximum execution time among all tasks. We present an O(n log p max { log log p, log n}) algorithm that determines an optimal assignment. This algorithm can be efficiently parallelized, on the p processor hypercube, to obtain an O((n\/p) log p log <jats:sup>2<\/jats:sup>(n log p)) parallel assignment algorithm. <\/jats:p>","DOI":"10.1142\/s0129626492000210","type":"journal-article","created":{"date-parts":[[2004,11,23]],"date-time":"2004-11-23T03:29:30Z","timestamp":1101180570000},"page":"89-95","source":"Crossref","is-referenced-by-count":0,"title":["OPTIMAL SUBCUBE ASSIGNMENT FOR PARTITIONABLE HYPERCUBES"],"prefix":"10.1142","volume":"02","author":[{"given":"RAMESH","family":"KRISHNAMURTI","sequence":"first","affiliation":[{"name":"School of Computing Science, Simon Fraser University, Vancouver, B.C., Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BHAGIRATH","family":"NARAHARI","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering &amp; Computer Science, The George Washington University, Washington, DC 20052, USA"}],"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\/S0129626492000210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:25:18Z","timestamp":1565108718000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626492000210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":0,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1992,3]]}},"alternative-id":["10.1142\/S0129626492000210"],"URL":"https:\/\/doi.org\/10.1142\/s0129626492000210","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}