An executable modeling and analyzing approach to C4ISR architecture

To analyze the behavioral model of the command,control,communication,computer,intelligence,surveillance,reconnaissance(C4ISR)architecture,we propose an executable modeling and analyzing approach to it.First,the meta concept model of the C4ISR architecture is introduced.According to the meta concept model,we construct the executable meta models of the C4ISR architecture by extending the meta models of fUML.Then,we define the concrete syntax and executable activity algebra(EAA)semantics for executable models.The semantics functions are introduced to translating the syntax description of executable models into the item of EAA.To support the execution of models,we propose the executable rules which are the structural operational semantics of EAA.Finally,an area air defense of the C4ISR system is used to illustrate the feasibility of the approach.

An executable framework for modeling and validating cooperative capability requirements in emergency response system

As the scale of current systems become larger and larger and their complexity is increasing gradually,research on executable models in the design phase becomes significantly important as it is helpful to simulate the execution process and capture defects of a system in advance.Meanwhile,the capability of a system becomes so important that stakeholders tend to emphasize their capability requirements when developing a system.To deal with the lack of official specifications and the fundamental theory basis for capability requirement,we propose a cooperative capability requirements(CCR)meta-model as a theory basis for researchers to refer to in this research domain,in which we provide detailed definition of the CCR concepts,associations and rules.Moreover,we also propose an executable framework,which may enable modelers to simulate the execution process of a system in advance and do well in filling the inconsistency and semantic gaps between stakeholders’requirements and their models.The primary working mechanism of the framework is to transform the Alf activity meta-model into the communicating sequential process(CSP)process meta-model based on some mapping rules,after which the internal communication mechanism between process nodes is designed to smooth the execution of behaviors in a CSP system.Moreover,a validation method is utilized to check the correctness and consistency of the models,and a self-fixing mechanism is used to fix the errors and warnings captured during the validation process automatically.Finally,a validation report is generated and fed back to the modelers for system optimization.

The Trade-Off Between Performance and Security of Virtualized Trusted Execution Environment on Android

Nowadays,with the significant growth of the mobile market,security issues on the Android Operation System have also become an urgent matter.Trusted execution environment(TEE)technologies are considered an option for satisfying the inviolable property by taking advantage of hardware security.However,for Android,TEE technologies still contain restrictions and limitations.The first issue is that non-original equipment manufacturer developers have limited access to the functionality of hardware-based TEE.Another issue of hardware-based TEE is the cross-platform problem.Since every mobile device supports different TEE vendors,it becomes an obstacle for developers to migrate their trusted applications to other Android devices.A software-based TEE solution is a potential approach that allows developers to customize,package and deliver the product efficiently.Motivated by that idea,this paper introduces a VTEE model,a software-based TEE solution,on Android devices.This research contributes to the analysis of the feasibility of using a virtualized TEE on Android devices by considering two metrics:computing performance and security.The experiment shows that the VTEE model can host other software-based TEE services and deliver various cryptography TEE functions on theAndroid environment.The security evaluation shows that adding the VTEE model to the existing Android does not addmore security issues to the traditional design.Overall,this paper shows applicable solutions to adjust the balance between computing performance and security.

The Dynamic Checking of Complex Real Time System

The paper presents an dynamic execution model of complex real-time software based on requirement description model RTRSM, and then propose a checking method based on configuration covering and its corresponding algorithm. This checking method can check the execution situations between parallel elements in a dynamic execution step of real-time software systems. It also can check all the states and transitions which assure the completeness of checking. In the end, related theorem is proofed.

Exploitation of Locality for Energy Efficiency for Breadth First Search in Fine-Grain Execution Models

In the upcoming exa-scale era, the exploitation of data locality in parallel programs is very important because it benefits both program performance and energy efficiency. However, this is a hard topic for graph algorithms such as the Breadth First Search （BFS） due to the irregular data access patterns. This study analyzes the exploitation of data locality in the BFS and its impact on the energy efficiency with the Codelet fine-grain dataflow-inspired execution model. The Codelet Model more efficiently exploits data locality than the OpenMP-like execution models which traditionally focus on coarse-grain parallelism inside loops. A BFS algorithm is then given to exploit the locality between two loop iterations that belong to two different loops （inter-loop locality）. This kind of locality can be exploited by the Codelet Model but not by traditional coarse-grain execution models like OpenMR Tests were performed on fsim which is a simulation platform developed by Intel for the Ubiquitous High Performance Computing （UHPC） project to design future exa-scale architectures. The results show that this BFS algorithm saves up to 7% of the dynamic energy for memory accesses compared to a BFS implementation based on OpenMP loop scheduling.

