Modeling Process CSCE 668Set 14: Simulations 2 May be several algorithms (processes) runs on each processor to simulate the desired communication system.

Slides:



Advertisements
Similar presentations
Synthesis of Protocol Converter Using Timed Petri-Nets Anh Dang Balaji Krishnamoorthy Manoj Iyer Presented by:
Advertisements

Distributed System Services Prepared By:- Monika Patel.
CSCE 668 DISTRIBUTED ALGORITHMS AND SYSTEMS Fall 2011 Prof. Jennifer Welch CSCE 668 Set 14: Simulations 1.
Impossibility of Distributed Consensus with One Faulty Process
Lecture 8: Asynchronous Network Algorithms
Interaction Modeling for Testing We would generate the test cases based on our understanding of the interactions that may happen. The source is, again,
Supervisory Control of Hybrid Systems Written by X. D. Koutsoukos et al. Presented by Wu, Jian 04/16/2002.
Super computers Parallel Processing By: Lecturer \ Aisha Dawood.
Chap 2 System Structures.
Manipulation Planning. In 1995 Alami, Laumond and T. Simeon proposed to solve the problem by building and searching a ‘manipulation graph’.
© 2006 ITT Educational Services Inc. SE350 System Analysis for Software Engineers: Unit 9 Slide 1 Appendix 3 Object-Oriented Analysis and Design.
An Automata-based Approach to Testing Properties in Event Traces H. Hallal, S. Boroday, A. Ulrich, A. Petrenko Sophia Antipolis, France, May 2003.
1.  Integrated Computer-Aided Manufacturing (ICAM) Definition Languages  Comprehensive, formal syntax for describing a process  Better analysis and.
CPSC 668Set 14: Simulations1 CPSC 668 Distributed Algorithms and Systems Spring 2008 Prof. Jennifer Welch.
1 Complexity of Network Synchronization Raeda Naamnieh.
© 2005 Prentice Hall7-1 Stumpf and Teague Object-Oriented Systems Analysis and Design with UML.
61 Nondeterminism and Nodeterministic Automata. 62 The computational machine models that we learned in the class are deterministic in the sense that the.
CS 582 / CMPE 481 Distributed Systems Fault Tolerance.
An Introduction to Input/Output Automata Qihua Wang.
ECE669 L11: Static Routing Architectures March 4, 2004 ECE 669 Parallel Computer Architecture Lecture 11 Static Routing Architectures.
CPSC 668Set 16: Distributed Shared Memory1 CPSC 668 Distributed Algorithms and Systems Fall 2006 Prof. Jennifer Welch.
© 2005 Prentice Hall12-1 Stumpf and Teague Object-Oriented Systems Analysis and Design with UML.
Group Communication using Ensemble Part II. 2 Introduction From previous tutorial: Ensemble’s application interface: Concepts of Group Membership, View,
Scheduling with Optimized Communication for Time-Triggered Embedded Systems Slide 1 Scheduling with Optimized Communication for Time-Triggered Embedded.
CS294, YelickConsensus, p1 CS Consensus
Component and Deployment Diagrams
EEC-484/584 Computer Networks Lecture 2 Wenbing Zhao
CS230 Project Mobility in Energy Harvesting Wireless Sensor Network Nga Dang, Henry Nguyen, Xiujuan Yi.
Copyright Arshi Khan1 System Programming Instructor Arshi Khan.
Chapter 8 Asynchronous System Model by Mikhail Nesterenko “Distributed Algorithms” by Nancy A. Lynch.
HW/SW/FW Allocation – Page 1 of 14CSCI 4717 – Computer Architecture CSCI 4717/5717 Computer Architecture Allocation of Hardware, Software, and Firmware.
CS321 Functional Programming 2 © JAS Implementation using the Data Flow Approach In a conventional control flow system a program is a set of operations.
An Introduction to Software Architecture
Formal Model for Simulations Instructor: DR. Lê Anh Ngọc Presented by – Group 6: 1. Nguyễn Sơn Hùng 2. Lê Văn Hùng 3. Nguyễn Xuân Hậu 4. Nguyễn Xuân Tùng.
Chapter 14 Asynchronous Network Model by Mikhail Nesterenko “Distributed Algorithms” by Nancy A. Lynch.
Reliable Communication in the Presence of Failures Based on the paper by: Kenneth Birman and Thomas A. Joseph Cesar Talledo COEN 317 Fall 05.
Review for Exam 2. Topics included Deadlock detection Resource and communication deadlock Graph algorithms: Routing, spanning tree, MST, leader election.
Mahapatra-A&M-Fall'001 Co-design Finite State Machines Many slides of this lecture are borrowed from Margarida Jacome.
Lecture 4: Sun: 23/4/1435 Distributed Operating Systems Lecturer/ Kawther Abas CS- 492 : Distributed system & Parallel Processing.
ניתוח מערכות מידע 1 Unified Modeling Language (UML) § § The Unified Modeling Language (UML) is the industry-standard language for: Specifying, Visualizing,
Design Concepts By Deepika Chaudhary.
Logical view –show classes and objects Process view –models the executables Implementation view –Files, configuration and versions Deployment view –Physical.
Distributed System Concepts and Architectures Services
Chapter 5: Distributed objects and remote invocation Introduction Remote procedure call Events and notifications.
Xiong Junjie Node-level debugging based on finite state machine in wireless sensor networks.
Models of Computation. Computation: Computation is a general term for any type of information processing information processing CPU memory.
1 Copyright  2001 Pao-Ann Hsiung SW HW Module Outline l Introduction l Unified HW/SW Representations l HW/SW Partitioning Techniques l Integrated HW/SW.
Week 04 Object Oriented Analysis and Designing. What is a model? A model is quicker and easier to build A model can be used in simulations, to learn more.
Several sets of slides by Prof. Jennifer Welch will be used in this course. The slides are mostly identical to her slides, with some minor changes. Set.
Computer Simulation of Networks ECE/CSC 777: Telecommunications Network Design Fall, 2013, Rudra Dutta.
Layered Systems Rahul Nabar CS 551 Fall ’02. Layered or Hierarchical Designs A layered system is organized hierarchically, each layer providing service.
Chapter 8 Asynchronous System Model by Mikhail Nesterenko “Distributed Algorithms” by Nancy A. Lynch.
CSCE 668 DISTRIBUTED ALGORITHMS AND SYSTEMS Fall 2011 Prof. Jennifer Welch CSCE 668 Set 16: Distributed Shared Memory 1.
Chapter 1. The Role of the Algorithms in Computer.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
Introduction to distributed systems description relation to practice variables and communication primitives instructions states, actions and programs synchrony.
Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.
Computer Systems Architecture Edited by Original lecture by Ian Sunley Areas: Computer users Basic topics What is a computer?
INTRODUCTION TO WIRELESS SENSOR NETWORKS
Formal Languages, Automata and Models of Computation
UML Diagrams By Daniel Damaris Novarianto S..
Finite State Machines Dr K R Bond 2009
Model-Based Testing Model the system
UML Diagrams Jung Woo.
CSCE 668 DISTRIBUTED ALGORITHMS AND SYSTEMS
An Introduction to Software Architecture
Paper written by Flavio Oquendo Presented by Ernesto Medina
Emulating Massively Parallel (PetaFLOPS) Machines
Implementation Plan system integration required for each iteration
Presentation transcript:

