
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Larry Wilson, "TimeOptimal DomainSpecific Querying on Enhanced Meshes," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 1, pp. 1324, January, 1997.  
BibTex  x  
@article{ 10.1109/71.569651, author = {Venkatavasu Bokka and Himabindu Gurla and Stephan Olariu and James L. Schwing and Larry Wilson}, title = {TimeOptimal DomainSpecific Querying on Enhanced Meshes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {8}, number = {1}, issn = {10459219}, year = {1997}, pages = {1324}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.569651}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  TimeOptimal DomainSpecific Querying on Enhanced Meshes IS  1 SN  10459219 SP13 EP24 EPD  1324 A1  Venkatavasu Bokka, A1  Himabindu Gurla, A1  Stephan Olariu, A1  James L. Schwing, A1  Larry Wilson, PY  1997 KW  Searching KW  ranking KW  parallel algorithms KW  timeoptimal algorithms KW  enhanced meshes KW  VLSI KW  database design KW  pattern recognition KW  robotics. VL  8 JA  IEEE Transactions on Parallel and Distributed Systems ER   
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
[1] A. Aggarwal, "Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses," IEEE Trans. Computers, vol. 35, no. 1, pp. 6264, Jan. 1986
[2] D.H. Ballard and C.M. Brown, Computer Vision, Prentice Hall, Upper Saddle River, N.J., 1982.
[3] A. BarNoy and D. Peleg, "Square Meshes Are Not Always Optimal," IEEE Trans. Computers, vol. 40, pp. 196204, 1991
[4] K.E. Batcher, "Design of Massively Parallel Processor," IEEE Trans. Computers, vol. 29, pp. 836840, 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. 545554, 1996.
[6] D. Bhagavathi, H. Gurla, S. Olariu, J.L. Schwing, and I. Stojmenovic, "TimeOptimal VisibilityRelated Algorithms on Meshes with Multiple Broadcasting," IEEE Trans. Parallel and Distributed Systems, vol. 6, pp. 687703, 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. 561569,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. 772778, 1994.
[9] D. Bhagavathi, S. Olariu, W. Shen, and L. Wilson, "A TimeOptimal Multiple Search Algorithm on Enhanced Meshes, with Applications," J. Parallel and Distributed Computing, vol. 22, pp. 113120, 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. 142156, 1995.
[11] D. Bhagavathi, H. Gurla, S. Olariu, J.L. Schwing, W. Shen, L. Wilson, and J. Zhang, "Time and VLSIOptimal Sorting Algorithms on Meshes with Multiple Broadcasting," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 196201,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. 545554, 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. 241246, 1990.
[14] Y.C. Chen, W.T. Chen, and G.H. Chen, "Efficient Median Finding and Its Application to TwoVariable Linear Programming on MeshConnected Computers with Multiple Broadcasting," J. Parallel and Distributed Computing, vol. 15, pp. 7984, 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. 8797, 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. 103109, 1990.
[17] M. Cosnard and A.G. Ferreira, "Parallel Algorithms for Searching in X + Y," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 1619,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 NPComplete Problems," Technical Report 9032, 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. 1430, 1984.
[21] L.H. Harper, T.H. Payne, J.E. Savage, and E. Strauss, "Sorting XY," Comm. ACM, vol. 18, pp. 347349, 1975.
[22] V.K. Prasanna Kumar, and C.S. Raghavendra,“Array processor with multiple broadcasting,” J. of Parallel and Distributed Computing, vol. 4, pp. 173190, 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. 119125, 1989.
[24] J.L. Lambert, "Sorting X + Y in O(n2) Comparisons," Theoretical Computer Science, vol. 103, pp. 137141, 1992.
[25] H. Li and M. Maresca,“Polymorphictorus network,” IEEE Trans. on Computers, vol. 38, no. 9, pp. 13451351, Sept. 1989.
[26] R. Lin, S. Olariu, J.L. Schwing, and J. Zhang, "Simulating Enhanced Meshes, with Applications," Parallel Processing Letters, vol. 3, pp. 5970, 1993.
[27] R. Lin, S. Olariu, and J.L. Schwing, "An Efficient VLSI Architecture for Digital Geometry," Proc. IEEE Conf. ApplicationSpecific Array Processors, pp. 392403, Aug. 1994.
[28] M. Maresca, "Polymorphic Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 490506, 1993.
[29] R. Miller Personal communication, 1994.
[30] A. Mirzaian, "Channel Routing in VLSI," Proc. 16th Ann. ACM STOC, pp. 101107,Washington, D.C., 1984.
[31] D. Nassimi and S. Sahni, "Bitonic Sort on a MeshConnected Parallel Computer," IEEE Trans. Computers, vol. 27, pp. 27, 1979.
[32] D. Nassimi and S. Sahni, "Data Broadcasting in SIMD Computers," IEEE Trans. Computers, vol. 30, pp. 101107, 1981.
[33] S. Olariu, J.L. Schwing, and J. Zhang, "Optimal Convex Hull Algorithms on Enhanced Meshes," BIT, vol. 33, pp. 396410, 1993.
[34] S. Olariu and I. Stojmenovic, "TimeOptimal Proximity Problems on Meshes with Multiple Broadcasting," J. Parallel and Distributed Computing, vol. 36, pp. 144155, 1996.
[35] D. Parkinson, D.J. Hunt, and K.S. MacQueen, "The AMT DAP 500," Proc. 33rd IEEE CS Int'l Conf., pp. 196199 1988.
[36] H. Tamura and N. Yokoya, "Image Database Systems: A Survey," Pattern Recognition, vol. 17, pp. 2949, 1984.