{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:27:13Z","timestamp":1759134433129,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540611431"},{"type":"electronic","value":"9783540683322"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":[[1996]]},"DOI":"10.1007\/bfb0023061","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T06:32:44Z","timestamp":1132381964000},"page":"174-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Understanding language support for irregular parallelism"],"prefix":"10.1007","author":[{"given":"Mukund","family":"Raghavachari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne","family":"Rogers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"9_CR1","unstructured":"A. Agarwal et al. The MIT Alewife machine. In Proceedings of Workshop on Scalable Shared Memory Multiprocessors, 1991."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"H. Bal and F. Kaashoek. Object distribution in Orca using compile-time and runtime techniques. In OOPSLA, Sept. 1993.","DOI":"10.1145\/165854.165884"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"J. Barnes and P. Hut. A hierarchical O(N log N) force calculation algorithm. Nature, pages 446\u2013449, Dec. 1986.","DOI":"10.1038\/324446a0"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"C. Leiserson et al. The network architecture of the connection machine CM-5. In Symposium on Parallel and Distributed Algorithms, pages 272\u2013285, June 1992.","DOI":"10.1145\/140901.141883"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"M. Carlisle and A. Rogers. Software caching and computation migration in olden. Principles and Practice of Parallel Programming, July 1995.","DOI":"10.1145\/209936.209941"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"R. Chandra, A. Gupta, and J. Hennessy. Data locality and load balancing in COOL. In Principles and Practice of parallel programming, May 1993.","DOI":"10.1145\/155332.155358"},{"key":"9_CR7","volume-title":"Technical Report TR 1291","author":"S. Chandra","year":"1995","unstructured":"S. Chandra, B. Richards, and J. Larus. Teapot: Language support for writing memory coherence protocls. Technical Report TR 1291, Computer Science Department, University of Wisconsin, Madison, WI, Oct. 1995."},{"key":"9_CR8","volume-title":"Technical Report CS-92-01","author":"M. Chandy","year":"1992","unstructured":"M. Chandy and C. Kesselman. A declarative, concurrent object oriented programming notation. Technical Report CS-92-01, California Institute of Technology, Pasadena, Ca, 1992."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"A. Chien, V. Karamcheti, and J. Pleyvak. The concert system \u2014 compiler and runtime support for efficient, fine-grained concurrent object-oriented programs. Technical Report UIUCDCS-R-93-1815, Dept of Computer Science, University of Illinois(UC), 1993.","DOI":"10.2514\/6.1993-4505"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"D. Culler et al. Parallel programming in Split-C. In Proceedings of Supercomputing '93, pages 262\u2013273, Nov. 1993.","DOI":"10.1145\/169627.169724"},{"key":"9_CR11","unstructured":"R. Das, M. Uysal, J. Saltz, and Y.-S. Hwang. Communication optimizations for irregular scientific computations on distributed memory architectures. Technical Report CS-TR-3163, University of Maryland, Oct. 1993."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"B. Falsafi, A. Lebeck, S. Reinhardt, I. Schoinas, M. Hill, J. Larus, A. Rogers, and D. Wood. Application-specific protocols for user-level shared memory. In Proceedings of Supercomputing '94, pages 380\u2013389, Nov. 1994.","DOI":"10.1145\/602770.602838"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Y.-S. Hwang, B. Moon, S. Sharma, R. Ponnuswamy, R. Das, and J. Saltz. Runtime and language support for compiling adaptive irregular programs on distributed memory machines. Software \u2014 Practice and Experience, 25, June 1995.","DOI":"10.1002\/spe.4380250603"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"J. Kuskin et al. The Stanford FLASH multiprocessor. In Proceedings of the 21st Annual International Symposium on Computer Architecture, pages 302\u2013313, Apr. 1994.","DOI":"10.1109\/ISCA.1994.288140"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"M. Blumrich et al. Virtual memory mapped network interface for the SHRIMP multicomputer. In Proceedings of the 21st Annual International Symposium on Computer Architecture, pages 142\u2013153, Apr. 1994.","DOI":"10.1145\/192007.192024"},{"issue":"1","key":"9_CR16","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/103727.103729","volume":"9","author":"J. M. Mellor-Crummey","year":"1991","unstructured":"J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21\u201365, Feb. 1991.","journal-title":"ACM Transactions on Computer Systems"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"R. S. Nikhil. Cid: A parallel, shared-memory C for distributed-memory machines. In Languages and Compilers for Parallel Computing, pages 376\u2013390, Aug. 1994.","DOI":"10.1007\/BFb0025891"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"S. Reinhardt, J. Larus, and D. Wood. Tempest and Typhoon: user-level shared memory. In Proceedings of the 21st Annual International Symposium on Computer Architecture, Apr. 1994.","DOI":"10.1145\/192007.192062"},{"key":"9_CR19","unstructured":"M. Rinard. The design, implementation and evaluation of Jade: a portable, implicitly parallel programming language. PhD thesis, Stanford University, Aug. 1994."},{"key":"9_CR20","unstructured":"E. Rothberg. Exploiting the memory hierarchy in sequential and sparse Cholesky factorization. PhD thesis, Stanford University Department of Computer Science, Jan. 1993."},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"I. Schoinas, B. Falsafi, A. Lebeck, S. Reinhardt, J. Larus, and D. Wood. Fine-grain access control for distributed shared memory. In Conference on Architectural Support for Programming Languages and Operating Systems, pages 297\u2013307, Nov. 1994.","DOI":"10.1145\/195473.195575"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"J. P. Singh, J. L. Hennessy, and A. Gupta. Implications of hierarchical n-body methods for multiprocessor architecture. ACM Transactions on Computer Systems, May 1995.","DOI":"10.1145\/201045.201050"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"J. P. Singh, C. Holt, T. Totsuka, A. Gupta, and J. L. Hennessy. Load balancing and data locality in adaptive hierarchical n-body methods: Barnes-hut, fast multipole, and radiosity. Journal of Parallel and Distributed Computing, June 1995.","DOI":"10.1006\/jpdc.1995.1077"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"T. von Eicken, D. Culler, S. Goldstein, and K. Schauser. Active messages: a mechanism for integrated commmunication and computing. In Proceedings of the International Symposium on Computer Architecture, pages 256\u2013266, May 1992.","DOI":"10.1145\/146628.140382"},{"key":"9_CR25","unstructured":"K. Yelick, S. Chakrabarti, E. Deprit, J. Jones, A. Krishnamurthy, and C.-P. Wen. Parallel data structures for symbolic computation. In Workshop on Parallel Symbolic Languages and Systems, Oct. 1995."}],"container-title":["Lecture Notes in Computer Science","Parallel Symbolic Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T18:54:28Z","timestamp":1736103268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611431","9783540683322"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0023061","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}