Annual review of computer science vol. 1, 1986
The program dependence graph and its use in optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modelling scheduling problems with timed Petri nets
Advances in Petri Nets 1984
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Software pipelining: an effective scheduling technique for VLIW machines
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Compiling for dataflow software pipelining
Selected papers of the second workshop on Languages and compilers for parallel computing
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
A compilation technique for software pipelining of loops with conditional jumps
MICRO 20 Proceedings of the 20th annual workshop on Microprogramming
A global resource-constrained parallelization technique
ICS '89 Proceedings of the 3rd international conference on Supercomputing
Monsoon: an explicit token-store architecture
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
A Fortran compiler for the FPS-164 scientific computer
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
A Code Mapping Scheme for Dataflow Software Pipelining
A Code Mapping Scheme for Dataflow Software Pipelining
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Timed Event Graphs: A Complete Study of Their Controlled Executions
International Workshop on Timed Petri Nets
Proceedings of the International Sympoisum on Theoretical Programming
MICRO 14 Proceedings of the 14th annual workshop on Microprogramming
Compaction-Based Parallelization
Compaction-Based Parallelization
Fine-Grain Compilation for Pipelined Machines
Fine-Grain Compilation for Pipelined Machines
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
| Hi-index | 0.00 |
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 iterations.In this paper we study loop scheduling using Petri nets, due to their unique power for modeling both partial orders and cycles. The behavior of loops can be modeled by constructing, at compile time, a Petri-net behavior graph which exhibits a repetitive firing sequence known as a cyclic frustum. From a cyclic frustum, a time-optimal schedule for the corresponding loop can be derived. A polynomial time bound for such a cyclic frustum to occur has been established. Simulation results on a number of Livermore loops, both with and without loop-carried dependences, have demonstrated the feasibility of determining the cyclic frustum at compile time.