This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Time-Optimal Domain-Specific Querying on Enhanced Meshes
January 1997 (vol. 8 no. 1)
pp. 13-24

Abstract—Query processing is a crucial component of various application domains including information retrieval, database design and management, pattern recognition, robotics, and VLSI. Many of these applications involve data stored in a matrix satisfying a number of properties. One property that occurs time and again specifies that the rows and the columns of the matrix are independently sorted. It is customary to refer to such a matrix as sorted. An instance of the Batched Searching and Ranking problem, (BSR, for short) involves a sorted matrix A of items from a totally ordered universe, along with a collection Q of queries. Q is an arbitrary mix of the following query types: For a search query qj, one is interested in an item of A that is closest to qj; for a rank query qj one is interested in the number of items of A that are strictly smaller than qj. The BSR problem asks for solving all queries in Q. In this work, we consider the BSR problem in the following context: The matrix A is pretiled, one item per processor, onto an enhanced mesh of size $\sqrt n\times \sqrt n$; the m queries are stored, one per processor, in the first ${{m \over {\sqrt n}}}$ columns of the platform. Our main contribution is twofold. First, we show that any algorithm that solves the BSR problem must take at least $\Omega ({\rm max\{log}n,\sqrt m\})$ time in the worst case. Second, we show that this time lower bound is tight on meshes of size $\sqrt n\times \sqrt n$ enhanced with multiple broadcasting, by exhibiting an algorithm solving the BSR problem in $\Theta ({\rm max\{log}\!\!n,\sqrt m\})$ time on such a platform.

