Exact and Portable Profiling for the JVM Using Bytecode Instruction Counting

Publications associées (20)

Page 2 sur 2

À propos
Confidentialité
Mentions légales

Graph Chatbot

A Methodology for Profiling and Partitioning Stream Programs on Many-core Architectures

Marco Mattavelli, Malgorzata Maria Michalska, Jani Boutellier

Maximizing the data throughput is a very common implementation objective for several streaming applications. Such task is particularly challenging for implementations based on many-core and multi-core target platforms because, in general, it implies tackli ...

2015

Surgical Precision JIT Compilers

Tiark Rompf, Hassan Chafi

Just-in-time (JIT) compilation of running programs provides more optimization opportunities than offline compilation. Modern JIT compilers, such as those in virtual machines like Oracle's HotSpot for Java or Google's V8 for JavaScript, rely on dynamic prof ...

Assoc Computing Machinery2014

Architecture Internalisation in BIP

Joseph Sifakis, Simon Bliudze

We consider two approaches for building component-based systems, which we call respectively architecture-based and architecture-agnostic. The former consists in describing coordination constraints in a purely declarative manner through parameterizable glue ...

ACM2014

Miniboxing: Improving the Speed to Code Size Tradeoff in Parametric Polymorphism Translations

Martin Odersky, Vlad Ureche, Cristian Talau

Parametric polymorphism enables code reuse and type safety. Underneath the uniform interface exposed to programmers, however, its low level implementation has to cope with inherently non-uniform data: value types of different sizes and semantics (bytes, in ...

2013

Cell Guidance on Nanogratings: A Computational Model of the Interplay between PC12 Growth Cones and Nanostructures

Silvestro Micera

Background: Recently, the effects of nanogratings have been investigated on PC12 with respect to cell polarity, neuronal differentiation, migration, maturation of focal adhesions and alignment of neurites. Methodology/Principal Findings: A synergistic proc ...

Public Library Science2013

Composing Relaxed Transactions

Rachid Guerraoui, Vincent Gramoli, Mihai Letia

As the classic transactional abstraction is sometimes considered too restrictive in leveraging parallelism, a lot of work has been devoted to devising relaxed transactional models with the goal of improving concurrency. Nevertheless, the quest for improvin ...

IEEE Computer Society2013

Memory Power Optimization of Java-Based Embedded Systems Exploiting Garbage Collection Information

David Atienza Alonso

Nowadays, Java is used in all types of embedded devices. For these memory-constrained systems, the automatic dynamicmemorymanager (Garbage Collector or GC) has been always a key factor in terms of the Java Virtual Machine (JVM) performance. Moreover, in cu ...

Elsevier2012

Towards Static Analysis of Virtualization-Obfuscated Binaries

Johannes Kinder

Virtualization-obfuscation protects a program from manual or automated analysis by compiling it into bytecode for a randomized virtual architecture and attaching a corresponding interpreter. Static analysis appears to be helpless on such programs, where on ...

IEEE2012

Widget-Based Approach for Remote Control Labs

Denis Gillet, Christophe Salzmann, Evgeny Bogdanov

The paper presents a novel approach to conduct laboratory experiments in relation with the Control class taught at EPFL. The existing laboratory interface built as a Java applet, which allows students to access experimentation devices locally or remotely, ...

2012

Alternating Control Flow Reconstruction

Johannes Kinder

Unresolved indirect branch instructions are a major obstacle for statically reconstructing a control flow graph (CFG) from machine code. If static analysis cannot compute a precise set of possible targets for a branch, the necessary conservative over-appro ...

Springer2012

Page 2 sur 2