{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:20:29Z","timestamp":1726410029812},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642376573"},{"type":"electronic","value":"9783642376580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37658-0_13","type":"book-chapter","created":{"date-parts":[[2013,4,5]],"date-time":"2013-04-05T06:20:22Z","timestamp":1365142822000},"page":"190-204","source":"Crossref","is-referenced-by-count":0,"title":["A Fast Parallel Graph Partitioner for Shared-Memory Inspector\/Executor Strategies"],"prefix":"10.1007","author":[{"given":"Christopher D.","family":"Krieger","sequence":"first","affiliation":[]},{"given":"Michelle Mills","family":"Strout","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1145\/103418.103458","volume-title":"Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, STOC 1991","author":"R.J. Anderson","year":"1991","unstructured":"Anderson, R.J., Woll, H.: Wait-free parallel algorithms for the union-find problem. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, STOC 1991, pp. 370\u2013380. ACM, New York (1991)"},{"key":"13_CR2","unstructured":"I.\u00a0Berman. Multicore programming in the face of metamorphosis: Union-find as an example. Master\u2019s thesis, Tel-Aviv University, July 2010."},{"issue":"6-8","key":"13_CR3","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.parco.2007.12.001","volume":"34","author":"C. Chevalier","year":"2008","unstructured":"Chevalier, C., Pellegrini, F.: PT-Scotch: A tool for efficient parallel graph ordering. Parallel Comput.\u00a034(6-8), 318\u2013331 (2008)","journal-title":"Parallel Comput."},{"issue":"5","key":"13_CR4","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/BF01383882","volume":"17","author":"G. Cybenko","year":"1989","unstructured":"Cybenko, G., Allen, T.G., Polito, J.E.: Practical parallel union-find algorithms for transitive closure and clustering. Int. J. Parallel Program\u00a017(5), 403\u2013423 (1989)","journal-title":"Int. J. Parallel Program"},{"key":"13_CR5","first-page":"21","volume":"10","author":"C.C. Douglas","year":"2000","unstructured":"Douglas, C.C., Hu, J., Kowarschik, M., R\u00fcde, U., Weiss, C.: Cache optimization for structured and unstructured grid multigrid. Electronic Tranactions on Numerical Analysis\u00a010, 21\u201340 (2000)","journal-title":"Electronic Tranactions on Numerical Analysis"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-40889-4_6","volume-title":"Languages, Compilers, and Run-Time Systems for Scalable Computers","author":"H. Han","year":"2000","unstructured":"Han, H., Tseng, C.-W.: A Comparison of Locality Transformations for Irregular Codes. In: Dwarkadas, S. (ed.) LCR 2000. LNCS, vol.\u00a01915, pp. 70\u201384. Springer, Heidelberg (2000)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-45574-4_12","volume-title":"Languages and Compilers for Parallel Computing","author":"H. Han","year":"2001","unstructured":"Han, H., Tseng, C.-W.: Improving Locality for Adaptive Irregular Scientific Codes. In: Midkiff, S.P., Moreira, J.E., Gupta, M., Chatterjee, S., Ferrante, J., Prins, J.F., Pugh, B., Tseng, C.-W. (eds.) LCPC 2000. LNCS, vol.\u00a02017, pp. 173\u2013188. Springer, Heidelberg (2001)"},{"key":"13_CR8","volume-title":"Proceedings of the 1996 ACM\/IEEE Conference on Supercomputing (CDROM), Supercomputing 1996","author":"G. Karypis","year":"1996","unstructured":"Karypis, G., Kumar, V.: Parallel multilevel k-way partitioning scheme for irregular graphs. In: Proceedings of the 1996 ACM\/IEEE Conference on Supercomputing (CDROM), Supercomputing 1996, IEEE Computer Society, Washington, DC (1996)"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput.\u00a020(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Mohiyuddin, M., Hoemmen, M., Demmel, J., Yelick, K.: Minimizing communication in sparse matrix solvers. In: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, SC 2009, pp. 36:1\u201336:12. ACM, New York (2009)","DOI":"10.1145\/1654059.1654096"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/11596110_7","volume-title":"Languages and Compilers for Parallel Computing","author":"M.M. Strout","year":"2005","unstructured":"Strout, M.M., Carter, L., Ferrante, J., Freeman, J., Kreaseck, B.: Combining Performance Aspects of Irregular Gauss-Seidel Via Sparse Tiling. In: Pugh, B., Tseng, C.-W. (eds.) LCPC 2002. LNCS, vol.\u00a02481, pp. 90\u2013110. Springer, Heidelberg (2005)"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1177\/1094342004041294","volume":"18","author":"M.M. Strout","year":"2004","unstructured":"Strout, M.M., Carter, L., Ferrante, J., Kreaseck, B.: Sparse tiling for stationary iterative methods. International Journal of High Performance Computing Applications\u00a018(1), 95\u2013114 (2004)","journal-title":"International Journal of High Performance Computing Applications"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-19595-2_17","volume-title":"Languages and Compilers for Parallel Computing","author":"X. Sui","year":"2011","unstructured":"Sui, X., Nguyen, D., Burtscher, M., Pingali, K.: Parallel Graph Partitioning on Multicore Architectures. In: Cooper, K., Mellor-Crummey, J., Sarkar, V. (eds.) LCPC 2010. LNCS, vol.\u00a06548, pp. 246\u2013260. Springer, Heidelberg (2011)"},{"issue":"12","key":"13_CR14","doi-asserted-by":"publisher","first-page":"1635","DOI":"10.1016\/S0167-8191(00)00046-6","volume":"26","author":"C. Walshaw","year":"2000","unstructured":"Walshaw, C., Cross, M.: Parallel optimisation algorithms for multilevel mesh partitioning. Parallel Comput.\u00a026(12), 1635\u20131660 (2000)","journal-title":"Parallel Comput."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"B.\u00a0Wu, E.\u00a0Z. Zhang, and X.\u00a0Shen. Enhancing data locality for dynamic simulations through asynchronous data transformations and adaptive control. In Proceedings of the 2011 International Conference on Parallel Architectures and Compilation Techniques, PACT 2011, pp. 243\u2013252. IEEE Computer Society, Washington, DC (2011)","DOI":"10.1109\/PACT.2011.56"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37658-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T23:58:16Z","timestamp":1557619096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37658-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642376573","9783642376580"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37658-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}