{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:01:50Z","timestamp":1742385710294},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422938"},{"type":"electronic","value":"9783540482284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48228-8_28","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T17:00:36Z","timestamp":1265734836000},"page":"273-282","source":"Crossref","is-referenced-by-count":2,"title":["Source Code and Task Graphs in Program Optimization"],"prefix":"10.1007","author":[{"given":"Welf","family":"L\u00f6we","sequence":"first","affiliation":[]},{"given":"Wolf","family":"Zimmermann","sequence":"additional","affiliation":[]},{"given":"Sven","family":"Dickert","sequence":"additional","affiliation":[]},{"given":"J\u00f6rn","family":"Eisenbiegler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,12]]},"reference":[{"key":"28_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Optimal orthogonal tiling","author":"R. Andonov","year":"1998","unstructured":"R. Andonov, S. Rajopadhye, and N. Yanev. Optimal orthogonal tiling. Lecture Notes in Computer Science, 1470, 1998."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP 93), pp 1\u201312, 1993. SIGPLAN Notices (28) 7.","DOI":"10.1145\/155332.155333"},{"key":"28_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/3-540-58430-7_23","volume-title":"Parallel Processing: CONPAR 94-VAPP VI","author":"B. Martino Di","year":"1994","unstructured":"B. Di Martino and G. Ianello. Parallelization of non-simultaneous iterative methods for systems of linear equations. In Parallel Processing: CONPAR 94-VAPP VI, volume 854 of Lecture Notes in Computer Science, pp 253\u2013264. Springer, 1994."},{"issue":"5","key":"28_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01407835","volume":"21","author":"P. Feautrier","year":"1992","unstructured":"P. Feautrier. Some efficient solutions to the affine scheduling problem. I. one dimensional time. International Journal of Parallel Programming, 21(5):313\u2013347, October 1992.","journal-title":"International Journal of Parallel Programming"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1109\/71.242154","volume":"4","author":"A. Gerasoulis","year":"1993","unstructured":"A. Gerasoulis and T. Yang. On the granularity and clustering of directed acyclic task graphs. IEEE Transactions on Parallel and Distributed Systems, 4:686\u2013701, June 1993.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0167-6377(94)90024-8","volume":"16","author":"J.A. Hoogreven","year":"1994","unstructured":"J.A. Hoogreven, J.K. Lenstra, and B. Veltmann. Three, four, five, six or the complexity of scheduling with communication delays. Operations Research Letters, 16:129\u2013137, 1994.","journal-title":"Operations Research Letters"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/inco.1993.1041","volume":"105","author":"H. Jung","year":"1993","unstructured":"H. Jung, L.M. Kirousis, and P. Spirakis. Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays. Information and Computation, 105:94\u2013104, 1993.","journal-title":"Information and Computation"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"I. Kort and D. Trystram. Scheduling fork graphs under logp with an unbounded number of processors. In Europar\u2019 98, pp 940\u2013943, 1998.","DOI":"10.1007\/BFb0057951"},{"issue":"9","key":"28_CR9","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1016\/S0167-8191(00)00030-2","volume":"26","author":"W. L\u00f6we","year":"2000","unstructured":"W. L\u00f6we and W. Zimmermann. Scheduling balanced task-graphs to logp-machines. Parallel Computing, 26(9):1083\u20131108, 2000.","journal-title":"Parallel Computing"},{"issue":"2","key":"28_CR10","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1137\/0219021","volume":"19","author":"C.H. Papadimitriou","year":"1990","unstructured":"C.H. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing, 19(2):322\u2013328, 1990.","journal-title":"SIAM Journal on Computing"},{"key":"28_CR11","first-page":"186","volume":"II","author":"J. Siddhiwala","year":"1995","unstructured":"J. Siddhiwala and L.-F. Cha. Path-based task replication for scheduling with communication cost. In Proceedings of the International Conference on Parallel Processing, volume II, pp 186\u2013190, 1995.","journal-title":"Proceedings of the International Conference on Parallel Processing"},{"issue":"9","key":"28_CR12","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1016\/S0167-8191(00)00029-6","volume":"26","author":"J. Verriet","year":"2000","unstructured":"J. Verriet. Scheduling out-trees of height 1 in the LogP-Model Parallel Computing, 26(9):1065\u20131082, 2000.","journal-title":"Parallel Computing"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"M. Wolfe. More iteration space tiling. In ACM, editor, Proceedings, Supercomputing\u2019 89: November 13\u201317, 1989, Reno, Nevada, pp 655\u2013664, New York, NY 10036, USA, 1989. ACM Press.","DOI":"10.1145\/76263.76337"},{"key":"28_CR14","unstructured":"Michael Wolfe. Iteration space tiling for memory hierarchies. In Gary Rodrigue, editor, Proceedings of the 3rd Conference on Parallel Processing for Scientific Computing, pp 357\u2013361, Philadelphia, PA, USA, December 1989. SIAM Publishers."},{"key":"28_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-58430-7_25","volume-title":"Parallel Processing: CONPAR 94-VAPP VI","author":"W. Zimmermann","year":"1994","unstructured":"W. Zimmermann and W. L\u00f6we. An approach to machine-independent parallel programming. In Parallel Processing: CONPAR 94-VAPP VI, volume 854 of Lecture Notes in Computer Science, pages 277\u2013288. Springer, 1994."}],"container-title":["Lecture Notes in Computer Science","High-Performance Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48228-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T16:29:10Z","timestamp":1551025750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48228-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422938","9783540482284"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48228-8_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}