{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:15:30Z","timestamp":1725455730012},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648093"},{"type":"electronic","value":"9783540685333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0018530","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T08:30:21Z","timestamp":1131870621000},"page":"92-103","source":"Crossref","is-referenced-by-count":0,"title":["Tree-based parallel load-balancing methods for solution-adaptive unstructured finite element models on distributed memory multicomputers"],"prefix":"10.1007","author":[{"given":"Ching-Jung","family":"Liao","sequence":"first","affiliation":[]},{"given":"Yeh-Ching","family":"Chung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"9_CR1","volume-title":"Solving Problems on Concurrent Processors, Vol. 2","author":"I.G. Angus","year":"1990","unstructured":"I.G. Angus, G.C. Fox, J.S. Kim, and D.W. Walker, Solving Problems on Concurrent Processors, Vol. 2, N. J.: Prentice-Hall, Englewood Cliffs, 1990."},{"issue":"2","key":"9_CR2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/cpe.4330060203","volume":"6","author":"S.T. Barnard","year":"1994","unstructured":"S.T. Barnard and H.D. Simon, \u201cFast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems,\u201d Concurrency: Practice and Experience, Vol. 6, No. 2, pp. 101\u2013117, Apr. 1994.","journal-title":"Concurrency: Practice and Experience"},{"key":"9_CR3","series-title":"Technical Report","volume-title":"A Processor Oriented Partitioning Method for Mapping Unstructured Finite Element Graphs on SP2 Parallel Machines","author":"Y.C. Chung","year":"1996","unstructured":"Y.C. Chung and C.J. Liao, \u201cA Processor Oriented Partitioning Method for Mapping Unstructured Finite Element Graphs on SP2 Parallel Machines,\u201d Technical Report, Institute of Information Engineering, Feng Chia University, Taichung, Taiwan, Sep. 1996."},{"issue":"2","key":"9_CR4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0743-7315(89)90021-X","volume":"7","author":"G. Cybenko","year":"1989","unstructured":"G. Cybenko, \u201cDynamic Load Balancing for Distributed Memory Multiprocessors,\u201d Journal of Parallel and Distributed Computing, Vol. 7, No. 2, pp. 279\u2013301, Oct. 1989.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0743-7315(90)90004-9","volume":"10","author":"F. Ercal","year":"1990","unstructured":"F. Ercal, J. Ramanujam, and P. Sadayappan, \u201cTask Allocation onto a Hypercube by Recursive Mincut Bipartitioning,\u201d Journal of Parallel and Distributed Computing, Vol. 10, pp. 35\u201344, 1990.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"9_CR6","volume-title":"Computers and Intractability, A Guide to Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"J.R. Gilbert, G.L. Miller, and S.H. Teng, \u201cGeometric Mesh Partitioning: Implementation and Experiments,\u201d Proceedings of 9th International Parallel Processing Symposium, Santa Barbara, California, pp. 418\u2013427, Apr. 1995.","DOI":"10.1109\/IPPS.1995.395965"},{"key":"9_CR8","series-title":"Technical Report SAND94-2692","volume-title":"The Chaco User's Guide: Version 2.0","author":"B. Hendrickson","year":"1994","unstructured":"B. Hendrickson and R. Leland, \u201cThe Chaco User's Guide: Version 2.0,\u201d Technical Report SAND94-2692, Sandia National Laboratories, Albuquerque, NM, Oct. 1994."},{"issue":"2","key":"9_CR9","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0916028","volume":"16","author":"B. Hendrickson","year":"1995","unstructured":"B. Hendrickson and R. Leland, \u201cAn Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations,\u201d SIAM Journal on Scientific Computing, Vol. 16, No.2, pp. 452\u2013469, 1995.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"9_CR10","series-title":"Technical Report 95-064","volume-title":"Multilevel k-way Partitioning Scheme for Irregular Graphs","author":"G. Karypis","year":"1995","unstructured":"G. Karypis and V. Kumar, \u201cMultilevel k-way Partitioning Scheme for Irregular Graphs,\u201d Technical Report 95-064, Department of Computer Science, University of Minnesota, Minneapolis, 1995."},{"issue":"2","key":"9_CR11","first-page":"292","volume":"49","author":"B.W. Kernigham","year":"1970","unstructured":"B.W. Kernigham and S. Lin, \u201cAn Efficient Heuristic Procedure for Partitioning Graphs,\u201d Bell Syst. Tech. J., Vol. 49, No. 2, pp. 292\u2013370, Feb. 1970.","journal-title":"Bell Syst. Tech. J."},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"J.B. Kruskal, \u201cOn the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem,\u201d In Proceeding of the AMS, Vol. 7, pp. 48\u201350, 1956.","journal-title":"Proceeding of the AMS"},{"issue":"8","key":"9_CR13","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1109\/71.605773","volume":"8","author":"C.W. Ou","year":"1997","unstructured":"C.W. Ou and S. Ranka, \u201cParallel Incremental Graph Partitioning,\u201d IEEE Trans. Parallel and Distributed Systems, Vol. 8, No. 8, pp. 884\u2013896, Aug. 1997.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"9_CR14","volume-title":"The PARTY Partitioning \u2014 Library User Guide \u2014 Version 1.1","author":"R. Preis","year":"1996","unstructured":"R. Preis and R. Diekmann, \u201cThe PARTY Partitioning \u2014 Library User Guide \u2014 Version 1.1,\u201d HENIZ NIXDORF INSTITUTE Universit\u00e4t Paderborn, Germany, Sep. 1996."},{"issue":"6","key":"9_CR15","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/71.506702","volume":"7","author":"W. Shu","year":"1996","unstructured":"W. Shu and M.Y. Wu, \u201cRuntime Incremental Parallel Scheduling (RIPS) on Distributed Memory Computers,\u201d IEEE Trans. Parallel and Distributed Systems, Vol. 7, No. 6, pp. 637\u2013649, June 1996.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"2\/3","key":"9_CR16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0956-0521(91)90014-V","volume":"2","author":"H.D. Simon","year":"1991","unstructured":"H.D. Simon, \u201cPartitioning of Unstructured Problems for Parallel Processing,\u201d Computing Systems in Engineering, Vol. 2, No. 2\/3, pp. 135\u2013148, 1991.","journal-title":"Computing Systems in Engineering"},{"issue":"1","key":"9_CR17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/cpe.4330070103","volume":"7","author":"C.H. Walshaw","year":"1995","unstructured":"C.H. Walshaw and M. Berzins, \u201cDynamic Load-Balancing for PDE Solvers on Adaptive Unstructured Meshes,\u201d Concurrency: Practice and Experience, Vol. 7, No. 1, pp. 17\u201328, Feb. 1995.","journal-title":"Concurrency: Practice and Experience"},{"issue":"5","key":"9_CR18","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1002\/cpe.4330030502","volume":"3","author":"R.D. Williams","year":"1991","unstructured":"R.D. Williams, \u201cPerformance of Dynamic Load Balancing Algorithms for Unstructured Mesh Calculations,\u201d Concurrency: Practice and Experience, Vol. 3, No. 5, pp. 457\u2013481, Oct. 1991.","journal-title":"Concurrency: Practice and Experience"},{"key":"9_CR19","unstructured":"R.D. Williams, DIME: Distributed Irregular Mesh Environment, California Institute of Technology, 1990."},{"issue":"2","key":"9_CR20","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/71.577261","volume":"8","author":"M.Y. Wu","year":"1997","unstructured":"M.Y. Wu, \u201cOn Runtime Parallel Scheduling,\u201d IEEE Trans. Parallel and Distributed Systems, Vol. 8, No. 2, pp. 173\u2013186, Feb. 1997.","journal-title":"IEEE Trans. Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Solving Irregularly Structured Problems in Parallel"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0018530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T14:44:12Z","timestamp":1549291452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018530"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648093","9783540685333"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0018530","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}