Document Type
Technical Report
Publication Date
2003-04-25
Technical Report Number
WUCSE-2003-37
Abstract
Real-time are beginning to appear in advanced, high-level programming languages such as Java. When complemented by a real-time operating system, the Real-Time Specification for Java (RTSJ) offers strong execution constraints for applications developed in Java. While the RTSJ make the basic services of Java such as storage and thread management ready for many real-time applications, the collection objects, and the rest of the application run-time library, cannot be used by RTSJ applications until their run-time properties are examined and modified as necessary to make them suitable for use by real-time applications. In this work, we examine the Hashtable collection facility of Java and describe how to make it suitable for many real-time applications. Specifically, we reformulate its behavior to provide an execution-time bound on any Hashtable operation, and provide analysis establishing that bound. This analysis quantifies the trade-off between execution-time provisioning for Hashtable operations and the degree of confidence that a given bound will be violated. We present experiments that confirm our analysis and support our claim that Hashtables can be made suitable for many real-time applications.
Recommended Citation
Krishnan, Anand, "Hashtables for Real-Time and Embedded Systems" Report Number: WUCSE-2003-37 (2003). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/1083
Comments
Permanent URL: http://dx.doi.org/10.7936/K7154FC3