In: Proceedings of the International Conference on Supercomputing, 1988, Saint-Malo, France, pages 466-477. New York, NY: Association for Computing Machinery, 1988.
Abstract: This paper deals with the minimization of the asymptotic latency of horizontal microprograms performing vectorial loops. The authors show that all the constraints can be formalized to give a cyclic scheduling problem, modelled with a timed Petri net. To analyze the net behavior, a bivalued resolution graph is built. A critical cycle of this graph leads to microprograms whose structure is independent of the number of iterations.
Keywords: horizontal microprogram; timed net; cyclic scheduling problem; bivalued resolution graph; parallel processing; vector processing.
Back to the Petri Nets Bibliography