A Computation Model of Parallel Solution of Linear Equations

IEEE Transactions on Computers

Volumn C-29, Issue 7, 1980, Pages 632-638

  Wing, Omar ^a   Huang, John W ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Computation model; parallel computation; parallel processing; parallel solution of linear equations

Indexed keywords

PARALLEL COMPUTATION;

COMPUTER PROGRAMMING;

EID: 0019038254     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1980.1675634     Document Type: Article

References (20)

1. D. Heller, “A survey of parallel algorithms in numerical linear algebra,” SIAM Rev., vol. 20, pp. 740–777, Oct. 1978.
2. D. A. Calahan, “Parallel solution of sparse simultaneous linear equations,” in Proc. 11th Ann. Allerton Conf. Circuit and Syst. Theory, Oct. 1973, pp. 729–735.
3. ――, “Exploiting parallelism in design algorithms,” in Basic Questions of Design Theory, W. R. Spillers, Ed. New York: Elsevier, 1974.
4. D. A. Calahan, W. N. Joy, and D. Orbits, “Preliminary report on results of matrix benchmarks on vector processors,” Syst. Eng. Lab. Rep. 9 4, Univ. of Michigan, May, 1976.
5. V. Conrad and Y. Wallach, “Iteration solution of linear equations on a parallel processor system,” IEEE Trans. Comput., vol. C-26, pp. 838–846, Sept. 1977.
6. J. L. Rosenfeld, “A case study in programming for parallel processing,” Commun. Ass. Comput. Mach., vol. 12, pp. 645-655, 1969.
7. C. Pottle and Y. M. Wong, “Nonlinear circuit simulation on a parallel microcomputer system,” in Proc. 1976 IEEE Int. Symp. Circuits and Syst., IEEE 76H 1074-4CAS, Apr 1976, pp. 394–397.
8. J. J. Lambiotte, Jr., “The solution of linear systems of equations on a vector computer,” Ph.D. dissertation, Dep. of Appl. Math. and Comput. Sci., Univ. of Virginia, May 1975.
9. T. C. Hu, “Parallel sequencing and assembly line problems,” Operations Res., vol. 9, pp. 841-848, 1961.
10. C. V. Ramamoorthy, K. M. Chandy, and M. J. Gonzales, J r., “Optimal scheduling strategies in a multiprocessor system,” IEEE Trans. Comput., vol. C-21, pp. 137–146, Feb. 1972.
11. T. Lang and E. B. Fernandez, “Improving the computation of lower bounds for optimal schedules,” IBM J. Res. Develop., vol. 21, pp. 273–280, May 1977.
12. E. G. Coffman, Jr. (ed.), Computer and Job Shop Scheduling Theory; New York: Wiley, 1976, Chap. 1, pp. 1–50.
13. O. Wing and J. W. Huang, “A parallel triangulation process of sparse matrices,” in Proc. 1977 Int. Conf. Parallel Processing, IEEE 77CH 1253-4C, Aug. 1977, pp. 207–214.
14. D. J. Rose, “Triangulated graphs and the elimination process,” J. Math. Anal. Appl., vol. 32, pp. 597-609, 1970.
15. S. Parter, “The use of linear graphs in Gauss elimination,” SIAM Rev., vol. 3, pp. 119-130, 1961.
16. F. L. Bauer, “Computation graphs and bounding error,” SIAM J. Numerical Anal., vol. 11, pp. 87–96, Mar. 1974.
17. R. Sethi, “Algorithms for minimum-length schedules,” in Computer and Job Shop Scheduling Theory, E. G. Coffman, Jr., Ed. New York: Wiley, 1976, pp. 51–99.
18. E. B. Fernandez and B. Bussel, “Bounds on the number of processors and time for multiprocessor optimal schedule,” IEEE Trans. Comput., vol. C-22, pp. 745–751, Aug. 1973.
19. M. J. Gonzales, Jr., “Deterministic processor scheduling,” Comput. Surveys, vol. 9, pp. 173–204, Sept. 1977.
20. “AEP 118 Bus Test System,” American Electric Power Service Corp., New York, NY.