article

Free access

A timed Petri-net model for fine-grain loop scheduling

Authors:

Guang R. Gao,

Yue-Bong Wong,

Qi NingAuthors Info & Claims

ACM SIGPLAN Notices, Volume 26, Issue 6

Pages 204 - 218

https://doi.org/10.1145/113446.113463

Published: 01 May 1991 Publication History

PDF eReader

References

[1]

A. Aiken. Compaction-based parallellzation. (PhD the. sis), Technical Report 88-922, Cornell University, 1988.

Digital Library

Google Scholar

[2]

A. Aiken and A. Nicolau. Optimal loop parallelization. In Proceedings of the 1988 A 6'M SIGPLAN Conference on Programming l;anguagea Design and Implements. tion, June 1988.

Digital Library

Google Scholar

[3]

A. Aiken and A. Nicolau. A realistic resourceconstrained software pipelining algorithm. In Proceed. ings of the Third Workshop on Programming Languages and Compilers for Parallel Computing, Irvine, CA, Angust 1990.

Google Scholar

[4]

Arvind and D. E. Culler. Dataflow architectures. An. nual Reviews in Computer Science, 1:225-253, 1986.

Digital Library

Google Scholar

[5]

Arvind and K. P. Gostelow. Some relationships between asynchronous interpreters of a data flow language. In E. J. Neuhold, editor, Formal Description of Programming Concepts, pages 95-119. North-Holland, 1978.

Google Scholar

[6]

Robert A. Ballance, Arthur B. Maccabe, and Karl J. Ottenstein. The program dependence web: A representation supporting control-, and demand-driven interpretation of imperative languages. In A CM bIG. PLAN'90 Conference on Programming Language De. sign and Implementation, White Plains, iVY, June ~0- ~I~ 1990, page 257. ACM, 1990.

Digital Library

Google Scholar

[7]

M. Beck and K. Pingali. From control flow to datafiow. Technical Report TR-89-1050, Department of Computer Science, Cornell University, Ithaca, NY, 1989.

Google Scholar

[8]

J. Carlier, P. Chretienne, and C. Girault. Modeling scheduling problems with timed Petri nets. In G. Goos and J. Hartmanis, editors, Advances in Petri Nets, LNCS 340, pages 62-82. Springer-Verlag, Berlin, Heidelberg, NY, 1984.

Digital Library

Google Scholar

[9]

