Analysis And Transform Of A Parallel Programming Language With Share And Shape Annote

The rapid development of Multi-core or multi-processing architecture has brought drastic changes in the way of software development.In order to get the benefits of architecture, parallel programming and concurrent software design has become more and more important, but parallel programming is still a difficult task.Our group is studying a high-productivity parallel programming language base on shared resource useage declaration, which is based on shared memory model,it differents with the current existing languages,The most important feature is to provide programmers with a high-level abstraction synchornization, the programmer does not need to manage concurrency control, but only need to provide some simple abstract descriptions on shared resources and their usage, and these information can be used by compilers to be capable of generating high-quality codes.Based on the parallel language of our group,this paper focuses on the type of the pointer operating linked data structure,The main contributions of this thesis are listed as follows:1. Design the SPC-II program language foucusing on the pointer typeInvolved in designing a parallel program language SPC-II foucusing on the pointer type based on the SPC-I of our group, by giving the corresponding syntax and semantic.2. Automatic lock allocation on shared mutable data structure with fine-grained lockWe introduce an automatic technique, with the programmer helping give the shape declaration of shared resources, the compiler can analyze the range of shared resources protection, and then automatically insertrument the fine-grained locking code based on the SPC-II.3. Design and implement the translator of SPC-IIOur group has implemented the compiler prototype for SPC-II based on the SUIF compiler framework. The basic idea for this compiler is to transform the SPC-II program to the multithreading C program with the fine grained locking code. This thesis focuses on discussing how to design the key data structures based on the SUIF intermediate representation, and the approach to generating the intermediate representation from high-level SPC-II program and the checker for the translator. Innovation and contribuations in this paper: the code with a single linked list or a double-linked list data structure can be transformed automatically. The generated code with fine-grained are deadlock freedom and high concurrent.