{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T12:38:44Z","timestamp":1775047124836,"version":"3.50.1"},"reference-count":51,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/clustr.2002.1137758","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T01:03:42Z","timestamp":1056589422000},"page":"296-304","source":"Crossref","is-referenced-by-count":12,"title":["Processor allocation on Cplant: achieving general processor locality using one-dimensional allocation strategies"],"prefix":"10.1109","author":[{"given":"V.J.","family":"Leung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.M.","family":"Arkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ma.","family":"Bender","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Bunde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Johnston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Alok Lal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.S.B.","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Phillips","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.S.","family":"Seiden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/71.491582"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF01199438"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019325647X"},{"key":"ref32","year":"0","journal-title":"Advanced Simulation and Computing (ASCI)"},{"key":"ref31","first-page":"420","article-title":"An implementation of the Hilbert scanning algorithm and its application to data compression","volume":"e76 d","author":"kamata","year":"1993","journal-title":"IEICE Trans Information and Sys-Tems"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/83.772242"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0036198"},{"key":"ref36","year":"0"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/69.908985"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/3-540-48184-2_35","article-title":"A video scrambling technique based on space filling curves","volume":"293","author":"matias","year":"1987","journal-title":"Proc Advances in Cryptology (CRYPTO)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80026-7"},{"key":"ref27","author":"johnson","year":"1973","journal-title":"Near-Optimal Bin Packing Algorithms"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0203025"},{"key":"ref2","first-page":"431","article-title":"A recursive algorithm for pattern recognition","author":"alexandrov","year":"1982","journal-title":"Proc IEEE Intl Conf Pattern Recognition"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240010003"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/263767.263789"},{"key":"ref22","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"ref24","article-title":"A system software architecture for high-end computing","author":"greenberg","year":"1997","journal-title":"Proc High Performance Networking and Computing (SC '02)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/83.499920"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01199431"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/218\/3018"},{"key":"ref50","article-title":"Selective buddy allocation for scheduling parallel jobs on clusters","author":"subramani","year":"2002","journal-title":"Proc 4th IEEE International Conference on Cluster Computing"},{"key":"ref51","first-page":"467","article-title":"Fractal scanning for image compression","author":"thyagarajan","year":"1992","journal-title":"Conference Record of the 25th Asilomar Conference on Signals Systems and Computers"},{"key":"ref10","article-title":"Cache oblivious search trees via binary trees of small height (extended abstract)","author":"brodal","year":"2002","journal-title":"Proc of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/305619.305645"},{"key":"ref40","article-title":"Cache-oblivious algorithms","author":"prokop","year":"1999"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/0603007"},{"key":"ref13","article-title":"Approximation algorithms for bin packing: A survey","author":"coffman","year":"1997","journal-title":"Approximation Algorithms Np-hard Problems chapter 2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90027-8"},{"key":"ref15","year":"0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335331"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48518-X_15"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029568"},{"key":"ref19","year":"0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/30.156720"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/HIPC.1997.634498"},{"key":"ref6","first-page":"29","article-title":"A locality-preserving cache-oblivious dynamic dictionary","author":"bender","year":"2002","journal-title":"Proc 17th Ann ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892128"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(99)00104-0"},{"key":"ref7","article-title":"Scalability and performance of CTH on the Computational Plant","author":"brightwell","year":"2000","journal-title":"Proc 2nd International Conference on Cluster-Based Computing"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"ref9","article-title":"Scalability limitations of VIA-based technologies in supporting MP I","author":"brightwell","year":"2000","journal-title":"Proc 4th MPI Developer's and User's Conference"},{"key":"ref46","year":"0","journal-title":"The Computational Plant Project"},{"key":"ref45","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0871-6","author":"sagan","year":"1994","journal-title":"Space-Filling Curves"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029570"},{"key":"ref47","first-page":"486","article-title":"New bounds for multidimensional packing","author":"seiden","year":"2002","journal-title":"Proc 17th Ann ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref42","article-title":"Cplant","author":"riesen","year":"1999","journal-title":"Proc 2nd Extreme Linux workshop at the 1999 USENIX Annual Technical Confer-ence"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44688-5_6"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321846"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/321650.321658"}],"event":{"name":"2002 IEEE International Conference on Cluster Computing","location":"Chicago, IL, USA","acronym":"CLUSTR-02"},"container-title":["Proceedings. IEEE International Conference on Cluster Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8231\/25385\/01137758.pdf?arnumber=1137758","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T02:56:05Z","timestamp":1585018565000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1137758\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/clustr.2002.1137758","relation":{},"subject":[]}}