{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:23:17Z","timestamp":1725560597366},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280095"},{"type":"electronic","value":"9783540318132"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11532378_16","type":"book-chapter","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T19:16:36Z","timestamp":1279653396000},"page":"209-223","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Computation of Communicator Variables for Programs with Unstructured Parallelism"],"prefix":"10.1007","author":[{"given":"Christoph","family":"von Praun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Chen, W.-Y., Krishnamurthy, A., Yelick, K.: Polynomial-time algorithms for enforcing sequential consistency in SPMD programs with arrays. In: Proceedings of the International Workshop on Compilers for Parallel Computing (LCPC 2003) (October 2003)","DOI":"10.1007\/978-3-540-24644-2_22"},{"key":"16_CR2","unstructured":"Choi, J.-D., Loginov, A., Sarkar, V.: Static datarace analysis for multithreaded object-oriented programs. Technical Report RC22146, IBM Research (Auguest 2001)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Fang, X., Lee, J., Midkiff, S.: Automatic fence insertion for shared memory multiprocessing. In: Proceedings of the International Conference on Supercomputing (ICS 2003), June 2003, pp. 285\u2013294 (2003)","DOI":"10.1145\/782814.782854"},{"key":"16_CR4","unstructured":"Java Grande Forum multi-threaded benchmark suite, http:\/\/www.epcc.ed.ac.uk\/javagrande\/"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1006\/jpdc.1996.0136","volume":"38","author":"A. Krishnamurthy","year":"1996","unstructured":"Krishnamurthy, A., Yelick, K.: Analyses and optimizations for shared address space programs. Journal of Parallel and Distributed Computing\u00a038(2), 130\u2013144 (1996)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"16_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-24596-4_31","volume-title":"High Performance Computing - HiPC 2003","author":"M.P. Kurhekar","year":"2003","unstructured":"Kurhekar, M., Barik, R., Kumar, U.: An efficient algorithms for computing delay set in SPMD programs. In: Pinkston, T.M., Prasanna, V.K. (eds.) HiPC 2003. LNCS (LNAI), vol.\u00a02913, pp. 290\u2013299. Springer, Heidelberg (2003)"},{"key":"16_CR7","unstructured":"Midkiff, S., Lee, J., Padua, D.: A compiler for multiple memory models. In: Rec. Workshop Compilers for Parallel Computers (CPC 2001) (June 2001)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Naumovich, G., Avrunin, G., Clarke, L.: An efficient algorithm for computing MHP information for concurrent Java programs. In: Proceedings of the European Software Engineering Conference and Symposium on the Foundations of Software Engineering, Septemper 1999, pp. 338\u2013354 (1999)","DOI":"10.1007\/3-540-48166-4_21"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/130616.130623","volume":"1","author":"R. Netzer","year":"1992","unstructured":"Netzer, R., Miller, B.: What are race conditions? Some issues and formalizations. ACM Letters on Programming Languages and Systems\u00a01(1), 74\u201388 (1992)","journal-title":"ACM Letters on Programming Languages and Systems"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1145\/42190.42277","volume":"10","author":"D. Shasha","year":"1988","unstructured":"Shasha, D., Snir, M.: Efficient and correct execution of parallel programs that share memory. ACM Trans. on Programming Languages and Systems\u00a010(2), 282\u2013312 (1988)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"16_CR11","unstructured":"SPEC JVM98 Benchmarks, http:\/\/www.spec.org\/osg\/jvm98"},{"key":"16_CR12","unstructured":"Sura, Z., Wong, C.-L., Fang, X., Lee, J., Midkiff, S., Padua, D.: Automatic implementation of programming language consistency models. In: Record of the Workshop on Compilers for Parallel Computers (CPC 2003) (January 2003)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"von Praun, C., Gross, T.: Object race detection. In: Proceedings of the Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA 2001), October 2001, pp. 70\u201382 (2001)","DOI":"10.1145\/504282.504288"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"von Praun, C., Gross, T.: Static conflict analysis for multi-threaded object-oriented programs. In: Proceedings of the Conference on Programming Language Design and Implementation (PLDI 2003), June 2003, pp. 115\u2013129 (2003)","DOI":"10.1145\/781131.781145"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for High Performance Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11532378_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T09:52:02Z","timestamp":1559296322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11532378_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280095","9783540318132"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11532378_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}