{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:54:53Z","timestamp":1726412093817},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci China Ser F"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1007\/bf02714571","type":"journal-article","created":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T16:33:29Z","timestamp":1654014809000},"page":"213-225","source":"Crossref","is-referenced-by-count":1,"title":["Task scheduling of parallel programs to optimize communications for cluster of SMPs"],"prefix":"10.1007","volume":"44","author":[{"given":"Weimin","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Bo","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Weijian","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Zhiguang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"BF02714571_CR1","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/2.485843","volume":"29","author":"C. Amza","year":"1996","unstructured":"Amza, C., Cox A. L., Dwarkadas S. et al., Tread marks: shared memory computing on network of workstations, IEEE Computer, 1996, 29 (2):18\u201328.","journal-title":"IEEE Computer"},{"issue":"2","key":"BF02714571_CR2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. W. Kernighan","year":"1970","unstructured":"Kernighan, B. W., Lin, S., An efficient heuristic procedure for partitioning graphs, Bell Syst. Tech. J., 1970, 49(2): 291\u2013307.","journal-title":"Bell Syst. Tech. J."},{"key":"BF02714571_CR3","first-page":"175","volume-title":"Proc. 19th Design Automation Conf.","author":"C. M. Fiduccia","year":"1982","unstructured":"Fiduccia, C. M., Matteyses, R. M., A linear-time heuristic for improving network partitions, in Proc. 19th Design Automation Conf., Piscataway: IEEE Press, 1982, 175\u2013181."},{"issue":"5","key":"BF02714571_CR4","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1109\/TC.1984.1676460","volume":"33","author":"B. Krishnamurthy","year":"1984","unstructured":"Krishnamurthy, B., An improved Min-Cut algorithm for partitioning VLSI networks, IEEE Trans. On Computers, 1984, 33 (5): 438.","journal-title":"IEEE Trans. On Computers"},{"key":"BF02714571_CR5","first-page":"748","volume-title":"Proc of System Integration \u201990","author":"C. H. Lee","year":"1990","unstructured":"Lee, C. H., Kim, M., Park, C. I., An efficient k-way graph partitioning algorithm for task allocation in parallel computing systems, in Proc of System Integration \u201990 (eds. Ng, P. A., Ramamoorthy, C. V., Seifert, L. C.), Piscataway: IEEE Press, 1990, 748\u2013751."},{"key":"BF02714571_CR6","volume-title":"Computational Complexity","author":"C. H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C. H., Computational Complexity, Reading Mass.: Addison-Wesley Publishing Company, 1994."}],"container-title":["Science in China Series F Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02714571.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF02714571\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02714571.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T16:33:34Z","timestamp":1654014814000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF02714571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["BF02714571"],"URL":"https:\/\/doi.org\/10.1007\/bf02714571","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"type":"print","value":"1009-2757"},{"type":"electronic","value":"1862-2836"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}