High level support for divide-and-conquer parallelism

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

High level support for divide-and-conquer parallelism

Full text

Pdf (695 KB)

Source

Conference on High Performance Networking and Computing archive
Proceedings of the 1991 ACM/IEEE conference on Supercomputing table of contents

Albuquerque, New Mexico, United States

Pages: 283 - 292

Year of Publication: 1991

ISBN:0-89791-459-7

Authors

Attila Gürsoy	Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL
L. V. Kalé	Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL

Sponsors

IEEE : Institute of Electrical and Electronics Engineers
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 7, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/125826.125985 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	2	Jon Louis Bentley, Multidimensional divide-and-conquer, Communications of the ACM, v.23 n.4, p.214-229, April 1980 [doi>10.1145/358841.358850]
	3	F.W. Burton, M.M.Huntbach, "Virtual Tree Machines," IEEE Trans. Comput., vol. C-33, no. 3, pp. 278-280, Mar. 1984.
	4	F. W. Burton, Storage Management in Virtual Tree Machines, IEEE Transactions on Computers, v.37 n.3, p.321-328, March 1988 [doi>10.1109/12.2169]
	5	Nicholas Carriero , David Gelernter, Linda in context, Communications of the ACM, v.32 n.4, p.444-458, April 1989 [doi>10.1145/63334.63337]
	6	Conte and de Boor, Elementary Numemcal Analyszs, (1980) pp 328-332.
	7	Jack B. Dennis , Earl C. Van Horn, Programming semantics for multiprogrammed computations, Communications of the ACM, v.9 n.3, p.143-155, March 1966 [doi>10.1145/365230.365252]
	8	Raphael Finkel , Udi Manber, DIB—a distributed implementation of backtracking, ACM Transactions on Programming Languages and Systems (TOPLAS), v.9 n.2, p.235-256, April 1987 [doi>10.1145/22719.24067]
	9	E. Gabber, VMMP: A Practical Tool for the Development of Portable and Efficient Programs for Multiprocessors, IEEE Transactions on Parallel and Distributed Systems, v.1 n.3, p.304-317, July 1990 [doi>10.1109/71.80158]
	10	G.Golub, C. van Loan, Matrix computatzons, Johns Hopkins University Press, Baltimore, 1983.
	11	L.V.Kale, "The Chare Kernel parallel programming language and system", Proceedings of the International Conference on Parallel Processing, Vol II, Aug 1990, pp17-25.
	12	B. W. Kernighan , D. M. Ritchie, The C programming language, Prentice-Hall, Inc., Upper Saddle River, NJ, 1978
	13	Vipin Kumar , V. Nageshwara Rao, Parallel depth first search. Part II. analysis, International Journal of Parallel Programming, v.16 n.6, p.501-519, December 1987 [doi>10.1007/BF01389001]
	14	Carver Mead , Lynn Conway, Introduction to VLSI Systems, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1979
	15	P.A. Nelson, L.Synder, "Programming paradigms for nonshared memory parallel computer," in The Characteristics of Parallel Algorithms, L.H.Jamieson, D.B.Gannon, and R.J.Douglas, Eds. Cambridge, MA: MIT Press, 1987, pp. 3-20.
	16	J. M. Ortega, Introduction to Parallel & Vector Solution of Linear Systems, Plenum Press, New York, NY, 1988
	17	Frans J. Peters, Tree machines and divide-and-conquer algorithms, Proceedings of the Conference on Analysing Problem Classes and Programming for Parallel Computing, p.25-36, June 10-12, 1981
	18	W.Shu, L.V.Kale, "Dynamic scheduling of medium-grained processes on multicomputers", Tech. Rep. UIUCDCS-R-89-1528, Dept. of Computer Science, University of illinois at Urbana- Champaign, July 1989.
	19	Quentin F. Stout, Supporting divide-and-conquer algorithms for image processing, Journal of Parallel and Distributed Computing, v.4 n.1, p.95-115, February 1, 1987 [doi>10.1016/0743-7315(87)90010-4]