{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:00:01Z","timestamp":1648746001842},"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":[[1996,3]]},"abstract":"<jats:p> Global parallel scheduling is a new approach for runtime load balancing. In parallel scheduling, all processors cooperate together to schedule work. Parallel scheduling accurately balances the load by using global load information. As an alternative strategy to the commonly used dynamic scheduling, it provides a high-quality, low-overhead load balancing. This paper presents a parallel scheduling algorithm for interconnection networks of the tree topology. This algorithm minimizes communications and maximize locality. <\/jats:p>","DOI":"10.1142\/s0129626496000066","type":"journal-article","created":{"date-parts":[[2004,10,28]],"date-time":"2004-10-28T14:29:23Z","timestamp":1098973763000},"page":"45-54","source":"Crossref","is-referenced-by-count":2,"title":["A PARALLEL SCHEDULING ALGORITHM FOR TREE STRUCTURED INTERCONNECTION NETWORKS"],"prefix":"10.1142","volume":"06","author":[{"given":"MIN-YOU","family":"WU","sequence":"first","affiliation":[{"name":"Department of Computer Science, State University of New York at Buffalo, Buffalo, NY 14260, USA"}]}],"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\/S0129626496000066","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:18:33Z","timestamp":1565093913000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626496000066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":0,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1996,3]]}},"alternative-id":["10.1142\/S0129626496000066"],"URL":"https:\/\/doi.org\/10.1142\/s0129626496000066","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}