This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Mapping Algorithms for a Class of Hierarchical Systems
November 1993 (vol. 4 no. 11)
pp. 1230-1245

Proposes techniques for mapping application algorithms onto a class of hierarchicallystructured parallel computing systems. Multiprocessors of this type are capable ofefficiently solving a variety of scientific problems because they can efficiently implementboth local and global operations for data in a two-dimensional array format. Among theset of candidate application domains, low-level and intermediate-level image processingand computer vision (IPCV) are characterized by high-performance requirements.Emphasis is given to IPCV algorithms. The importance of the mapping techniques stemsfrom the fact that the current technology cannot be used to build cost-effective andefficient systems composed of very large numbers of processors, so the performance ofvarious systems of lower cost should be investigated. Both analytical and simulationresults prove the effectiveness and efficiency of the proposed mapping techniques.

[1] N. Ahuja and S. Swamy, "Multiprocessor pyramid architectures for bottom-up image analysis,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-6, pp. 463-474, July 1984.
[2] R. P. Blanford and S. L. Tanimoto, "Bright-spot detection in pyramids,"Comput. Vision, Graphics, Image Processing, vol. CVGIP-43, pp. 133-149, Aug. 1988.
[3] S. H. Bokhari,Assignment Problems in Parallel and Distributed Computing. Boston, MA: Kluwer Academic, 1987.
[4] S. H. Bokhari, "On the mapping problem,"IEEE Trans. Comput., vol. C-30, pp. 207-214, Mar. 1981.
[5] S. W. Bollinger and S. F. Midkiff, "Heuristic technique for processor and link assignment in multicomputers,"IEEE Trans. Comput., vol. 40, pp. 325-332, Mar. 1991.
[6] A. Brandt, "Multilevel computations: Review and recent developments," inMultigrid Methods--Theory, Applications, and Supercomputing, S. F. McCormick, Ed. New York: Marcel Dekker, 1988.
[7] V. Cantoni and S. Levialdi, "Multiprocessor computing for images,"Proc. IEEE, vol. 76, no. 8, Aug. 1988.
[8] T. F. Chan and Y. Saad, "Multigrid algorithms on the hypercube multiprocessor,"IEEE Trans. Comput., vol. C-35, no. 11, pp. 969-977, Nov. 1986.
[9] P. Clermont and A. Merigot, "Real time synchronization in a multi-SIMD massively parallel machine," inProc. Conf. Architecture Pattern Anal. Machine Intell., 1987, pp. 131-136.
[10] J. E. Cuny and L. Snyder, "A model for analyzing generalized interprocessor communication systems," inAlgorithmically Specialized Parallel Computers, L. Snyder, L. H. Jamieson, D. B. Gannon, and H. J. Siegel, Eds. Orlando, FL: Academic, 1985, pp. 7-16.
[11] M. J. B. Duff, "The limits of computing in arrays of processors," inFrom Pixels to Features, J. C. Simon, Ed. The Netherlands: North-Holland, 1989.
[12] C. R. Dyer, "A VLSI pyramid machine for hierarchical parallel image processing," inProc. Conf. Pattern Recognition Image Processing, 1981, pp. 381-386.
[13] L. G. C. Hamey, J. A. Webb, and I.-C. Wu, "Apply, A programming language for low-level vision on diverse parallel architectures," inParallel Computation and Computers for Artificial Intelligence, J. Kowalik, Ed. Boston, MA: Kluwer Academic, 1987.
[14] M. Hanan and J. M. Kurtzberg, "A review of the placement and quadratic assignment problems,"SIAM Rev., vol. 14, pp. 324-342, Apr. 1972.
[15] D. Hillis,The Connection Machine. Cambridge, MA: M.I.T. Press, 1985.
[16] T.-H. Lai and W. White, "Mapping pyramid algorithms into hypercubes,"J. Parallel Comput., vol. 8, 1990.
[17] M. Maresca, M. A. Lavin, and H. Li, "Parallel architectures for vision,"Proc. IEEE, vol. 76, Aug. 1988.
[18] A.P. Reeves, "Pyramidal Systems for Computer Vision," inPyramidal Algorithms on Processor Arrays, V. Cantoni and S. Levialdi, eds., Academic Press, London, 1986, pp. 195-213.
[19] A. Rosenfeld, Ed.,Multiresolution Image Processing and Analysis. New York: Springer-Verlag, 1984.
[20] C.-C. Shen and W.-H. Tsai, "A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion,"IEEE Trans. Comput., vol. C-34, pp. 197-203, Mar. 1985.
[21] Q. F. Stout, "Hypercubes and pyramids," inPyramidal Systems for Computer Vision, V. Cantoni and S. Levialdi, Eds. Berlin: Springer, 1986.
[22] S. L. Tanimoto, "A pyramidal approach to parallel processing," inProc. Int. Symp. Comput. Architecture, June 1983, pp .
[23] D. Terzopoulos, "Concurrent multilevel relaxation," inProc. Image Underst. Workshop, L. S. Baumann, Ed., Miami Beach, FL, 1985.
[24] L. Uhr, Ed.,Parallel Computer Vision. New York: Academic, 1987.
[25] S. G. Ziavras, "On the mapping problem for multi-level systems," inProc. Supercomputing '89, IEEE Computer Society and ACM SIGARCH, Reno, NV, Nov. 1989, pp. 399-408.
[26] S. G. Ziavras, "Techniques for mapping deterministic algorithms onto multi-level systems," inProc. Int. Conf. Parallel Processing, St. Charles, IL, Aug. 1990, pp. 226-233.
[27] S. G. Ziavras and L. S. Davis, "Fast addition on the fat pyramid and its simulation on the connection machine," inFrom Pixels to Features, J. C. Simon, Ed. The Netherlands: North-Holland, 1989, pp. 373-382.
[28] S. G. Ziavras and D. P. Shah, "High performance emulation of hierarchical structures on hypercube supercomputers,"Concurrency: Practice and Experience, vol. 6, no. 1, 1994.

Index Terms:
Index Termsmapping algorithms; hierarchical systems; parallel computing systems; image processing;computer vision; high-performance requirements; mapping techniques; processassignment; scheduling; computer vision; image processing; multiprocessorinterconnection networks; parallel architectures
Citation:
S.G. Ziavras, "Efficient Mapping Algorithms for a Class of Hierarchical Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 11, pp. 1230-1245, Nov. 1993, doi:10.1109/71.250102
Usage of this product signifies your acceptance of the Terms of Use.