Scheduling garbage collector for embedded real-time systems

ABSTRACT

This paper proposes a new scheduling method for multiple mutators and a garbage collector running on embedded real-time systems with a single processor and no virtual memory. The hard real-time tasks should reserve a certain amount of heap memory to prevent memory starvation and/or deadline miss. Since the memory requirement depends on the worst-case response time of a garbage collector, the traditional approach in which garbage collection is performed in the background demands large memory space. The proposed scheduling algorithm is based on an aperiodic scheduling technique, sporadic server. This paper also presents a modified copying garbage collection algorithm with hardware support. In order to minimize the worst-case response time of a garbage collector thus reducing the memory requirement, the garbage collector runs as the highest priority task with a preset bandwidth. This paper also investigates the schedulability of a garbage collector and mutator tasks as well as the worst-case memory requirement. Performance analysis shows that the proposed algorithm can provide a considerable reduction in the worst-case memory requirement compared with the background policy. Simulation results demonstrate that the proposed algorithm can produce the feasible memory requirement comparable to the complex on-line scheduling algorithm such as slack stealing.

REFERENCES

• 1: Andrew W. Appel, Garbage collection can be faster than stack allocation, Information Processing Letters, v.25 n.4, p.275-279, June 17, 1987 [doi>10.1016/0020-0190(87)90175-X ]
• 2: Henry G. Baker, Jr., List processing in real time on a serial computer, Communications of the ACM, v.21 n.4, p.280-294, April 1978 [doi>10.1145/359460.359470]
• 3: David A. Barrett , Benjamin G. Zorn, Using lifetime predictors to improve memory allocation performance, Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation, p.187-196, June 21-25, 1993, Albuquerque, New Mexico, United States
• 4: Rodney A. Brooks, Trading data space for reduced time and code space in real-time garbage collection on stock hardware, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.256-262, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802042]
• 5: L. Peter Deutsch , Daniel G. Bobrow, An efficient, incremental, automatic garbage collector, Communications of the ACM, v.19 n.9, p.522-526, Sept. 1976 [doi>10.1145/360336.360345]
• 6: Edsger W. Dijkstra , Leslie Lamport , A. J. Martin , C. S. Scholten , E. F. M. Steffens, On-the-fly garbage collection: an exercise in cooperation, Communications of the ACM, v.21 n.11, p.966-975, Nov. 1978 [doi>10.1145/359642.359655]
• 7: HENRIKSSON, R. Scheduling Garbage Collection in Embedded Systems. PhD thesis, Lund University, July 1998.
• 8: KALMAN, R. E. A new approach to linear filtering and prediction problems. Transactions of the ASME-Journal of Basic Engineering (Mar 1960), 35-45.
• 9: Kalman fileter C++ class, v 1.2. ftp://ftp.taygeta.com/pub/ c++/kalman.tar.Z.
• 10: LEHOCZKEY, J. P., SHA, L., AND DING, Y. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In Proceedings of the Real-Time Systems Symposium (Dec. 1989), pp. 166-171.
• 11: LEHOCZKY, J. P., AND RAMOS-THUEL, S. An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems. In Proceedings of the Real-Time Systems Symposium (Dec. 1992), pp. 110-123.
• 12: C. L. Liu , James W. Layland, Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment, Journal of the ACM (JACM), v.20 n.1, p.46-61, Jan. 1973 [doi>10.1145/321738.321743]
• 13: NILSEN, K. D., AND SCHMIDT, W. J. A high-performance hardware-assisted real time garbage collection system. Journal of Programming Languages 2, 1 (1994).
• 14: SPRtJNT, B., SHA, L., AND LEHOCZKY, J. P. Aperiodic task scheduling for hard-real-time systems. Journal of Real-Time Systems I (1989), 27-60.
• 15: WILSON, P. R. Uniprocessor garbage collection techniques. Tech. rep., University of Texas, Jan 1994.
• 16: WIND RIVER SYSTEMS, INC. VxWorks Programmer's Guide, 5.3.1, 1997.
• 17: T. Yuasa, Real-time garbage collection on general-purpose machines, Journal of Systems and Software, v.11 n.3, p.181-198, Mar. 1990 [doi>10.1016/0164-1212(90)90084-Y]
• 18: ZORN, B. Barrier methods for garbage collection. Tech. Rep. CU-CS-494-90, University of Colorado, Boulder, Nov 1990.

INDEX TERMS

Primary Classification:
  D. Software
  D.4 OPERATING SYSTEMS
      D.4.7 Organization and Design
          Subjects: Real-time systems and embedded systems

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES

General Terms:
Design, Management, Reliability