{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:54:15Z","timestamp":1743101655288,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664437"},{"type":"electronic","value":"9783540483113"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","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":[[1999]]},"DOI":"10.1007\/3-540-48311-x_118","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:16:48Z","timestamp":1269897408000},"page":"833-844","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Exploiting Advanced Task Parallelism in High Performance Fortran via a Task Library"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Brandes","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,8,6]]},"reference":[{"key":"118_CR1","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1038\/324446a0","volume":"324","author":"J. Barnes","year":"1986","unstructured":"J. Barnes and P. Hut. A hierarchical O(NlogN) force calculation algorithm. Nature 4, 324:446\u2013449, 1986.","journal-title":"Nature 4"},{"key":"118_CR2","unstructured":"T. Brandes. Implementation and Evaluation of Nested Task and Data Parallelism for High Performance Fortran within the ADAPTOR Compilation System. Working paper (unpublished), GMD, 1998. available via anonymous ftp as ftp:\/\/gmd.de:\/GMD\/adaptor\/docs\/tasking.ps ."},{"key":"118_CR3","doi-asserted-by":"crossref","unstructured":"T. Brandes and F. Zimmermann. ADAPTOR-A Transformation Tool for HPF Programs. In K. Decker and R. Rehmann, editors, Programming Environments for Massively Parallel Distributed Systems, pages 91\u201396. Birkh\u00e4user Verlag, Apr. 1994.","DOI":"10.1007\/978-3-0348-8534-8_9"},{"issue":"4","key":"118_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1155\/1997\/632908","volume":"6","author":"B. Chapman","year":"1997","unstructured":"B. Chapman, M. Haines, P. Mehrotra, H. Zima, and J. Van Rosendale. Opus: A Coordination Language for Multidisciplinary Applications. Scientific Programming, 6(4): 345\u2013361, 1997.","journal-title":"Scientific Programming"},{"key":"118_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"J.W. Cooley","year":"1965","unstructured":"J.W. Cooley and J.W. Tukey. An Algorithm for the machine calculation of complex Fourier series. Mathematical Computing, 19:297\u2013301, 1965.","journal-title":"Mathematical Computing"},{"key":"118_CR6","unstructured":"P. Dinda, T. Gross, D. O\u2019Hallaron, E. Segall, E. Stichnoth, J. Subhlok, J. Webb, and B. Yang. The CMU Task Parallel Program Suite. Technical Report CMUCS-94-131, School of Computer Science, Carnegie Mellon University, Mar. 1994."},{"key":"118_CR7","doi-asserted-by":"crossref","unstructured":"I. Foster, D. Kohr, K.R., and A. Choudhary. Double Standards: Bringing Task Parallelism to HPF via the Message Passing Interface. In P. Pittsburgh, editor, Supercomputing\u2019 96, Nov. 1996.","DOI":"10.1145\/369028.369104"},{"key":"118_CR8","series-title":"Scientific and Engineering Computation Series","volume-title":"Using MPI: Portable Parallel Programming with the Message-Passing Interface","author":"W. Groop","year":"1994","unstructured":"W. Groop, E. Lusk, and A. Skjellum. Using MPI: Portable Parallel Programming with the Message-Passing Interface. Scientific and Engineering Computation Series. The MIT Press, Cambridge, MA, 1994."},{"issue":"2","key":"118_CR9","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/M-PDT.1994.329791","volume":"2","author":"T. Gross","year":"1994","unstructured":"T. Gross, D. O\u2019Hallaron, and J. Subhlok. Task Parallelism in a High Performance Fortran Framework. IEEE Parallel and Distributed Technology, 2(2):16\u201326, 1994.","journal-title":"IEEE Parallel and Distributed Technology"},{"key":"118_CR10","unstructured":"High Performance Fortran Forum. High Performance Fortran Language Specification. Version 2.0, Department of Computer Science, Rice University, Jan. 1997."},{"key":"118_CR11","unstructured":"S. Orlando and R. Perego. COLTHPF, a Coordination Layer for HPF Tasks. Technical Report Series on Computer Science CS-98-4, Universita ca\u2019 Foscari di Venezia, Mar. 1998. Paper submitted to Concurrency: Practice and Experience."},{"key":"118_CR12","doi-asserted-by":"crossref","unstructured":"S. Ramaswamy and P. Banerjee. Automatic Generation of Efficient Array Redistribution Routines for Distributed Memory Multicomputers. In Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computations (FRONTIERS\u201995), pages 342\u2013394, Feb. 1995.","DOI":"10.1109\/FMPC.1995.380436"},{"issue":"11","key":"118_CR13","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/71.642945","volume":"8","author":"S. Ramaswamy","year":"1997","unstructured":"S. Ramaswamy, S. Spatnekar, and P. Banerjee. A Framework for Exploiting Task and Data Parallelism on Distributed Memory Multicomputers. IEEE Transaction on Parallel and Distributed Systems, 8(11):1098\u20131116, Nov. 1997.","journal-title":"IEEE Transaction on Parallel and Distributed Systems"},{"key":"118_CR14","doi-asserted-by":"crossref","unstructured":"J. Subhlok and B. Yang. A New Model for Integrated Nested Task and Data Parallel Programming. In PPOPP 97, 1997.","DOI":"10.1145\/263764.263768"}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201999 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48311-X_118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T19:23:07Z","timestamp":1739992987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48311-X_118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664437","9783540483113"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48311-x_118","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"6 August 1999","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"}]}}