NDLI: Elimination of Java array bounds checks in the presence of indirection

Please wait, while we are loading the content...

A Java embedded micro-kernel infrastructure

The ninf portal: an automatic generation tool for grid portals

Experience with integrating Java with new technologies: C#, XML and web services

JavaSymphony: new directives to control and synchronize locality, parallelism, and load balancing for cluster and GRID-computing

A brief overview of scalable distributed concurrency services for hierarchical locking

Ibis: an efficient Java-based grid programming environment

Execution of monolithic Java programs on large non-dedicated collections of commodity workstations

Efficient, flexible, and typed group communications in Java

An object-oriented approach to the DSMC method

JOPI: a Java object-passing interface

Measuring the impact of object-oriented techniques in grande applications: a method-level analysis

Abstracting remote object interaction in a peer-2-peer environment

Understanding the performance of the Java operating system JX using visualization techniques

Advanced eager scheduling for Java-based adaptively parallel computing

Improving the memory management performance of RTSJ

A scaleable event infrastructure for peer to peer grids

CSFS: a Java enabled network file storage system

Elimination of Java array bounds checks in the presence of indirection

Experiments with multi-protocol RMI in Java

Simple and effective array prefetching in Java

OoLaLa: how and when can it be optimised?

Fast subtype checking in the HotSpot JVM

Parallel operation of cartablanca on shared and distributed memory computers ©

Almost-whole-program compilation

Benchmarking Java against C/C++ for interactive scientific visualization

Generic programming for high performance scientific applications

Support and optimization of Java RMI over bluetooth environments

Higher-order functions and partial applications for a C++ skeleton library

Using MPI with C\# and the common language infrastructure

Ravenscar-Java: a high integrity profile for real-time Java

Parsek: object oriented particle in cell. implementation and performance issues

inAspect™: interfacing Java and VSIPL

Open runtime platform: flexibility with performance using interfaces

Object combining: A new aggressive optimization for object intensive programs

Run-time evaluation of opportunities for object inlining in Java

Adding tuples to Java: a study in lightweight data structures

Specifying Java thread semantics using a uniform memory model

Immutability specification and its applications

Jeeg: a programming language for concurrent objects synchronization

Elimination of Java array bounds checks in the presence of indirection

Content Provider	ACM Digital Library
Author	Luján, Mikel Freeman, T. L. Miguel, José Gurd, John R.
Abstract	The Java language specification states that every access to an array needs to be within the bounds of that array; i.e. between 0 and array length 1. Different techniques for different programming languages have been proposed to eliminate explicit bounds checks. Some of these techniques are implemented in off-the-shelf Java Virtual Machines (JVMs). The underlying principle of these techniques is that bounds checks can be removed when a JVM/compiler has enough information to guarantee that a sequence of accesses (e.g. inside a for-loop) is safe (within the bounds). Most of the techniques for the elimination of array bounds checks have been developed for programming languages that do not support multi-threading and/or enable dynamic class loading. These two characteristics make most of these tech niques unsuitable for Java. Techniques developed specifically for Java have not addressed the elimination of array bounds checks in the presence of indirection, that is, when the index is stored in another array (indirection array). With the objective of optimising applications with array indirection, this paper proposes and evaluates three implementation strategies, each implemented as a Java class. The classes provide the functionality of Java arrays of type int so that objects of the classes can be used instead of indirection arrays. Each strategy enables JVMs, when examining only one of these classes at a time, to obtain enough information to remove array bounds checks.
Starting Page	76
Ending Page	85
Page Count	10
File Format	PDF
ISBN	1581135998
DOI	10.1145/583810.583819
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2002-11-03
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Array indirection Java Array bounds check
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Elimination of Java Array Bounds Checks in the Presence of Indirection (2004)

Elimination of java array bounds checks in the presence of indirection (2002).

Array bounds check elimination for the Java HotSpot™ client compiler

Speculative improvements to verifiable bounds check elimination

Array Bounds Check Elimination for Java Based on Sparse Representation

Towards Array Bound Check Elimination in Java Virtual Machine Language (1999)

Eliminating partially-redundant array-bounds check in the Android Dalvik JIT compiler

ABCD: Eliminating Array-Bounds Checks on Demand (2000)

Safe, Multiphase Bounds Check Elimination in Java (2010)

Elimination of Java array bounds checks in the presence of indirection

Similar Documents

Elimination of Java Array Bounds Checks in the Presence of Indirection (2004)

Elimination of java array bounds checks in the presence of indirection (2002).

Array bounds check elimination for the Java HotSpot™ client compiler

Speculative improvements to verifiable bounds check elimination

Array Bounds Check Elimination for Java Based on Sparse Representation

Towards Array Bound Check Elimination in Java Virtual Machine Language (1999)

Eliminating partially-redundant array-bounds check in the Android Dalvik JIT compiler

ABCD: Eliminating Array-Bounds Checks on Demand (2000)

Safe, Multiphase Bounds Check Elimination in Java (2010)

Elimination of Java array bounds checks in the presence of indirection