Maximum and minimum mean cycle problems are important problems with many applications in performance analysis of synchronous and asynchronous digital systems including rate analysis of embedded systems, in discrete-event systems, and in graph theory. Karp's algorithm is one of the fastest and commonest algorithms for both of these problems. We present this paper mainly in the context of the maximum mean cycle problem. We show that Karp's algorithm processes more nodes and arcs than needed to nd the maximum cycle mean of a digraph. This observation motivated us to propose a new graph unfolding scheme that remedies this de ciency and leads to two faster algorithms with di erent c haracteristics. Theoretical analysis tells us that our algorithms always run faster than Karp's algorithm and that they are among the fastest to date. Experiments on small benchmark graphs con rm this fact for most of the graphs. These algorithms have been used in building a framework for analysis of timing constraints for embedded systems.
As discussed in REF , the maximum cycle mean problem is a special case of the maximum profit-to-time ratio problem.
Faster Maximum and Minimum Mean Cycle Algorithms for System-Performance Analysis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Computer Science