Experimental analysis of the fastest optimum cycle ratio and mean algorithms

ACM Transactions on Design Automation of Electronic Systems

Volumn 9, Issue 4, 2004, Pages 385-418

  Dasdan, Ali ^a  

^a SYNOPSYS INC   (United States)

Author keywords

Cycle mean; Cycle period; Cycle ratio; Cycle time; Data flow graphs; Discrete event systems; Experimental analysis; Iteration bound; System performance analysis

Indexed keywords

EID: 30744446734     PISSN: 10844309     EISSN: 10844309     Source Type: Journal    
DOI: 10.1145/1027084.1027085     Document Type: Article

References (44)

1. AHUJA, R. K., KODIALAM, M., MISHRA, A. K., AND ORLIN, J. B. 1997. Computational investigations of maximum flow algorithms. Europ. J. Oper. Res. 97, 509-542.
2. AHUJA, R. K., MAGNANTI, T. L., AND ORLIN, J. B. 1993. Network Flows. Prentice Hall, Upper Saddle River, N.J.
3. ALBRECHT, C., KORTE, B., SCHIETKE, J., AND VYGEN, J. 1999. Cycle time and slack optimization for VLSI chips. In Proceedings of the International Conference on Computer-Aided Design. IEEE Computer Society Press, Los Alamitos, Calif., 232-238.
4. ALPERT, C. J. 1998. The ISPD98 circuit benchmark suite. In Proceedings of the International Symposium on Physical Design. ACM/IEEE, New York, 588-593.
5. BACELLI, F., COHEN, G., OLSDER, G. J., AND QUADRAT, J.-P. 1992. Synchronization and Linearity. Wiley, New York.
6. BURNS, S. M. 1991. Performance analysis and optimization of asynchronous circuits. Ph.D. dissertation, California Institute of Technology.
7. CARLONI, L. P. AND SANGIOVANNI-VINCENTELLI, A. L. 2000. Performance analysis and optimization of latency insensitive systems. In Proceedings of the 37th Design Automation Conference. IEEE Computer Society Press, Los Alamitos, Calif., 361-367.
8. CHANDRACHOODAN, N., BHATTACHARYYA, S. S., AND LIU, K. R. 1999. Negative cycle detection in dynamic graphs. Tech. Rep. UMIACS-TR-99-59, Institute for Advanced Computer Studies, Univ. of Maryland at College Park, College Park, Md., Sept.
9. CHERKASSKY, B. V. AND GOLDBERG, A. V. 1996. Negative-cycle detection algorithms. In Proceedings of the 4th European Symposium on Algorithms. 349-363.
10. COCHET-TERRASSON, J., COHEN, G., GAUBERT, S., MCGETTRICK, M., AND QUADRAT, J.-P. 1998. Numerical computation of spectral elements in max-plus algebra. In Proceedings of the IFAC Conference on System Structure and Control.
11. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. 1991. Introduction to Algorithms. MIT Press, Cambridge, Mass.
12. CUNINGHAME-GREEN, R. A. AND YIXUN, L. 1996. Maximum cycle-means of weighted digraphs. Applied Math.-JCU 11, 225-234.
13. DANTZIG, B., BLATTNER, W., AND RAO, M. R. 1967. Finding a cycle in a graph with minimum cost to times ratio with applications to a ship routing problem. In Theory of Graphs, P. Rosenstiehl, Ed. Dunod, Paris and Gordon and Breach, New York, 77-84.
14. DASDAN, A. 2002. A strongly polynomial algorithm for over-constraint resolution. In Proceedings of the 10th International Symposium on HW/SW Codesign (CODES). 127-132.
15. DASDAN, A. AND GUPTA, R. K. 1998. Faster maximum and minimum mean cycle algorithms for system performance analysis. IEEE Trans. Computer-Aided Design 17, 10 (Oct.), 889-99.
16. DASDAN, A., IRANI, S., AND GUPTA, R. K. 1998. An experimental study of minimum mean cycle algorithms. Tech. Rep. #98-32, University of California, Irvine, Calif, July.
17. DASDAN, A., IRANI, S., AND GUPTA, R. K. 1999. Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems. In Proceedings of the 36th Design Automation Conference.
18. GOLDBERG, A. V. 2001. A practical shortest path algorithm with linear expected time. Submitted to SIAM J. Comput., http://www.avglab.com/andrew/.
19. GONDRAN, M. AND MINOUX, M. 1984. Graphs and Algorithms. Wiley, New York.
20. HARTMANN, M. AND ORLIN, J. B. 1993. Finding minimum cost to time ratio cycles with small integral transit times. Networks 23, 567-574.
21. HOWARD, R. A. 1960. Dynamic Programming and Markov Processes. The M.I.T. Press, Cambridge, Mass.
22. HULGAARD, H., BURNS, S. M., AMON, T., AND BORRIELLO, G. 1995. An algorithm for exact bounds on the time separation of events in concurrent systems. IEEE Trans. Comput. 44, 11 (Nov.), 1306-1317.
23. ITO, K. AND PARHI, K. K. 1995. Determining the minimum iteration period of an algorithm. J. VLSI Signal Proce. 11, 3 (Dec.), 229-44.
24. JAIN, R. 1991. The Art of Computer Systems Peformance Analysis. Wiley-Interscience, New York.
25. JOHNSON, D. S., MCGEOCH, L. A., AND ROTHBERG, E. E. 1996. Asymptotic experimental analysis for the held-karp traveling salesman bound. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 341-350.
26. KARP, R. M. 1978. A characterization of the minimum cycle mean in a digraph. Disc. Math. 23, 309-311.
27. KARP, R. M. AND ORLIN, J. B. 1981. Parametric shortest path algorithms with an application to cyclic staffing. Disc. Appl. Math. 3, 37-45.
28. LAWLER, E. L. 1976. Combinatorial Optimization: Networks and Matroids. Holt, Reinhart, and Winston, New York.
29. MADANI, O. 2000. Complexity results for infinite-horizon Markov decision processes. Ph.D. dissertation, University of Washington.
30. MATHUR, A., DASDAN, A., AND GUPTA, R. K. 1998. Rate analysis of embedded systems. ACM Trans. Design Automat. Elect. Syst. 3, 3 (July), 408-436.
31. MEHLHORN, K. AND NAHER, S. 1995. LEDA: A platform for combinatorial and geometric computing. Commun. ACM 38, 1, 96-102.
32. MEHLHORN, K. AND NAHER, S. 2000. LEDA: A Platform for Combinatorial and Geometric Computing. The Cambridge University Press, New York.
33. MENDENHALL, W. AND BEAVER, R. J. 1994. Introduction to Probability and Statistics. Duxbury Press, Belmont, Calif.
34. NIELSEN, C. D. AND KISHINEVSKY, M. 1994. Peformance analysis based on timing simulation. In Proceedings of the 31st Design Automation Conference. IEEE, Computer Society Press, Los Alamitos, Calif., 70-76.
35. ORLIN, J. B. AND AHUJA, R. K. 1992. New scaling algorithms for the assignment and minimum mean cycle problems. Math. Prog. 54, 41-56.
36. RADZIK, T. AND GOLDBERG, A. V. 1994. Tight bounds on the number of minimum-mean cycle cancellations and related results. Algorithmica 11, 226-242.
37. RAMAMOORTHY, C. V. AND Ho, G. S. 1980. Performance evaluation of asynchronous concurrent systems using petri nets. IEEE Trans. Software Eng. 6, 5 (Sept.), 440-9.
38. SHENOY, N. AND RUDELL, R. 1994. Efficient implementation of retiming. In Proceedings of the 31st Design Automation Conference. IEEE, Computer Society Press, Los Alamitos, Calif., 226-33.
39. SKOROBOHATYJ, G. 1993. Code for finding a minimum mean cycle in a directed graph. WWW document, Konrad-Zuse-Zentrum fur Informationstechnik Berlin, (http://elib.zib.de/pub/Packages/mathprog/netopt/mmc/).
40. SZYMANSKI, T. G. 1992. Computing optimal clock schedules. In Proceedings of the 29th Design Automation Conference. ACM, New York, 399-404.
41. TARJAN, R. E. 1981. Shortest paths. Tech. Rep., AT&T Bell Laboratories, Murray Hill, N.J.
42. TARJAN, R. E. 1983. Data Structures and Network Algorithms. Society for Industrial and Applied Math., Philadelphia, Pa.
43. TEICH, J., SRIRAM, S., THIELE, L., AND MARTIN, M. 1997. Performance analysis and optimization of mixed asynchronous synchronous systems. IEEE Trans. Computer-Aided Design 16, 5 (May), 473-484.
44. YOUNG, N. E., TARJAN, R. E., AND ORLIN, J. B. 1991. Faster parametric shortest path and minimumbalance algorithms. Networks 21, 205-221.