Investigating the Run Time Behavior of Distributed Applications by Using Tiny Java Virtual Machines with Wireless Communications

2009 ◽  
pp. 882-889
Author(s):  
Tsuyoshi Miyazaki ◽  
Takayuki Suzuki ◽  
Fujio Yamamoto
Keyword(s):  
Wireless Communications ◽  
Virtual Machines ◽  
Distributed Applications ◽  
Time Behavior ◽  
Run Time ◽  
Java Virtual Machines

Managing the life cycle of Java Card applets in other Java virtual machines

2014 ◽  
Vol 10 (3) ◽  
pp. 291-312 ◽  
Author(s):  
Michael Roland ◽  
Josef Langer ◽  
Rene Mayrhofer
Keyword(s):  
Life Cycle ◽  
Memory Management ◽  
Virtual Machines ◽  
Near Field ◽  
Content Type ◽  
Java Card ◽  
Persistent Memory ◽  
Run Time ◽  
Java Virtual Machines ◽  
Secure Element

Purpose – The purpose of this paper is to address the design, implementation, performance and limitations of an environment that emulates a secure element for rapid prototyping and debugging. Today, it is difficult for developers to get access to a near field communication (NFC)-secure element in current smartphones. Moreover, the security constraints of smartcards make in-circuit emulation and debugging of applications impractical. Therefore, an environment that emulates a secure element brings significant advantages for developers. Design/methodology/approach – The authors' approach to such an environment is the emulation of Java Card applets on top of non-Java Card virtual machines (e.g. Android Dalvik VM), as this would facilitate the use of existing debugging tools. As the operation principle of the Java Card VM is based on persistent memory technology, the VM and applications running on top of it have a significantly different life cycle compared to other Java VMs. The authors evaluate these differences and their impact on Java VM-based Java Card emulation. They compare possible strategies to overcome the problems caused by these differences, propose a possible solution and create a prototypical implementation to verify the practical feasibility of such an emulation environment. Findings – While the authors found that the Java Card inbuilt persistent memory management is not available on other Java VMs, they present a strategy to model this persistence mechanism on other VMs to build a complete Java Card run-time environment on top of a non-Java Card VM. Their analysis of the performance degradation in a prototypical implementation caused by additional effort put into maintaining persistent application state revealed that the implementation of such an emulation environment is practically feasible. Originality/value – This paper addresses the problem of emulating a complete Java Card run-time environment on top of non-Java Card virtual machines which could open and significantly ease the development of NFC secure element applications.

scholarly journals Better state pictures facilitating state machine characteristic conjecture

2021 ◽  
Author(s):  
Dang Duy Bui ◽  
Kazuhiro Ogata
Keyword(s):  
Virtual Machines ◽  
Mutual Exclusion ◽  
State Machine ◽  
Formal Proof ◽  
The State ◽  
Lessons Learned ◽  
Java Virtual Machines ◽  
Core Part ◽  
Proximity Principle

AbstractThe mutual exclusion protocol invented by Mellor-Crummey and Scott (called MCS protocol) is used to exemplify that state picture designs based on which the state machine graphical animation (SMGA) tool produces graphical animations should be better visualized. Variants of MCS protocol have been used in Java virtual machines and therefore the 2006 Edsger W. Dijkstra Prize in Distributed Computing went to their paper on MCS protocol. The new state picture design of a state machine formalizing MCS protocol is assessed based on Gestalt principles, more specifically proximity principle and similarity principle. We report on a core part of a formal verification case study in which the new state picture design and the SMGA tool largely contributed to the successful completion of the formal proof that MCS protocol enjoys the mutual exclusion property. The lessons learned acquired through our experiments are summarized as two groups of tips. The first group is some new tips on how to make state picture designs. The second one is some tips on how to conjecture state machine characteristics by using the SMGA tool. We also report on one more case study in which the state picture design has been made for the mutual exclusion protocol invented by Anderson (called Anderson protocol) and some characteristics of the protocol have been discovered based on the tips.

Discovery of Emergent Sorting Behavior using Swarm Intelligence and Grid-Enabled Genetic Algorithms

2014 ◽  
pp. 249-271
Author(s):  
Dimitris Kalles ◽  
Alexis Kaporis ◽  
Vassiliki Mperoukli ◽  
Anthony Chatzinouskas
Keyword(s):  
Genetic Algorithms ◽  
Swarm Intelligence ◽  
Time Behavior ◽  
Repeated Application ◽  
Grid Infrastructure ◽  
Sorting Algorithms ◽  
Parameter Configuration ◽  
Local Comparison ◽  
Run Time

The authors in this chapter use simple local comparison and swap operators and demonstrate that their repeated application ends up in sorted sequences across a range of variants, most of which are also genetically evolved. They experimentally validate a square run-time behavior for emergent sorting, suggesting that not knowing in advance which direction to sort and allowing such direction to emerge imposes a n/logn penalty over conventional techniques. The authors validate the emergent sorting algorithms via genetically searching for the most favorable parameter configuration using a grid infrastructure.

REVIEW OF PARALLEL TECHNIQUES AND ITS IMPLICATION FOR JAVA

2010 ◽  
Vol 19 (07) ◽  
pp. 1465-1481
Author(s):  
SUN YU ◽  
WEI ZHANG
Keyword(s):  
Garbage Collection ◽  
Virtual Machines ◽  
State Of The Art ◽  
Parallelizing Compilers ◽  
Research Topics ◽  
Multiprocessor Architectures ◽  
Program Parallelization ◽  
Java Programs ◽  
Java Virtual Machines ◽  
Parallel Techniques

This paper surveys the state-of-the-art parallel techniques for multiprocessor architectures, and studies its implication for Java programs, which are typically compiled at run-time. First, this paper overviews basic techniques of program parallelization in traditional static compilers, followed by a survey of successful parallelizing compilers. Then this paper introduces the latest research topics in this area, particularly focusing on the efforts of combining parallelizing techniques with Java virtual machines, including parallel compilation and parallel real-time garbage collection. Finally, this paper summaries the opportunities and challenges of parallelizing Java computing on multicore platforms.

Sign in / Sign up

Export Citation Format

Share Document