|Budget Amount *help
¥3,400,000 (Direct Cost : ¥3,400,000)
Fiscal Year 1999 : ¥1,200,000 (Direct Cost : ¥1,200,000)
Fiscal Year 1998 : ¥2,200,000 (Direct Cost : ¥2,200,000)
In this research, we have been developed efficient parallel algorithms and algorithm library.
Our first contribution is to develop a visualized simulator for reconfigurable meshes, and implemented a number of parallel algorithms running on the reconfigurable mesh. The simulator we have developed has the following feature : accept algorithm description using C-like language, visualize the execution of the parallel algorithm, and supply various statistic information including running time, and delay time. The parallel algorithms implemented include sum and prefix-sums problem, ranking and sorting, and graph algorithms such as reachability and minimum weight spanning tree. Further, we developed an efficient geometric algorithm that computes the convex hull of n points in the plane in O(log log n) on the reconfigurable mesh of size ィイD8nィエD8×ィイD8nィエD8. This algorithm is an improvement of the best known algorithm that performs the same task in O(log n) time.
Second, we developed a number of parallel algorithms under the radio communication environment. The parallel algorithms we developed include leader electron, initializing, routing, ranking, and sorting. for example, we developed an initializing algorithm that gives n processors unique ID in [1, n] in O(n) time with each processor performing broadcast/receive operations in O(log n) time.