{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:40:04Z","timestamp":1747615204190,"version":"3.40.5"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319157887"},{"type":"electronic","value":"9783319157894"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15789-4_2","type":"book-chapter","created":{"date-parts":[[2015,2,13]],"date-time":"2015-02-13T10:25:31Z","timestamp":1423823131000},"page":"17-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Real-World Clustering for Task Graphs on Shared Memory Systems"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Herz","sequence":"first","affiliation":[]},{"given":"Chris","family":"Pinkau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,14]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/166962.166982","volume":"21","author":"VS Adve","year":"1993","unstructured":"Adve, V.S., Vernon, M.K.: The influence of random delays on parallel execution times. SIGMETRICS Perfom. Eval. Rev. 21(1), 61\u201373 (1993)","journal-title":"SIGMETRICS Perfom. Eval. Rev."},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/966785.966788","volume":"22","author":"VS Adve","year":"2004","unstructured":"Adve, V.S., Vernon, M.K.: Parallel program performance prediction using deterministic task graph analysis. ACM Trans. Comput. Syst. 22(1), 94\u2013136 (2004)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.jalgor.2005.08.001","volume":"57","author":"MA Bender","year":"2005","unstructured":"Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57(2), 75\u201394 (2005)","journal-title":"J. Algorithms"},{"issue":"5","key":"2_CR4","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/324133.324234","volume":"46","author":"RD Blumofe","year":"1999","unstructured":"Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. J. ACM 46(5), 720\u2013748 (1999)","journal-title":"J. ACM"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"EG Coffman Jr.","year":"1978","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: An application of bin-packing to multiprocessor scheduling. SIAM J. Comput. 7(1), 1\u201317 (1978)","journal-title":"SIAM J. Comput."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Darte, A., Robert, Y.P., Vivien, F.: Scheduling and Automatic Parallelization. Birkh\u00e4user Boston (2000)","DOI":"10.1007\/978-1-4612-1362-8"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Dick, R.P., Rhodes, D.L., Wolf, W.: Tgff: Task graphs for free. In Proceedings of the 6th International Workshop on Hardware\/Software Codesign, pp. 97\u2013101. IEEE Computer Society (1998)","DOI":"10.1145\/278241.278309"},{"issue":"6","key":"2_CR8","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1109\/71.242154","volume":"4","author":"A Gerasoulis","year":"1993","unstructured":"Gerasoulis, A., Yang, T.: On the granularity and clustering of directed acyclic task graphs. IEEE Trans. Parallel Distrib. Syst. 4(6), 686\u2013701 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/71.127258","volume":"3","author":"M Girkar","year":"1992","unstructured":"Girkar, M., Polychronopoulos, C.D.: Automatic extraction of functional parallelism from ordinary programs. IEEE Trans. Parallel Distrib. Syst. 3(2), 166\u2013178 (1992)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"5","key":"2_CR10","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/BF02577777","volume":"22","author":"M Girkar","year":"1994","unstructured":"Girkar, M., Polychronopoulos, C.D.: The hierarchical task graph as a universal intermediate representation. Int. J. Parallel Prog. 22(5), 519\u2013551 (1994)","journal-title":"Int. J. Parallel Prog."},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"2_CR12","unstructured":"Intel. Thread building blocks 4.1 (2013). http:\/\/www.threadingbuildingblocks.org\/"},{"key":"2_CR13","volume-title":"A Numerical Comparative Analysis of Partitioning Heuristics for Scheduling Tak Graphs on Multiprocessors","author":"AA Khan","year":"1993","unstructured":"Khan, A.A., McCreary, C.L., Gong, Y.: A Numerical Comparative Analysis of Partitioning Heuristics for Scheduling Tak Graphs on Multiprocessors. Auburn University, Auburn (1993)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Kwok, Y.-K., Ahmad, I.: Benchmarking the Task Graph Scheduling Algorithms, pp. 531\u2013537 (1998)","DOI":"10.1109\/IPPS.1998.669967"},{"key":"2_CR15","unstructured":"Liou, J.-C., Palis, M.A.: An efficient task clustering heuristic for scheduling dags on multiprocessors. In: Workshop on Resource Management, Symposium on Parallel and Distributed Processing, pp. 152\u2013156. Citeseer (1996)"},{"key":"2_CR16","first-page":"152","volume-title":"A Comparison of General Approaches to Multiprocessor Scheduling","author":"J-C Liou","year":"1997","unstructured":"Liou, J.-C., Palis, M.A.: A Comparison of General Approaches to Multiprocessor Scheduling, pp. 152\u2013156. IEEE Computer Society, Washington, DC (1997)"},{"issue":"5\u20136","key":"2_CR17","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1016\/S0167-8191(98)00037-4","volume":"24","author":"Z Liu","year":"1998","unstructured":"Liu, Z.: Worst-case analysis of scheduling heuristics of parallel systems. Parallel Comput. 24(5\u20136), 863\u2013891 (1998)","journal-title":"Parallel Comput."},{"issue":"9","key":"2_CR18","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1145\/66451.66454","volume":"32","author":"C McCreary","year":"1989","unstructured":"McCreary, C., Gill, H.: Automatic determination of grain size for efficient parallel processing. Commun. ACM 32(9), 1073\u20131078 (1989)","journal-title":"Commun. ACM"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"McCreary, C.L., Khan, A., Thompson, J., McArdle, M.: A comparison of heuristics for scheduling dags on multiprocessors. In: Proceedings on the Eighth International Parallel Processing Symposium, pp. 446\u2013451. IEEE Computer Society (1994)","DOI":"10.1109\/IPPS.1994.288264"},{"key":"2_CR20","first-page":"408","volume-title":"Power-aware Scheduling of Conditional Task Graphs in Real-time Multiprocessor Systems","author":"D Shin","year":"2003","unstructured":"Shin, D., Kim, J.: Power-aware Scheduling of Conditional Task Graphs in Real-time Multiprocessor Systems, pp. 408\u2013413. ACM, New York (2003)"},{"key":"2_CR21","unstructured":"Indiana University. Open mpi 1(4), 5 (2013). http:\/\/www.open-mpi.org\/"},{"issue":"9","key":"2_CR22","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1109\/71.308533","volume":"5","author":"T Yang","year":"1994","unstructured":"Yang, T., Gerasoulis, A.: Dsc: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans. Parallel Distrib. Syst. 5(9), 951\u2013967 (1994)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15789-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:21:35Z","timestamp":1747614095000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15789-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319157887","9783319157894"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15789-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"14 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}