Challenge benchmarks for verification of real-time programs
Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification
High-level programming of embedded hard real-time devices
Proceedings of the 5th European conference on Computer systems
Schism: fragmentation-tolerant real-time garbage collection
PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Scheduling of hard real-time garbage collection
Real-Time Systems
Scheduling garbage collection in real-time systems
CODES/ISSS '10 Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Virtualization architecture using the ID/Locator split concept for Future Wireless Networks (FWNs)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scheduling real-time garbage collection on uniprocessors
ACM Transactions on Computer Systems (TOCS)
Virtualizing real-time embedded systems with Java
Proceedings of the 48th Design Automation Conference
Region-Based RTSJ Memory Management: State of the art
Science of Computer Programming
| Hi-index | 0.00 |
Managed languages such as Java and C# are increasingly being considered for hard real-time applications because of their productivity and software engineering advantages. Automatic memory management, or garbage collection, is a key enabler for robust, reusable libraries, yet remains a challenge for analysis and implementation of real-time execution environments. This paper comprehensively compares the two leading approaches to hard real-time garbage collection. While there are many design decisions involved in selecting a real-time garbage collection algorithm, for time-based garbage collectors researchers and practitioners remain undecided as to whether to choose periodic scheduling or slack-based scheduling. A significant impediment to valid experimental comparison is that the commercial implementations use completely different proprietary infrastructures. Here, we present Minuteman, a framework for experimenting with real-time collection algorithms in the context of a high-performance execution environment for real-time Java. We provide the first comparison of the two approaches, both experimentally using realistic workloads, and analytically in terms of schedulability.