Making Parallel Computers Usable:
the ability to make effective use of libraries of previously developed algorithms
the efficient mapping new algorithms to parallel architectures, where efficient applies both to the resulting mapping and the process by which the mapping is done
the development of new algorithms
the rapid assessment of proposed and new architectures for their suitability for a given application.
KeywordsParallel Algorithm Parallel Architecture Image Processing Algorithm Graph Matcher Data Allocation
Unable to display preview. Download preview PDF.
- E. J. Delp, H. J. Siegel, A. Whinston, and L. H. Jamieson, “An Intelligent Operating System for Executing Image Understanding Tasks on a Reconfigurable Parallel Architecture,” IEEE Computer Society Workshop on Computer Architecture for Pattern Analysis and Image Database Management, Miami Beach, FL, Nov. 1985, pp. 217–224.Google Scholar
- F. Weil, L. H. Jamieson, and E. J. Delp, “An Algorithm Database for an Image Understanding Task Execution Environment,” High-Level Vision with Multicomputers, S. Levialdi, editor, Academic Press, London, 1988, pp. 35–51.Google Scholar
- H. Chu, E. J. Delp, and H. J. Siegel, “Image Understanding on PASM: A User’s Perspective,” 2nd International Conference on Super computing, Santa Clara, CA, May 1987, pp. 440–449.Google Scholar
- L. H. Jamieson, “Characterizing Parallel Algorithms,” in The Characteristics of Parallel Algorithms, L. H. Jamieson, D. Gannon, and R. J. Douglass, editors, M.I.T. Press, Cambridge, MA, 1987, pp. 65–100.Google Scholar
- L. H. Jamieson, “Using Algorithm Characteristics to Evaluate Parallel Architectures,” in Performance Evaluation of Supercomputers, J. L. Martin, editor, North-Holland, Amsterdam, 1988, pp. 21–49.Google Scholar