{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:20Z","timestamp":1725455420399},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540618645"},{"type":"electronic","value":"9783540707103"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0022287","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T02:04:36Z","timestamp":1131847476000},"page":"48-64","source":"Crossref","is-referenced-by-count":17,"title":["A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm"],"prefix":"10.1007","author":[{"given":"Michael","family":"Wan","sequence":"first","affiliation":[]},{"given":"Reagan","family":"Moore","sequence":"additional","affiliation":[]},{"given":"George","family":"Kremenek","sequence":"additional","affiliation":[]},{"given":"Ken","family":"Steube","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"4_CR1","unstructured":"B. Kingsbury, H. Walter, M. Bridge and T. Carver. \u201cNQS, Network Queuing System, Version 2.0\u201d, Cosmic Program # ARC-13179."},{"key":"4_CR2","unstructured":"L. M. Ni and P. K. McKinley. \u201cA survey of wormhole routing techniques in direct networks\u201d. IEEE Trans. Computers, 1993."},{"key":"4_CR3","unstructured":"V. Lo, K. Windisch, W. Liu and B. Nitzberg. \u201cNon-contiguous Processor Allocation Algorithm for Mesh-connected Multicomputers\u201d, paper to be published."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0743-7315(91)90032-5","volume":"12","author":"K. Li","year":"1991","unstructured":"K. Li and K. Cheng. \u201cA two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system\u201d. Journal of Parallel and Distributed Computing, 12:79\u201383, 1991.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"4_CR5","unstructured":"FTP:\/\/ftp.sdsc.edu\/\/pub\/sdsc\/parallel\/ paragon\/paragon95.txt.Z"}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T05:09:22Z","timestamp":1549256962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540618645","9783540707103"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/bfb0022287","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}