Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system

Authors:
Yi Pan;Keqin Li;Si-Qing Zheng
Affiliations:
-;-;-
Venue:
ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
Year:
1997

Citing 0
Cited 3

Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array With a Reconfigurable Pipelined Bus System

IEEE Transactions on Parallel and Distributed Systems
Scaling Simulation of the Fusing-Restricted Reconfigurable Mesh

IEEE Transactions on Parallel and Distributed Systems
Fault Tolerant Algorithms for a Linear Array with a Reconfigurable Pipelined Bus System

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present efficient algorithms for the nearest neighbor problem defined in an n/spl times/n binary image. We show that using a linear array with a reconfigurable pipelined bus system (LARPBS) of n/sup 2/ processors, the nearest neighbor problem can be solved in O(log log n) time, and using an LARPBS of n/sup 3/ processors, the nearest neighbor problem can be solved in O(1) time. We also show that the nearest neighbor problem can be solved on an LARPBS of n/sup 2/ processors in O(1) time with high probability.