Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Hartstone Uniprocessor Benchmark: Definitions and experiments for real-time systems

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

The purpose of this paper is to define a series of requirements and associated experiments called the Hartstone Uniprocessor Benchmark (HUB), to be used in testing the ability of a uniprocessor system to handle certain types of hard real-time applications. The benchmark model considers the real-time system as a set of periodic, aperiodic (sporadic), and synchronization (server) tasks. The tasks are characterized by their execution times (workloads), and deadlines. There are five series of experiments defined. They are, in order of increasing complexity, PH (Periodic Tasks, Harmonic Frequencies), PN (Periodic Tasks, Nonharmonic Frequencies), AH (Periodic Tasks with Aperiodic Processing), SH (Periodic Tasks with Synchronization), and SA (Periodic Tasks with Aperiodic Processing and Synchronization). The general stopping criteria of the experiments is defined as follows: Change one of the following four task set parameters: number of tasks, execution time(s), blocking time(s), or deadline(s) until a given task set is no longer schedulable, i.e., a deadline is missed. The derivation of the Hartstone experiments from one static scheduling algorithm (Rate Monotonic) and one dynamic scheduling algorithm (Earliest Deadline First) is presented. Because of its high-level application view of the underlying hardware and real-time system software the Hartstone experiments can be used for fast prototyping of real-time applications. Implementation of such benchmarks is useful in evaluating scheduling algorithms, scheduling protocols, and design paradigms, as well as evaluating real-time languages, the tasking system of compilers, real-time operating systems, and hardware configurations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Altman, N., and Weiderman, N.H., 1988. Timing variation in dual loop benchmarks, Ada Letters, 8(3): 98–102.

    Google Scholar 

  2. Baker, T.P., 1990. Fixing some time-related problems in Ada, Ada Letters-Special Edition on the Third International Workshop on Real-Time Ada Issues 1989, 4: 136–143.

    Google Scholar 

  3. Baker, T.P., Stack-based scheduling of realtime processes, Journal of Real-Time Systems, 3: 67–99.

  4. Baker, T.P., and Shaw, A., 1988. The cyclic executive model and Ada, Proceedings of the IEEE Real-Time Systems Symposium, Huntsville, AL, December, pp. 120–129.

  5. Borger, M., Klein, M., and Veltre, R., 1989. Real-time software engineering in Ada: Observations and Guidelines, CMU/SEI-89-TR-22, DTIC: ADA219020, Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA, September.

    Google Scholar 

  6. Chen, Min-Ih, and Lin, Kwei-Jay, 1990. Dynamic priority ceilings: A concurrency control protocol for realtime systems, Real-Time Systems, 2: 325–346.

    Google Scholar 

  7. Cheng, S.C., Stankovic, J.A., and Ramamritham, K., 1988. Scheduling algorithms for hard real-time systems: A brief survey, Tutorial on Hard Real-Time Systems, J.A. Stankovic and K. Ramamritham, eds., Computer Society Press of the IEEE, Washington, D.C.

    Google Scholar 

  8. Clapp, R.M., Duchesneau, L., Volz, R.A., Mudge, T.N., and Schultze, T. 1986. Toward real-time performance benchmarks for Ada, Communications of the ACM, 29(8): 760–778.

    Google Scholar 

  9. Curnow, H.J., and Wichmann, B.A., 1976. A synthetic benchmark, Computer Journal, 19(1): 43–49.

    Google Scholar 

  10. Donohoe, P., Shapiro, R., and Weiderman, N., 1990a. Hartstone Benchmark User's Guide, CMU/SEI-90-UG-1, Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA.

    Google Scholar 

  11. Donohoe, P., Shapiro, R., and Weiderman, N., 1990b. Hartstone Benchmark Results and Analysis, Version 1.0, CMU/SEI-90-TR-7, Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA.

    Google Scholar 

  12. Gafni, V., 1989. A tasking model for reactive systems, Proceedings of the Real-Time Systems Symposium, Santa Monica, CA, December, pp. 258–265.

  13. Ghazalie, T., 1990. Improving aperiodic response with deadline scheduling, Master's Thesis, Florida State University.

  14. Goodenough, J.B., and Sha, L., 1988. The priority ceiling protocol: A method of minimizing the blocking of high-priority Ada tasks. Proceedings of the Second International Workshop of Real-Time Ada Issues, Mortonhamstead, Devon, UK, June.

  15. Harbaugh, S., and Forakis, J., 1984. Timing studies using a synthetic Whetstone benchmark, Ada Letters, 4(2): 23–34.

    Google Scholar 

  16. Kamenoff, N.I., and Weiderman, N.H., 1991. Hartstone distributed benchmark: Requirements and definitions, Proceedings Twelfth Real-Time Systems Symposium, San Antonio, TX, December 4–6, 1991, IEEE Computer Society Press (1991), 199–208, Los Alamitos, CA.

    Google Scholar 

  17. Kar, R.P., and Porter, K., 1989. Rhealstone—A real-time benchmarking proposal, Dr. Dobbs Journal, 14 (2): 14–24.

    Google Scholar 

  18. Kar, R.P., 1990. Implementing the rhealstone the real-time benchmark, Dr. Dobbs Journal, 15(4): 46–104.

    Google Scholar 

  19. Knuth, D.E., 1969. The art of computer programming: Seminumerical algorithms, Reading, MA, Addison-Wesley, Vol. 2.

    Google Scholar 

  20. Levi, S.T., Tripathi, S.K., Carson, S.D. and Agrawala, A.K., 1989. The MARUTI hard real-time operating system, Operating Systems Review, 23(3): 90–105.

    Google Scholar 

  21. Liu, C.L., and Layland, J.W., 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment, Journal of the Association of Computing Machinery, 20(1): 46–61.

    Google Scholar 

  22. Locke, C.D., 1986. Best-effort decision making for real-time scheduling, Ph.D. Thesis, Carnegie Mellon University, May.

  23. Mok, A., 1983. Fundamental design problems of distributed systems for the hard-real-time environment, Cambridge, Massachusetts Institute of Technology.

    Google Scholar 

  24. Pollack, R.H., and Campbell, D.J., 1990. Clock resolution and the PIWG benchmark suite, Ada Letters-Special Edition on Ada Performance Issues, X, 3: 91–97.

    Google Scholar 

  25. Roy, D., and Gupta, L., 1990. PIWG analysis methodology, Ada Letters-Special Edition on Ada Performance Issues, X, 3: 217–229.

    Google Scholar 

  26. Sha, L., Rajikumar, R., and Lehoczky, J.P., 1987. Priority Inheritance Protocols: An Approach to Real-Time Synchronization, CMU-CS-88-181, Computer Science Department, Carnegie Mellon University, Pittsburgh, PA.

    Google Scholar 

  27. Sha, L., Goodenough, J.B., 1990. Real-time scheduling theory and Ada, CMU/SEI-89-TR-14, DTIC: ADA211397. Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA.

    Google Scholar 

  28. Sha, L., and Goodenough, J.B., 1990. Real-time scheduling theory and Ada. IEEE Computer, 23(4): 53–62.

    Google Scholar 

  29. Sprunt, B., Sha, L., and Lehoczky, J., 1989. Scheduling Sporadic and Aperiodic Events in a Hard Real-Time System, CMUSEI-89-TR-11. Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA.

    Google Scholar 

  30. Sprunt, B., Sha, L., and Lehoczky, J., 1989. Aperiodic task scheduling for hard-real-time systems, Journal of Real-Time Systems, 1(1): 27–60.

    Google Scholar 

  31. Sprunt, B., and Sha, L., 1990. Implementing Sporadic Servers in Ada, CMU/SEI-90-TR-6. Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA.

    Google Scholar 

  32. Stankovic, J.A., and Ramamritham, K., 1988. Real-time computing systems: The next generation (J.A. Stankovic, ed.), Tutorial: Hard Real-Time Systems, IEEE Computer Society Press, pp. 14–37.

  33. Stankovic, J.A., and Ramamritham, K., 1989. The spring kernel: A new paradigm for real-time operating systems, Operating Systems Review, 23(3): 54–71.

    Google Scholar 

  34. United States Department of Defense, 1983. Reference Manual for the Ada Programming Language, ANSI/MIL-STD-1815A-1983, American National Standards Institute, New York.

    Google Scholar 

  35. Weicker, R.P., 1984. Dhrystone: A synthetic systems programming benchmark, Communications of the ACM, 27(10): 1013–1030.

    Google Scholar 

  36. Weicker, R.P., 1988. Dhrystone benchmark: Rationale for version 2 and measurement rules, SIGPLAN Notices, 23(8): 49–62.

    Google Scholar 

  37. Weiderman, N., 1989. Hartstone: Synthetic benchmark requirements for hard real-time applications, CMU/ SEI-89-TR-23 DTIC: ADA219326, Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA.

    Google Scholar 

  38. Weiderman, N., 1990. Hartstone: Synthetic benchmark requirements for hard real-time applications, Ada Letters-Special Edition on Ada Performance Issues, X, 3: 126–136 (also available as CMU/SEI-89-TR-23, DTIC: ADA219326).

    Google Scholar 

  39. ISO-IEC/JTC1/SC22/WG9 (Ada) Numerics Rapporteur Group, 1989. Proposed Standard for a Generic Package of Elementary Functions for Ada, ISO/IEC/JTC1/SC22/WG9 N57.,WG9 Numerics Rapporteur Group, October.

  40. Wichmann, B.A., 1988. Validation code for the Whetstone benchmark, DITC 107/88, National Physical Laboratory, Teddington, Middlesex, UK, March.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Engineering Institute, Carnegie Mellon University, 15213-3890, Pittsburgh, PA, USA

    Nelson H. Weiderman

  2. Department of Computer and Information Sciences, Fordham University, 10458-5198, Bronx, New York, USA

    Nick I. Kamenoff

Authors
  1. Nelson H. Weiderman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nick I. Kamenoff
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Weiderman, N.H., Kamenoff, N.I. Hartstone Uniprocessor Benchmark: Definitions and experiments for real-time systems. Real-Time Syst 4, 353–382 (1992). https://doi.org/10.1007/BF00355299

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00355299

Keywords

Search

Navigation