A Scheme to Enforce Data Dependence on Large Multiprocessor Systems

IEEE Transactions on Software Engineering

Volumn SE-13, Issue 6, 1987, Pages 726-739

  Zhu, Chuan Qi ^a   Yew, Pen Chung ^a  

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

Author keywords

Data dependence; multiprocessor; program vectori ; synchronization; zation

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; COMPUTER SYSTEMS, DIGITAL - MULTIPROCESSING; INTEGRATED CIRCUITS, VLSI - APPLICATIONS;

DATA DEPENDENCE TESTS; SHARED-MEMORY MULTIPROCESSOR; SYNCHRONIZATION PRIMITIVES; SYNCHRONIZING PROCESSES;

DATA PROCESSING;

EID: 0023362714     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1987.233477     Document Type: Article

References (21)

1. D. J. Kuck et al., “Dependence graph and compiler optimization,” in Proc. 8th ACM Symp. Principles ofProgramming Languages, Jan. 1981, pp. 207-218.
2. D. J. Kuck, The Structure of Computers and Computations, vol. 1. New York, Wiley, 1978.
3. M. J. Flynn, “Some computer organizations and their effectiveness,” IEEE Trans. Comput., vol. C-21, pp. 948–960, Sept. 1972.
4. D. J. Kuck and R. A. Stokes, “The Burroughs scientific processors (BSP),“ IEEE Trans. Comput., vol. C-31, pp. 363–376, May 1982.
5. “Heterogeneous element processor: Principles of operations,” HEP Tech. Documentation Series, Denelcor, Part 9000001, Feb. 1981.
6. A. Gottlieb et al., “The NYU ultracomputer-Designing an MIMD shared memory parallel computer,” IEEE Trans. Comput., vol. C-32, pp. 175–189, Feb. 1983.
7. A. K. Jones and P. Schwarz, “Experience using multiprocessor systems—A status report,” ACM Comput. Surveys, vol. 12, no. 2, pp. 121–166, June 1980.
8. M. J. Wolfe, “Optimizing supercompilers for supercomputers,” Ph.D. dissertation, Univ. Illinois at Urbana-Champaign, Rep. UIUCDCS-R-82-1105, Oct. 1982.
9. G. Rodrigue, Parallel Computations. New York: Academic, 1982.
10. M. J. Wolfe, “Techniques for improving the inherent parallelism in programs,” M.S. thesis, Univ. Illinois at Urbana-Champaign, Rep. UIUCDCS-R-78-929, July 1978.
11. H. T. Kung, “Synchronized and asynchronous parallel algorithms for multiprocessor,” in Algorithms and Complexity, J. F. Troub, Ed. New York: Academic, 1976.
12. Y. Muraoka, “Parallelism exposure and exploitation in programs,” Ph.D. dissertation, Univ. Illinois at Urbana-Champaign, Rep. UIUCDCS-R-71-424, Feb. 1971.
13. C. Q. Zhu and P. C. Yew, “A synchronization scheme and its applications for large multiprocessor systems,” in Proc. 4th Int. Conf. Distributed Computing Systems, May 1984, pp. 486–493.
14. E. W. Dijkstra, “Cooperating sequential processes,” in Programming Languages, F. Genuys, Ed. New York: Academic, 1968.
15. P. Tang, C. Q. Zhu, and P. C. Yew, “An implementation of Cedar synchronization primitives,” Lab. Advanced Supercomputers, Univ. Illinois at Urbana-Champaign, Cedar Document 32, Feb. 1984.
16. D. J. Kuck et al., “Parallel supercomputing today and the Cedar approach,” Science, pp. 967–974, Feb. 1986.
17. J. C. Syre et al., “Parallelism, control and synchronization expression in a single assignment language,” in Proc. 4th ACM Comput. Sci. Conf., Feb. 1976.
18. U. Banerjee, “Speedup of ordinary programs,” Ph.D. dissertation, Univ. Illinois at Urbana-Champaign, Rep. UIUCDCS-R-79-989, Oct. 1979.
19. R. Allen et al., “PTOOL: A semi-automatic parallel programming assistant, i n Proc. 1986 Int. Conf. Parallel Processing, Aug. 1986, pp. 164–170.
20. P. Tang and P. C. Yew, “Processor self-scheduling for multiple-nested nested parallel loops,” i n Proc. 1986 Int. Conf. Parallel Processing, Aug. 1986, pp. 528–535.
21. P. C. Yew et al., “Distributing hot-spot addressing in large-scale multiprocessors,” in Proc. 1986 I nt. Conf. Parallel Processing, Aug. 1986, pp. 51–58.