System Architecture for CIMOSA Model Execution

A CIMOSA integrating infrastructure (IIS) provides only a set of general services and a group of execution guidelines. Therefore, in order to execute a CIMOSA model, it is necessary to develop the architecture for its execution system. An execution kernel needs to be developed. The kernel makes use of the services of CIMOSA IIS to control and coordinate the occurrences of CIMOSA model constructs. An extended color Petri net, the control and integration net(CIN), is proposed. This CIN is used to build the execution kernel for the CIMOSA model. The system architecture is given. The execution system's computational view is also presented. The CIMOSA model execution system presented here is under implementation in a production system at the Berlin Fraunhofer Institute of Production Systems and Design Technology. The system's layout and relevant components are introduced. The proposed CIN method provides a new approach for CIM system integration.

Multiple-Morphs Adaptive Stream Architecture

In modern VLSI technology, hundreds of thousands of arithmetic units fit on a 1cm^2 chip. The challenge is supplying them with instructions and data. Stream architecture is able to solve the problem well. However, the applications suited for typical stream architecture are limited. This paper presents the definition of regular stream and irregular stream, and then describes MASA （Multiple-morphs Adaptive Stream Architecture） prototype system which supports different execution models according to applications＇ stream characteristics. This paper first discusses MASA architecture and stream model, and then explores the features and advantages of MASA through mapping stream applications to hardware. Finally MASA is evaluated by ten benchmarks. The result is encouraging.

Principles to Support Modular Software Construction

The construction of large software systems is always achieved through assembly of independently written components -- program modules. For these software components to work together, they must share a common set of data types and principles for representing structured data such as arrays of values and files. This common set of tools for creating and operating on data objects is provided by the infrastructure of the computer system： the hardware, operating system and runtime code. Because the nature and properties of these tools are crucial for correct operation of software components and their inter-operation, it is essential to have a precise specification that may be used for verifying correctness of application software on one hand, and to verify correctness of system behavior on the other. We call such a specification a program execution model （PXM）. It is evident that the properties of the PXM implemented by a computer system can have serious impact on the ability of application programmers to practice modular software construction. This paper discusses the concept of program execution models and presents a set of principles that a PXM must satisfy to provide a sound basis for modular software construction. Because parallel program execution on computer systems with many processing units is an essential part of contemporary computing environments, the expression of parallelism and modular software construction using components involving parallel operations is included in this treatment. The conclusion is that it is possible to build computer systems that implement a PXM within which any parallel program may be used, unmodified, as a component for building more substantial parallel programs.

Optimized Parallel Execution of Declarative Programs on Distributed Memory Multiprocessors

In this paper,we focus on the compiling implementation of parallel logic language PARLOG and functional language ML on distributed memory multiprocessors.Under the graph rewriting framework, a Heterogeneous Parallel Graph Rewriting Execution Model(HPGREM)is presented firstly.Then based on HPGREM,a parallel abstract machine PAM/TGR is described.Furthermore,several optimizing compilation schemes for executing declarative programs on transputer array are proposed. The performance statistics on a transputer array demonstrate the effectiveness of our model,parallel ab- stract machine,optimizing compilation strategies and compiler.

Toward High-Performance Delta-Based Iterative Processing with a Group-Based Approach

Many systems have been built to employ the delta-based iterative execution model to support iterative algorithms on distributed platforms by exploiting the sparse computational dependencies between data items of these iterative algorithms in a synchronous or asynchronous approach. However, for large-scale iterative algorithms, existing synchronous solutions suffer from slow convergence speed and load imbalance, because of the strict barrier between iterations;while existing asynchronous approaches induce excessive redundant communication and computation cost as a result of being barrier-free. In view of the performance trade-off between these two approaches, this paper designs an efficient execution manager, called Aiter-R, which can be integrated into existing delta-based iterative processing systems to efficiently support the execution of delta-based iterative algorithms, by using our proposed group-based iterative execution approach. It can efficiently and correctly explore the middle ground of the two extremes. A heuristic scheduling algorithm is further proposed to allow an iterative algorithm to adaptively choose its trade-off point so as to achieve the maximum efficiency. Experimental results show that Aiter-R strikes a good balance between the synchronous and asynchronous policies and outperforms state-of-the-art solutions. It reduces the execution time by up to 54.1% and 84.6% in comparison with existing asynchronous and the synchronous models, respectively.