The Experts below are selected from a list of 9357 Experts worldwide ranked by ideXlab platform
Clark Verbrugge - One of the best experts on this subject based on the ideXlab platform.
-
software thread level speculation for the Java Language and virtual machine environment
Lecture Notes in Computer Science, 2006Co-Authors: Christopher J F Pickett, Clark VerbruggeAbstract:Thread level speculation (TLS) has shown great promise as a strategy for fine to medium grain automatic parallelisation, and in a hardware context techniques to ensure correct TLS behaviour are now well established. Software and virtual machine TLS designs, however, require adherence to high level Language semantics, and this can impose many additional constraints on TLS behaviour, as well as open up new opportunities to exploit Language-specific information. We present a detailed design for a Java-specific, software TLS system that operates at the bytecode level, and fully addresses the problems and requirements imposed by the Java Language and VM environment. Using SableSpMT, our research TLS framework, we provide experimental data on the corresponding costs and benefits; we find that exceptions, GC, and dynamic class loading have only a small impact, but that concurrency, native methods, and memory model concerns do play an important role, as does an appropriate, Language-specific runtime TLS support system. Full consideration of Language and execution semantics is critical to correct and efficient execution of high level TLS designs, and our work here provides a baseline for future Java or Java virtual machine implementations.
-
LCPC - Software thread level speculation for the Java Language and virtual machine environment
Languages and Compilers for Parallel Computing, 2005Co-Authors: Christopher J F Pickett, Clark VerbruggeAbstract:Thread level speculation (TLS) has shown great promise as a strategy for fine to medium grain automatic parallelisation, and in a hardware context techniques to ensure correct TLS behaviour are now well established. Software and virtual machine TLS designs, however, require adherence to high level Language semantics, and this can impose many additional constraints on TLS behaviour, as well as open up new opportunities to exploit Language-specific information. We present a detailed design for a Java-specific, software TLS system that operates at the bytecode level, and fully addresses the problems and requirements imposed by the Java Language and VM environment. Using SableSpMT, our research TLS framework, we provide experimental data on the corresponding costs and benefits; we find that exceptions, GC, and dynamic class loading have only a small impact, but that concurrency, native methods, and memory model concerns do play an important role, as does an appropriate, Language-specific runtime TLS support system. Full consideration of Language and execution semantics is critical to correct and efficient execution of high level TLS designs, and our work here provides a baseline for future Java or Java virtual machine implementations.
Christopher J F Pickett - One of the best experts on this subject based on the ideXlab platform.
-
software thread level speculation for the Java Language and virtual machine environment
Lecture Notes in Computer Science, 2006Co-Authors: Christopher J F Pickett, Clark VerbruggeAbstract:Thread level speculation (TLS) has shown great promise as a strategy for fine to medium grain automatic parallelisation, and in a hardware context techniques to ensure correct TLS behaviour are now well established. Software and virtual machine TLS designs, however, require adherence to high level Language semantics, and this can impose many additional constraints on TLS behaviour, as well as open up new opportunities to exploit Language-specific information. We present a detailed design for a Java-specific, software TLS system that operates at the bytecode level, and fully addresses the problems and requirements imposed by the Java Language and VM environment. Using SableSpMT, our research TLS framework, we provide experimental data on the corresponding costs and benefits; we find that exceptions, GC, and dynamic class loading have only a small impact, but that concurrency, native methods, and memory model concerns do play an important role, as does an appropriate, Language-specific runtime TLS support system. Full consideration of Language and execution semantics is critical to correct and efficient execution of high level TLS designs, and our work here provides a baseline for future Java or Java virtual machine implementations.
-
LCPC - Software thread level speculation for the Java Language and virtual machine environment
Languages and Compilers for Parallel Computing, 2005Co-Authors: Christopher J F Pickett, Clark VerbruggeAbstract:Thread level speculation (TLS) has shown great promise as a strategy for fine to medium grain automatic parallelisation, and in a hardware context techniques to ensure correct TLS behaviour are now well established. Software and virtual machine TLS designs, however, require adherence to high level Language semantics, and this can impose many additional constraints on TLS behaviour, as well as open up new opportunities to exploit Language-specific information. We present a detailed design for a Java-specific, software TLS system that operates at the bytecode level, and fully addresses the problems and requirements imposed by the Java Language and VM environment. Using SableSpMT, our research TLS framework, we provide experimental data on the corresponding costs and benefits; we find that exceptions, GC, and dynamic class loading have only a small impact, but that concurrency, native methods, and memory model concerns do play an important role, as does an appropriate, Language-specific runtime TLS support system. Full consideration of Language and execution semantics is critical to correct and efficient execution of high level TLS designs, and our work here provides a baseline for future Java or Java virtual machine implementations.
Akinori Yonezawa - One of the best experts on this subject based on the ideXlab platform.
-
COORDINATION - A Simple Extension of Java Language for Controllable Transparent Migration and Its Portable Implementation
Coordinatio Languages and Models, 1999Co-Authors: Tatsurou Sekiguchi, Hidehiko Masuhara, Akinori YonezawaAbstract:A scheme has been developed that enables a Java program to be migrated across computers while preserving its execution state, such as the values of local variables and the dynamic extents of try-and-catch blocks. This scheme provides the programmer with flexible control of migration, including transparent migration. It is based on source-code-level transformation. The translator takes as input code a Java program written in a Java Language extended with Language constructs for migration, and outputs pure Java source code that uses JavaRMI. The translated code can run on any Java interpreter and can be compiled by any just-in-time compiler. We have measured some execution performance for several application programs, and found that the translated programs are only about 20% slower than the original programs. Because migration is completely controlled by using only three Language constructs added to the Java Language (go, undock and migratory), the programmer can write programs to be migrated easily and succinctly. Our system is available in the public domain.
-
a simple extension of Java Language for controllable transparent migration and its portable implementation
International Conference on Coordination Models and Languages, 1999Co-Authors: Tatsurou Sekiguchi, Hidehiko Masuhara, Akinori YonezawaAbstract:A scheme has been developed that enables a Java program to be migrated across computers while preserving its execution state, such as the values of local variables and the dynamic extents of try-and-catch blocks. This scheme provides the programmer with flexible control of migration, including transparent migration. It is based on source-code-level transformation. The translator takes as input code a Java program written in a Java Language extended with Language constructs for migration, and outputs pure Java source code that uses JavaRMI. The translated code can run on any Java interpreter and can be compiled by any just-in-time compiler. We have measured some execution performance for several application programs, and found that the translated programs are only about 20% slower than the original programs. Because migration is completely controlled by using only three Language constructs added to the Java Language (go, undock and migratory), the programmer can write programs to be migrated easily and succinctly. Our system is available in the public domain.
Vadim Zaytsev - One of the best experts on this subject based on the ideXlab platform.
-
recovering grammar relationships for the Java Language specification
arXiv: Programming Languages, 2010Co-Authors: Ralf Lammel, Vadim ZaytsevAbstract:Grammar convergence is a method that helps discovering relationships between different grammars of the same Language or different Language versions. The key element of the method is the operational, transformation-based representation of those relationships. Given input grammars for convergence, they are transformed until they are structurally equal. The transformations are composed from primitive operators; properties of these operators and the composed chains provide quantitative and qualitative insight into the relationships between the grammars at hand. We describe a refined method for grammar convergence, and we use it in a major study, where we recover the relationships between all the grammars that occur in the different versions of the Java Language Specification (JLS). The relationships are represented as grammar transformation chains that capture all accidental or intended differences between the JLS grammars. This method is mechanized and driven by nominal and structural differences between pairs of grammars that are subject to asymmetric, binary convergence steps. We present the underlying operator suite for grammar transformation in detail, and we illustrate the suite with many examples of transformations on the JLS grammars. We also describe the extraction effort, which was needed to make the JLS grammars amenable to automated processing. We include substantial metadata about the convergence process for the JLS so that the effort becomes reproducible and transparent.
-
recovering grammar relationships for the Java Language specification
Source Code Analysis and Manipulation, 2009Co-Authors: Ralf Lammel, Vadim ZaytsevAbstract:We describe a completed effort to recover the relationships between all the grammars that occur in the different versions of the Java Language Specification (JLS). The relationships are represented as grammar transformations that capture all accidental or intended differences between the JLS grammars. This process is mechanized and it is driven by simple measures of nominal or structural differences between any pair of grammars involved. Our work suggests a form of consistency management for the JLS in particular, and Language specifications in general.
-
SCAM - Recovering Grammar Relationships for the Java Language Specification
2009 Ninth IEEE International Working Conference on Source Code Analysis and Manipulation, 2009Co-Authors: Ralf Lammel, Vadim ZaytsevAbstract:We describe a completed effort to recover the relationships between all the grammars that occur in the different versions of the Java Language Specification (JLS). The relationships are represented as grammar transformations that capture all accidental or intended differences between the JLS grammars. This process is mechanized and it is driven by simple measures of nominal or structural differences between any pair of grammars involved. Our work suggests a form of consistency management for the JLS in particular, and Language specifications in general.
Tatsurou Sekiguchi - One of the best experts on this subject based on the ideXlab platform.
-
COORDINATION - A Simple Extension of Java Language for Controllable Transparent Migration and Its Portable Implementation
Coordinatio Languages and Models, 1999Co-Authors: Tatsurou Sekiguchi, Hidehiko Masuhara, Akinori YonezawaAbstract:A scheme has been developed that enables a Java program to be migrated across computers while preserving its execution state, such as the values of local variables and the dynamic extents of try-and-catch blocks. This scheme provides the programmer with flexible control of migration, including transparent migration. It is based on source-code-level transformation. The translator takes as input code a Java program written in a Java Language extended with Language constructs for migration, and outputs pure Java source code that uses JavaRMI. The translated code can run on any Java interpreter and can be compiled by any just-in-time compiler. We have measured some execution performance for several application programs, and found that the translated programs are only about 20% slower than the original programs. Because migration is completely controlled by using only three Language constructs added to the Java Language (go, undock and migratory), the programmer can write programs to be migrated easily and succinctly. Our system is available in the public domain.
-
a simple extension of Java Language for controllable transparent migration and its portable implementation
International Conference on Coordination Models and Languages, 1999Co-Authors: Tatsurou Sekiguchi, Hidehiko Masuhara, Akinori YonezawaAbstract:A scheme has been developed that enables a Java program to be migrated across computers while preserving its execution state, such as the values of local variables and the dynamic extents of try-and-catch blocks. This scheme provides the programmer with flexible control of migration, including transparent migration. It is based on source-code-level transformation. The translator takes as input code a Java program written in a Java Language extended with Language constructs for migration, and outputs pure Java source code that uses JavaRMI. The translated code can run on any Java interpreter and can be compiled by any just-in-time compiler. We have measured some execution performance for several application programs, and found that the translated programs are only about 20% slower than the original programs. Because migration is completely controlled by using only three Language constructs added to the Java Language (go, undock and migratory), the programmer can write programs to be migrated easily and succinctly. Our system is available in the public domain.