[1] A. Aggarwal, "Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses," IEEE Trans. Computers, vol. 35, no. 1, pp. 62-64, Jan. 1986
[2] D.H. Ballard and C.M. Brown, Computer Vision, Prentice Hall, Upper Saddle River, N.J., 1982.
[3] A. Bar-Noy and D. Peleg, "Square Meshes Are Not Always Optimal," IEEE Trans. Computers, vol. 40, pp. 196-204, 1991
[4] K.E. Batcher, "Design of Massively Parallel Processor," IEEE Trans. Computers, vol. 29, pp. 836-840, 1980.
[5] D. Bhagavathi, H. Gurla, R. Lin, S. Olariu, J.L. Schwing, and J. Zhang, "Square Meshes Are Not Optimal for Convex Hull Computation," IEEE Trans. Parallel and Distributed Systems, vol. 7, pp. 545-554, 1996.
[6] D. Bhagavathi, H. Gurla, S. Olariu, J.L. Schwing, and I. Stojmenovic, "Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting," IEEE Trans. Parallel and Distributed Systems, vol. 6, pp. 687-703, 1995.
[7] D. Bhagavathi, S. Olariu, W. Shen, and L. Wilson, "A Unifying Look at Semigroup Computations on Meshes with Multiple Broadcasting," Proc. Parallel Architectures and Languages Europe, LNCS 694, pp. 561-569,München, Germany, June 1993.
[8] D. Bhagavathi, P.J. Looges, S. Olariu, J.L. Schwing, and J. Zhang, "A Fast Selection Algorithm on Meshes with Multiple Broadcasting," IEEE Trans. Parallel and Distributed Systems, vol. 5, pp. 772-778, 1994.
[9] D. Bhagavathi, S. Olariu, W. Shen, and L. Wilson, "A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications," J. Parallel and Distributed Computing, vol. 22, pp. 113-120, 1994.
[10] D. Bhagavathi, S. Olariu, J.L. Schwing, W. Shen, L. Wilson, and J. Zhang, "Convexity Problems on Meshes with Multiple Broadcasting," J. Parallel and Distributed Computing, vol. 27, pp. 142-156, 1995.
[11] D. Bhagavathi, H. Gurla, S. Olariu, J.L. Schwing, W. Shen, L. Wilson, and J. Zhang, "Time- and VLSI-Optimal Sorting Algorithms on Meshes with Multiple Broadcasting," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 196-201,St. Charles, Ill., Aug. 1993.
[12] D. Bhagavathi, H. Gurla, R. Lin, S. Olariu, J.L. Schwing, and J. Zhang, "Square Meshes Are Not Optimal for Convex Hull Computation," IEEE Trans. Parallel and Distributed Systems, vol. 7, pp. 545-554, 1996.
[13] Y.C. Chen, W.T. Chen, G.H. Chen, and J.P. Sheu, "Designing Efficient Parallel Algorithms on Mesh Connected Computers with Multiple Broadcasting," IEEE Trans. Parallel and Distributed Systems, vol. 1, pp. 241-246, 1990.
[14] Y.C. Chen, W.T. Chen, and G.-H. Chen, "Efficient Median Finding and Its Application to Two-Variable Linear Programming on Mesh-Connected Computers with Multiple Broadcasting," J. Parallel and Distributed Computing, vol. 15, pp. 79-84, 1992.
[15] S.A. Cook, C. Dwork, and R. Reischuk, "Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes," SIAM J. Computing, vol. 15, pp. 87-97, 1986.
[16] M. Cosnard, J. Dupras, and A.G. Ferreira, "The Complexity of Searching in X + Y and Other Multisets," Information Processing Letters, vol. 34, pp. 103-109, 1990.
[17] M. Cosnard and A.G. Ferreira, "Parallel Algorithms for Searching in X + Y," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 16-19,St. Charles, Ill., Aug. 1989.
[18] R. Duda, P. Hart, and D. Stork, Pattern Classification. New York: John Wiley&Sons, 2001.
[19] A.G. Ferreira, "Parallel Search in Sorted Multisets, with Applications to NP-Complete Problems," Technical Report 90-32, Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon, Dec. 1990.
[20] G.N. Frederickson and D.B. Johnson, "Generalized Selection and Ranking: Sorted Matrices," SIAM J. Computing, vol. 13, pp. 14-30, 1984.
[21] L.H. Harper, T.H. Payne, J.E. Savage, and E. Strauss, "Sorting XY," Comm. ACM, vol. 18, pp. 347-349, 1975.
[22] V.K. Prasanna Kumar, and C.S. Raghavendra,“Array processor with multiple broadcasting,” J. of Parallel and Distributed Computing, vol. 4, pp. 173-190, 1987.
[23] V.K. Prasanna and D.I. Reisis, "Image Computations on Meshes with Multiple Broadcast," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 119-125, 1989.
[24] J.L. Lambert, "Sorting X + Y in O(n2) Comparisons," Theoretical Computer Science, vol. 103, pp. 137-141, 1992.
[25] H. Li and M. Maresca,“Polymorphic-torus network,” IEEE Trans. on Computers, vol. 38, no. 9, pp. 1345-1351, Sept. 1989.
[26] R. Lin, S. Olariu, J.L. Schwing, and J. Zhang, "Simulating Enhanced Meshes, with Applications," Parallel Processing Letters, vol. 3, pp. 59-70, 1993.
[27] R. Lin, S. Olariu, and J.L. Schwing, "An Efficient VLSI Architecture for Digital Geometry," Proc. IEEE Conf. Application-Specific Array Processors, pp. 392-403, Aug. 1994.
[28] M. Maresca, "Polymorphic Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 490-506, 1993.
[29] R. Miller Personal communication, 1994.
[30] A. Mirzaian, "Channel Routing in VLSI," Proc. 16th Ann. ACM STOC, pp. 101-107,Washington, D.C., 1984.
[31] D. Nassimi and S. Sahni, "Bitonic Sort on a Mesh-Connected Parallel Computer," IEEE Trans. Computers, vol. 27, pp. 2-7, 1979.
[32] D. Nassimi and S. Sahni, "Data Broadcasting in SIMD Computers," IEEE Trans. Computers, vol. 30, pp. 101-107, 1981.
[33] S. Olariu, J.L. Schwing, and J. Zhang, "Optimal Convex Hull Algorithms on Enhanced Meshes," BIT, vol. 33, pp. 396-410, 1993.
[34] S. Olariu and I. Stojmenovic, "Time-Optimal Proximity Problems on Meshes with Multiple Broadcasting," J. Parallel and Distributed Computing, vol. 36, pp. 144-155, 1996.
[35] D. Parkinson, D.J. Hunt, and K.S. MacQueen, "The AMT DAP 500," Proc. 33rd IEEE CS Int'l Conf., pp. 196-199 1988.
[36] H. Tamura and N. Yokoya, "Image Database Systems: A Survey," Pattern Recognition, vol. 17, pp. 29-49, 1984.

Index Terms:
Searching, ranking, parallel algorithms, time-optimal algorithms, enhanced meshes, VLSI, database design, pattern recognition, robotics.
Citation:
Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Larry Wilson, "Time-Optimal Domain-Specific Querying on Enhanced Meshes," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 1, pp. 13-24, Jan. 1997, doi:10.1109/71.569651
Usage of this product signifies your acceptance of the Terms of Use.