Towards a Reconfiguration Service for Distributed Real-Time Java

REACTION 2012. 1st International workshop on Real-time and distributed computing in emerging applications. December 4th, 2012, San Juan, Puerto Rico.Ancient monolithic distributed systems were attached to well-known development practices and offline analysis. Current scenarios are more dynamic, and open, plenty of applications and services which appear and disappear dynamically at runtime. Likewise, these scenarios require taking into account actions that were traditionally addressed offline, this time in an online scenario. This paper contributes a reconfiguration service in the context of distributed real-time Java application as a means to include real-time reconfiguration into next generation real-time Java systems. The paper addresses the integration taking into account changes required in the API and the cost of some reconfiguration strategies.This research was partially supported by the European Commission (ARTIST2 NoE, ST-2004-004527; iLAND ARTEMIS-JU Call 1) and by the Spanish national project REM4VSS (TIN-2011-28339)

Design, modelling, simulation and integration of cyber physical systems: Methods and applications

The main drivers for the development and evolution of Cyber Physical Systems (CPS) are the reduction of development costs and time along with the enhancement of the designed products. The aim of this survey paper is to provide an overview of different types of system and the associated transition process from mechatronics to CPS and cloud-based (IoT) systems. It will further consider the requirement that methodologies for CPS-design should be part of a multi-disciplinary development process within which designers should focus not only on the separate physical and computational components, but also on their integration and interaction. Challenges related to CPS-design are therefore considered in the paper from the perspectives of the physical processes, computation and integration respectively. Illustrative case studies are selected from different system levels starting with the description of the overlaying concept of Cyber Physical Production Systems (CPPSs). The analysis and evaluation of the specific properties of a sub-system using a condition monitoring system, important for the maintenance purposes, is then given for a wind turbine

Ada (trademark) projects at NASA. Runtime environment issues and recommendations

Ada practitioners should use this document to discuss and establish common short term requirements for Ada runtime environments. The major current Ada runtime environment issues are identified through the analysis of some of the Ada efforts at NASA and other research centers. The runtime environment characteristics of major compilers are compared while alternate runtime implementations are reviewed. Modifications and extensions to the Ada Language Reference Manual to address some of these runtime issues are proposed. Three classes of projects focusing on the most critical runtime features of Ada are recommended, including a range of immediately feasible full scale Ada development projects. Also, a list of runtime features and procurement issues is proposed for consideration by the vendors, contractors and the government

Runtime and Install-Time Binary Translation for Reconfigurable Accelerators

Computer EngineeringNowadays, softwares are often distributed in form of some machine-independent intermediate representation (IR), because compared to machine-dependent native binary, the IR is more portable across a wide range of architectures, has better security, and contains richer semantic information. However, the problem of making use of the accelerator in a target machine to speedup the execution of the IR on top of a just-in-time compiler (JIT) is challenging, mainly because the discovery of compute-intensive kernels and the partitioning of the application to the kernel and sequential parts must be done based on the IR alone, without the access to the program source code as well as the kernel information in the IR. In this work, we propose a Runtime Binary Translation (RBT) technique that can dynamically identify and translate kernels IR to Coarse-Grained Reconfigurable Array (CGRA) accelerator configuration, and offoad the execution of the kernels onto the accelerator. Also, we simplify the RBT approach to make the Install-time Binary Translation (IBT) approach, which does the partitioning and the translation right at the install-time instead of at the runtime. Experimental results show that our RBT and IBT techniques can improve the runtime of the application IR by 1.44 times and 1.61 times, respectively, compare to the runtime on the JIT that does not support making use of the accelerator.ope

FPGA based technical solutions for high throughput data processing and encryption for 5G communication: A review

