Sine-Wave Application v2.0 Pavel Čírtek. Sine-Wave Application v2.0 2 The Aim of the Work Create representative prototype of highly dependable synthetic.

Slides:

Advertisements

Similar presentations

Multiple Processor Systems

Advertisements

Time-Triggered Protocol

1 Hardware Support for Isolation Krste Asanovic U.C. Berkeley MURI “DHOSA” Site Visit April 28, 2011.

Sensor network Routing protocol A study on LEACH protocol and how to improve it.

Impala: A Middleware System for Managing Autonomic, Parallel Sensor Systems Ting Liu and Margaret Martonosi Princeton University.

Spark: Cluster Computing with Working Sets

Safety evaluation of in-car real-time applications distributed on TDMA-based networks Cédric Wilwert Françoise Simonot-Lion, Ye-Qiong Song François Simonot.

PARALLEL PROCESSING COMPARATIVE STUDY 1. CONTEXT How to finish a work in short time???? Solution To use quicker worker. Inconvenient: The speed of worker.

State Machine Replication Project Presentation Ido Zachevsky Marat Radan Supervisor: Ittay Eyal Winter Semester 2010.

Communication Scheduling for Time-Triggered SystemsSlide 1 Communication Scheduling for Time-Triggered Systems Paul Pop, Petru Eles and Zebo Peng Dept.

1 of 30 June 14, 2000 Scheduling and Communication Synthesis for Distributed Real-Time Systems Paul Pop Department of Computer and Information Science.

INSENS: Intrusion-Tolerant Routing For Wireless Sensor Networks By: Jing Deng, Richard Han, Shivakant Mishra Presented by: Daryl Lonnon.

8. Fault Tolerance in Software

Scheduling with Optimized Communication for Time-Triggered Embedded Systems Slide 1 Scheduling with Optimized Communication for Time-Triggered Embedded.

1 of 16 March 30, 2000 Bus Access Optimization for Distributed Embedded Systems Based on Schedulability Analysis Paul Pop, Petru Eles, Zebo Peng Department.

1 of 14 1 Analysis and Synthesis of Communication-Intensive Heterogeneous Real-Time Systems Paul Pop Computer and Information Science Dept. Linköpings.

The Rare Glitch Project: Verifying Bus Protocols for Embedded Systems Edmund Clarke, Daniel Kroening Carnegie Mellon University.

WANs and Routers Routers. Router Description Specialized computer Like a general purpose PC, a router has:  CPU  Memory  System Bus Connecting Internal.

Time-Triggered Architectures, Protocols and Applications. P.S. Thiagarajan.

MULTICOMPUTER 1. MULTICOMPUTER, YANG DIPELAJARI Multiprocessors vs multicomputers Interconnection topologies Switching schemes Communication with messages.

Practical TDMA for Datacenter Ethernet

PMIT-6102 Advanced Database Systems

Lecture 6: Introduction to Distributed Computing.

On Probabilistic Snap-Stabilization Karine Altisen Stéphane Devismes University of Grenoble.

Fault Tolerant and Mobility Aware Routing Protocol for Mobile Wireless Sensor Network Name : Tahani Abid Aladwani ID :

REAL-TIME SOFTWARE SYSTEMS DEVELOPMENT Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.

1 Fault Tolerance in the Nonstop Cyclone System By Scott Chan Robert Jardine Presented by Phuc Nguyen.

OS support for Teraflux A Prototype

Communications. How do computers work?  Computer is made up of many different parts  Receives input from user  Processes information  Produces an.

1 Adaptive QoS Framework for Wireless Sensor Networks Lucy He Honeywell Technology & Solutions Lab No. 430 Guo Li Bin Road, Pudong New Area, Shanghai,

IMPROUVEMENT OF COMPUTER NETWORKS SECURITY BY USING FAULT TOLERANT CLUSTERS Prof. S ERB AUREL Ph. D. Prof. PATRICIU VICTOR-VALERIU Ph. D. Military Technical.

Andreas Larsson, Philippas Tsigas SIROCCO Self-stabilizing (k,r)-Clustering in Clock Rate-limited Systems.

On Probabilistic Snap-Stabilization Karine Altisen Stéphane Devismes University of Grenoble.

© Oxford University Press 2011 DISTRIBUTED COMPUTING Sunita Mahajan Sunita Mahajan, Principal, Institute of Computer Science, MET League of Colleges, Mumbai.

How computer’s are linked together.

Hao Yang, Fan Ye, Yuan Yuan, Songwu Lu, William Arbaugh (UCLA, IBM, U. Maryland) MobiHoc 2005 Toward Resilient Security in Wireless Sensor Networks.

1 of 14 1/15 Synthesis-driven Derivation of Process Graphs from Functional Blocks for Time-Triggered Embedded Systems Master thesis Student: Ghennadii.

Dependable communication synthesis for distributed embedded systems Nagarajan Kandasamy, John P. Hayes, Brian T. Murray Presented by John David Eriksen.

Multiple Processor Systems Chapter Multiprocessors 8.2 Multicomputers 8.3 Distributed systems.

In-Vehicle Communication SAN Group RTS Regular Meeting Presentation December 2008.

Thomas Losert HRTC Meeting 12 September 2002, Vienna Introduction to the TTA.

