Geometry based mapping strategies for PDE computations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Geometry based mapping strategies for PDE computations

Full text

Pdf (987 KB)

Source

International Conference on Supercomputing archive
Proceedings of the 5th international conference on Supercomputing table of contents

Cologne, West Germany

Pages: 115 - 127

Year of Publication: 1991

ISBN:0-89791-434-1

Authors

N. P. Chrisochoides	Purdue University, Computer Science Department, West Lafayette, IN
E. N. Houstis	University of Crete, Computer Science Department, Heraklion, Greece
C. E. Houstis

Sponsor

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 9, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions 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/109025.109060 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.

	Ayka 88	C. Aykanat , F. Özgüner , F. Ercal , P. Sadayappan, Iterative Algorithms for Solution of Large Sparse Systems of Linear Equations on Hypercubes, IEEE Transactions on Computers, v.37 n.12, p.1554-1568, December 1988 [doi>10.1109/12.9733]
	Bopp 87	R.B. Boppana, Eigenvalues and graph bisection: An average case analysis, In 28th Foundation of Computer Sczence, ACM, 280- 285, 1987.
	Carp 80	Giorgio Carpaneto , Paolo Toth, Algorithm 548: Solution of the Assignment Problem [H], ACM Transactions on Mathematical Software (TOMS), v.6 n.1, p.104-111, March 1980 [doi>10.1145/355873.355883]
	Chri 89	N. P. Chrisochoides , C. E. Houstis , E. N. Houstis , S. K. Kortesis , J. R. Rice, Automatic load balanced paritioning strategies for PDE computations, Proceedings of the 3rd international conference on Supercomputing, p.99-107, June 05-09, 1989, Crete, Greece [doi>10.1145/318789.318801]
	Chri 90	N.P. Chrisochoides, C.E. Houstis, E.N. Houstis, Geometry based mapping strategies for PDE computation, CER-90-16, Computer Science Department, Purdue University, West Lafayette, IN 47907.
	Chri 91	N.P. Chrisochoides, On the mappzT~g of PDE computatzons to distmbuted memory machines, Ph.D. Thesis, Purdue University, 1991.
	Chri 76	N. Christofides and P. Brooker, The optimal partitioning of graphs, SIAM Journal of Applied Mathematics, Vol. 30:55-69, 1976.
	Fhar 88	C. Farhat, A simple and efficient automatic FEM domain decomposer, Computers aT~d Structures, Vol. 28,579-602, 1988.
	Fhar 89	C. Farhat, On the mapping of massively parallel processors onto finite element graphs, Computers and Structures, Vol. 32, 347-353, 1989.
	Flow 88	J. Flower, S. Otto and M. Salana, Optimal mapping of irregular finite element domains to parallel processors, In Parallel Computers and Thezr Impact on Mechanzcs (A.K. Noor, ed.), AMD, Vol. 86, 239-250, 1988.
	Fox 86a	G.C. Fox, A graphical approach to load balancing and sparse matrix vector multiplication on the hypercube, Proceedings of IMA Institute, 37-51, 1986.
	Fox 86b	G.C. Fox, A review of automatic load balancing and decomposition methods for the hypercube, Proceedings of the IMA institute, 63- 76, 1986.
	Fuku 84	Kunio Fukunaga, Shoichiro Yamada, Harold S. Stone, and Tamotsu Kasai A presentation of hypergraphs in the Euclidean space, IEEE Trans., Vol. C-33, 1984.
	Goto 81	Satoshi Goto, An efficient algorithm for the two-dimensional placement problem in electrical circuit layout, IEEE Trans. on Circuits and Systems, Vol. CAS-28, 1981.
	Hana 72	A review of the placement and quadratic assignment problems, SIAM Review, Vol. 14, 324-342, 1972.
	Hopf 76	J.J. Hopfield, Neural networks and physical systems with emergent collective computational abilities, Proc. Natl. Acad. Sci., USA, Vol. 79, 2554-2558, 1982.
	Hous 90a	Catherine E. Houstis, Module Allocation of Real-Time Applications to Distributed Systems, IEEE Transactions on Software Engineering, v.16 n.7, p.699-709, July 1990 [doi>10.1109/32.56096]
	Hous 90b	C.E. IIoustis, E.N. Houstis, J.R. Rice, S.M. Samartzis and D.L. Alexandrakis, The algorithm mapper: A system for modeling and evaluating parallel application/architecture pairs, In Intelliger~t Mathematical Software Syslems (iioustis, Rice and Vishnevetsky, eds.), North-Holland, 87-101, 1990.
	Hous 90c	E.N. Houstis, S.K. Kortesis and H. Byun, A workload partitioning strategy for PDEs by a generalized neural network, CSD-TR-934, Computer Science Department, Purdue University, W. Lafayette, IN, 1990.
	Hous 87	C.E. Houstis, E.N. Houstis and J.R. Rice, Partitioning PDE computations: Methods and performance evaluation, Parallel Computing, Vol. 5, 141-163, 1987.
	Hous 90d	E. N. Houstis , J. R. Rice , N. P. Chrisochoides , H. C. Karathanasis , P. N. Papachiou , M. K. Samartzis , E. A. Vavalis , Ko Yang Wang , S. Weerawarana, //ELLPACK: a numerical simulation programming environment for parallel MIMD machines, Proceedings of the 4th international conference on Supercomputing, p.96-107, June 11-15, 1990, Amsterdam, The Netherlands
	Kern 70	B.W. Kernighan and S. Lin, An efficient, heuristic procedure for partitioning graphs, The Bell System Technzcal Journal, 291-307, 1970.
	Kirk 83	S. Kirkpatrick, C. Gelatt and M. Vecctli, Optimization by simulated annealing, Sc~eT~ce, Vol. 220,671-680, 1983.
	Luke 74	J.A. Lukes, Efficient algorithm for the 1)artitioning of trees, IBM Journal of Research aTtd Development, 18:217-224, 1974.
	Morr 87	R. Morison , S. Otta, The scattered decomposition for finite elements, Journal of Scientific Computing, v.2 n.1, p.59-76, March 1, 1987 [doi>10.1007/BF01061512]
	Pomm 90	C. Pommerell, M. Annaratone and W. Fichtner, A set of new mapping and coloring heuristics for distributed-memory parallel processors, Proceedings of Copper Mountain C,onference on Iterative Methods, Vol. 4, 1-27, 1990.
	Quin 79	N. Quinn and M. Breuer, A forced direcl~ed component placement procedure for printed circuit boards IEEE Trans. on Circuits and Systems, Vol CAS-26, No. 6, June 1979.
	Sada 87a	P. Sadayappan , F. Ercal, Cluster-partitioning approaches to mapping parallel programs onto a hypercube, Proceedings of the 1st International Conference on Supercomputing, p.475-497, March 1988, Athens, Greece
	Sada 87b	P. Sadayappan , F. Ercal, Nearest-neighbor mapping of finite element graphs onto processor meshes, IEEE Transactions on Computers, v.36 n.12, p.1408-1424, Dec. 1987
	Weil 71	François Bourgeois , Jean-Claude Lassalle, An extension of the Munkres algorithm for the assignment problem to rectangular matrices, Communications of the ACM, v.14 n.12, p.802-804, Dec. 1971 [doi>10.1145/362919.362945]
	West 83	David H. West, Algorithm 608: Approximate Solution of the Quadratic Assignment Problem, ACM Transactions on Mathematical Software (TOMS), v.9 n.4, p.461-466, Dec. 1983 [doi>10.1145/356056.356062]
	Will 90	R.D. Williams, Performance of dynamic load balancing algorithms for unstructured mesh calculations, Concurrent Supercomputing Facility, Cal Tech, unpublished manuscript, 23 pages, 1990.