Figure - uploaded by Lizy K. John
Content may be subject to copyright.
Comparison of Branches for the MIPS (Normalized) Normalizing is done with reference to the number of branches for the C program compiled with the O1 option. In the last column, we normalize the counts with respect to O4 level of the C version, so that we can compare the relative counts of C and C++ programs in the best optimized option.
Source publication
It is widely accepted that object-oriented design improves code reusability, facilitates code maintainability and enables higher levels of abstraction. Although the software engineering community has embraced object-oriented programming for these benefits, it has not been clear what performance overheads are associated with this programming paradig...
Similar publications
It is widely accepted that object-oriented design improves code
reusability, facilitates code maintainability and enables higher levels
of abstraction. Although software developers and the software
engineering community have embraced object-oriented programming for
these benefits, there have been wide concerns about the performance
overhead associa...
Memory Leak is a common problem in computer programming. Due to this memory leak the performance of the system can be degraded to a great extent. Consumption of more and more memory by a single program will eventually lead the other programs to starve for memory. This paper proposes MemHunt: A Dynamic Memory Leak Analyzer and Garbage collector. We...
To improve performance, data reorganization needs locality models to identify groups of data that have reference affinity.
Much past work is based on access frequency and does not consider accessing time directly. In this paper, we propose anew
model of reference affinity. This model considers the distance between data accesses in addition to the f...
In static binary translation, it can be used to detect previously undetected entry points into the code, such as through register indirect branches. If no entry point can be found, . in a static binary translation scheme, the program has to branch to an interpreter which will interpret the original program code which is still maintained as part of...
Summary form only given. Speculative preexecution achieves efficient data prefetching by running additional prefetching threads on spare hardware contexts. Various implementations for speculative preexecution have been proposed, including compiler-based static approaches and hardware-based dynamic approaches. A static approach defines the p-thread...
