Run-time Tool Research Articles

Implementation of Docker for mobile edge computing embedded platform

Some of the glitches in Mobile cloud computing are high latency, network bottleneck, and congestion. From a centralized to a decentralized computing scenario, Mobile Edge computing can transfer the computation to the edge, which decreases the response time for the application and increase the user experience. This paper assesses Docker as a medium for Edge Computing, a container-based technology. Docker can be seen as an open platform for designers and system managers to use Docker Engine, a portable, lightweight runtime and packaging tool to build, ship, run applications, and Docker hub. This cloud service distributes applications and mechanizing workflows. The key benefit is that, as soon as possible, Docker can get code checked and can fit into production. This paper will discuss Docker and present how this technology has overcome the earlier problems of virtualization with building and deploying large applications in two ways. We have implemented Docker of YOLO and AQM models on Jetson TX2 and compared both applications on Docker and Host OS. We can use dockers in two ways either we can use previously made dockers or build our own Docker according to our needs. In this paper, I have used the Docker image of YOLO and built my own Docker for AQM Model. These Docker containers' performance measured in this paper based on their device performance, memory consumption, boot time, and Docker performed very well.

LBMA and IMAR2: Weighted lottery based migration strategies for NUMA multiprocessing servers

SummaryMulticore NUMA systems present on‐board memory hierarchies and communication networks that influence performance when executing shared memory parallel codes. Characterizing this influence is complex, and understanding the effect of particular hardware configurations on different codes is of paramount importance. In this article, monitoring information extracted from hardware counters at runtime is used to characterize the behavior of each thread for an arbitrary number of multithreaded processes running in a multiprocessing environment. This characterization is given in terms of number of operations per second, operational intensity, and latency of memory accesses. We propose a runtime tool, executed in user space, that uses this information to guide two different thread migration strategies for improving execution efficiency by increasing locality and affinity without requiring any modification in the running codes. Different configurations of NAS Parallel OpenMP benchmarks running concurrently on multicore NUMA systems were used to validate the benefits of our proposal, in which up to four processes are running simultaneously. In more than the 95% of the executions of our tool, results outperform those of the operating system (OS) and produces up to 38% improvement in execution time over the OS for heterogeneous workloads, under different and realistic locality and affinity scenarios.

Dynamic Reliability Management for FPGA-Based Systems

Radiation tolerance in FPGAs is an important field of research particularly for reliable computation in electronics used in aerospace and satellite missions. The motivation behind this research is the degradation of reliability in FPGA hardware due to single-event effects caused by radiation particles. Redundancy is a commonly used technique to enhance the fault-tolerance capability of radiation-sensitive applications. However, redundancy comes with an overhead in terms of excessive area consumption, latency, and power dissipation. Moreover, the redundant circuit implementations vary in structure and resource usage with the redundancy insertion algorithms as well as number of used redundant stages. The radiation environment varies during the operation time span of the mission depending on the orbit and space weather conditions. Therefore, the overheads due to redundancy should also be optimized at run-time with respect to the current radiation level. In this paper, we propose a technique called Dynamic Reliability Management (DRM) that utilizes the radiation data, interprets it, selects a suitable redundancy level, and performs the run-time reconfiguration, thus varying the reliability levels of the target computation modules. DRM is composed of two parts. The design-time tool flow of DRM generates a library of various redundant implementations of the circuit with different magnitudes of performance factors. The run-time tool flow, while utilizing the radiation/error-rate data, selects a required redundancy level and reconfigures the computation module with the corresponding redundant implementation. Both parts of DRM have been verified by experimentation on various benchmarks. The most significant finding we have from this experimentation is that the performance can be scaled multiple times by using partial reconfiguration feature of DRM, e.g., 7.7 and 3.7 times better performance results obtained for our data sorter and matrix multiplier case studies compared with static reliability management techniques. Therefore, DRM allows for maintaining a suitable trade-off between computation reliability and performance overhead during run-time of an application.

Remote Control Laboratory Using EJS Applets and TwinCAT Programmable Logic Controllers

This paper presents a new methodology to develop remote laboratories for systems engineering and automation control courses, based on the combined use of TwinCAT, a laboratory Java server application, and Easy Java Simulations (EJS). The TwinCAT system is used to close the control loop for the selected plants by means of programmable logic controllers (PLCs) deployed in PCs with the TwinCAT run-time tool. EJS is used to develop the laboratory front-end applets that let teachers and students parametrize and observe the behavior of the PLCs from any computer. The laboratory Java server application establishes the connection between the EJS applets and the PLCs, fulfilling the TwinCAT connection requirements while ensuring an individualized access to each PLC. This paper also shows how the practical work in some undergraduate control courses at the Complutense University of Madrid, Spain, already uses the TwinCAT PLC + Java server + EJS applet strategy to provide real-time support to the controllers, remote individualized access to the experiments, and a user-friendly graphic controller interface for the students.

