This work suggests an architecture that uses the java Native Interface to improve the performance of java domain transformation applications. It also shows how to make possible the independency between image formats a...
详细信息
java threads allow to express parallelism of a java application. However, integrating parallelism in the context of distributed object systems, namely in the java RMI context, raises problems at both conceptual and im...
详细信息
ISBN:
(纸本)3540436723
java threads allow to express parallelism of a java application. However, integrating parallelism in the context of distributed object systems, namely in the java RMI context, raises problems at both conceptual and implementation levels. This article presents an useful tool, the distributed collection, which allows the expression of parallelism and an easy recovery of the results. The parallelism proposed associates the two approaches: the data parallelism, through fragmented data and the task parallelism using asynchronous calls. We show the interest of distributed collections, evaluating the facility in the conception of distributed and parallel java programs.
Object oriented software design is getting more and more common in the field of industrial control. In particular, java seems extremely versatile for the development of distributed control applications. One of the mai...
详细信息
ISBN:
(纸本)0780374746
Object oriented software design is getting more and more common in the field of industrial control. In particular, java seems extremely versatile for the development of distributed control applications. One of the main requirements of control application is a deterministic execution of the tasks, which generally feature real-time constraints. When javalanguage has been conceived, a little weight to the real-time requirements of applications has been given. In the last few years the limits to the use of java for Real-Time applications has led to the definition of java Real-Time platform specifications. Real-Time capability of a java Virtual Machine (VM) depends on a very large number of elements, among which the task scheduling algorithm, the memory management, the garbage collector algorithm and its execution policy. Knowledge of how each single internal mechanism of a java VM influence its performance is very important to improve its real-time behaviour. This paper must be considered as a first step toward this direction, as its aim is to try to understand how real-time performance of a java VM may be influenced by each its single component.
Existing reification techniques for java only allow for inspection and manipulation of java programs on the class, object and method level, but not at the level of individual program points. In this paper we introduce...
详细信息
ISBN:
(纸本)0769516629
Existing reification techniques for java only allow for inspection and manipulation of java programs on the class, object and method level, but not at the level of individual program points. In this paper we introduce a reification technique of program points based on source-to-source transformations. Our reification method allows for the association of arbitrary meta-information with program points and to manipulate it during execution. We present examples of the innovative use of such reified program points for visualizing the execution of java programs.
Enterprise javaBeans is a successful component model for the development of distributed business applications. Enterprise javaBeans have to adhere to a set of rules and guidelines which, amongst others, require that a...
详细信息
ISBN:
(纸本)3540440879
Enterprise javaBeans is a successful component model for the development of distributed business applications. Enterprise javaBeans have to adhere to a set of rules and guidelines which, amongst others, require that a significant amount of glue code between the components is written. By using Declarative Meta programming (DMP)we can codify these rules and guidelines as a logic program which operates on the java code. Our DMP development tool can not only generate java code, but can also verify compliance of developer code.
This paper attempts to solve the inherently slow performance problem of java by improving instruction level parallelism merged with a newly developed instruction folding technique, The new ILP scheme with an advanced ...
详细信息
ISBN:
(纸本)0780373715
This paper attempts to solve the inherently slow performance problem of java by improving instruction level parallelism merged with a newly developed instruction folding technique, The new ILP scheme with an advanced folding mechanism creates a possibility of further improvement of instruction parallelism. 4 new architecture is introduced in this project by demonstrating the most recent bytecode folding mechanism followed by folded instruction level parallelism. This paper also presents a comprehensive study of branch prediction logic in the new ILP mechanism. An experiment using SPECJVM98 benchmarks reveals that as many as 7.8 bytecode instructions can he executed concurrently. In our simulation results, the 4-way parallel issue processor has achieved the highest performance, exceeding by 4 times the parallel bytecodes per issue among many other configurations. Moreover the new ILP system proposed in this paper shows significantly high er parallelism against an existing java ILP machine.
We present an efficient online subpath profiling algorithm, OSP, that reports hot subpaths executed by a program in a given run. The hot subpaths can start at arbitrary basic block boundaries, and their identification...
详细信息
ISBN:
(纸本)3540433694
We present an efficient online subpath profiling algorithm, OSP, that reports hot subpaths executed by a program in a given run. The hot subpaths can start at arbitrary basic block boundaries, and their identification is important for code optimization;e.g., to locate program traces in which optimizations could be most fruitful, and to help programmers in identifying performance bottlenecks. The OSP algorithm is online in the sense that it reports at any point during execution the hot subpaths as observed so far. It has very low memory and runtime overheads, and exhibits high accuracy in reports for benchmarks such as Mex and FFT. These features make the OSP algorithm potentially attractive for use in just-in-time (JIT) optimizing compilers, in which profiling performance is crucial and it is useful to locate hot subpaths as early as possible. The OSP algorithm is based on an adaptive sampling technique that makes effective utilization of memory with small overhead. Both memory and runtime overheads can be controlled, and the OSP algorithm can therefore be used for arbitrarily large applications, realizing a tradeoff between report accuracy and performance. We have implemented a java prototype of the OSP algorithm for java programs. The implementation was tested on programs from the java Grande benchmark suite and exhibited a low average runtime overhead.
This paper studies the level 1 cache performance of java programs by analyzing memory reference traces of the SPECjvm98 applications executed by the Latte java virtual machine. We study in detail java programs' ca...
详细信息
We present a points-to analysis that aims at enabling loop-based dependence analysis in the presence of java references. The analysis is based on an abstraction called element-wise points-to (ewpt) mapping. An ewpt ma...
详细信息
We present a points-to analysis that aims at enabling loop-based dependence analysis in the presence of java references. The analysis is based on an abstraction called element-wise points-to (ewpt) mapping. An ewpt mapping summarizes, in a compact representation, the relation between a pointer and the heap object it points to, for every instance of the pointer inside a loop and for every array element directly accessible through this pointer. Such instance-wise and element-wise information is especially important for loop-based dependence analyses and for a language where multi-dimensional arrays are implemented as arrays of pointers. We describe an iterative algorithm to compute ewpt mappings. We also present techniques to remove objects from ewpt mappings for destructive updates. The points-to algorithm was implemented and evaluated on a set of benchmark programs. We demonstrate that ewpt information can significantly improve the precision of dependence analysis. In many cases, the dependence analysis reports no false dependences due to array accesses.
We present a toolkit for developing and visualizing distributed algorithms in java. This toolkit consists of a java class library with a simple programming interface that allows to develop distributed algorithms in a ...
详细信息
ISBN:
(纸本)1581134991
We present a toolkit for developing and visualizing distributed algorithms in java. This toolkit consists of a java class library with a simple programming interface that allows to develop distributed algorithms in a message passing model. The resulting programs may be executed in standalone mode using a java interpreter or embedded as applets into HTML documents and executed by a Web browser. The toolkit has been applied in various university courses and is freely available.
暂无评论