{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:22:04Z","timestamp":1725837724649},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319271217"},{"type":"electronic","value":"9783319271224"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27122-4_28","type":"book-chapter","created":{"date-parts":[[2015,11,16]],"date-time":"2015-11-16T11:27:27Z","timestamp":1447673247000},"page":"406-419","source":"Crossref","is-referenced-by-count":1,"title":["A List Scheduling Algorithm for DAG-Based Parallel Computing Models"],"prefix":"10.1007","author":[{"given":"Hao","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ce","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jizhou","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengmeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,16]]},"reference":[{"key":"28_CR1","volume-title":"Computers and Intractability: A guide to the theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-Completeness. WH Freeman & Co., San Francisco (1979)"},{"issue":"1","key":"28_CR2","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/321796.321808","volume":"21","author":"WH Kohler","year":"1974","unstructured":"Kohler, W.H., Steiglitz, K.: Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems. J. ACM (JACM) 21(1), 140\u2013156 (1974)","journal-title":"J. ACM (JACM)"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Bruno, J., Coffman Jr., E.G., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Commun. ACM 17(7), 382\u2013387 (1974)","DOI":"10.1145\/361011.361064"},{"key":"28_CR4","unstructured":"Gonzalez Jr., Mario, J.: Deterministic processor scheduling. ACM Comput. Surv. (CSUR) 9(3), 173\u2013204 (1977)"},{"issue":"6","key":"28_CR5","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"TC Hu","year":"1961","unstructured":"Hu, T.C.: Parallel sequencing and assembly line problems. Oper. Res. 9(6), 841\u2013848 (1961)","journal-title":"Oper. Res."},{"issue":"1","key":"28_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/0205005","volume":"5","author":"R Sethi","year":"1976","unstructured":"Sethi, R.: Scheduling graphs on two processors. SIAM J. Comput. 5(1), 73\u201382 (1976)","journal-title":"SIAM J. Comput."},{"key":"28_CR7","volume-title":"Introduction to Parallel Computing","author":"A Grama","year":"2003","unstructured":"Grama, A.: Introduction to Parallel Computing. Pearson Education, London (2003)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Roig, C., Ripoll, A., Senar, M.A., et al.: A new model for static mapping of parallel applications with task and data parallelism. In: Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS 2002, Abstracts and CD-ROM, p. 8. IEEE (2001)","DOI":"10.1109\/IPDPS.2002.1015586"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Tang, S., Yu, C., Lee, B.S., et al.: Adaptive data refinement for parallel dynamic programming applications. In: 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), pp. 2220\u20132229 (2012)","DOI":"10.1109\/IPDPSW.2012.274"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/3-540-58822-1_116","volume-title":"Ada in Europe","author":"L Bj\u00f6rnfot","year":"1994","unstructured":"Bj\u00f6rnfot, L., Lundqvist, K., Wall, G., et al.: Distribution of tasks within a centrally scheduled local area network. In: Toussaint, M. (ed.) Ada in Europe. LNCS, vol. 887, pp. 421\u2013432. Springer, Heidelberg (1994)"},{"key":"28_CR11","volume-title":"Clustering Computing","author":"R Buyya","year":"2000","unstructured":"Buyya, R., Paprazycki, M.: Clustering Computing. Prentice Hall, Upper Saddle River (2000)"},{"issue":"4","key":"28_CR12","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/0743-7315(92)90012-C","volume":"16","author":"A Gerasoulis","year":"1992","unstructured":"Gerasoulis, A., Yang, T.: A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors. J. Parallel Distrib. Comput. 16(4), 276\u2013391 (1992)","journal-title":"J. Parallel Distrib. Comput."},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Wang, F., Mok, A., Emerson, E.A.: Formal specification of asynchronous distributed real-time systems by APTL. In: Proceedings of the 14th International Conference on Software Engineering, pp. 188\u2013198. ACM (1992)","DOI":"10.1145\/143062.143113"},{"key":"28_CR14","volume-title":"Parallel and Distributed Computing","author":"H El-Rewini","year":"1999","unstructured":"El-Rewini, H., Lewis, T.G.: Parallel and Distributed Computing. Manning Publications Co., Greenwich (1999)"},{"issue":"2","key":"28_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1109\/71.207593","volume":"4","author":"GC Sih","year":"1993","unstructured":"Sih, G.C., Lee, E.: A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans. Parallel Distrib. Syst. 4(2), 175\u2013187 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"28_CR16","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1137\/0218016","volume":"18","author":"JJ Hwang","year":"1989","unstructured":"Hwang, J.J., Chow, Y.C., Anger, F.D., et al.: Scheduling precedence graphs in systems with interprocessor communication times. SIAM J. Comput. 18(2), 244\u2013257 (1989)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"28_CR17","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/71.80160","volume":"1","author":"MY Wu","year":"1990","unstructured":"Wu, M.Y., Gajski, D.D.: Hypertool: a programming aid for message-passing systems. IEEE Trans. Parallel Distrib. Syst. 1(3), 330\u2013343 (1990)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"28_CR18","volume-title":"Task Scheduling in Parallel and Distributed Systems","author":"H El-Rewini","year":"1994","unstructured":"El-Rewini, H., Lewis, T.G., Ali, H.H.: Task Scheduling in Parallel and Distributed Systems. Prentice-Hall Inc., Upper Saddle River (1994)"},{"issue":"5","key":"28_CR19","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1109\/TPDS.2011.218","volume":"23","author":"S Tang","year":"2012","unstructured":"Tang, S., Yu, C., Sun, J., et al.: EasyPDP: an efficient parallel dynamic programming runtime system for computational biology. IEEE Trans. Parallel Distrib. Syst. 23(5), 862\u2013872 (2012)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Du, J., Yu, C., Sun, J., et al.: EasyHPS: a multilevel hybrid parallel system for dynamic programming. In: 2013 IEEE 27th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), pp. 630\u2013639 (2013)","DOI":"10.1109\/IPDPSW.2013.93"},{"issue":"4","key":"28_CR21","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"YK Kwok","year":"1999","unstructured":"Kwok, Y.K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. 31(4), 406\u2013471 (1999)","journal-title":"ACM Comput. Surv."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27122-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T15:08:49Z","timestamp":1559315329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27122-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319271217","9783319271224"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27122-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}