{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T13:56:21Z","timestamp":1792072581982,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424956","type":"print"},{"value":"9783540446811","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44681-8_10","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T03:35:09Z","timestamp":1188358509000},"page":"62-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["VizzScheduler - A Framework for the Visualization of Scheduling Algorithms"],"prefix":"10.1007","author":[{"given":"Welf","family":"L\u00f6we","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alex","family":"Liebrich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, T. von Eicken. LogP: Towards a realistic model of parallel computation. In 4\n                           \n                    th\n                  \n                           ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPOPP 93), pp 235\u2013261, 1993.","DOI":"10.1145\/155332.155333"},{"key":"10_CR2","series-title":"Lect Notes Comput Sci","first-page":"602","volume-title":"Europar\u2019 96","author":"J. Eisenbiegler","year":"1996","unstructured":"J. Eisenbiegler, W. L\u00f6we, W. Zimmermann. Optimizing parallel programs on machines with expensive communication. In Europar\u2019 96, LNCS 1124, pp. 602\u2013610. Springer, 1996."},{"key":"10_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, LNCS 854, pp. 253\u2013264. Springer, 1994."},{"key":"10_CR4","unstructured":"Java Debug Architecture: \n                    http:\/\/java.sun.com\/j2se\/1.3\/docs\/guide\/jpda\/index.html\n                    \n                  ."},{"key":"10_CR5","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, pp. 1083\u20131108, 2000.","journal-title":"Parallel Computing"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"R. Karp, A. Sahay, E. Santos, K. Schauser. Optimal broadcast and summation in the LogP model. In 5\n                           \n                    th\n                  \n                           Symp. on Parallel Algorithms and Architectures, pp. 142\u2013153. ACM, 1993.","DOI":"10.1145\/165231.165250"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"SMC-11","author":"K. Sugiyama","year":"1981","unstructured":"K. Sugiyama, S. Tagawa, and M. Toda: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man., Cybern,, SMC-11, pp. 109\u2013125, 1981.","journal-title":"IEEE Trans. Syst. Man., Cybern"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2001 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44681-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:09:15Z","timestamp":1587341355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44681-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424956","9783540446811"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44681-8_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"17 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}