JIST: Just-In-Time Scheduling Translation for Parallel Processors

The application fields of bytecode virtual machines and VLIW processors overlap in the area of embedded and mobile systems, where the two technologies offer different benefits, namely high code portability, low power consumption and reduced hardware cost. Dynamic compilation makes it possible to bri...

Full description

Bibliographic Details
Main Authors: Giovanni Agosta, Stefano Crespi Reghizzi, Gerlando Falauto, Martino Sykora
Format: Article
Language:English
Published: Hindawi Limited 2005-01-01
Series:Scientific Programming
Online Access:http://dx.doi.org/10.1155/2005/127158
id doaj-fa0cb85336bc4299a5e94af924302a2b
record_format Article
spelling doaj-fa0cb85336bc4299a5e94af924302a2b2021-07-02T01:02:00ZengHindawi LimitedScientific Programming1058-92441875-919X2005-01-0113323925310.1155/2005/127158JIST: Just-In-Time Scheduling Translation for Parallel ProcessorsGiovanni Agosta0Stefano Crespi Reghizzi1Gerlando Falauto2Martino Sykora3Politecnico di Milano, Dipartimento di Elettronica e Informazione Piazza Leonardo da Vinci 32 - 20133 Milano, ItalyPolitecnico di Milano, Dipartimento di Elettronica e Informazione Piazza Leonardo da Vinci 32 - 20133 Milano, ItalyPolitecnico di Milano, Dipartimento di Elettronica e Informazione Piazza Leonardo da Vinci 32 - 20133 Milano, ItalyPolitecnico di Milano, Dipartimento di Elettronica e Informazione Piazza Leonardo da Vinci 32 - 20133 Milano, ItalyThe application fields of bytecode virtual machines and VLIW processors overlap in the area of embedded and mobile systems, where the two technologies offer different benefits, namely high code portability, low power consumption and reduced hardware cost. Dynamic compilation makes it possible to bridge the gap between the two technologies, but special attention must be paid to software instruction scheduling, a must for the VLIW architectures. We have implemented JIST, a Virtual Machine and JIT compiler for Java Bytecode targeted to a VLIW processor. We show the impact of various optimizations on the performance of code compiled with JIST through the experimental study on a set of benchmark programs. We report significant speedups, and increments in the number of instructions issued per cycle up to 50% with respect to the non-scheduling version of the JITcompiler. Further optimizations are discussed.http://dx.doi.org/10.1155/2005/127158
collection DOAJ
language English
format Article
sources DOAJ
author Giovanni Agosta
Stefano Crespi Reghizzi
Gerlando Falauto
Martino Sykora
spellingShingle Giovanni Agosta
Stefano Crespi Reghizzi
Gerlando Falauto
Martino Sykora
JIST: Just-In-Time Scheduling Translation for Parallel Processors
Scientific Programming
author_facet Giovanni Agosta
Stefano Crespi Reghizzi
Gerlando Falauto
Martino Sykora
author_sort Giovanni Agosta
title JIST: Just-In-Time Scheduling Translation for Parallel Processors
title_short JIST: Just-In-Time Scheduling Translation for Parallel Processors
title_full JIST: Just-In-Time Scheduling Translation for Parallel Processors
title_fullStr JIST: Just-In-Time Scheduling Translation for Parallel Processors
title_full_unstemmed JIST: Just-In-Time Scheduling Translation for Parallel Processors
title_sort jist: just-in-time scheduling translation for parallel processors
publisher Hindawi Limited
series Scientific Programming
issn 1058-9244
1875-919X
publishDate 2005-01-01
description The application fields of bytecode virtual machines and VLIW processors overlap in the area of embedded and mobile systems, where the two technologies offer different benefits, namely high code portability, low power consumption and reduced hardware cost. Dynamic compilation makes it possible to bridge the gap between the two technologies, but special attention must be paid to software instruction scheduling, a must for the VLIW architectures. We have implemented JIST, a Virtual Machine and JIT compiler for Java Bytecode targeted to a VLIW processor. We show the impact of various optimizations on the performance of code compiled with JIST through the experimental study on a set of benchmark programs. We report significant speedups, and increments in the number of instructions issued per cycle up to 50% with respect to the non-scheduling version of the JITcompiler. Further optimizations are discussed.
url http://dx.doi.org/10.1155/2005/127158
work_keys_str_mv AT giovanniagosta jistjustintimeschedulingtranslationforparallelprocessors
AT stefanocrespireghizzi jistjustintimeschedulingtranslationforparallelprocessors
AT gerlandofalauto jistjustintimeschedulingtranslationforparallelprocessors
AT martinosykora jistjustintimeschedulingtranslationforparallelprocessors
_version_ 1721345611044749312