Performance of Processor-Memory Interconnections for Multiprocessors

IEEE Transactions on Computers

Volumn C-30, Issue 10, 1981, Pages 771-780

  Patel, Janak H ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS, DIGITAL;

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

References (26)

1. V. B. Aggarwal and J. W. Burgmeier, “A roundoff error model with applications to arithmetic expressions,” SI AM J. Comput., vol. 8, pp. 60-72, Feb. 1979.
2. D. Bini, M. Capovani, F. Romani, and G. Lotti, “0(n2-779) complexity for n ×n approximate matrix multiplication,” Inform. Process. Lett., vol. 8, pp. 234-235, 1979.
3. R. P. Brent, “Algorithms for matrix multiplication,” Stanford Univ., Stanford, CA, STAN-CS-70-157, Mar. 1970.
4. “Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity,” Numer. Math., vol. 16, pp. 145-156, 1970.
5. J. R. Bunch and J. E. Hopcroft, “Triangular factorization and inversion by fast matrix multiplication,” Math Comput., vol. 28, pp. 231-236, Jan. 1974.
6. F. Y Chin, “An O(n) algorithm for determining a near-optimal computation order of matrix chain products,” Commun. Ass. Comput. Mach., vol. 21, pp. 544-549, July 1978.
7. J. Cohen and M. Roth, “On the implementation of Strassen's fast multiplication algorithm,” Acta Inform., vol. 6, pp. 341-355, 1976.
8. S. S. Godbole, “On efficient computation of matrix chain products,” IEEE Trans. Comput., vol. C-22, pp. 864-866, Sept. 1973.
9. W. Miller, “Computational complexity and numerical stability,” in Proc. 6th ACM Symp. Theory Comput., 1974, pp. 317-322.
10. V. Muraoka and D. J. Kuck, “On the time required for a sequence of matrix products,” Commun. Ass. Comput. Mach., vol. 16, pp. 22-26, Jan. 1973.
11. V. Y. Pan, “New methods for the acceleration of matrix multiplications,” in Proc. 20th FOCS Symp., 1979, pp. 28-38.
12. V. Strassen, “Gaussian elimination is not optimal,” Numer. Math., vol. 13, pp. 354-356, 1969.
13. N. K. Tsao, “On accurate evaluation of extended sums,” J. Franklin Inst., vol. 308, pp. 39-55, July 1979.
14. “The numerical instability of Bini's algorithm,” Inform. Process. Lett., vol. 12. pp. 17-19, 1981.
15. J. H. Wilkinson, Rounding Errors in Algebraic Processes. Englewood Cliffs, NJ: Prentice-Hall, 1963.
16. S. Winograd, “A new algorithm for inner product,” IEEE Trans. Comput., vol. C-17, pp. 693-694, July 1968.
17. M.J. Flynn, “Very high speed computing systems,” Proc. IEEE, vol. 54, pp. 1901-1909, Dec. 1966.
18. L. R. Goke and G. J. Lipovski, “Banyan networks for partitioning multiprocessor systems,” in Proc. 1st Annu. Symp. Comput. Arch., Dec. 1973, pp. 21-28.
19. D. H. Lawrie, “Access and alignment of data in an array processor,” IEEE Trans. Comput., ml. C-24, pp. 1145-1155, Dec. 1975.
20. M. C. Pease, “The indirect binary n-cube microprocessor array,” IEEE Trans. Comput., vol. C-26, pp. 458-473, May 1977.
21. H. J. Siegel, “Study of multistage SIMD interconnection networks,” in Proc. 5th Annu. Symp. Comput. Arch., Apr. 1978, pp. 223-229.
22. H. S. Stone, “Parallel processing with the perfect shuffle,” IEEE Trans. Comput., vol. C-20, pp. 153-161, Feb. 1971.
23. D. Y. Chang, D. J. Kuck, and D. H. Lawrie, “On the effective bandwidth of parallel memories,” IEEE Trans. Comput., vol. C-26, pp. 480-490, May 1977.
24. W. D. Strecker, “Analysis of the instruction execution rate in certain computer structures,” Ph.D. dissertation, Carnegie-Mellon Univ., Pittsburgh, PA, 1970.
25. F. Baskett and A. J. Smith, “Interference in multiprocessor computer systems with interleaved memory,” Commun. Ass. Comput. Mach., vol. 19, pp. 327-334, June 1976.
26. D. P. Bhandarkar, “Analysis of memory interference in multiprocessors,” IEEE Trans. Comput., vol. C-24, pp. 897-908, Sept. 1975.