journal article
LitStream Collection
Home
doi: 10.1002/cpe.4330030102pmid: N/A
A new parallel sorting algorithm, called parsort, suitable for implementation on tightly coupled multiprocessors is presented. The algorithm is based upon quicksort and two‐way merging. An asynchronous parallel partitioning algorithm is used to distribute work evenly during merging to ensure a good load balance amongst processors, which is crucial if we are to achieve high efficiency. The implementation of this parallel sorting algorithm exhibits theoretical and measured near linear speed‐up when compared to sequential quicksort. This is illustrated by the results of experiments carried out on the Sequent Balance 8000 multiprocessor.
doi: 10.1002/cpe.4330030103pmid: N/A
An exception handling system for a language defined as a CSP/OCCAM‐based extension of C++ is presented. This language is part of a project we are developing which aims at constructing a high level programming environment for transputer‐based multiprocessors. In this proposal, the replacement model of Yemini and Berry (1985) is considered, parallelism and exception handling are closely combined, making process pre‐emption available but raising problems of atomicity and non‐determinism. These problems are discussed, a solution is suggested and an efficient implementation we have carried out is presented.
Wang, Han; Dew, Peter M.; Webb, Jon A.
doi: 10.1002/cpe.4330030104pmid: N/A
Apply is a machine‐independent, low‐level image processing language for expressing local window operations. It has two main advantages: (1) it significantly reduces the programming effort, and (2) it can be mapped onto a wide range of parallel computers. In this paper we report our recent experience on implementing Apply on a Meiko Computing Surface (transputer array machine) using a farmer/gather model. The performance of the Meiko implementation on a number of edge detection algorithms including the popular Canny operator is analysed. Results suggest that the performance of Apply generated code represents peak performance and it is likely to be as efficient as hand‐written code.
Showing 1 to 4 of 4 Articles