Modeling Process CSCE 668Set 14: Simulations 2 May be several algorithms (processes) runs on each processor to simulate the desired communication system. For example, a processor run two algorithms (processes) at the same time ◦ one process (algorithm) that uses the broadcast service ◦ another process (algorithm) that implements the asynchronous broadcast system on top of the asynchronous point-to-point message-passing system proposed facility

Modeling Process (Cont.) Ordering of process, forming a “Stack of protocols” ◦ Environment communicates with the top layer ◦ Each process uses communication primitives to interact with the layer beneath it ◦ The bottom layer communicates with the Communication System CSCE 668Set 14: Simulations3 Algorithm composition

Simulation for Modeling Process CSCE 668Set 14: Simulations 4 layer 1layer 2layer 3 environment communication system modeled as a problem spec (interface & allowable sequences) modeled as a problem spec (interface & allowable sequences) modeled as state machines communicate via appropriate primitives: shared events Layered model

Simulation for Modeling Process (Cont.) CSCE 668Set 14: Simulations 5 layer 1layer 2layer 3 environment communication system Send Propagation of events

Modeling Process Specifications (1) A system consists of ◦ A collection of n processors (or nodes), p 0 through p n-1 ◦ A communication system C linking the nodes ◦ Environment E Notes ◦ Environment E and Communication system C are given as problem specifications ◦ Node is a hardware notion ◦ Running on each node are one or more processes  Processes are organized into a single stack of layers  The same number of layers on each node CSCE 668Set 14: Simulations6

Modeling Process Specifications (2) Each process is state machine (modeled as an automaton) ◦ Has a set of states, including a subset of initial states ◦ Has hour kinds of events  Inputs coming in from the layer above (or the environment, if this is the top layer)  Outputs going out to the layer above  Inputs coming in from the layer below (or the communication system, if this is the bottom layer)  Outputs going out to the layer below ◦ Events of type 1 and 2 form the top interface of the process ◦ Events of type 3 and 4 form the bottom interface of the process CSCE 668Set 14: Simulations7

CSCE 668Set 14: Simulations 8 layer i - 1 layer i layer i + 1 Propagation of events Top interface of layer i Bottom interface of layer i 12 34

Modeling Process Specifications (3) Events ◦ Concepts  An event is said to be enabled in a state of a process if there is a transition from that state labeled with that event  Inputs from the environment and from the communication system are called node inputs A configuration of the system specifies a state for every process on every node ◦ A configuration does not include the state of the communication system ◦ An initial configuration contains all initial states

Modeling Process Specifications (4) An execution of the system is a sequence C 0 e 1 C 1 e 2 C 2 … of alternating configurations C i and events e i ◦ If it is finite, ending with a configuration ◦ Satisfies the following conditions  Configuration C 0 is an initial configuration