{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T08:42:30Z","timestamp":1742632950394},"reference-count":40,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0167-8191(93)90081-u","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"1359-1373","source":"Crossref","is-referenced-by-count":7,"title":["Two-stage m-way graph partitioning"],"prefix":"10.1016","volume":"19","author":[{"given":"H.B","family":"Zhou","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(93)90081-U_BIB1","volume":"Vol. 1","author":"Angus","year":"1988"},{"key":"10.1016\/0167-8191(93)90081-U_BIB2","series-title":"Proc. IEEE Internat. Conf. Parallel Processing","article-title":"The LAST algorithm: A heuristic-based static task allocation algorithm","author":"Baxter","year":"1989"},{"issue":"4","key":"10.1016\/0167-8191(93)90081-U_BIB3","article-title":"An algorithm for partitioning the nodes of a graph","volume":"3","author":"Barnes","year":"1982","journal-title":"SIAM J. Algeb. Discr. Math."},{"issue":"3","key":"10.1016\/0167-8191(93)90081-U_BIB4","doi-asserted-by":"crossref","DOI":"10.1137\/0401030","article-title":"A new heuristic for partitioning the nodes of a graph","volume":"1","author":"Barnes","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0167-8191(93)90081-U_BIB5","series-title":"Proc. 25th Ann. IEEE Symp. on Foundations of Computer Science","article-title":"Graph bisection algorithms with good average case behavior","author":"Bui","year":"1984"},{"key":"10.1016\/0167-8191(93)90081-U_BIB6","series-title":"Proc. 26th Design Automation Conf. A","article-title":"Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms","author":"Bui","year":"1989"},{"key":"10.1016\/0167-8191(93)90081-U_BIB7","series-title":"Proc. 28th Ann. Symp. on Foundations of Computer Science, IEEE","article-title":"Eigenvalues and graph bisection: An average case analysis","author":"Boppana","year":"1987"},{"key":"10.1016\/0167-8191(93)90081-U_BIB8","series-title":"Assignment Problems in Parallel and Distributed Computing","author":"Bokhari","year":"1987"},{"key":"10.1016\/0167-8191(93)90081-U_BIB9","first-page":"33","article-title":"Task allocation in a distributed computer system","volume":"82","author":"Doty","year":"1982"},{"key":"10.1016\/0167-8191(93)90081-U_BIB10","series-title":"Proc. Internat. Phoenix Conf. on Computers and Communications","article-title":"Effective algorithms for partitioning distributed programs","author":"Donnett","year":"1988"},{"key":"10.1016\/0167-8191(93)90081-U_BIB11","doi-asserted-by":"crossref","DOI":"10.1109\/MC.1982.1654050","article-title":"Heuristic models of task assignment scheduling in distributed systems","author":"Efe","year":"1982","journal-title":"IEEE Comput."},{"key":"10.1016\/0167-8191(93)90081-U_BIB12","series-title":"Proc. 19th Design Automation Conf. ACM\/IEEE","article-title":"A linear time heuristic for improving network partitions","author":"Fiduccia","year":"1982"},{"key":"10.1016\/0167-8191(93)90081-U_BIB13","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-8191(93)90081-U_BIB14","first-page":"520","article-title":"Finding clusters in VLSI circuits","author":"Garbers","year":"1990"},{"key":"10.1016\/0167-8191(93)90081-U_BIB15","series-title":"Proc. IEEE Internat. Conf. on Computer Design: VLSI in Computers","article-title":"Heuristic improvement technique for bisection of VLSI networks","author":"Goldberg","year":"1983"},{"key":"10.1016\/0167-8191(93)90081-U_BIB16","series-title":"Proc. Compcon Fall","first-page":"353","article-title":"Optimal partitioning of workload for distributed systems","author":"Gylys","year":"1976"},{"key":"10.1016\/0167-8191(93)90081-U_BIB17","series-title":"Optimization by simulated annealing: An experimental evaluation (part I)","author":"Johnson","year":"1985"},{"key":"10.1016\/0167-8191(93)90081-U_BIB18","doi-asserted-by":"crossref","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Syst. Tech. J."},{"issue":"5","key":"10.1016\/0167-8191(93)90081-U_BIB19","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1984.1676460","article-title":"An improved min-cut algorithm for partitioning VLSI networks","volume":"C-33","author":"Krishnamurthy","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90081-U_BIB20","doi-asserted-by":"crossref","DOI":"10.1109\/52.1991","article-title":"Grain size determination for parallel processing","author":"Kruatrachue","year":"1988","journal-title":"IEEE Software"},{"key":"10.1016\/0167-8191(93)90081-U_BIB21","series-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"Lengauer","year":"1990"},{"key":"10.1016\/0167-8191(93)90081-U_BIB22","series-title":"Proc. IEEE 29th Annual Symp. on Foundations of Computer Science","article-title":"An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximate algorithms","author":"Leighton","year":"1988"},{"issue":"2","key":"10.1016\/0167-8191(93)90081-U_BIB23","doi-asserted-by":"crossref","DOI":"10.1137\/0136016","article-title":"A separator theorem for planar graphs","volume":"36","author":"Lipton","year":"1979","journal-title":"SIAM J. Applied Math."},{"key":"10.1016\/0167-8191(93)90081-U_BIB24","series-title":"Proc. 4th Internat. Conf. Distr. Comput. Syst.","first-page":"30","article-title":"Heuristic algotithms for task assignment is distributed systems","author":"Lo","year":"1984"},{"issue":"1","key":"10.1016\/0167-8191(93)90081-U_BIB25","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/MC.1984.1658932","article-title":"A model to solve timing-critical application problems in distributed computer systems","volume":"17","author":"Ma","year":"1984","journal-title":"Computer"},{"issue":"1","key":"10.1016\/0167-8191(93)90081-U_BIB26","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TC.1982.1675884","article-title":"A task allocation model for distributed computing systems","volume":"C-31","author":"Ma","year":"1982","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"10.1016\/0167-8191(93)90081-U_BIB27","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1145\/66451.66454","article-title":"Automatic determination of grain size for efficient parallel processing","volume":"32","author":"McCreary","year":"1989","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0167-8191(93)90081-U_BIB28","doi-asserted-by":"crossref","DOI":"10.1137\/0219018","article-title":"A heuristic algorithm for small separators in arbitrary graphs","volume":"19","author":"Plaisted","year":"1990","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/0167-8191(93)90081-U_BIB29","doi-asserted-by":"crossref","DOI":"10.1137\/0212005","article-title":"Minimum s-t cut of a planar undirected network in O(n log2 (n)) time","volume":"12","author":"Reif","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(93)90081-U_BIB30","series-title":"IEEE 28th Annual Symp. Foundations of Computer Science","article-title":"Finding near optimal separators in planar graphs","author":"Rao","year":"1987"},{"issue":"1","key":"10.1016\/0167-8191(93)90081-U_BIB31","doi-asserted-by":"crossref","DOI":"10.1109\/12.8730","article-title":"Multi-way network partitioning","volume":"38","author":"Sanchis","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90081-U_BIB32","series-title":"Proc. 26th ACM\/IEEE Design Automation Conf.","article-title":"An evolution-based approach to partitioning ASIC systems","author":"Saab","year":"1989"},{"key":"10.1016\/0167-8191(93)90081-U_BIB33","first-page":"421","article-title":"Algorithms","author":"Sedgewick","year":"1988"},{"key":"10.1016\/0167-8191(93)90081-U_BIB34","first-page":"24","article-title":"Partitioning concurrent VLSI simulation programs onto a multiprocessor by simulated annealing","volume":"134","author":"Sheild","year":"1987"},{"issue":"1","key":"10.1016\/0167-8191(93)90081-U_BIB35","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TSE.1977.233840","article-title":"Multiprocessor scheduling with the aid of network flow algorithms","volume":"3","author":"Stone","year":"1977","journal-title":"IEEE Trans. on Software Engrg."},{"issue":"10","key":"10.1016\/0167-8191(93)90081-U_BIB36","doi-asserted-by":"crossref","DOI":"10.1109\/TSE.1986.6313018","article-title":"Allocating programs containing branches and loops within a multiple processor system","volume":"12","author":"Towsley","year":"1986","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0167-8191(93)90081-U_BIB37","series-title":"Proc. 28th ACM\/IEEE Design Automation Conf.","article-title":"A general purpose multiple way partitioning algorithm","author":"Yeh","year":"1991"},{"key":"10.1016\/0167-8191(93)90081-U_BIB38","series-title":"Proc. 2nd Internat. Conf. on Automation, Robotics, and Computer Vision","article-title":"Image processing in a workstation-based distributed system","author":"Zhou","year":"1992"},{"key":"10.1016\/0167-8191(93)90081-U_BIB39","unstructured":"H.B. Zhou, Effective algorithms for distributed program allocation, in preparation."},{"key":"10.1016\/0167-8191(93)90081-U_BIB40","series-title":"Proc. Internat. Conf. on Parallel Processing","first-page":"288","article-title":"Workload scheduling: A new technique for scheduling task graphs with communication costs in parallel systems","author":"Zhu","year":"1991"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390081U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390081U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T09:57:34Z","timestamp":1585130254000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919390081U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":40,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["016781919390081U"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(93)90081-u","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}