Two plausible ways to implement Floyd's all pairs shortest paths algorithm on a hypercube mutiprocessor are considered. These are evaluated experimentally. A comparison with using Dijkstra's single source all desitination algorithm on each processor is also done. 1 2 Abstract Two plausible ways to implement Floyd's all pairs shortest paths algorithm on a… (More)
We develop two algorithms to perform the q step shrinking and expanding of an N×N binary image on a pyramid computer with an N×N base. The time complexity of both algorithms is O(√ q). However, one uses O(√ q) space per processor while the per processor space requirement of the other is O (1).
Computing the conjguration space is an importm problem in spatial planning for robotics applicatiorx In this paper, we present parallel algorithms for computing the configuration space by using hypercube multiprocessors. The digitized images of the obstacies and the robot are stored in an Nx N image plane. In this paper, we develop optimal hyper-cube… (More)
Polygon scan conversion is an important operation in rasterization process for computer graphics application. In this paper, we present parallel algorithm for converting polygon from its object space representation into its image space representation by using hypercube multiprocessors. The total number of SIMD hypercube processor is N X N. Each processor… (More)