The Mechanics Of Computers The Operating System (OS) & Hardware.

1 Internet Routing. 2 Terminology Forwarding –Refers to datagram transfer –Performed by host or router –Uses routing table Routing –Refers to propagation.

Multiprossesors Systems.. What are Distributed Databases ? “ A Logically interrelated collection of shared data ( and a description of this data) physically.

TTP and FlexRay. Time Triggered Protocols Global time by fault tolerant clock synchronisation Exact time point of a certain message is known (determinism)

Fault injection tool Fault Injection Tool Pavel Čírtek.

Time Triggered Networks: use in space 2015 CCSDS spring SOIS Plenary 23 March 2015 Glenn Rakow/NASA-GSFC.

Chapter 8-2 : Multicomputers Multiprocessors vs multicomputers Multiprocessors vs multicomputers Interconnection topologies Interconnection topologies.

REAL-TIME SOFTWARE SYSTEMS DEVELOPMENT Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.

Computer Science 1 TinySeRSync: Secure and Resilient Time Synchronization in Wireless Sensor Networks Speaker: Sangwon Hyun Acknowledgement: Slides were.

Membership and Clique Avoidance in TTP/C Gunther Bauer, Michael Paulitsch Presented by Michael Sirivianos 02/01/2005.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.

Clustering Servers Chapter Seven. Exam Objectives in this Chapter:  Plan services for high availability Plan a high availability solution that uses clustering.

Lecture 4 Mechanisms & Kernel for NOSs. Mechanisms for Network Operating Systems  Network operating systems provide three basic mechanisms that support.

Host Side Dynamic Reconfiguration with InfiniBand TM By Wei Lin Guay*, Sven-Arne Reinemo*, Olav Lysne*, Tor Skeie*, Bjørn Dag Johnsen^ and Line Holen^

Rollback-Recovery Protocols I Message Passing Systems Nabil S. Al Ramli.

Cluster computing. 1.What is cluster computing? 2.Need of cluster computing. 3.Architecture 4.Applications of cluster computing 5.Advantages of cluster.

EEC 688/788 Secure and Dependable Computing Lecture 10 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University

Krishna Suman Kadiyala Fault Tolerant Systems EE 585 Fall 2006

Paul Pop, Petru Eles, Zebo Peng

Lecture 7: Introduction to Distributed Computing.

湖南大学-信息科学与工程学院-计算机与科学系

Outline Announcements Fault Tolerance.

Fault Tolerance Distributed Web-based Systems

EEC 688/788 Secure and Dependable Computing

High Performance Computing

EEC 688/788 Secure and Dependable Computing

EEC 688/788 Secure and Dependable Computing

Distributed Systems and Concurrency: Distributed Systems

Presentation transcript:

Sine-Wave Application v2.0 Pavel Čírtek

Sine-Wave Application v2.0 2 The Aim of the Work Create representative prototype of highly dependable synthetic application for TTP/C cluster Perform value-domain fault tolerance tests (every single fault should be tolerated)

Sine-Wave Application v2.0 3 Definitions TTP/C – Time triggered protocol (fulfils C class of safety requirements) TDMA – Time Divided Multiple Access TDMA round – every node has own time slot in one round

Sine-Wave Application v2.0 4 TTP/C node and cluster Communication Controller (CC) – executes TTP/C protocol Host Processor (HP) – executes application program Dual-port CNI (Computer Network Interface) memory – interconnection between CC and HP

Sine-Wave Application v2.0 5 Main goals Verify that a single fault (transient or permanent) can be tolerated Test resilience of app. output with regards to more complicated faults (attacking a single node) Test ability of TTP/C cluster to recover from more complicated faults (attacking more nodes)

Sine-Wave Application v2.0 6 Application work Get phase shift (S-node) Compute it through cluster (C-node) The result phase in A-node should be same as from S-node

Sine-Wave Application v2.0 7 Cluster Schema S-node – sensor C-node – computation A-node – actuator k – number of C-node pairs N – number of nodes = 2*k+4 m – “state memory”

Sine-Wave Application v2.0 8 Cluster timing Two TDMA rounds –Data frame (N-frame) –Initialization frame (I-frame) Tasks –TLF (lifesign) – right before sending (in every node) –Two computation tasks – somehow time shifted (in C-nodes)

Sine-Wave Application v2.0 9 Functionality of C-node Read data d i-1 from message Use data to recalculate state s i and new value d i –s i = f 1 (s i, d i-1 ) –d i = f 1 (s i, d i-1 ) Broadcast new value d i and s i Four values to compare (two nodes, TTP/C doubled bus)

Sine-Wave Application v Application data ROM (e.g. constants) Global data (stored in HP RAM memory) CNI data (special kind of global data, periodically updated by CC) Local data (initialized within every run of its task)

Sine-Wave Application v Fault injection Permanent fault – failed node is fail-silent (only two d i in next FTU) Transient faults: –Global data – four instances of result –Local data – two scenarios: does not influence the control flow only result (same as global data damaging) Influences the control flow – TTP/C should recognize it and restart HP

Sine-Wave Application v Conclusion The aim of model is to use fault injection to evaluate possibilities how to build safety-critical applications. Improvement of old version – node has its state