Advertisement

New priority-lists for scheduling in timed Petri nets

  • Toshimasa Watanabe
  • Masahiro Yamauchi
Full Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 691)

Abstract

The subject of the paper is to propose two new priority-lists for scheduling in timed Petri nets. Both of the proposed priority-lists are constructed by taking feasibility into consideration, and our experimental evaluation on 10200 test problems shows their superiority over those by the Sifakis bounds that have been widely used.

Keywords

Completion Time Test Problem Task Graph Cyclic Schedule Marked Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    H.Arai, A.Fujimori and T.Hisamura, Applications of Timed Petri Net to Scheduling Problems of Repetitive Processes and Their Restoring Strategies in Emergency Stops, Trans. Society of Instrument and Control Engineers, Vol. 22, No.9(1986), pp. 955–961. (in Japanese)Google Scholar
  2. [2]
    J.Campos, G.Chiola and M.Silva, Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector, IEEE Trans. Software Engineering, Vol. SE-17, No.2(1991),pp 117–125.Google Scholar
  3. [3]
    J.Campos, G.Chiola, J.M.Colom and M.Silva, Tight Polynomial Bounds for Steady-State Performance of Marked Graphs, Proc. 3rd International Workshop on Petri Nets and Performance Models (December 1989), pp.200–209.Google Scholar
  4. [4]
    E. G.Coffman, Computer and Job-Shop Scheduling Theory, John Wiley & Sons, N. Y., 1976.Google Scholar
  5. [5]
    F.Commoner, A. W. Holt, S. Even and A. Pnueli, Marked Directed Graphs, J. Computer and System Sciences, Vol. 5, No.5(1971), pp. 511–523.Google Scholar
  6. [6]
    M. R.Carey and D. S.Johnson, Computers and Intractability: A Guide to the Theory of NP-completencss, Freeman, San Francisco, CA, 1978.Google Scholar
  7. [7]
    R. L. Graham, Bounds on Multiprocessing Timing Anomalies, SIAM J. Appl. Math., Vol. 17, No.2(1969), pp. 416–429.Google Scholar
  8. [8]
    R. L.Graham, E. L.Lawler, J. K.Lenstra and A. H. G. Rinnooy Kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey, Annals of Discrete Mathematics Vol. 5(1979), pp. 287–326.Google Scholar
  9. [9]
    H. P.Hillion and J. M.Proth, Performance Evaluation of Job-Shop Systems Using Timed Event-Graphs, IEEE Trans. Automatic Control, Vol. 34, No.1(1989), pp. 3–9.Google Scholar
  10. [10]
    K.Iwano and S.Yeh, An Efficient Algorithm for Optimal Loop Parallelization, Research Report RT 0043, IBM Research, Tokyo Research Laboratory, Chiyoda-Ku, Tokyo, Japan (March, 1990).Google Scholar
  11. [11]
    H.Kasahara and S.Narita, A Practical Optimal/Approximate Algorithm for Multi-Processor Scheduling Problem, Trans. IEICE of Japan, Vol. J67-D, No.7(1984), pp. 792–799. (in Japanese)Google Scholar
  12. [12]
    J.Magott, Performance Evaluation of Concurrent Systems Using Petri Nets, Information Processing Letters, 18(1984), pp. 7–13.Google Scholar
  13. [13]
    J.Magott, Performance Evaluation of Systems of Cyclic Sequential Processes with Mutual Exclusion Using Petri Nets, Information Processing Letters Vol. 21 (1985), pp. 229–232.Google Scholar
  14. [14]
    J.Magott, New NP-Complete Problems in Performance Evaluation of Concurrent Systems Using Petri Nets, IEEE Trans. Software Engineering, Vol. SE-13, No.5(1987), pp. 578–581.Google Scholar
  15. [15]
    J.Martinez and M.Silva, A Simple and Fast Algorithm to Obtain All Invariants of a Generalized Petri Net, Fachberichte Informatik, Vol.52, (C.Girault and W.Reisig (Eds)), Springer-Verlag, Berlin, pp. 301–310 (1982).Google Scholar
  16. [16]
    R. R.Muntz and E. G.Coffman, Jr., Optimal Preemptive Scheduling on Two-Processor Systems, IEEE Trans. on Computers, Vol. C-18, No.11(1969), pp. 1014–1020.Google Scholar
  17. [17]
    I.Nabeshima, Sukejuringu-Riron (Theory of Scheduling), Morikita Shuppan Pub. Co. Ltd., 1974. (in Japanese)Google Scholar
  18. [18]
    K.Onaga, Scheduling of Extended Marked Graphs, Trans. IEICE, Vol. J69-A, No.2(1986), pp. 241–251. (in Japanese)Google Scholar
  19. [19]
    K.Onaga, T.Watanabe and M.Silva, On Periodic Schedules for Deterministically Timed Petri Nets Systems, Proc. 4th International Workshop on Petri Nets and Performance Models (PNPM91) (Dec., 1991), pp.210–215. (See also: K.Onaga, M.Silva and T.Watanabe, Qualitative Analysis of Periodic Schedules for Deterministically Timed Petri Nets Systems, Trans. IEICE, Vol.E76-A, No.4(1993), to appear.)Google Scholar
  20. [20]
    J. L. Peterson: Petri Net Theory and the Modeling of Systems, Prentice-Hall, Englewood Cliffs, N.J., 1981.Google Scholar
  21. [21]
    C. V. Ramamoorthy and G. S. Ho, Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets, IEEE Trans. Software Eng., Vol. 6, No.5(1983), pp. 440–449Google Scholar
  22. [22]
    W. Reisig: Petri Nets/An introduction, Springer-Verlag, Berlin, 1982.Google Scholar
  23. [23]
    R.Reiter, Scheduling Parallel Computations, J. Assoc. Computing Math., 15, pp. 590–599 (1968).Google Scholar
  24. [24]
    R.Reiter, On Assembly-Line Balancing Problems, Operations Research, Vol. 17, No.4(1969), pp. 685–700.Google Scholar
  25. [25]
    J. Sifakis, Modeling and Performance Evaluation of Computer Systems, Proc. Third International Symposium on Measuring, Modeling and Evaluating Computer Systems, (H.Beilner and E.Gelenbe (Eds.)), North-Holland, Amstedam, pp. 75–93(1977).Google Scholar
  26. [26]
    T.Tanida, T.Watanabe, K.Masuoka and K.Onaga, Scheduling in a Timed Petri Net Model of a Repeatedly Executing Set of Tasks—Priority-List Scheduling—, Tech. Rep. IEICE of Japan, COMP92-94, pp.41–48 (March 1992).Google Scholar
  27. [27]
    T.Tanida, T.Watanabe, M.Yamauchi and K.Onaga, Priority-List Scheduling in Timed Petri Nets, Trans. IEICE of Japan, Vol. E 75, No.10(1992), pp. 1394–1406.Google Scholar
  28. [28]
    T. Watanabe, Y. Mizobata and K. Onaga, Minimum Initial Marking Problems of Petri Nets, Trans. IEICE of Japan, Vol. E72, No.12(1989), pp. 1390–1399.Google Scholar
  29. [29]
    T. Watanabe, Y. Mizobata and K. Onaga, Time Complexity of Legal Firing Sequence and Related Problems of Petri Nets, Trans. IEICE of Japan, E72, No.12(1989), pp. 1400–1409.Google Scholar
  30. [30]
    T.Watanabe, T.Tanida, M.Yamauchi and K.Onaga, The Minimum Initial Marking Problem for Scheduling in Timed Petri Nets, Trans. IEICE of Japan, Vol. E75, No.10(1992), pp. 1407–1421.Google Scholar
  31. [31]
    M.Yamauchi, T. Tanida, T. Watanabe and K.Onaga, Scheduling in Timed Petri Net Model of a Repeatedly Executing Set of Tasks—Minimum Initial Marking Problems—, Tech. Rep. IEICE of Japan, COMP91-93, pp.29–40 (March 1992).Google Scholar
  32. [32]
    M.Yamauchi and T. Watanabe, Experimental Evaluation of Priority-List Schedulings in Timed Petri Nets, Tech. Rep. IEICE of Japan, CASP92-46, pp.33–4(September 1992).Google Scholar
  33. [33]
    M.Yamauchi and T.Watanabe, Constructing Priority-Lists for Scheduling of Timed Petri Nets, Tech. Rep. IEICE of Japan, COMP92-62, pp.11–20 (November 1992).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Toshimasa Watanabe
    • 1
  • Masahiro Yamauchi
    • 1
  1. 1.Department of Circuits and Systems, Faculty of EngineeringHiroshima University 4-1Higashi-HiroshimaJapan

Personalised recommendations