-aware scheduling algorithm. A set of simulation experiments illustrate the influence of context switch and scheduling overhead on the actual energy consumed in a given system. Results show that, in certain conditions, the penalty due to the runtime overhead might be as large as the amount of energy saved using

Abstract Kieker's monitoring component is tuned for a low runtime overhead. Nevertheless, we recently identified potential for improvement. Unfortunately, we could utilize this potential only by refactoring major parts of its architecture. In this paper, we describe these changes and discuss

Java is a popular object oriented programming language suitable for writing Java programs. Sometimes programmers spend most of the time to increase the execution time of the program, but simultaneously its effect on code size. Therefor the code become more complex and unreliable, so this leads to reduce the efficiency of code. Today so many compilers are exist like c, javac,c++,cobol,etc.we studied the code optimization techniques for java compiler separately and that time we come across some new code optimization strategies which is the smart way to do the coding in java. In this paper we applied some new java code optimization techniques on existing code. We verify the code optimization, performance using our executor. These code optimization strategies indirectly help to reduce the work of garbage collection, data structure and also work on loop optimization. So the results which we found after doing experimentations are quite satisfactory as compare to original results. so these techniques are help to improve the code quality.

Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or cost-sensitive applications. In some situations, designers are not willing to squander computing resources for the sake

assembly language, and then generated PCC binaries for them using a special prototype assembler. The PCC binaries can be executed with no run-time overhead, beyond a one-time cost of 1 to 3 milliseconds for validating the enclosed proofs. The net result is that our packet filters are formally guaranteed

control, and exceptions. This paper defines the JFlow language and presents formal rules that are used to check JFlow programs for correctness. Because most checking is static, there is little code space, data space, or run-time overhead in the JFlow implementation.

The fifth release of the multithreaded language Cilk uses a provably good "work-stealing " scheduling algorithm similar to the rst system, but the language has been completely redesigned and the runtime system completely reengineered. The efficiency of the new implementation was aided

of data flow (either atomic or large grain) in which the number of data samples produced or consumed by each node on each invocation is specified a priori. Nodes can be scheduled statically (at compile time) onto single or parallel programmable processors so the run-time overhead usually associated

repeatedly in an atomic block), (3) we use runtime filtering to detect duplicate log entries that are missed statically, and (4) we present a series of GC-time techniques to compact the logs generated by long-running atomic blocks. Our implementation supports short-running scalable concurrent benchmarks

allows for a safe execution of programs, it may impose a significant runtime overhead. In this paper, we propose a novel technique combining verification and monitoring which incurs no overhead during runtime at all. The technique proceeds by using the inconclusive result of a verification run