{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T23:20:20Z","timestamp":1756682420043,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319436586"},{"type":"electronic","value":"9783319436593"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-43659-3_11","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T02:54:01Z","timestamp":1470624841000},"page":"146-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Penalized Graph Partitioning for Static and Dynamic Load Balancing"],"prefix":"10.1007","author":[{"given":"Tim","family":"Kiefer","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Habich","sequence":"additional","affiliation":[]},{"given":"Wolfgang","family":"Lehner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"unstructured":"Amazon. Amazon Relational Database Service (2015)","key":"11_CR1"},{"volume-title":"Graph Partitioning","year":"2011","unstructured":"Bichot, C.-E., Siarry, P. (eds.): Graph Partitioning. Wiley, Hoboken (2011)","key":"11_CR2"},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/1880018.1880019","volume":"28","author":"S Blagodurov","year":"2010","unstructured":"Blagodurov, S., Zhuravlev, S., Fedorova, A.: Contention-aware scheduling on multicore systems. ACM Trans. Comput. Syst. 28(4), 8 (2010)","journal-title":"ACM Trans. Comput. Syst."},{"unstructured":"Bulu\u00e7, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent Advances in Graph Partitioning. preprint: Computing Research Repository (2013)","key":"11_CR4"},{"doi-asserted-by":"crossref","unstructured":"Catalyurek, U.V., et al.: Hypergraph-based dynamic load balancing for adaptive scientific computations. In: IPDPS (2007)","key":"11_CR5","DOI":"10.1109\/IPDPS.2007.370258"},{"doi-asserted-by":"crossref","unstructured":"Curino, C., Jones, E.P.C., Zhang, Y., Madden, S.: Schism: a workload-driven approach to database replication and partitioning. In: VLDB (2010)","key":"11_CR6","DOI":"10.14778\/1920841.1920853"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.apnum.2004.08.028","volume":"52","author":"KD Devine","year":"2005","unstructured":"Devine, K.D., Boman, E.G., Heaphy, R.T., Hendrickson, B.A.: New challenges in dynamic load balancing. Appl. Numer. Math. 52, 133\u2013152 (2005)","journal-title":"Appl. Numer. Math."},{"doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: DAC (1982)","key":"11_CR8","DOI":"10.1145\/800263.809204"},{"doi-asserted-by":"crossref","unstructured":"Golab, L., Hadjieleftheriou, M., Karloff, H., Saha, B.: Distributed data placement to minimize communication costs via graph partitioning. In: SSDBM (2014)","key":"11_CR9","DOI":"10.1145\/2618243.2618258"},{"issue":"12","key":"11_CR10","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/S0167-8191(00)00048-X","volume":"26","author":"B Hendrickson","year":"2000","unstructured":"Hendrickson, B., Kolda, T.G.: Graph partitioning models for parallel computing. Parallel Comput. 26(12), 1519\u20131534 (2000)","journal-title":"Parallel Comput."},{"doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R., Van Driessche, R.: Enhancing data locality by using terminal propagation. In: HICSS (1996)","key":"11_CR11","DOI":"10.1109\/HICSS.1996.495507"},{"unstructured":"Hyafil, L., Rivest, R.L.: Graph Partitioning and Constructing Optimal Decision Trees are Polynomial Complete Problems. Technical report, IRIA (1973)","key":"11_CR12"},{"doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Analysis of multilevel graph partitioning. In: SC (1995)","key":"11_CR13","DOI":"10.1145\/224170.224229"},{"doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Multilevel Algorithms for Multi-Constraint Graph Partitioning. Technical report, University of Minnesota (1998)","key":"11_CR14","DOI":"10.1109\/SC.1998.10018"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jpdc.1997.1403","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48(1), 71\u201395 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"unstructured":"Kissinger, T., et al.: ERIS: a NUMA-aware in-memory storage engine for analytical workloads. In: ADMS (2014)","key":"11_CR17"},{"doi-asserted-by":"crossref","unstructured":"Li, C., Ding, C., Shen, K.: Quantifying the cost of context switch. In: ExpCS (2007)","key":"11_CR18","DOI":"10.1145\/1281700.1281702"},{"unstructured":"Microsoft. Microsoft Windows Azure (2015)","key":"11_CR19"},{"doi-asserted-by":"crossref","unstructured":"Pandis, I., Johnson, R., Hardavellas, N., Ailamaki, A.: Data-oriented transaction execution. In: VLDB (2010)","key":"11_CR20","DOI":"10.1145\/1989323.1989463"},{"unstructured":"Pellegrini, F.: Static mapping by dual recursive bipartitioning of process and architecture graphs. In: SHPCC (1994)","key":"11_CR21"},{"doi-asserted-by":"crossref","unstructured":"Pothen, A.: Graph Partitioning Algorithms with Applications to Scientific Computing. Technical report, Old Dominion University (1997)","key":"11_CR22","DOI":"10.1007\/978-94-011-5412-3_12"},{"doi-asserted-by":"crossref","unstructured":"Quamar, A., Kumar, K.A., Deshpande, A.: SWORD: scalable workload-aware data placement for transactional workloads. In: EDBT (2013)","key":"11_CR23","DOI":"10.1145\/2452376.2452427"},{"doi-asserted-by":"crossref","unstructured":"Schaffner, J., et al.: RTP: Robust tenant placement for elastic in-memory database clusters. In: SIGMOD (2013)","key":"11_CR24","DOI":"10.1145\/2463676.2465302"},{"doi-asserted-by":"crossref","unstructured":"Schloegel, K., Karypis, G., Kumar, V.: Graph partitioning for dynamic. adaptive and multi-phase scientific simulations. In: CLUSTER (2001)","key":"11_CR25","DOI":"10.1142\/9781860949630_0004"},{"issue":"2","key":"11_CR26","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/B:JOGO.0000042115.44455.f3","volume":"29","author":"AJ Soper","year":"2004","unstructured":"Soper, A.J., Walshaw, C., Cross, M.: A combined evolutionary search and multilevel optimisation approach to graph-partitioning. J. Global Optim. 29(2), 225\u2013241 (2004)","journal-title":"J. Global Optim."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2016: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-43659-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T00:03:37Z","timestamp":1596931417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-43659-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319436586","9783319436593"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43659-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/europar2016.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}