We have shown how graphical languages such as CODE/ROPE and PPSE can be used to design SIMD or data parallel programs. The advantages of this approach are machine independence, design clarity, automated program analys...
详细信息
Task Grapher is a tool for studying optimal parallel program task scheduling on arbitrarily intercor iected parallel processors. Given a parallel program represented as a precedence-constrained task graph, and an inte...
详细信息
A top-level view of the architecture of the Parallel Programming Support Environment (PPSE), which is an experimental set of tools for use in the design and implementation of software systems for parallel computing sy...
详细信息
A top-level view of the architecture of the Parallel Programming Support Environment (PPSE), which is an experimental set of tools for use in the design and implementation of software systems for parallel computing systems, is proposed. The tools include a graphical design editor, a graphical target machine description system, a task mapper/scheduler tool, parallel code generator, and graphical aids for performance analysis. The objective is, to the extent possible, to design and develop parallel software with little regard for the details of the architecture of the target machine, programming language, or parallel computing paradigm that the program is to use. A prototype of the environment running on the Macintosh was developed. It was used to parallelize a small image-processing application and several simple programs.< >
We propose a new strategy to recognize the maximum subcube in an n-cube multiprocessor. This subcube recognition algorithm can be done in both serial and parallel and analyzed. This strategy will enhance the performan...
ISBN:
(纸本)0897913418
We propose a new strategy to recognize the maximum subcube in an n-cube multiprocessor. This subcube recognition algorithm can be done in both serial and parallel and analyzed. This strategy will enhance the performance drastically so that our algorithm will outperform the buddy system by a factor nCk, the gray strategy by nCk/2 and Al-Dhelaan [8] by nCk/(k(n-k)+1) in cube recognition. We present a very efficient processor allocation strategy which makes larger contiguous spaces for the new coming job than buddy, gray strategy and Al-Dhelaan [8] do. Furthermore, this new strategy is suitable for static as well as dynamic processors allocation and it results in a less fragmentation and higher fault tolerance. Also we describe an efficient procedure for task migration under the new strategy: 1) goal configuration under the new strategy 2) node-mapping between source and destination node 3) the shortest deadlock-free routing algorithm.
A description is given of two known strategies for static-processor allocation in an n-cube multiprocessor, namely, the buddy-system strategy and the gray-code strategy. A strategy is proposed that outperforms the fir...
详细信息
A description is given of two known strategies for static-processor allocation in an n-cube multiprocessor, namely, the buddy-system strategy and the gray-code strategy. A strategy is proposed that outperforms the first by (n-k+1) and the second by (n-k+1)/2 in a cube recognition. The authors' strategy is suitable for static as well as dynamic processor allocation, and it results in less system fragmentation, more subcube recognition, and higher fault tolerance. The authors also introduce an extension to their strategy that will enhance the performance drastically so that their algorithm together with the extension will outperform the buddy system by a factor of (k(n-k)+1) and the gray strategy by (k(n-k)+1)/2 in cube recognition. The implementation details for these algorithms are described.< >
The cube-connected cycles network is discussed as a cube whose 2k vertices are cycles of k nodes each. It is suitable for realization for VLSI since it satisfies the properties of degree boundedness of nodes (=3). Bro...
详细信息
The cube-connected cycles network is discussed as a cube whose 2k vertices are cycles of k nodes each. It is suitable for realization for VLSI since it satisfies the properties of degree boundedness of nodes (=3). Broadcasting is a procedure by which a processor can pass a message to all other processors in the network nonredundantly. This is extremely important for diagnosis of the network, distribution agreement or clock synchronization. A simple yet efficient algorithm is developed for broadcasting in the cube-connected cycles network. Another broadcasting algorithm for the cube-connected cycles network in the presence of some faulty processors is also developed.< >
暂无评论