Abstract
AbstractThis paper addresses the issue of improving the performance of memory management for real-time Java applications, building upon the Real-Time Specification for Java (RTSJ). This specification imposes strict assignment rules to or from memory areas preventing the creation of dangling pointers, and thus maintaining the pointer safety of Java. The dynamic issues that Java presents, requires for some cases ensuring the checking of these rules at run-time, which adversely affects both the performance and predictability of the RTSJ application. This paper presents an efficient algorithm for managing scoped areas which requires some modifications in the current RTSJ specification.KeywordsParentage RelationArea TreeCurrent AreaMemory ManagementAssignment RuleThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
