{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T12:47:29Z","timestamp":1750855649070,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_16","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"169-181","source":"Crossref","is-referenced-by-count":13,"title":["Communication-Aware Processor Allocation for Supercomputers"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David P.","family":"Bunde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e1ndor P.","family":"Fekete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitus J.","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cynthia A.","family":"Phillips","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1007\/978-3-540-30117-2_87","volume-title":"Field Programmable Logic and Application","author":"A. Ahmadinia","year":"2004","unstructured":"Ahmadinia, A., Bobda, C., Fekete, S., Teich, J., der Veen, J.: Optimal routing-conscious dynamic placement for reconfigurable computing. In: Becker, J., Platzner, M., Vernalde, S. (eds.) FPL 2004. LNCS, vol.\u00a03203, pp. 847\u2013851. Springer, Heidelberg (2004)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Charikar, M., Raz, D.: Approximating min-sum k-clustering in metric spaces. In: Proc. 33rd Symp. on Theory of Computation, pp. 11\u201320 (2001)","DOI":"10.1145\/380752.380754"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Baylor, S., Benveniste, C., Hsu, Y.: Performance evaluation of a massively paralel I\/O subsystem. In: Jain, R., Werth, J., Browne, J. (eds.) Synthesizing Synchronous Systems by Static Scheduling in Space-Time. The Kluwer International Series in Engineering and Computer Science, ch. 13, vol.\u00a0362, pp. 293\u2013311. Kluwer Academic Publishers, Dordrecht (1996)","DOI":"10.1007\/978-1-4613-1401-1_13"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1088\/0305-4470\/37\/1\/010","volume":"37","author":"C.M. Bender","year":"2004","unstructured":"Bender, C.M., Bender, M.A., Demaine, E.D., Fekete, S.P.: What is the optimal shape of a city? J. Physics A: Mathematical and General\u00a037, 147\u2013159 (2004)","journal-title":"J. Physics A: Mathematical and General"},{"key":"16_CR5","unstructured":"Bender, M.A., Bunde, D.P., Demaine, E.D., Fekete, S.P., Leung, V.J., Meijer, H., Phillips, C.A.: Communication-aware processor allocation for supercomputers. Technical Report cs.DS\/0407058, Computing Research Repository (2004), http:\/\/arxiv.org\/abs\/cs.DS\/0407058"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., Tsai, W.-T.: Lookahead processor allocation in mesh connected massively parallel computers. In: Proc. 8th International Parallel Processing Symposium, pp. 868\u2013875 (1994)","DOI":"10.1109\/IPPS.1994.288204"},{"issue":"2-3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0167-8191(99)00104-0","volume":"26","author":"R. Brightwell","year":"2000","unstructured":"Brightwell, R., Fisk, L.A., Greenberg, D.S., Hudson, T., Levenhagen, M., Maccabe, A.B., Riesen, R.: Massively parallel computing using commodity components. Parallel Computing\u00a026(2-3), 243\u2013266 (2000)","journal-title":"Parallel Computing"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1006\/jpdc.1998.1459","volume":"52","author":"C. Chang","year":"1998","unstructured":"Chang, C., Mohapatra, P.: Improving performance of mesh connected multicomputers by reducing fragmentation. Journal of Parallel and Distributed Computing\u00a052(1), 40\u201368 (1998)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Chuang, P.-J., Tzeng, N.-F.: An efficient submesh allocation strategy for mesh computer systems. In: Proc. Int. Conf. Dist. Comp. Systems, pp. 256\u2013263 (1991)","DOI":"10.1109\/ICDCS.1991.148674"},{"key":"16_CR10","unstructured":"Feitelson, D.: The parallel workloads archive, http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/index.html"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s00453-003-1074-x","volume":"38","author":"S.P. Fekete","year":"2004","unstructured":"Fekete, S.P., Meijer, H.: Maximum dispersion and geometric maximum weight cliques. Algorithmica\u00a038, 501\u2013511 (2004)","journal-title":"Algorithmica"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0166-218X(98)00100-0","volume":"89","author":"N. Guttmann-Beck","year":"1998","unstructured":"Guttmann-Beck, N., Hassin, R.: Approximation algorithms for minimum sum p-clustering. Disc. Appl. Math.\u00a089, 125\u2013142 (1998)","journal-title":"Disc. Appl. Math."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Indyk, P.: A sublinear time approximation scheme for clustering in metric spaces. In: Proc. 40th Ann. IEEE Symp. Found. Comp. Sci (FOCS), pp. 154\u2013159 (1999)","DOI":"10.1109\/SFFCS.1999.814587"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1137\/0204023","volume":"4","author":"R.M. Karp","year":"1975","unstructured":"Karp, R.M., McKellar, A.C., Wong, C.K.: Near-optimal solutions to a 2-dimensional placement problem. SIAM Journal on Computing\u00a04, 271\u2013286 (1975)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"16_CR15","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1109\/71.282559","volume":"5","author":"P. Krueger","year":"1994","unstructured":"Krueger, P., Lai, T.-H., Dixit-Radiya, V.: Job scheduling is more important than processor allocation for hypercube computers. IEEE Trans. on Parallel and Distributed Systems\u00a05(5), 488\u2013497 (1994)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0304-3975(96)00304-0","volume":"181","author":"S. Krumke","year":"1997","unstructured":"Krumke, S., Marathe, M., Noltemeier, H., Radhakrishnan, V., Ravi, S., Rosenkrantz, D.: Compact location problems. Th. Comp. Sci.\u00a0181, 379\u2013404 (1997)","journal-title":"Th. Comp. Sci."},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Leung, V., Arkin, E., Bender, M., Bunde, D., Johnston, J., Lal, A., Mitchell, J., Phillips, C., Seiden, S.: Processor allocation on Cplant: achieving general processor locality using one-dimensional allocation strategies. In: Proc. 4th IEEE International Conference on Cluster Computing, pp. 296\u2013304 (2002)","DOI":"10.2172\/800975"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0743-7315(91)90032-5","volume":"12","author":"K. Li","year":"1991","unstructured":"Li, K., Cheng, K.-H.: A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system. Journal of Parallel and Distributed Computing\u00a012, 79\u201383 (1991)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Lo, V., Windisch, K., Liu, W., Nitzberg, B.: Non-contiguous processor allocation algorithms for mesh-connected multicomputers. IEEE Transactions on Parallel and Distributed Computing\u00a08(7) (1997)","DOI":"10.1109\/71.598346"},{"key":"16_CR20","unstructured":"Mache, J., Lo, V.: Dispersal metrics for non-contiguous processor allocation. Technical Report CIS-TR-96-13, University of Oregon (1996)"},{"key":"16_CR21","unstructured":"Mache, J., Lo, V.: The effects of dispersal on message-passing contention in processor allocation strategies. In: Proc. Third Joint Conf. on Information Sciences, Sessions on Parallel and Distributed Processing, vol.\u00a03, pp. 223\u2013226 (1997)"},{"key":"16_CR22","unstructured":"Mache, J., Lo, V., Windisch, K.: Minimizing message-passing contention in fragmentation-free processor allocation. In: Proc. 10th Intern. Conf. Parallel and Distributed Computing Systems, pp. 120\u2013124 (1997)"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Moore, S., Ni, L.: The effects of network contention on processor allocation strategies. In: Proc. 10th Int. Par. Proc. Symp., pp. 268\u2013274 (1996)","DOI":"10.1109\/IPPS.1996.508068"},{"issue":"3","key":"16_CR24","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: p-complete approximation problems. JACM 23(3), 555\u2013565 (1976)","journal-title":"JACM"},{"key":"16_CR25","unstructured":"Sandia National Laboratories. The Computational Plant Project, http:\/\/www.cs.sandia.gov\/cplant"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Subramani, V., Kettimuthu, R., Srinivasan, S., Johnson, J., Sadayappan, P.: Selective buddy allocation for scheduling parallel jobs on clusters. In: Proc. 4th IEEE International Conference on Cluster Computing (2002)","DOI":"10.1109\/CLUSTR.2002.1137735"},{"key":"16_CR27","unstructured":"University of Oregon Resource Allocation Group. Procsimity. http:\/\/www.cs.uoregon.edu\/research\/DistributedComputing\/ProcSimity.html"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Windisch, K., Miller, J., Lo, V.: Procsimity: An experimental tool for processor allocation and scheduling in highly parallel systems. In: Proc. Fifth Symp. on the Frontiers of Massively Parallel Computation, pp. 414\u2013421 (1995)","DOI":"10.1109\/FMPC.1995.380484"},{"key":"16_CR29","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0743-7315(92)90016-G","volume":"16","author":"Y. Zhu","year":"1992","unstructured":"Zhu, Y.: Efficient processor allocation strategies for mesh-connected parallel computers. J. Parallel and Distributed Computing\u00a016, 328\u2013337 (1992)","journal-title":"J. Parallel and Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T12:02:52Z","timestamp":1739966572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11534273_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}