P. Chretienne. Les Reseauz de Petri Temporisds (These d'dtat). PhD thesis, Institut de programmation, Universit/~ P. et M. CURIE, C.N.R.S.-E.R.A. 592, Septembet 1984.

Google Scholar

[10]

P. Chretienne. Timed event graphs: A complete study of their controlled executions. In International Workshop on Timed Petri Nets, pages 47-54, Torino, Italy, July 1985. IEEE Computer Society Press.

Digital Library

Google Scholar

[11]

E. G. Coffman. Computer and Job-Shop Scheduling Theory. John Wiley and Sons, New York, 1976.

Google Scholar

[12]

F. Commoner, A. W. Holt, S. Even, and A. Pnueli. Marked directed graphs. Journal of Computer and Systern Sciences, 5:511-523, 1971.

Digital Library

Google Scholar

[13]

J. B. Dennis. Packet communication architecture. In Proceedings of the 1975 Sagamore Computer Confer. ence on Parallel Processing, 1975.

Google Scholar

[14]

J. B. Dennis. Data flow supercomputers. IEEE Com. purer, 13(11):48-56, November 1980.

Digital Library

Google Scholar

[15]

J. B. Dennis. Data flow for supercomputers. In Pro. ceedings of the 198j CompCon, March 1984.

Google Scholar

[16]

J.B. Dennis, J. B. Fosseen, and J. P. Linderman. Data flow schemas. In International Symposium on Theoretical Programming, LNCS 5, pages 187-215. Springer- Vcrlag, Berlin, Heidelberg, NY, 1972.

Digital Library

Google Scholar

[17]

K. Ebcio~lu. A compilation technique for software pipelining of loops with conditional jumps. In Proceed. ings of the 20th Annual Workshop on Microprogrammine, December 1987.

Digital Library

Google Scholar

[18]

K. Ebcio~lu and A. Nicolau. A global resourceconstrained parallellzatlon technique. In Proceedings o/ the A CM SIGARCH international Conference on Supercomputing, June 1989.

Digital Library

Google Scholar

[19]

J.T. Feo. An analysis of the computational and parallel complexity of the Livermore loops. Parallel Computer, 8(7):163-185, July 10SS.

Google Scholar

[20]

J. Fcrrantc, K. J. Ottcnstcin, and J. D. Warren. The program dependence graph and its use in optimization. A CM Tranzaction~ on Programming Languages and Systems, 9(3):319-349, July 1987.

Digital Library

Google Scholar

[21]

G.R. Gao. A pipelined code mapping scheme for static datafiow computers. Technical Report TR-371, Laboratory for Computer Science, MIT, 1986.

Google Scholar

[22]

G. R. Gao. A Code Mapping Scheme for Dataflow Software Pipelinin~. Kluwer Academic Publishers, Boston, December 1990.

Digital Library

Google Scholar

[23]

G. R. Gao and Z. Paraskevas. Compiling for datafiow software pipelining. In D. Gelerntcr, A. Nicolau, and D. Padua, editors, Languages and Compilers/or Parallel Computing, pages 275-303. MIT Press, 1990.

Digital Library

Google Scholar

[24]

G. R. Gao, Y. B. Wong, and Qi Ning. A Pctri-Nct model for fine-grain loop scheduling. ACAPS Technical Memo 18, School of Computer Science, McGill University, Montreal, January 1991.

Google Scholar

[25]

M. R. Garry and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP- Completeness. W. H. Freeman and Company, New York, 1979.

Digital Library

Google Scholar

[26]

IBM Corporation. IBM RISC System/6000 Technology, 1990.

Google Scholar

[27]

G. Kahn. The semantics of a simple language for parallel processing. In Information Proce~ing 74, pages 471-475, 1974.

Google Scholar

[28]

L. Kohn and N. Margulls. Introducing the Intel i860 64- bit microprocessor. IEEE Micro, pages 15-30, August 1989.

Digital Library

Google Scholar

[29]

Monies Lain. Software plpelining: An effective scheduling technique for VLIW machines. In Proceedings of the 1988 A CM SIGPLAN Conference on Programming Languages Design and Implementation, pages 318-328, Atlanta, CA, June 1988.

Digital Library

Google Scholar

[30]

J. Magott. Performance evaluation of concurrent systems using Petri nets. Information Processing Letter~, North-Holland, 18:7-13, January 1984.

Google Scholar

[31]

J. R. McGraw and ctal. SISAL: Streams and iteration in a single assignment language--language refcrcnce manual version 1.2. Technical Report M-146, Lawrence Livcrmore National Laboratory, 1985.

Google Scholar

[32]

A. Nicolau, K. Pingali, and A. Aikcn. Fine-grain compilation for pipclincd machines. Technical Report TR- 88-934, Department of Computer Science, CorneU Univcrsity, ithaca, NY, 1988.

Digital Library

Google Scholar

[33]

R. S. Nikhil. Id (Version SS.0) reference manual. Computation Structures Group Memo 284, Laboratory for Computer Science, MIT, March 1988.

Google Scholar

[34]

G. M. Papadopoulos and D. E. Culler. Monsoon: An explicit token-store architecture. In Proceedings of the Seventeenth Annual International Symposium of Computer Architecture, Seattle, Washington, pages 82-91, 1990.

Digital Library

Google Scholar

[35]

J. L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1981.

Digital Library

Google Scholar

[36]

C. V. Ramamoorthy and O. S. Ho. Performance evaluation of asynchronous concurrent systems using Pctri Nets. IEEE Transactions on Computers, pages 440- 448, September 1980.

Google Scholar

[37]

C. Ramchandani. Analysis of asynchronous concurrent systems. Technical Report TR-120, Laboratory for Computer Science, MIT, 1974.

Digital Library

Google Scholar

[38]

B. R. Rau and C. D. Glaeser. Some scheduling techniqucs and an easily schedulable horizontal architecture for high performance scientific computing. In Proceedino8 of the 14th Annual Workshop on Microprogramruing, pages 183-198, 1981.

Crossref

Google Scholar

[39]

B. R. Rau, D. Yen, W. Yen, and R. A. Towle. The Cydro 5 departmental supercomputcr. IEEE Computer, 22(1):12-35, January 1989.

Digital Library

Google Scholar

[40]

R. Tio. The A-code assembly language reference manual. ACAPS Design Note 02, School of Computer Science, McGiU University, Montreal, July 1988.

Google Scholar

[41]

R. Tio. DASM: The A-code data-driven assembler program reference manual. ACAPS Design Note 03, School of Computer Science, McGill University, Montreal, July 1988.

Google Scholar

[42]

R. F. Touzeau. A FORTRAN compiler for the FPS- 164 scientific computer. In Proceedings of the A CM SIGPLAN '8,~ Symposium on Compiler Construction, pages 48-57, June 1984.

Digital Library

Google Scholar

[43]

J.D. Ullman. NP-complete scheduling problems. Journal of Computer System Science, 10:384-393, 1975.

Digital Library

Google Scholar

Cited By

View all

Gotha (2011)Les problèmes d'ordonnancementRAIRO - Operations Research10.1051/ro/199327010077127:1(77-150)Online publication date: 29-Mar-2011
https://doi.org/10.1051/ro/1993270100771
Allan VAllan S(2010)Software PipeliningThe Compiler Design Handbook10.1201/9781420040579.ch18Online publication date: 7-Mar-2010
https://doi.org/10.1201/9781420040579.ch18
Campi FDeledda APizzotti MCiccarelli LRolandi PMucci CLodi AVitkovski AVanzolini LLauwereins RMadsen J(2007)A dynamically adaptive DSP for heterogeneous reconfigurable platformsProceedings of the conference on Design, automation and test in Europe10.5555/1266366.1266371(9-14)Online publication date: 16-Apr-2007
https://dl.acm.org/doi/10.5555/1266366.1266371
Show More Cited By

Index Terms

A timed Petri-net model for fine-grain loop scheduling

Recommendations

A timed Petri-net model for fine-grain loop scheduling
CASCON '91: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research

Efficient execution of loops is one of the most important obstacles facing high-performance computer architectures. Loop scheduling involves handling a partially ordered set of operations which are to be performed repetitively over a number of ...
Using timed Petri net to model instruction-level loop scheduling with resource constraints
Abstract
This paper uses timed Petri net to model and analyze the problem of instruction-level loop scheduling with resource constraints, which has been proven to be an NP complete problem. First, we present a new timed Petri net model to integrate ...
Loop Quantization: Unwinding for Fine-Grain Parallelism Exploitation

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 26, Issue 6

June 1991

352 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/113446

Editor:
Richard L. Wexelblat
IDA/CSED, Alexandria, VA

Issue’s Table of Contents

PLDI '91: Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
May 1991
356 pages
ISBN:0897914287
DOI:10.1145/113445
Chairman:
David S. Wise
Indiana Univ., Bloomington

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1991

Published in SIGPLAN Volume 26, Issue 6

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

42
Total Citations
View Citations
600
Total Downloads

Downloads (Last 12 months)102
Downloads (Last 6 weeks)27

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gotha (2011)Les problèmes d'ordonnancementRAIRO - Operations Research10.1051/ro/199327010077127:1(77-150)Online publication date: 29-Mar-2011
https://doi.org/10.1051/ro/1993270100771
Allan VAllan S(2010)Software PipeliningThe Compiler Design Handbook10.1201/9781420040579.ch18Online publication date: 7-Mar-2010
https://doi.org/10.1201/9781420040579.ch18
Campi FDeledda APizzotti MCiccarelli LRolandi PMucci CLodi AVitkovski AVanzolini LLauwereins RMadsen J(2007)A dynamically adaptive DSP for heterogeneous reconfigurable platformsProceedings of the conference on Design, automation and test in Europe10.5555/1266366.1266371(9-14)Online publication date: 16-Apr-2007
https://dl.acm.org/doi/10.5555/1266366.1266371
Rajagopalan MAllan V(1994)Specification of software pipelining using Petri netsInternational Journal of Parallel Programming10.1007/BF0257773522:3(273-301)Online publication date: 1-Jun-1994
https://dl.acm.org/doi/10.1007/BF02577735
Chao Sha (1993)Static scheduling of uniform nested loopsProceedings of the 1993 Seventh International Parallel Processing Symposium10.1109/IPPS.1993.262890(254-258)Online publication date: 13-Apr-1993
https://dl.acm.org/doi/10.1109/IPPS.1993.262890
Rocha JPáscoa Dias OGomes L(2018)Improving Synchronous Dataflow Analysis Supported by Petri Net MappingsElectronics10.3390/electronics71204487:12(448)Online publication date: 18-Dec-2018
https://doi.org/10.3390/electronics7120448
Allan VAllan S(2010)Software PipeliningThe Compiler Design Handbook10.1201/9781420040579.ch18Online publication date: 7-Mar-2010
https://doi.org/10.1201/9781420040579.ch18
Grasset AMillet PBonnot PYehia SPutzke-Roeming WCampi FRosti AHuebner MVoros NRossi DSahlbach HErnst R(2010)The MORPHEUS Heterogeneous Dynamically Reconfigurable PlatformInternational Journal of Parallel Programming10.1007/s10766-010-0160-339:3(328-356)Online publication date: 17-Dec-2010
https://doi.org/10.1007/s10766-010-0160-3
Campi FDeledda ARossi DCoppola MPieralisi LLocatelli RMaruccia GDeMarco TRies FKühnle MHübner MBecker J(2009)The MORPHEUS Data Communication and Storage InfrastructureDynamic System Reconfiguration in Heterogeneous Platforms10.1007/978-90-481-2427-5_8(93-105)Online publication date: 2009
https://doi.org/10.1007/978-90-481-2427-5_8
Campi FDeledda APizzotti MCiccarelli LRolandi PMucci CLodi AVitkovski AVanzolini L(2007)A dynamically adaptive DSP for heterogeneous reconfigurable platforms2007 Design, Automation & Test in Europe Conference & Exhibition10.1109/DATE.2007.364559(1-6)Online publication date: Apr-2007
https://doi.org/10.1109/DATE.2007.364559
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations