In: Proceedings of the 12th International Conference on Application and Theory of Petri Nets, 1991, Gjern, Denmark, pages 22-41. June 1991.
Abstract: The authors use dataflow graphs as program representation for a class of loops, and they develop a timed Petri net model to model these loops. The behavior graph of the Petri net is used to determine a repetitive execution pattern. Such a pattern can be used to generate parallel instructions schedule during code generation. The authors show that, after the earliest firing schedule is relaxed to satisfy an initial token-distribution constraint, the repetitive pattern of a loop can be detected in O(nē) iterations. The authors have examined the application of the behavior graph approach to a target pipelined architecture.
Keywords: timed net model (for) loop scheduling; data flow graph; net behaviour graph; repetitive execution pattern; earliest firing schedule; parallel instructions schedule generation; target pipelined architecture.
Back to the Petri Nets Bibliography