B. Liblit, A. Aiken, and K. Yelick. Type systems for distributed data sharing. In SAS '03: The 10th International Static Analysis Symposium, Lecture Notes in Computer Science, San Diego, California, June 11--13 2003. SpringerVerlag. 11 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Problems with using MPI 1.1 and 2.0 as compilation targets.. - Bonachea, Duell (Correct)
.... declare data objects to be either shared or private (usage varies by application, but typically the major data structures reside in shared space) In Titanium, by contrast, all heap and static data can potentially be accessed remotely [13] although a sophisticated compiler escape analysis [17] can detect which objects are potentially shared (interesting applications typically have about 50 100 of the total bytes allocated judged to be shared by the analysis) Dynamic allocations of shared memory must be collective in Co Array Fortran, while they can also be achieved in UPC and ....
B. Liblit, A. Aiken, and K. Yelick. Type systems for distributed data sharing. In SAS '03: The 10th International Static Analysis Symposium, Lecture Notes in Computer Science, San Diego, California, June 11--13 2003. SpringerVerlag.
Data Sharing Analysis for Titanium - Liblit, al. (2001) Self-citation (Liblit Aiken Yelick) (Correct)
....time clients. We report on the design of and experience with an implementation of a data sharing analysis for the Titanium programming language. 1 Introduction Sharing analysis describes the ways in which data is (or is not) shared among components of a parallel computing system. Liblit et al. [9] develop a family of data sharing models based on type qualifiers, and show how type inference can automatically identify shared and private data in a small pointer and tuple manipulation language. That work also enumerates a variety of analysis clients which can potentially benefit from static ....
....analysis in the real world. Section 2 briefly introduces the Titanium scientific programming language which we have extended to reflect data sharing. In Section 3 we examine specific Titanium features in greater depth to show how the sharing models and inference strategy used by Liblit et al. [9] map onto a complete, realistic programming language. We consider several analysis and optimization clients in Section 4, and report on the e#ectiveness of sharing analysis in supporting their implementation and deployment. Section 5 concludes. # This research was supported in part by NASA Grant ....
[Article contains additional citation context not shown here]
B. Liblit, A. Aiken, and K. Yelick. Type systems for distributed data sharing. In preparation, Nov. 2001.
Problems with using MPI 1.1 and 2.0 as compilation targets.. - Bonachea, Duell (Correct)
No context found.
B. Liblit, A. Aiken, and K. Yelick. Type systems for distributed data sharing. In SAS '03: The 10th International Static Analysis Symposium, Lecture Notes in Computer Science, San Diego, California, June 11--13 2003. SpringerVerlag. 11
Problems with using MPI 1.1 and 2.0 as compilation targets.. - Bonachea, Duell (Correct)
No context found.
B. Liblit, A. Aiken, and K. Yelick. Type systems for distributed data sharing. In SAS '03: The 10th International Static Analysis Symposium, Lecture Notes in Computer Science, San Diego, California, June 11--13 2003. SpringerVerlag. 11
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC