Base Three Architecture, Parallel Computing Mechanism

Chip Multi-Processors (CMP) has become one of the most important methods to improve the performance of the computer. The CMP-based parallel computing is a hot-spot issue, and is also a difficult issue that all of the programmers should face. The issue is relevant to how to utilize the emerging huge and diversified CMP computing resources, and how to help programmers to design parallel applications based on CMP. Triplet-Based Architecture(Triplet-Based Architecture, TriBA) is an object-oriented CMP architecture. Many of those problems are also existed in TriBA. This dissertation deeply researches and discusses some key technologies relavant to parallel computing in TriBA, which include researches on"aid tools for parallel programming design based on CMP"and"parallel data stream scheduling and data transferring in CMPs based on Network-on-Chip (NoC)". The brief research content and achievement in this dissertation is:1. An aid tool for parallel programming design based on CMP is proposed, which is called FPPF (Feedback Parallel Programming Framework). The main idea of FPPF is to help the programmer think in a low level during the course of programming, which can be convenient for the programmers to learn some hardware features, to choose more proper solutions, to develop parallel programs that fit to specific CMP architecture, and eventually improve the performance of the program. FPPF is composed of many components. Several architectures and corresponding algorithms are stored in FPPF as patterns. Programmers can combine, modify or create these patterns to configure their solutions, which are evaluated and compared by FPPF to find a better one for programmers to continue their further design. The course avoid the burdon of repeatly reversing, debugging and verificating. Besides, some existing tools can also be added into FPPF as components or modules.2. The ergodic property of NoC topology in TriBA is proved, including Hamilton route and the minimal spanning tree. The concept of Streaming Model is defined, and TriBA's streaming models are constructed. In SPPF, streaming model can be used to construct the User Interface component. It can not only help programmers to know the topology features of specific architecture, but also can be used to deal with top level program design and to schedule the parallel data streams.3. HPCM (Hierarchy Parallel Computing Model), which is a method to describe parallel architectures, is proposed. HPCM is a self-nesting description of hierarchy parallel architectures. It can describe parallel architectures and their running patterns in several granularities. The method of evaluating parallel solutions based on HPCM with different granularities is also introduced. HPCM and its evaluation method can be utilized to construct the architecture pattern library and the static evaluating engine in FPPF.4. The method of designing a key component (Concurrent Multi-direction Data Switch Structure, CMDSS) for transferring parallel data is proposed. The method is called GSS (Graph State Select). GSS can utilize topology features of NoC to extract basic states of CMDSS. A control and schedule algorithm called FG-NC is also introduced and implemented. FG-NC transform the states found by GSS into control codes, thus improving the parallelism of CMDSS. The InterUnit in TriBA is re-designed using GSS, and the new InterUnit efficiently support parallel data transfers with unicast, groupcast and broadcast types.5. Methods that utilize the features of architecture topology to compute the weights on every edge are proposed. These methods are called SSTF (Stream Schedule based on Topology Features). SSTF mainly includes Divide and Select methods. Divide methods are suitable for the architecture with little load. When there is more load, Select method can be used to assist Divde method to complete the data stream scheduling. The use of SSTF in Triplet-based Interconnection Networks (THIN) is taken as an example. The topology weight of THIN is computed, and the situations that Divide method with and without transfer latency are also be analysed.