{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:44:47Z","timestamp":1761662687927,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1109\/clustr.2008.4663766","type":"proceedings-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T00:17:52Z","timestamp":1225930672000},"page":"152-159","source":"Crossref","is-referenced-by-count":9,"title":["Are nonblocking networks really needed for high-end-computing workloads?"],"prefix":"10.1109","author":[{"given":"N.","family":"Desai","sequence":"first","affiliation":[]},{"given":"P.","family":"Balaji","sequence":"additional","affiliation":[]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[]},{"given":"M.","family":"Islam","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","first-page":"107","article-title":"selective buddy allocation for scheduling parallel jobs on clusters","author":"subramani","year":"2002","journal-title":"Cluster Computing 2002 Proceedings 2002 IEEE International Conference on"},{"journal-title":"Parallel Workloads Archive","year":"0","author":"feitelson","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/12.76413"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/71.80186"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.1993.26"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.5009493"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.1991.148674"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2007.60"},{"journal-title":"Linux clusters overview","year":"0","author":"barney","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/71.282559"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2000.846022"},{"key":"6","article-title":"processor allocation on cplant: achieving general processor locality using one-dimensional allocation strategies","author":"leung","year":"2002","journal-title":"Proc IEEE Int Conf Cluster Comput"},{"key":"5","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0743-7315(92)90016-G","article-title":"efficient processor allocation strategies for mesh-connected parallel computers","volume":"16","author":"zhu","year":"1992","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0743-7315(91)90032-5","article-title":"a two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system","volume":"12","author":"li","year":"1991","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9037-2"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1996.508068"}],"event":{"name":"2008 IEEE International Conference on Cluster Computing (CLUSTER)","start":{"date-parts":[[2008,9,29]]},"location":"Tsukuba","end":{"date-parts":[[2008,10,1]]}},"container-title":["2008 IEEE International Conference on Cluster Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4655410\/4663724\/04663766.pdf?arnumber=4663766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T13:10:51Z","timestamp":1497791451000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4663766\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/clustr.2008.4663766","relation":{},"subject":[],"published":{"date-parts":[[2008,9]]}}}