{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:41:18Z","timestamp":1725532878770},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022845"},{"type":"electronic","value":"9783642023033"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02303-3_14","type":"book-chapter","created":{"date-parts":[[2009,5,21]],"date-time":"2009-05-21T00:12:28Z","timestamp":1242864748000},"page":"168-182","source":"Crossref","is-referenced-by-count":2,"title":["Identifying Inter-task Communication in Shared Memory Programming Models"],"prefix":"10.1007","author":[{"given":"Per","family":"Larsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Karlsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Madsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"OpenMP Architecture Review\u00a0Board: OpenMP application program interface, version 3.0. Technical report, OpenMP Archtecture Review Board (2008)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/3-540-44898-5_15","volume-title":"Static Analysis","author":"B. Liblit","year":"2003","unstructured":"Liblit, B., Aiken, A., Yelick, K.A.: Type systems for distributed data sharing. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 273\u2013294. Springer, Heidelberg (2003)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/125826.125925","volume-title":"Proceedings of Supercomputing 1991","author":"D.H. Bailey","year":"1991","unstructured":"Bailey, D.H., et al.: The NAS parallel benchmarks\u2014summary and preliminary results. In: Proceedings of Supercomputing 1991, pp. 158\u2013165. ACM, New York (1991)"},{"key":"14_CR4","unstructured":"Jin, H., Frumkin, M., Yan, H.: NPB-OpenMP 3.0. Technical Report NAS-99-011, NASA Ames Research Center, Moffett Field, CA 94035-1000 (October 1999)"},{"issue":"12","key":"14_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/2.546611","volume":"29","author":"S.V. Adve","year":"1996","unstructured":"Adve, S.V., Gharachorloo, K.: Shared memory consistency models: A tutorial. IEEE Computer\u00a029(12), 66\u201376 (1996)","journal-title":"IEEE Computer"},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/0470121173","volume-title":"Task Scheduling for Parallel Systems","author":"O. Sinnen","year":"2007","unstructured":"Sinnen, O.: Task Scheduling for Parallel Systems. Wiley-Interscience, Hoboken (2007)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-79561-2_10","volume-title":"OpenMP in a New Era of Parallelism","author":"A. Duran","year":"2008","unstructured":"Duran, A., P\u00e9rez, J.M., Ayguad\u00e9, E., Badia, R.M., Labarta, J.: Extending the OpenMP tasking model to allow dependent tasks. In: Eigenmann, R., de Supinski, B.R. (eds.) IWOMP 2008. LNCS, vol.\u00a05004, pp. 111\u2013122. Springer, Heidelberg (2008)"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1145\/291889.291893","volume":"20","author":"M.C. Rinard","year":"1998","unstructured":"Rinard, M.C., Lam, M.S.: The design, implementation, and evaluation of Jade. TOPLAS\u00a020(3), 483\u2013545 (1998)","journal-title":"TOPLAS"},{"issue":"7","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/390013.808479","volume":"5","author":"F.E. Allen","year":"1970","unstructured":"Allen, F.E.: Control flow analysis. SIGPLAN Not.\u00a05(7), 1\u201319 (1970)","journal-title":"SIGPLAN Not."},{"key":"14_CR10","volume-title":"System-Level Design Techniques for Energy-Efficient Embedded Systems","author":"M.T. Schmitz","year":"2004","unstructured":"Schmitz, M.T., Al-Hashimi, B.M., Eles, P.: System-Level Design Techniques for Energy-Efficient Embedded Systems. Kluwer Academic Publishers, Norwell (2004)"},{"key":"14_CR11","unstructured":"Sinnen, O., Sousa, L.: A classification of graph theoretic models for parallel computing. Technical Report RT\/005\/99, Instituto Superior Tecnico, Technical University of Lisbon (1999)"},{"key":"14_CR12","first-page":"480","volume-title":"Proceedings of VLSID 2003","author":"K.S. Vallerio","year":"2003","unstructured":"Vallerio, K.S., Jha, N.K.: Task graph extraction for embedded system synthesis. In: Proceedings of VLSID 2003, p. 480. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"14_CR13","first-page":"46","volume-title":"Proceedings of CODES+ISSS 2006","author":"A.H. Liu","year":"2006","unstructured":"Liu, A.H., Dick, R.P.: Automatic run-time extraction of communication graphs from multithreaded applications. In: Proceedings of CODES+ISSS 2006, pp. 46\u201351. ACM, New York (2006)"},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1145\/17356.17406","volume":"14","author":"M. Dubois","year":"1986","unstructured":"Dubois, M., Scheurich, C., Briggs, F.: Memory access buffering in multiprocessors. SIGARCH Comput. Archit. News\u00a014(2), 434\u2013442 (1986)","journal-title":"SIGARCH Comput. Archit. News"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Gharachorloo, K., et al.: Memory consistency and event ordering in scalable shared-memory multiprocessors. In: Proceedings of ISCA 1990, pp. 15\u201326 (1990)","DOI":"10.1145\/325096.325102"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Emami, M., Ghiya, R., Hendren, L.J.: Context-sensitive interprocedural points-to analysis in the presence of function pointers. In: PLDI 1994, pp. 242\u2013256 (1994)","DOI":"10.1145\/178243.178264"},{"key":"14_CR17","first-page":"54","volume-title":"Proceedings of PASTE 2001","author":"M. Hind","year":"2001","unstructured":"Hind, M.: Analysis: Havent we solved this problem yet. In: Proceedings of PASTE 2001, pp. 54\u201361. ACM, New York (2001)"},{"issue":"5","key":"14_CR18","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1145\/186025.186041","volume":"16","author":"G. Ramalingam","year":"1994","unstructured":"Ramalingam, G.: The undecidability of aliasing. TOPLAS\u00a016(5), 1467\u20131471 (1994)","journal-title":"TOPLAS"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-45574-4_14","volume-title":"Languages and Compilers for Parallel Computing","author":"V.S. Adve","year":"2001","unstructured":"Adve, V.S., Sakellariou, R.: Compiler synthesis of task graphs for parallel program performance prediction. In: Midkiff, S.P., Moreira, J.E., Gupta, M., Chatterjee, S., Ferrante, J., Prins, J.F., Pugh, B., Tseng, C.-W. (eds.) LCPC 2000. LNCS, vol.\u00a02017, pp. 208\u2013226. Springer, Heidelberg (2001)"},{"key":"14_CR20","series-title":"The MPI Core","volume-title":"MPI \u2013 The Complete Reference","author":"M. Snir","year":"1998","unstructured":"Snir, M., et al.: MPI \u2013 The Complete Reference, 2nd edn. The MPI Core, vol.\u00a01. The MIT Press, Cambridge (1998)","edition":"2"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-69303-1_1","volume-title":"A Practical Programming Model for the Multi-Core Era","author":"E. Ayguad\u00e9","year":"2008","unstructured":"Ayguad\u00e9, E., et al.: A proposal for task parallelism in OpenMP. In: Chapman, B., Zheng, W., Gao, G.R., Sato, M., Ayguad\u00e9, E., Wang, D. (eds.) IWOMP 2007. LNCS, vol.\u00a04935, pp. 1\u201312. Springer, Heidelberg (2008)"},{"key":"14_CR22","unstructured":"Asanovic, K., et al.: The landscape of parallel computing research: A view from Berkeley. Technical Report UCB\/EECS-2006-183, EECS Department, University of California, Berkeley (2006)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Rodman, A., Brorsson, M.: Programming effort vs. performance with a hybrid programming model for distributed memory parallel architectures. In: Proceedings of EuroPar 1998, pp. 888\u2013898 (1999)","DOI":"10.1007\/3-540-48311-X_124"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BFb0052217","volume-title":"Network-Based Parallel Computing. Communication, Architecture, and Applications","author":"S. Karlsson","year":"1998","unstructured":"Karlsson, S., Brorsson, M.: A comparative characterization of communication patterns in applications using MPI and shared memory on an IBM SP2. In: Panda, D.K., Stunkel, C.B. (eds.) CANPC 1998. LNCS, vol.\u00a01362, pp. 189\u2013201. Springer, Heidelberg (1998)"},{"issue":"10","key":"14_CR25","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1145\/362759.362813","volume":"14","author":"P.J. Courtois","year":"1971","unstructured":"Courtois, P.J., Heymans, F., Parnas, D.L.: Concurrent control with \u201creaders\u201d and \u201cwriters\u201d. Commun. ACM\u00a014(10), 667\u2013668 (1971)","journal-title":"Commun. ACM"},{"key":"14_CR26","unstructured":"IEEE: IEEE std. 1003.1c-1995 thread extensions. Technical report, IEEE, Formerly POSIX.4a. now included in 1003.1-2004 (1995)"},{"issue":"5","key":"14_CR27","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/563647.563656","volume":"29","author":"J.M. Bull","year":"2001","unstructured":"Bull, J.M., O\u2019Neill, D.: A microbenchmark suite for OpenMP 2.0. SIGARCH Comput. Archit. News\u00a029(5), 41\u201348 (2001)","journal-title":"SIGARCH Comput. Archit. News"},{"key":"14_CR28","unstructured":"McKenney, P.E., Slingwine, J.D.: Read-copy update: Using execution history to solve concurrency problems. In: Proceedings of PDCS 1998, pp. 509\u2013518 (1998)"}],"container-title":["Lecture Notes in Computer Science","Evolving OpenMP in an Age of Extreme Parallelism"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02303-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T03:59:57Z","timestamp":1558324797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02303-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022845","9783642023033"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02303-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}