{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T05:10:26Z","timestamp":1737263426165,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540426097"},{"type":"electronic","value":"9783540454175"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45417-9_23","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T15:16:41Z","timestamp":1183562201000},"page":"148-157","source":"Crossref","is-referenced-by-count":0,"title":["TOPPER: A Tool for Optimizing the Performance of Parallel Applications"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Konstantinou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nectarios","family":"Koziris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Papakonstantinou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,11]]},"reference":[{"key":"23_CR1","unstructured":"H. Ali et H. El-Rewini. Task Allocation in Distributed Systems: A Split Graph Model. Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 14, pp. 15\u201332, October 1993."},{"key":"23_CR2","unstructured":"H. El-Rewini, T. G. Lewis and H. Ali. Task Scheduling in Parallel and Distributed Systems. Prentice Hall, 1994."},{"issue":"5","key":"23_CR3","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1093\/comjnl\/39.5.439","volume":"39","author":"N. Koziris","year":"1996","unstructured":"N. Koziris, G. Papakonstantinou and P. Tsanakas. Optimal Time and Efficient Space Free Scheduling for Nested Loops. The Computer Journal, vol. 39, no 5, pp 439\u2013448, 1996.","journal-title":"The Computer Journal"},{"key":"23_CR4","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. Toward an Architecture-Independent Analysis of Parallel Algorithms. SIAM J. Comput., vol. 19, pp. 322\u2013328, 1990.","journal-title":"SIAM J. Comput."},{"key":"23_CR5","volume-title":"Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors","author":"V. Sarkar","year":"1989","unstructured":"V. Sarkar. Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. Cambridge, MA: MIT Press, 1989."},{"issue":"6","key":"23_CR6","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 Trans. Parallel Distrib. Syst., vol. 4, no. 6, pp. 686\u2013701, Jan. 1993.","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1145\/143369.143446","volume-title":"Proc 6th Int\u2019l Conf. Supercomputing (ICS92)","author":"T. Yang","year":"1992","unstructured":"T. Yang and A. Gerasoulis. PYRROS: Static Task Scheduling and Code Generation for Message Passing Multiprocessors. Proc 6 th Int\u2019l Conf. Supercomputing (ICS92), ACM Press, New York, N. Y., 1992, pp. 428\u2013437."},{"key":"23_CR8","volume-title":"Thesis","author":"D. Konstantinou","year":"2000","unstructured":"D. Konstantinou and A. Panagiotopoulos, Thesis, Dept. of Electrical Engineering, NTUA, Athens 2000"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01379319","volume":"20","author":"V. Lo","year":"1991","unstructured":"V. Lo, S. Rajopadhye, S. Gupta, D. Keldsen, M. Mohamed, B. Nitzberg, J. Telle and X. Zhong. OREGAMI: Tools for Mapping Parallel Computations to Parallel Architectures. Int\u2019l Journal of Parallel Programming, vol. 20, no. 3, 1991, pp. 237\u2013270.","journal-title":"Int\u2019l Journal of Parallel Programming"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"N. Koziris, M. Romesis, G. Papakonstantinou and P. Tsanakas. An efficient Algorithm for the Physical Mapping of Clustered Task Graphs onto Multiprocessor Architectures, (PDP2000), IEEE Press, pp. 406\u2013413, Rhodes, Greece.","DOI":"10.1109\/EMPDP.2000.823437"},{"key":"23_CR11","unstructured":"J.-C. Liou and Michael. A Palis. A Comparison of General Approaches to Multiprocessor, 11th International Parallel Processing Symposium (IPPS\u201997), Geneva, Switzerland, April 1997, pp. 152\u2013156."}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Parallel Virtual Machine and Message Passing Interface"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45417-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T04:43:31Z","timestamp":1737175411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45417-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540426097","9783540454175"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45417-9_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}