Faster maximum and minimum mean cycle algorithms for system-performance analysis
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 17 (10) , 889-899
- https://doi.org/10.1109/43.728912
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Determining the minimum iteration period of an algorithmJournal of Signal Processing Systems, 1995
- An algorithm for exact bounds on the time separation of events in concurrent systemsIEEE Transactions on Computers, 1995
- Data flow partitioning for clock period and latency minimizationPublished by Association for Computing Machinery (ACM) ,1994
- Finding minimum cost to time ratio cycles with small integral transit timesNetworks, 1993
- Unfolding and retiming for high-level DSP synthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturingIEEE Transactions on Automatic Control, 1985
- Performance evaluation of concurrent systems using Petri netsInformation Processing Letters, 1984
- Parametric shortest path algorithms with an application to cyclic staffingDiscrete Applied Mathematics, 1981
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978
- Finding All the Elementary Circuits of a Directed GraphSIAM Journal on Computing, 1975