{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:31:39Z","timestamp":1742394699217,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679561"},{"type":"electronic","value":"9783540445203"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000]]},"DOI":"10.1007\/3-540-44520-x_35","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T03:51:43Z","timestamp":1188359503000},"page":"262-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Exploiting Knowledge of Temporal Behaviour in Parallel Programs for Improving Distributed Mapping"],"prefix":"10.1007","author":[{"given":"Concepci\u00f3","family":"Roig","sequence":"first","affiliation":[]},{"given":"Ana","family":"Ripoll","sequence":"additional","affiliation":[]},{"given":"Miquel A.","family":"Senar","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Guirado","sequence":"additional","affiliation":[]},{"given":"Emilio","family":"Luque","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,18]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Kwok Y-K. and Ahmad I.: Benchmarking the Task Graph Scheduling Algorithms. Proc. 12th. Int\u2019l Parallel Processing Symp., pp. 531\u2013537, Apr. 1998.","DOI":"10.1109\/IPPS.1998.669967"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-8191(90)90115-P","volume":"13","author":"P. Sadayappan","year":"1990","unstructured":"Sadayappan P., Ercal R. and Ramanujam J.: Cluster Partitioning Approaches to Mapping Parallel Programs onto Hypercube. Parallel Computing 13, pp. 1\u201316, 1990.","journal-title":"Parallel Computing"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Roig C., Ripoll A., Senar M. A., Guirado F. and Luque E.: Modelling Message-Passing Programs for Static Mapping. Proc. 8th. Euromicro Workshop on Parallel and Distributed Processing. pp. 229\u2013236 Jan. 2000.","DOI":"10.1109\/EMPDP.2000.823416"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1006\/jpdc.1996.0153","volume":"39","author":"T. Fahringer","year":"1996","unstructured":"Fahringer T.: Compile-Time Estimation of Communication Costs for Data Parallel Programs. J. Parallel and Distributed Computing, vol 39, pp. 46\u201365, 1996.","journal-title":"J. Parallel and Distributed Computing"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Gupta M. and Banerjee P.: Compile-Time Estimation of Communication Costs on Multicomputers. Proc. Sixth Int. Parallel Processing Symp. Mar. 1992.","DOI":"10.21236\/ADA236601"},{"key":"35_CR6","unstructured":"Geist A., Beguelin A., Dongarra J., Jiang W., Manchek R. and Sunderam V.: PVM: Parallel Virtual Machine. A Users\u2019 Guide and Tutorial for Networked Parallel Computing. The MIT Press. Cambridge, Massachusets."},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Hui Ch. and Chanson S.: Allocating Task Interaction Graph to Processors in Heterogeneous Networks. IEEE Trans. on Parallel and Distributed Systems. vol 8, n. 9, pp 908\u2013925 Sep. 1997.","DOI":"10.1109\/71.615437"},{"key":"35_CR8","first-page":"415","volume-title":"Int. Par. Proc Symp&Sym. On Par. Dist. Proc. (IPPS\/SPDP 98)","author":"M. A. Senar","year":"1998","unstructured":"Senar M. A., Ripoll A., Cort\u00e9s A. and Luque E.: Clustering and Reassignment-base Mapping Strategy for Message-Passing Architectures. Int. Par. Proc Symp&Sym. On Par. Dist. Proc. (IPPS\/SPDP 98) 415\u2013421. IEEE CS Press USA, 1998."},{"key":"35_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BFb0031630","volume-title":"High Performance Computing and Networking (HPCN97)","author":"M. A. Senar","year":"1997","unstructured":"Senar M. A., Ripoll A., Cort\u00e9s A. and Luque E.: Performance Comparison of Strategies for Static Mapping of Parallel Programs. High Performance Computing and Networking (HPCN97) Lecture Notes in Computer Science 225, 575\u2013587. Springer. Germay, 1997."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2000 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44520-X_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:35:36Z","timestamp":1737398136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44520-X_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679561","9783540445203"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44520-x_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"18 August 2000","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"}]}}