The performance of a distributed system depends upon the efficiency of job distribution among processing nodes, as well as that of its system architecture and operating system. The paper presents an extended C languag...
详细信息
ISBN:
(纸本)0818680679
The performance of a distributed system depends upon the efficiency of job distribution among processing nodes, as well as that of its system architecture and operating system. The paper presents an extended C language, ParaC, that supports efficient parallelprogramming on distributed systems. ParaC is designed to reduce the effort of job distribution on distributed programming environments. Our design includes the description of design goals for the parallel language, the definition of a programming model and the design of ParaC constructs. The paper also addresses the detailed design issues related to translation and finally presents our prototype.
The cyclic debugging approach often fails for parallel programs because parallel programs reveal nondeterministic characteristics due to message race conditions. This paper addresses the execution replay algorithm for...
详细信息
ISBN:
(纸本)0818675330
The cyclic debugging approach often fails for parallel programs because parallel programs reveal nondeterministic characteristics due to message race conditions. This paper addresses the execution replay algorithm for debugging MPI parallel programs. The lexical analyzer identifies the MPI events which affect nondeterministic executions, and then an execution is controlled in order to make it equivalent to a reference execution by keeping their orders of events in two executions identical. The proposed replay system uses the logical time stamping algorithm and the derived data types provided by MPI standard. It also presents the method of how to replay the blocking and nonblocking message passing events. The proposed replay system was applied to the bitonic-merge sort and other parallel programs. We found that re-execution has reproducible behavior and the replay system is useful to find the communication errors.
OMG's (Object Management Group) CORBA (Common Object Request Broker Architecture) is becoming a common platform for distributed computing environment. However, it is yet to address CSCW (Computer Supported Collabo...
详细信息
This paper demonstrates how the demultiplexor is used for making a new tree embedded in a MIN and how the Augmented Generalized Cube Network is designed using this tree. Evaluation of its performance and examination o...
详细信息
ISBN:
(纸本)0818682272
This paper demonstrates how the demultiplexor is used for making a new tree embedded in a MIN and how the Augmented Generalized Cube Network is designed using this tree. Evaluation of its performance and examination of its characteristics are also included. The demultiplexor was originally used for providing tolerance for destination link failures. The above shows that the AGCN gets better performance than other MINs. Not only does the AGCN have all of the Generalized Cube Network's features but it also offers multiple paths using a new embedded tree and intrastage links. Its self-adaptive routing in the last stage can alleviate tree saturation and contribute greatly to performance improvement.
As a parallel system employs more processors to become more complex, it is very hard to understand, evaluate, and tune the system without the aid of the performance information visualization. Many researchers have fou...
详细信息
As a parallel system employs more processors to become more complex, it is very hard to understand, evaluate, and tune the system without the aid of the performance information visualization. Many researchers have found that the criteria of good visualization usually include scalability, multiple views, context and user interaction. In spite of much research in performance visualization of a parallel system, only a few results are available which meet those criteria in an integrated fashion. The paper presents an integrated visualization framework satisfying those criteria for interprocessor communication using 3-D virtual space. The proposed framework is currently applied to a parallel system SPAX (Scalable parallel Architecture computer based on Xcent-net) being developed by the ETRI (Electronics and Telecommunications Research Institute).
OMG's (Object Management Group) CORBA (Common Object Request Broker Architecture) is becoming a common platform for distributed computing environment. However, it is yet to address CSCW (Computer Supported Collabo...
详细信息
OMG's (Object Management Group) CORBA (Common Object Request Broker Architecture) is becoming a common platform for distributed computing environment. However, it is yet to address CSCW (Computer Supported Collaborative Work) ftamework. This paper addresses the problem of building a framework for CSCW and proposes a new CSCW framework based on CORBA (CFC). CFC includes session, participant, mode, directory, stream, media and resource management. A desktop conference system and DSM-CC compliant video-on-demand system were built to demonstrate the usefulness of the framework. The performance of CORBA based CSCW applications is given. The strengths and weaknesses of using a CORBA framework are also discussed.
Vector prefix and reduction are collective communication primitives in which all processors must cooperate. The authors present two parallel algorithms, the direct algorithm and the split algorithm, for vector prefix ...
详细信息
Vector prefix and reduction are collective communication primitives in which all processors must cooperate. The authors present two parallel algorithms, the direct algorithm and the split algorithm, for vector prefix and reduction computation on coarse-grained, distributed-memory parallel machines. The algorithms are relatively architecture independent and can be used effectively in many applications such as pack/unpack, array prefix/reduction functions, and array combining scatter functions, which are defined in Fortran 90 and in High Performance Fortran. Experimental results on the CM-5 are presented.
In this paper, we address the problem of finding a maximum matching for a convex bipartite graph on a mesh-connected computer (MCC). We shall show that this can be done in optimal time on MCC by designing the efficien...
详细信息
暂无评论