Dynamic path profile aided recompilation in a JAVA just-in-time compiler

Just-in-Time (JIT) compilers for Java can be augmented by making use of runtime profile information to produce better quality code and hence achieve higher performance. In a JIT compilation environment, the profile information obtained can be readily exploited in the same run to aid recompilation and optimization of frequently executed (hot) methods. This paper discusses a low overhead path profiling scheme for dynamically profiling AT produced native code. The profile information is used in recompilation during a subsequent invocation of the hot method. During recompilation tree regions along the hot paths are enlarged and instruction scheduling at the superblock level is performed. We have used the open source LaTTe AT compiler framework for our implementation. Our results on a SPARC platform for SPEC JVM98 benchmarks indicate that (i) there is a significant reduction in the number of tree regions along the hot paths, and (ii) profile aided recompilation in LaTTe achieves performance comparable to that of adaptive LaTTe in spite of retranslation and profiling overheads.

Least path criterion (LPC) for unique indexing in a two-dimensional decagonal quasilattice

The least path criterion or least path length in the context of redundant basis vector systems is discussed and a mathematical proof is presented of the uniqueness of indices obtained by applying the least path criterion. Though the method has greater generality, this paper concentrates on the two-dimensional decagonal lattice. The order of redundancy is also discussed; this will help eventually to correlate with other redundant but desirable indexing sets.

Toward a Mean Field Formulation of the Babcock-Leighton Type Solar Dynamo. I. α-Coefficient versus Durney's Double-Ring Approach

We develop a model of the solar dynamo in which, on the one hand, we follow the Babcock-Leighton approach to include surface processes, such as the production of poloidal field from the decay of active regions, and, on the other hand, we attempt to develop a mean field theory that can be studied in quantitative detail. One of the main challenges in developing such models is to treat the buoyant rise of the toroidal field and the production of poloidal field from it near the surface. A previous paper by Choudhuri, Schüssler, & Dikpati in 1995 did not incorporate buoyancy. We extend this model by two contrasting methods. In one method, we incorporate the generation of the poloidal field near the solar surface by Durney's procedure of double-ring eruption. In the second method, the poloidal field generation is treated by a positive α-effect concentrated near the solar surface coupled with an algorithm for handling buoyancy. The two methods are found to give qualitatively similar results.

Effect of strain path change on the evolution of texture and microstructure during rolling of copper and nickel

The effect of strain path change during rolling has been investigated for copper and nickel using X-ray diffraction and electron back scatter diffraction as well as crystal plasticity simulations. Four different strain paths namely: (i) unidirectional rolling; (ii) reverse rolling; (iii) two-step cross rolling and (iv) multi-step cross rolling were employed to decipher the effect of strain path change on the evolution of deformation texture and microstructure. The cross rolled samples showed weaker texture with a prominent Bs {1 1 0}< 1 1 2 > and P(B(ND)) {1 1 0}< 1 1 1 > component in contrast to the unidirectional and reverse rolled samples where strong S {1 2 3}< 6 3 4 > and Cu {1 1 2}< 1 1 1 > components were formed. This was more pronounced for copper samples compared to nickel. The cross rolled samples were characterized by lower anisotropy and Taylor factor as well as less variation in Lankford parameter. Viscoplastic self-consistent simulations indicated that slip activity on higher number of octahedral slip systems can explain the weaker texture as well as reduced anisotropy in the cross rolled samples. (C) 2011 Elsevier B.V. All rights reserved.

Register Allocation and Optimal Spill code Scheduling in Software Pipelined Loops using 0-1 Integer Linear Programming Formulation

In achieving higher instruction level parallelism, software pipelining increases the register pressure in the loop. The usefulness of the generated schedule may be restricted to cases where the register pressure is less than the available number of registers. Spill instructions need to be introduced otherwise. But scheduling these spill instructions in the compact schedule is a difficult task. Several heuristics have been proposed to schedule spill code. These heuristics may generate more spill code than necessary, and scheduling them may necessitate increasing the initiation interval. We model the problem of register allocation with spill code generation and scheduling in software pipelined loops as a 0-1 integer linear program. The formulation minimizes the increase in initiation interval (II) by optimally placing spill code and simultaneously minimizes the amount of spill code produced. To the best of our knowledge, this is the first integrated formulation for register allocation, optimal spill code generation and scheduling for software pipelined loops. The proposed formulation performs better than the existing heuristics by preventing an increase in II in 11.11% of the loops and generating 18.48% less spill code on average among the loops extracted from Perfect Club and SPEC benchmarks with a moderate increase in compilation time.

An algebraic formulation of exact force-, moment-isotropy in spatial parallel manipulators

In this paper, we present an algebraic method to study and design spatial parallel manipulators that demonstrate isotropy in the force and moment distributions.We use the force and moment transformation matrices separately,and derive conditions for their isotropy individually as well as in combination. The isotropy conditions are derived in closed-form in terms of the invariants of the quadratic forms associated with these matrices. The formulation has been applied to a class of Stewart platform manipulators. We obtain multi-parameter families of isotropic manipulator analytically. In addition to computing the isotropic configurations of an existing manipulator,we demonstrate a procedure for designing the manipulator for isotropy at a given configuration.

Clustering Based Large Margin Classification: A Scalable Approach using SOCP Formulation

This paper presents a novel Second Order Cone Programming (SOCP) formulation for large scale binary classification tasks. Assuming that the class conditional densities are mixture distributions, where each component of the mixture has a spherical covariance, the second order statistics of the components can be estimated efficiently using clustering algorithms like BIRCH. For each cluster, the second order moments are used to derive a second order cone constraint via a Chebyshev-Cantelli inequality. This constraint ensures that any data point in the cluster is classified correctly with a high probability. This leads to a large margin SOCP formulation whose size depends on the number of clusters rather than the number of training data points. Hence, the proposed formulation scales well for large datasets when compared to the state-of-the-art classifiers, Support Vector Machines (SVMs). Experiments on real world and synthetic datasets show that the proposed algorithm outperforms SVM solvers in terms of training time and achieves similar accuracies.