
- 1 A. Agarwal, B. H. Lim, D. Kranz, and J. Kubiatowicz, "APRIL: A processor architecture for multiprocessing," in Proc. of ISCA-17, Seattle, Washington, pp. 104-114, May 1990. Google Scholar
Digital Library
- 2 T. M. Austin and G. S. Sohi, "Dynamic dependence analysis of ordinary programs," in Proc. of ISCA-19, G01d Coast, Australia, pp. 342-351, May 1992. Google Scholar
Digital Library
- 3 M. Butler, T.-Y. Yeh, Y. Part, M. Alsup, H. Scales, and M. Shebanow, "Single instruction stream parallelism is greater than two," in Proc. of ISCA-18, Toronto, Ont., pp. 276-286, May 1991. Google Scholar
Digital Library
- 4 D. E. Culler, A. Sah, K. E. Schauser, T. yon Eiken, and J. Wawrzynek, "Fine-grain parallelism with minimal hardware support: A compiler-controlled threaded abstract machine," in Proc. of ASPLOS- iV, Santa Clara, Calif., pp. 164-175, Apr. 1991. Google Scholar
Digital Library
- 5 W. J. Dally, L. Chao, A. Chien, S. Hassoun, W. Horwat, J. Kaplan, P. Song, B. Totty, and W Wills, rchltecture of a message-driven processor,'' in Proc. of ISCA-14, Pittsburgh, Pennsylvania, pp. 189-195, Jun. 1987. Google Scholar
Digital Library
- 6 N. P. Jouppi and D. W. Wall, "Available instruction-level parallelism for superscalar and superpipelined machines," in Proc. of ASPLOS- III, Boston, Mass., pp. 272-282, Apr. 1989. Google Scholar
Digital Library
- 7 D. j. Kuck, R. Kuhn, D. Padua, B. Leasure, and M. Wolfe, "Dependence graphs and compiler optimizations," in Conf. Rec. of POPL-8, pp. 207-218, Jan. 1981. Google Scholar
Digital Library
- 8 D. J. Kuck, Y. Muraoka, and S. C. Chen, "On the number of operations simultaneously executable in FORTRAN-like programs and their resulting speed-up," IEEE-TC, vol. C-21, pp. 1293-1310, Dec. 1972.Google Scholar
- 9 M. Kumar, "Measuring parallelism in computation-intensive scientific/engineering applications," IEEE-TC, vol. C-37, pp. 1088-1098, Sep. 1988. Google Scholar
Digital Library
- 10 M. S. Lam and R. P. Wilson, "Limits of control flow on parallelism," in Proc. of ISCA-19, Gold Coast, Australia, pp. 46-57, May 1992. Google Scholar
Digital Library
- 11 A. Nicolau and J. A. Fisher, "Measuring the parallelism available for very long instruction word architectures," IEEE-TC, vol. C-33, pp. 968-976, Nov. 1984.Google Scholar
- 12 R. Nikhil and Arvind, "Can dataflow subsume von Neumann computing?" in Proc. of ISCA-16, Jerusalem, Israel, pp. 262-272, May-Jun. 1989. Google Scholar
Digital Library
- 13 G. M. Papadopoulos and D. E. Culler, "Monsoon: An explicit token-store architecture," in Proc. of ISUA-17, Seattle, Wash., pp. 82-91, May 1990. Google Scholar
Digital Library
- 14 E. M. Riseman and C. C. Foster, "The inhibition of potential parallelism by conditional jumps," {EEE-TC, vol. C-21, pp. 1405-1411, Dec. 1972.Google Scholar
- 15 J. E. Smith, "A study of branch prediction strategies,'' in Proc. of ISCA-8, Minneapolis, Minnesota, pp. 135-148, May 1981. Google Scholar
Digital Library
- 16 K. B. Theobald, G. R. Gao, and L. J. Hen dren, "On the limits of program parallelism and its smoothability," ACAPS Tech. Memo 40, Sch. of Comp. Sci., McGill U., Montrdal, Qua., Jun. 1992.Google Scholar
- 17 G. S. Tjaden and M. J. Flynn, "Detection and parallel execution of independent instructions," IEEE-TC, vol. C-19, pp. 889-895, Oct. 1970.Google Scholar
- 18 D. W. Wall, "Limits of instruction-level parallelism,'' in Proc. of ASPLOS-IV, Santa Clara, California, pp. 176-188, Apr. 1991. Google Scholar
Digital Library
Index Terms
On the limits of program parallelism and its smoothability
Recommendations
On the limits of program parallelism and its smoothability
MICRO 25: Proceedings of the 25th annual international symposium on MicroarchitectureConverting thread-level parallelism to instruction-level parallelism via simultaneous multithreading
To achieve high performance, contemporary computer systems rely on two forms of parallelism: instruction-level parallelism (ILP) and thread-level parallelism (TLP). Wide-issue super-scalar processors exploit ILP by executing multiple instructions from a ...
Characterization of ILP Distribution for NASA NAS Parallel Benchmarks
A characterization study of analyzing dynamic instruction traces to characterize program parallelism is conducted. This study supports that the experimental design of supercomputer and parallel computers calls for quantifiable methods to evaluate the ...






Comments