Solving Linear Algebraic Equations on an MIMD Computer

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Solving Linear Algebraic Equations on an MIMD Computer

Full text

Pdf (578 KB)

Source

Journal of the ACM (JACM) archive
Volume 30 , Issue 1 (January 1983) table of contents

Pages: 103 - 117

Year of Publication: 1983

ISSN:0004-5411

Authors

R. E. Lord	Department of Computer Science, Washington State University, Pullman, WA
J. S. Kowalik	Department of Computer Science, Washington State University, Pullman, WA
S. P. Kumar	Department of Mathematics, University of Miami, Coral Gables, FL and Washington State University, Pullman, Washington

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 37, Citation Count: 17

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/322358.322366 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	Edward G. Coffman, Jr. , Peter J. Denning, Operating Systems Theory, Prentice Hall Professional Technical Reference, 1973
	2	DUFF, I.S.A sparse future Tech. Pep CSS 90, Atomic Energy Research Establishment, Harwell, England, Aug. 1980
	3	FL'fNt~, M.J., PODVI~, A., AND SmMIzU, K A multiple mstrucUon stream with shared teso~~.~. In Parallel Processor Systems, Technologzes, andApphcauons, L C Hobbs, Ed., Spartan Bootrs, Washington. D C., 1970, pp 251-286
	4	Gentlemen, NTLEMAN, W.M. Least squares computatmn by Gtvens transformations without square roots J Inst Math AppL 12 (1973), 329-336
	5	Heller, D A survey of parallel algorithms m numerical linear algebra SIAM Rev. 20 (1978), 740--777
	6	Internauonal Mathemaucal and Stattst~cal Library. IMSL, Inc., 7500 Bellmre Blvd., Houston, Texas
	7	Kohler, W.H. A prel,mmary evaluation of the cnacal path method for scheduling tasks on a mulnprocessor system IEEE Trans. Comput. C-24 (Dec. 1975), 1235-1238.
	8	KOWALIK, J S, KUMAR, S P, Ar~v KAMCmA, E R An mlplementation of the fast Givens transformaaon on an MIMD computer. App! Math, Pohsh Academy of Soence (to appear).
	9	A. H. Sameh , D. J. Kuck, On Stable Parallel Linear System Solvers, Journal of the ACM (JACM), v.25 n.1, p.81-91, Jan. 1978 [doi>10.1145/322047.322054]
	10	SMITH, B.J A pipelmed, shared resource MIMD computer. Int Conf. on Parallel Processing, Detroit, Mich., August 1978, pp. 6-8
	11	WING, O, AND HUANG, J W.A computational model of parallel solution of linear equations. IEEE Trans Comput C-29 (July 1980), 632-638.

CITED BY 17

	Li-Xin Wang , Jerry M. Mendel, Three-Dimensional Structured Networks for Matrix Equation Solving, IEEE Transactions on Computers, v.40 n.12, p.1337-1346, December 1991
	Ishfaq Ahmad , Yu-Kwong Kwok , Min-You Wu , Wei Shu, CASCH: A Tool for Computer-Aided Scheduling, IEEE Concurrency, v.8 n.4, p.21-33, October 2000
	Michel Cosnard , El Mostafa Daoudi, Optimal algorithms for parallel Givens factorization on a coarse-grained PRAM, Journal of the ACM (JACM), v.41 n.2, p.399-421, March 1994
	G. P. McKeown, Iterated interpolation using a systolic array, ACM Transactions on Mathematical Software (TOMS), v.12 n.2, p.162-170, June 1986
	A. Gerasoulis , N. Missirlis , I. Nelken , R. Peskin, Implementing Gauss Jordan on a hypercube multicomputer, Proceedings of the third conference on Hypercube concurrent computers and applications, p.1569-1576, January 1989, Pasadena, California, United States
	Rachid Saad, An optimal schedule for Gaussian elimination on an MIMD architecture, Journal of Computational and Applied Mathematics, v.185 n.1, p.91-106, 1 January 2006
	Abdel Krim Amoura , Evripidis Bampis , Jean-Claude König, Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs, IEEE Transactions on Parallel and Distributed Systems, v.9 n.7, p.679-686, July 1998
	H. Wabnig , G. Haring, Performance prediction of parallel systems with scalable specifications—methodology and case study, ACM SIGMETRICS Performance Evaluation Review, v.22 n.2-4, p.46-62, April 1995
	F. Szelényi , W. E. Nagel, A comparison of parallel processing on CRAY X-MP AND IBM 3090 VF multiprocessors, Proceedings of the 3rd international conference on Supercomputing, p.271-282, June 05-09, 1989, Crete, Greece
	Savina Bansal , Padam Kumar , Kuldip Singh, Dealing with heterogeneity through limited duplication for scheduling precedence constrained task graphs, Journal of Parallel and Distributed Computing, v.65 n.4, p.479-491, April 2005
	Gary J. Harkin, Parameterized algorithm decomposition and performance analysis, Proceedings of the 1990 ACM/IEEE conference on Supercomputing, p.314-323, November 12-16, 1990, New York, New York
	Ishfaq Ahmad , Yu-Kwong Kwok, On Exploiting Task Duplication in Parallel Program Scheduling, IEEE Transactions on Parallel and Distributed Systems, v.9 n.9, p.872-892, September 1998
	Gary J. Harkin, Parametrized algorithm decomposition and performance analysis, Proceedings of the 1990 conference on Supercomputing, p.314-323, October 1990, New York, New York, United States
	Yu-Kwong Kwok, Fault-Tolerant Parallel Scheduling of Tasks on a Heterogeneous High-Performance Workstation Cluster, The Journal of Supercomputing, v.19 n.3, p.299-314, July 2001
	P. Sadayappan , V. Visvanathan, Parallelization and performance evaluation of circuit simulation on a shared-memory multiprocessor, Proceedings of the 2nd international conference on Supercomputing, p.254-265, June 1988, St. Malo, France
	Yu-Kwong Kwok , Ishfaq Ahmad, Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors, IEEE Transactions on Parallel and Distributed Systems, v.7 n.5, p.506-521, May 1996
	Yu-Kwong Kwok , Ishfaq Ahmad, Static scheduling algorithms for allocating directed task graphs to multiprocessors, ACM Computing Surveys (CSUR), v.31 n.4, p.406-471, Dec. 1999