By Topic

Optimal algorithms for the multiple query problem on reconfigurable meshes, with applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Bokka, V. ; Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA ; Nakano, K. ; Olariu, S. ; Schwing, J.L.
more authors

The main contribution of this work is to show that a number of fundamental and seemingly unrelated problems in database design, pattern recognition, robotics, computational geometry, and image processing can be solved simply and elegantly by stating them as instances of a unifying algorithmic framework that we call the multiple query problem. The multiple query problem (MQ, for short) is a 5-tuple (Q, A, D, φ, ⊕), where Q is a set of queries, A is a set of items, D is a set of solutions, φ: Q×A→D is a function, and ⊕ is a commutative and associative binary operator over D. The input to the MQ problem consists of a sequence Q=⟨q1,q2…,qm⟩ of m queries from Q and of a sequence A=⟨a1,a2,…an⟩ of n items from A. The goal is to compute, for every query qi (1⩽i⩽m) its solution defined as φ(qi,A)=φ(q i,a1)⊕φ(qi,a2 )⊕···⊕φ(qi,an ). We begin by discussing a generic algorithm that solves a large class of MQ problems in O(√m+f(n)) time on a reconfigurable mesh of size √n×√n, where f(n) is the time necessary to compute the expression d1 ⊕ d2 ⊕···⊕ dn with di ∈ D on such a platform. We then go on to show that the MQ framework affords us an optimal algorithm for the multiple point location problem on a reconfigurable mesh of size √n×√n. Given a set A of n points and a set Q of m (m⩽n) points in the plane, our algorithm reports, in O(√m+log log n) time, all points of Q that lie inside the convex hull of A. Quite surprisingly, our algorithm solves the multiple point location problem without computing the convex hull of A which, in itself, takes Ω(√n) time on a reconfigurable mesh of size √n×√n. Finally, we prove an Ω(√m+g(n)) time lower bound for nontrivial MQ problems, where g(n) is the lower bound for evaluating the expression d1 ⊕ d2 ⊕···⊕ dn with di ∈ D, on a reconfigurable mesh of size √n×√n

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:12 ,  Issue: 9 )