MétaCan
Menu
Back to cohort
Record W2099952704 · doi:10.1109/mcom.2005.1509971

Accelerating embedded Java for mobile devices

2005· article· en· W2099952704 on OpenAlexaff
Mourad Debbabi, Azzam Mourad, Chamseddine Talhi, Hamdi Yahyaoui

Bibliographic record

VenueIEEE Communications Magazine · 2005
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsConcordia University
Fundersnot available
KeywordsComputer sciencePortingJavaEmbedded JavaOperating systemEmbedded systemSoftware deploymentCompilerVirtual machineMobile deviceReal time JavastrictfpSoftware

Abstract

fetched live from OpenAlex

With the proliferation of wireless devices, networks, and systems, the deployment of efficient embedded Java virtual machines is becoming a challenging and important research area. Accordingly, a plethora of acceleration techniques have been proposed. In this article we present a new acceleration technology that we developed for embedded Java virtual machines. Acceleration is achieved by the integration of a new selective dynamic compiler, which we called Armed E-Bunny, into the J2ME/CLDC (Java 2 Micro-Edition for Connected Limited Device Configuration) kilobyte virtual machine (KVM). The modified KVM is ported on a handheld PDA that is powered with embedded Linux. Experimental results demonstrate that we accomplished an important speedup (more than 360 percent) with respect to Sun's latest version of KVM. This experimentation was carried out using standard J2ME benchmarks.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0030.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.054
GPT teacher head0.334
Teacher spread0.279 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations9
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Communications MagazineSame topicParallel Computing and Optimization TechniquesFrench-language works237,207