Abstract

It is typical that only a part of the whole program code is necessary for their successful execution. Partial program code loading optimizes the start-up delay and system resource consumption of the object-oriented programs by decomposing the program into a set of object class clusters as the units of incremental on-demand loading. Unfortunately, the lack of a systematic yet simple class clustering technique prohibits such an optimization approach. This paper presents a Java class clustering technique that is able to improve both the spatial locality and temporal affinity of an optimized program. The technique provides two clustering algorithms, resource-centric and performance-centric, to achieve different requirements in optimizations. Experimental results indicate that our algorithms are practically useful to both interactive and noninteractive programs. Among the tested Java programs, use of the performance-centric and resource-centric algorithms could significantly improve program loading, on average, by 2.9 and 2.2 times, respectively, faster than whole program loading. Both algorithms resulted in chances to economize system resources. © 2006 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

Full Text
Paper version not known

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 call

Disclaimer: 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.