{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:10:08Z","timestamp":1763467808546},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,9,9]],"date-time":"2007-09-09T00:00:00Z","timestamp":1189296000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s00453-007-9037-2","type":"journal-article","created":{"date-parts":[[2007,9,8]],"date-time":"2007-09-08T11:01:44Z","timestamp":1189249304000},"page":"279-298","source":"Crossref","is-referenced-by-count":32,"title":["Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance"],"prefix":"10.1007","volume":"50","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","published-online":{"date-parts":[[2007,9,9]]},"reference":[{"issue":"5","key":"9037_CR1","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/TC.2007.1028","volume":"56","author":"A. Ahmadinia","year":"2007","unstructured":"Ahmadinia, A., Bobda, C., Fekete, S.P., Teich, J., van der Veen, J.: Optimal free-space management and routing-conscious dynamic placement for reconfigurable computing. IEEE Trans. Comput. 56(5), 673\u2013680 (2007)","journal-title":"IEEE Trans. Comput."},{"key":"9037_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.\u00a011\u201320 (2001)","DOI":"10.1145\/380752.380754"},{"key":"9037_CR3","series-title":"The Kluwer International Series in Engineering and Computer Science","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4613-1401-1_13","volume-title":"Input\/Output in Parallel and Distributed Computer Systems","author":"S. Baylor","year":"1996","unstructured":"Baylor, S., Benveniste, C., Hsu, Y.: Performance evaluation of a massively parallel I\/O subsystem. In: Jain, R., Werth, J., Browne, J. (eds.) Input\/Output in Parallel and Distributed Computer Systems. The Kluwer International Series in Engineering and Computer Science, vol. 362, pp. 293\u2013311. Kluwer Academic, Dordrecht (1996). Chapter 13"},{"key":"9037_CR4","doi-asserted-by":"crossref","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., Fekete, S.: What is the optimal shape of a city?. J.\u00a0Phys.\u00a0A: Math. Gen. 37, 147\u2013159 (2004)","journal-title":"J.\u00a0Phys.\u00a0A: Math. Gen."},{"key":"9037_CR5","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.\u00a0868\u2013875 (1994)","DOI":"10.1109\/IPPS.1994.288204"},{"issue":"2\u20133","key":"9037_CR6","doi-asserted-by":"crossref","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 Comput. 26(2\u20133), 243\u2013266 (2000)","journal-title":"Parallel Comput."},{"issue":"1","key":"9037_CR7","doi-asserted-by":"crossref","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. J.\u00a0Parallel Distrib. Comput. 52(1), 40\u201368 (1998)","journal-title":"J.\u00a0Parallel Distrib. Comput."},{"key":"9037_CR8","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.\u00a0256\u2013263 (1991)","DOI":"10.1109\/ICDCS.1991.148674"},{"key":"9037_CR9","unstructured":"Feitelson, D.: The parallel workloads archive. http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/index.html"},{"key":"9037_CR10","doi-asserted-by":"crossref","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 38, 501\u2013511 (2004)","journal-title":"Algorithmica"},{"key":"9037_CR11","doi-asserted-by":"crossref","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. Discret. Appl. Math. 89, 125\u2013142 (1998). http:\/\/www.math.tau.ac.il\/\u00a0hassin\/cluster.ps.gz","journal-title":"Discret. Appl. Math."},{"key":"9037_CR12","unstructured":"Indyk, P.: A sublinear time approximation scheme for clustering in metric spaces. In: Proc. 40th Ann. IEEE Symp. Found. Comp. Sci. (FOCS), pp.\u00a0154\u2013159 (1999). http:\/\/www.math.tau.ac.il\/~hassin\/cluster.ps.gz"},{"key":"9037_CR13","doi-asserted-by":"crossref","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 J. Comput. 4, 271\u2013286 (1975)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"9037_CR14","doi-asserted-by":"crossref","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. Parallel Distrib. Syst. 5(5), 488\u2013497 (1994)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9037_CR15","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 181, 379\u2013404 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"9037_CR16","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.\u00a0296\u2013304 (2002)","DOI":"10.2172\/800975"},{"key":"9037_CR17","doi-asserted-by":"crossref","unstructured":"Leung, V., Phillips, C., Bender, M., Bunde, D.: Algorithmic support for commodity-based parallel computing systems. Technical Report SAND2003-3702, Sandia National Laboratories (2003)","DOI":"10.2172\/918344"},{"key":"9037_CR18","doi-asserted-by":"crossref","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. J.\u00a0Parallel Distrib. Comput. 12, 79\u201383 (1991)","journal-title":"J.\u00a0Parallel Distrib. Comput."},{"key":"9037_CR19","doi-asserted-by":"crossref","unstructured":"Lo, V., Windisch, K., Liu, W., Nitzberg, B.: Non-contiguous processor allocation algorithms for mesh-connected multicomputers. IEEE Trans. Parallel Distrib. Comput. 8(7) (1997)","DOI":"10.1109\/71.598346"},{"key":"9037_CR20","unstructured":"Mache, J., Lo, V.: Dispersal metrics for non-contiguous processor allocation. Technical Report CIS-TR-96-13, University of Oregon (1996)"},{"key":"9037_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.\u00a0223\u2013226 (1997)"},{"key":"9037_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.\u00a0120\u2013124 (1997)"},{"key":"9037_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.\u00a0268\u2013274 (1996)","DOI":"10.1109\/IPPS.1996.508068"},{"issue":"3","key":"9037_CR24","first-page":"555","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: p-complete approximation problems. J.\u00a0ACM 23(3), 555\u2013565 (1976)","journal-title":"J.\u00a0ACM"},{"key":"9037_CR25","unstructured":"Sandia National Laboratories: The Computational Plant Project. http:\/\/www.cs.sandia.gov\/cplant"},{"key":"9037_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":"9037_CR27","unstructured":"University of Oregon Resource Allocation Group: Procsimity. http:\/\/www.cs.uoregon.edu\/research\/DistributedComputing\/ProcSimity.html"},{"key":"9037_CR28","unstructured":"Weisser, D., Nystrom, N., Vizino, C., Brown, S.T., Urbanic, J.: Optimizing job placement on the Cray XT3. In: CUG 2006 Proceedings (2006)"},{"key":"9037_CR29","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.\u00a0414\u2013421 (1995). ftp:\/\/ftp.cs.uoregon.edu\/pub\/lo\/procsimity.ps.gz"},{"key":"9037_CR30","doi-asserted-by":"crossref","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.\u00a0Parallel Distrib. Comput. 16, 328\u2013337 (1992)","journal-title":"J.\u00a0Parallel Distrib. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9037-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9037-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9037-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:44:59Z","timestamp":1559123099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9037-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,9]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["9037"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9037-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,9]]}}}