The hierarchical task graph and its use in auto-scheduling

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The hierarchical task graph and its use in auto-scheduling

Full text

Pdf (1.24 MB)

Source

International Conference on Supercomputing archive
Proceedings of the 5th international conference on Supercomputing table of contents

Cologne, West Germany

Pages: 252 - 263

Year of Publication: 1991

ISBN:0-89791-434-1

Author

Constantine D. Polychronopoulos

Center for Supercomputing Research and Development, Dept. of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois

Sponsor

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 53, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions 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/109025.109089 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.

	AhSU86	Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	AlKe82	J.R. Allen and K. Kennedy, "PFC: A Program to Convert Fortran to Parallel Form," Techn. Rept. MASC-TR82-6, Rice University, Houston, Texas,March 1982.
	ArNi87	Arvind , R S Nikhil, Executing a program on the MIT tagged-token dataflow architecture, Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe, p.1-29, March 1987, Eindhoven, The Netherlands
	ABLL90	T.E. Anderson, B.N. Bershad, E.D. Lazowska, H.M. Levy, "Scheduler Activations: Effective Kernel Support for the User-Level Management of Parallelism," Technical Rept. 90-04-02, Dept. of Computer Science, University of Washington, April, 1990.
	Beck90	C. Beckmann, "Reducing Synchronization and Scheduling Overhead in Parallel Loops," M.S. Thesis, Technical Report CSRD-TR-992, Center for Supercomputing Research and Development, University of Illinois, October 1989.
	Cray85	Multitasking User Guide, Cray Computer Systems Technical Note, SN-0222, January, 1985.
	FeOW87	Jeanne Ferrante , Karl J. Ottenstein , Joe D. Warren, The program dependence graph and its use in optimization, ACM Transactions on Programming Languages and Systems (TOPLAS), v.9 n.3, p.319-349, July 1987 [doi>10.1145/24039.24041]
	GPKK82	D. Gajski, D. Padua, D. Kuck and R. Kuhn, "A Second Opinion on Dataflow Machines and Languages," IEEE Computer, February 1982.
	GiPo90a	M. Girkar and C.D. Polychronopoulos, "Automatic Detection and Exploitation of Functional Parallelism from Control and Data Dependences", to appear in IEEE Trans. on Parallel and Distributed Comp., 1991.
	KKPL81	D. J. Kuck , R. H. Kuhn , D. A. Padua , B. Leasure , M. Wolfe, Dependence graphs and compiler optimizations, Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.207-218, January 26-28, 1981, Williamsburg, Virginia [doi>10.1145/567532.567555]
	Kuck78	David L. Kuck, Structure of Computers and Computations, John Wiley & Sons, Inc., New York, NY, 1978
	Lee90	C.-L. Lee, "On Run-Time Systems for Parallel Supercomputer", M.S. Thesis, CSRD TR-997, University of Illinois at Urbana-Champaign, May 1990.
	Poly88a	C. D. Polychronopoulos, "Towards Auto- Scheduling Compilers," The Journal of Supercomputing, Vol. 2, No. 3, November 1988.
	Poly89	C. D. Polychronopoulos, "Multiprocessing vs. Multiprogramming", Proc. of the 1989 International Conference on Parallel Processing, St. Charles, IL, August, 1989.
	Poly90	C. D. Polychronopoulos, "Auto-Scheduling: Control Flow and Data Flow Come Together", CSRD Technical Report No. 1058, Center for Supercomputing Research and Development, University of Illinois, Urbana, IL, November 1990.
	SmHH90	J. E. Smith , W.-C. Hsu , C. Hsiung, Future general purpose supercomputer architectures, Proceedings of the 1990 conference on Supercomputing, p.796-804, October 1990, New York, New York, United States

CITED BY 6

	David R. Wallace, Low level scheduling using the hierarchical task graph, Proceedings of the 6th international conference on Supercomputing, p.72-81, July 19-24, 1992, Washington, D. C., United States
	Peter L. Bird , Uwe F. Pleban, A semantics-directed partitioning of a processor architecture, Proceedings of the 1991 ACM/IEEE conference on Supercomputing, p.702-709, November 18-22, 1991, Albuquerque, New Mexico, United States
	Wolf Zimmermann , Welf Lowe, Foundations for the integration of scheduling techniques into compilers for parallel languages, International Journal of Computational Science and Engineering, v.1 n.2-4, p.99-109, May 2005
	Milind Girkar , Constantine D. Polychronopoulos, Extracting task-level parallelism, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.4, p.600-634, July 1995
	M. Danelutto, Irregularity handling via structured parallel programming, International Journal of Computational Science and Engineering, v.1 n.2-4, p.73-85, May 2005
	Apostolos A. Kountouris , Christophe Wolinski, Efficient scheduling of conditional behaviors for high-level synthesis, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.7 n.3, p.380-412, July 2002