A Non-Modal Approach to Integrating Dialogue and Action

We have developed and demonstrated an experimental authoring and run-time tool, called Disco for Games, that supports the creation of games in which dialogue and action are integrated without the need for changing modes. This tool is based on collaborative discourse theory and hierarchical task networks, in which utterances are treated as actions, and has a number of additional benefits including better modeling of interruptions, automatic dialogue generation, plan recognition and automatic failure retry.

A query language and runtime tool for evaluating behavior of multi-tier servers

As modern multi-tier systems are becoming increasingly large and complex, it becomes more difficult for system analysts to understand the overall behavior of the system, and diagnose performance problems. To assist analysts inspect performance behavior, we introduce SelfTalk, a novel declarative language that allows analysts to query and understand the status of a large scale system. SelfTalk is sufficiently expressive to encode an analyst's high-level hypotheses about system invariants, normal correlations between system metrics, or other a priori derived performance models, such as, "I expect that the throughputs of interconnected system components are linearly correlated". Given a hypothesis, Dena, our runtime support system, instantiates and validates it using actual monitoring data within specific system configurations. We evaluate SelfTalk/Dena by posing several hypotheses about system behavior and querying Dena to validate system behavior in a multi-tier dynamic content server. We find that Dena automatically validates the system performance based on the pre-existing hypotheses and helps to diagnose system misbehavior.

Transparent parallel checkpointing and migration in clusters and ClusterGrids

This paper introduces a novel approach in parallel checkpointing aimed at supporting fault-tolerance and migration among clusters of a ClusterGrid environment with various middleware components. Based on an architectural analysis, compatibility and integrity requirements are identified and corresponding conditions are established. Some of the available checkpointing systems are checked against the conditions in order to examine their conformity. Finally, a novel checkpointing approach is defined and the Parallel Grid Runtime and Application Development Environment (P-GRADE) Grid Programming Tool is adapted.

EXE

This article presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input, EXE runs it on symbolic input initially allowed to be anything. As checked code runs, EXE tracks the constraints on each symbolic (i.e., input-derived) memory location. If a statement uses a symbolic value, EXE does not run it, but instead adds it as an input-constraint; all other statements run as usual. If code conditionally checks a symbolic expression, EXE forks execution, constraining the expression to be true on the true branch and false on the other. Because EXE reasons about all possible values on a path, it has much more power than a traditional runtime tool: (1) it can force execution down any feasible program path and (2) at dangerous operations (e.g., a pointer dereference), it detects if the current path constraints allow any value that causes a bug. When a path terminates or hits a bug, EXE automatically generates a test case by solving the current path constraints to find concrete values using its own co-designed constraint solver, STP. Because EXE’s constraints have no approximations, feeding this concrete input to an uninstrumented version of the checked code will cause it to follow the same path and hit the same bug (assuming deterministic code). EXE works well on real code, finding bugs along with inputs that trigger them in: the BSD and Linux packet filter implementations, the dhcpd DHCP server, the pcre regular expression library, and three Linux file systems.

Integrated service creation environment for open network services

The service creation scheme is changing with the advent of open network service architecture for next-generation network. New requirements should be considered for IT domain developers to create telecom and Internet combined services more easily. This paper describes an integrated service creation environment (SCE) to reflect the trend of network evolution toward an open network environment. The SCE provides multiple service programming tools to support various users’ background, a mash-up toolkit for IT domain, a simulation-based validation tool, a run-time adaptation tool, and a personalized service provisioning environment. Several example services were implemented to verify the features of an integrated SCE. Our approach is very promising because it supports various requirements and background of service developers on the full service creation process. Furthermore, it provides a means for personalized service creation driven by end-user, which is a new trend of future network.

DYNAMICS OF A DISLOCATION SET IN MOTION BY AN EXTERNAL STRESS

The relation between dislocation velocity and resolved shear stress is studied computationally at the atomic scale using Molecular Dynamics simulations in a two-dimensional Lennard–Jones system. Mimicking a well known experimental technique, we apply a calibrated stress pulse to a system with a single dislocation and follow with a run-time graphics tool and displacement-field based tracking method, the dislocation motion caused by momentum transfer from an externally generated stress pulse. The empirically suggested power law relation between dislocation velocity and resolved shear stress seems to hold also in the atomic scale.