{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:11:06Z","timestamp":1763467866759,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/icpp.2004.1327942","type":"proceedings-article","created":{"date-parts":[[2008,7,18]],"date-time":"2008-07-18T11:07:46Z","timestamp":1216379266000},"page":"353-360 vol.1","source":"Crossref","is-referenced-by-count":28,"title":["Parallel network RAM: effectively utilizing global cluster memory for large data-intensive parallel programs"],"prefix":"10.1109","author":[{"given":"J.","family":"Oleszkiewicz","sequence":"first","affiliation":[]},{"family":"Li Xiao","sequence":"additional","affiliation":[]},{"family":"Yunhao Liu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(94)90013-2"},{"key":"22","article-title":"Adaptive memory allocations in clusters to handle unexpectedly large data-intensive jobs","volume":"15","author":"xiao","year":"2004","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"journal-title":"Barracuda Ata v and Barracuda Ata v Plus Technical Specifications","year":"0","key":"17"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/HPDC.2000.868636"},{"key":"18","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/3-540-60153-8_27","article-title":"The interaction between memory allocation and adaptive partitioning in message-passing multicomputers","volume":"949","author":"setia","year":"1995","journal-title":"Job Scheduling Strategies for Parallel Processing"},{"key":"24","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-39997-6_6","article-title":"Resource allocation schemes for gang scheduling","volume":"1911","author":"zhou","year":"2000","journal-title":"Job Scheduling Strategies for Parallel Processing"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(96)90030-9"},{"key":"16","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BFb0053987","article-title":"Improving first-come-first-serve job scheduling by gang scheduling","volume":"1459","author":"schwiegelshohn","year":"1998","journal-title":"Job Scheduling Strategies for Parallel Processing"},{"key":"13","first-page":"177","article-title":"Implementation of a reliable remote memory pager","author":"markatos","year":"1996","journal-title":"USENIX Annual Technical Conference"},{"key":"14","first-page":"133","article-title":"Improving parallel job scheduling by combining gang scheduling and backfilling techniques","author":"moreira","year":"2000","journal-title":"IPDPS"},{"key":"11","first-page":"383","author":"flouris","year":"1999","journal-title":"High Performance Cluster Computing"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0053979"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/71.993204"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2000.845971"},{"key":"20","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-63574-2_26","article-title":"Performance evaluation of gang scheduling for parallel and distributed multiprogramming","volume":"1291","author":"wang","year":"1997","journal-title":"Job Scheduling Strategies for Parallel Processing"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/S0141-9331(98)00077-5"},{"key":"1","article-title":"The utility of exploiting idle memory for data-intensive computations","volume":"trcs98 2","author":"acharya","year":"1998","journal-title":"Technical Report"},{"key":"10","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/3-540-45540-X_11","article-title":"Metrics for parallel job scheduling and their convergence","volume":"2221","author":"feitelson","year":"2001","journal-title":"Job Scheduling Strategies for Parallel Processing"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/224056.224072"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/29904.29912"},{"key":"5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-47954-6_4","article-title":"Benchmarks and standards for the evaluation of parallel job schedulers","volume":"1659","author":"chapin","year":"1999","journal-title":"Job Scheduling Strategies for Parallel Processing"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF00128100"},{"key":"9","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/3-540-63574-2_17","article-title":"Memory usage in the LANL CM-5 workload","volume":"1291","author":"feitelson","year":"1997","journal-title":"Job Scheduling Strategies for Parallel Processing"},{"key":"8","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BFb0022289","article-title":"Packing schemes for gang scheduling","volume":"1162","author":"feitelson","year":"1996","journal-title":"Job Scheduling Strategies for Parallel Processing"}],"event":{"name":"International Conference on Parallel Processing, 2004. ICPP 2004.","start":{"date-parts":[[2004,8,18]]},"location":"Montreal, Que., Canada","end":{"date-parts":[[2004,8,18]]}},"container-title":["International Conference on Parallel Processing, 2004. ICPP 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9250\/29349\/01327942.pdf?arnumber=1327942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T15:14:05Z","timestamp":1557674045000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1327942\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/icpp.2004.1327942","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}