The field programmable gate array (FPGA) devices are ideal solutions for high-speed processing applications, given their flexibility, parallel processing capability, and power efficiency. In this review paper, at first, an overview of the key applications of FPGA-based platforms in 5G networks/systems is presented, exploiting the improved performances offered by such devices. FPGA-based implementations of cloud radio access network (C-RAN) accelerators, network function virtualization (NFV)-based network slicers, cognitive radio systems, and multiple input multiple output (MIMO) channel characterizers are the main considered applications that can benefit from the high processing rate, power efficiency and flexibility of FPGAs. Furthermore, the implementations of encryption/decryption algorithms by employing the Xilinx Zynq Ultrascale+MPSoC ZCU102 FPGA platform are discussed, and then we introduce our high-speed and lightweight implementation of the well-known AES-128 algorithm, developed on the same FPGA platform, and comparing it with similar solutions already published in the literature. The comparison results indicate that our AES-128 implementation enables efficient hardware usage for a given data-rate (up to 28.16 Gbit/s), resulting in higher efficiency (8.64 Mbps/slice) than other considered solutions. Finally, the applications of the ZCU102 platform for high-speed processing are explored, such as image and signal processing, visual recognition, and hardware resource management

사물인터넷 애플리케이션의 적응형 동적 스케줄링 기법

학위논문 (석사)-- 서울대학교 대학원 : 공과대학 컴퓨터공학부, 2019. 2. 하순회.IoT시스템은매우다른성능과기능을가진이기종스마트장치로구성된분산임베디드시스템이다. IoT시스템에서일반적으로리소스요구사항과실시간요구사항이서로 다른 많은 IoT 애플리케이션들이 동시에 실행된다. 또한, 전력 소비 및 장치 수명과 같은 비 기능적 특성이 중요하게 고려된다. IoT 애플리케이션은 언제든지 추가되거나 제거 될 수 있으며 런타임에 디바이스 상태가 변경 될 수 있다. 이 같이 시스템은 동적 특성을 갖기 때문에 IoT 애플리케이션을 스마트 디바이스에 매핑/스케줄링 하는 것은 매우까다로운문제이다.이문제를해결하기위해점진적매핑및글로벌재매핑의두 가지 스케줄링 기법으로 구성된 새로운 적응적 스케줄링 기법을 제안한다. 동적 환경 변화에 대한 빠른 응답을 제공하기 위해 점진적 매핑 방법을 제안하며, 정적 상태에서 비 기능적 특성에 기초하여 주어진 목적 함수를 최적화하기 위해 주기적으로 IoT 애플리케이션의 전체 태스크를 모두 다시 스케줄링 하는 유전 알고리즘 기반 글로벌 재 매핑 방법은 제안한다. 제안 된 스케줄링 방법의 두 가지 성능 지표로 애플리케이션 수용 비율 및 에너지 소비량을 사용하였으며, 성능 및 실용성은 무작위로 생성 된 시나리오를 사용한 시뮬레이션 환경을 통해 검증한다.An IoT system can be regarded as a distributed embedded system that is composed of heterogeneous smart devices with very different performance and functions. Also many IoT applications that have different resource requirements and real-time requirements will run concurrently in the IoT system. In addition, non-functional properties such as power consumption and device lifetime are considered important. Since an IoT application can be added or removed anytime and the device status may change at run-time, the system is unprecedentedly dynamic in its configuration, which brings up a challenging scheduling problem of IoT applications onto the smart devices. To tackle this problem, we propose a novel adaptive scheduling technique that consists of two scheduling techniques, incremental and global. An incremental heuristic method is proposed to provide fast responsiveness to dynamically changing configuration. During the steady-state operation, a GA-based method is applied to perform global rescheduling of IoT applications periodically to optimize a given objective function based on non-functional properties. We use the acceptance ratio of new applications and energy consumption as two performance metrics of the proposed scheduling method. The viability of the proposed approach is verified by extensive simulations with randomly generated scenarios.Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ii List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v List of Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vi 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2. Problem Description . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.1 Target IoT system . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Motivational Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.3 Problem Definition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3. Schedulability Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.1 Transformation of a Task Graphs to Independent Tasks . . . . . . . . . . 10 3.2 Schedulability Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4. Proposed Mapping Technique . . . . . . . . . . . . . . . . . . . . . . . . . 14 4.1 Incremental Mapping . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 4.2 Global Re-mapping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 5. Experiments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 5.1 Benchmarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 5.2 Experiment 1 (Incremental Mapping) . . . . . . . . . . . . . . . . . . . 23 5.3 Experiment 2 (Global Re-mapping) . . . . . . . . . . . . . . . . . . . . 25 5.4 Experiment 3 (Sensitivity Analysis) . . . . . . . . . . . . . . . . . . . . 27 6. RelatedWork . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 7. Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 요 약 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35Maste