Journal of Systems Integration

, Volume 6, Issue 1–2, pp 41–72 | Cite as

Real-time scheduling for software prototyping

  • Luoi
  • M. Shing
Computer-Aided Prototyping

Abstract

This paper presents several real-time scheduling algorithms developed to support rapid prototyping of embedded systems using the Computer Aided Prototyping System (CAPS). The CAPS tools are based on the Prototyping System Description Language (PSDL), which is a high-level language designed specifically to support the conceptual modeling of real-time embedded systems. This paper describes the scheduling algorithms used in CAPS along with the associated timing constraint and hardware models, which include single and multi-processor configurations.

Keywords

Computer-aided software engineering rapid prototyping hard real-time systems real-time scheduling 

References

  1. 1.
    V. Cerny, “A thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm.”Journal of Optimization Theory and Application 45, pp. 41–45, 1985.CrossRefGoogle Scholar
  2. 2.
    J. Cervantes, “An optimal static scheduling algorithm for hard real-time systems specified in a prototyping language”, Master's Thesis, Computer Science, Naval Postgraduate School Monterey, CA, Dec. 1989.Google Scholar
  3. 3.
    T. Chang, “Static scheduler for hard real-time tasks on multiprocesosr systems,” Master's Thesis, Computer Science, Naval Postgraduate School, Monterey, CA, Dec. 1989.Google Scholar
  4. 4.
    M. Cordeiro, “Distributed hard real-time scheduling for a software prototyping environment”, Doctoral Dissertation, Computer Science, Naval Postgraduate School, Monterey CA, March 1995.Google Scholar
  5. 5.
    B. Fan, “Evaluations of some scheduling algorithms for hard real-time systems,” Master's Thesis, Computer Science, Naval Postgraduate School, Monterey, CA, September 1992.Google Scholar
  6. 6.
    B. Flannery, 1984.Numerical Recipes in C—The Art of Scientific Computing. Cambridge University Press: New York, NY.Google Scholar
  7. 7.
    L. Hsu, “Multiprocessor scheduling for hard real-time software”, Master's Thesis, Computer Science, Naval Postgraduate School, Monterey, CA, June 1990.Google Scholar
  8. 8.
    D. Johnson, C. Aragon, L. McGeoch, and C. Schevon, “Optimization by simulated annealing: An experimental evaluation; Part I, Graph partitioning”.Operations Research 37, pp. 865–892, 1989.Google Scholar
  9. 9.
    D. Johnson, C. Aragon, L. McGeoch, and C. Schevon, “Optimization by simulated annealing: An experimental evaluation; Part II, Graph coloring and number partitioning.”Operations Research 38, 1990.Google Scholar
  10. 10.
    S. Kirkpatrick, C. Gelatt, Jr., and M. Vecchi, “Optimization by simulated annealing.”Science 220, pp. 671–680, 1983.Google Scholar
  11. 11.
    M. Kilic, “Static schedulers for embedded and hard real-time systems”, Master's Thesis, Computer Science, Naval Postgraduate School, Monterey, CA, June 1990.Google Scholar
  12. 12.
    B. Kraemer, Luqi, and V. Berzins, “Compositional semantics of a real-time prototyping language.”IEEE Trans. on Software Engineering SE-19, pp.453–477, 1993.CrossRefGoogle Scholar
  13. 13.
    Luqi, V. Berzins, and R. T. Yeh, “Prototyping language for real-time software”.IEEE Trans. on Software Engineering SE-14, pp. 1409–1423, 1988.CrossRefGoogle Scholar
  14. 14.
    Luqi and V. Berzins, “Rapidly prototyping real-time systems,”IEEE Software 5, pp. 25–36, 1988.CrossRefGoogle Scholar
  15. 15.
    Luqi and V. Berzins, “Semantics of real-time languages,” inProceedings of the Real-Time Systems Symposium, Huntsville, AL, 1988, pp. 106–110.Google Scholar
  16. 16.
    Luqi and V. Berzins, “Execution of a high-level real-time language”, inProceedings of the Real-Time Systems Symposium, Huntsville, AL, 1988, pp. 69–76.Google Scholar
  17. 17.
    J. Levine, “Efficient static schedulers for the CAPS systems,” Master's Thesis, Computer Science Department, Naval Postgraduate School, Monterey, CA, June 1991.Google Scholar
  18. 18.
    Luqi and M. Ketabchi, “A computer aided prototyping system”,IEEE Software 5, pp. 66–72, 1988.CrossRefGoogle Scholar
  19. 19.
    Luqi, M. Shing, P. Barnes, and G. Hughes, “Prototyping hard real-time Ada systems in a slassroom environment”, inProc. of the Seventh Annual Ada Software Engineering Education and Training (ASEET) Symposium, Monterey, CA, 1993, pp. 103–117.Google Scholar
  20. 20.
    Luqi, “Handling timing constraints in rapid prototyping,” inProceedings of the 22nd Annual Hawaii International Conference on System Science, Kailua-Kona, Hawaii, 1989, pp. 417–424.Google Scholar
  21. 21.
    Luqi, “Computer-aided prototyping for a command-and-control system using CAPS.”IEEE Software 9, pp. 56–57, 1992.CrossRefGoogle Scholar
  22. 22.
    Luqi, “Real-time constraints in a rapid prototyping language.”Computer Language 18, pp. 77–103, 1993.CrossRefGoogle Scholar
  23. 23.
    A. Mok, “Fundamental design problems of distributed systems for the hard real-time environment,” Ph.D. dissertation, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1983.Google Scholar
  24. 24.
    N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H., Teller, and A. E. Teller, “Equation of state calculations by fast computing machines.”Journal of Chemical Physics 21, pp. 1087–1092, 1953.CrossRefGoogle Scholar
  25. 25.
    S. Nahar, S. Sahni, and E. Shragowitz, “Simulated annealing and combinatorial optimization,” inProc. 23rd Design Automation Conference, 1986, pp. 293–299.Google Scholar
  26. 26.
    L. Sha and J. Goodenough, “Real-time scheduling theory and Ada.”IEEE Computer 23(4), pp. 53–62, April, 1990.Google Scholar
  27. 27.
    A. Stoyenko, V. Hamacher, and R. Holt, “Analyzing hard real-time programs for guaranteed schedulability.”IEEE Trans. on Software Engineering SE-17, pp. 737–750, 1991.CrossRefGoogle Scholar
  28. 28.
    J. Stankovic and K. Ramamritham, 1988.Tutorial and Hard Real-Time Systems. IEEE Computer Society Press: Washington, D.C., 1988.Google Scholar
  29. 29.
    J. Stankovic, M. Sprui, M. Di Natale, and G. Buttazzo “Implications of classical scheduling results for real-time systems.”IEEE Computer 28, pp. 16–25, 1995.Google Scholar
  30. 30.
    J. Ullman, “NP-complete scheduling problem.”Journal of Computer and System Sciences 10, pp. 384–393, 1975.Google Scholar
  31. 31.
    J. Ullman, “Complexity of sequence problem,” inComputer and Job-Shop Scheduling Theory, John Wiley & Sons: NY, 1976.Google Scholar
  32. 32.
    M. Vecchi and S. Kirkpatrick, “Global wiring by simulated annealing,”IEEE Trans. on Computer-Aided Design CAD-2, pp. 215–222 1983.CrossRefGoogle Scholar
  33. 33.
    H. Wedde, B. Korel, and D. Huizinga, “Static analysis of timing properties for distributed real-time programs.”Real-Time Systems Newsletter 7, pp. 88–95, 1991.Google Scholar
  34. 34.
    J. Xu and D. Parnas, “Scheduling processes with release times, deadlines, precedence, and exclusion relations.”IEEE Trans. on Software Engineering 16, pp. 360–369, 1990.CrossRefGoogle Scholar
  35. 35.
    S. Zdrzalka, “Scheduling jobs on a single machine with periodic release date/deadline intervals.”European Journal of Operations Research 40, pp. 243–251, 1989.CrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Luoi
    • 1
  • M. Shing
    • 1
  1. 1.Computer Science DepartmentNaval Postgraduate SchoolMonterey

Personalised recommendations