Dynamic Structure Modeling

Slides:



Advertisements
Similar presentations
School of Engineering & Technology Computer Architecture Pipeline.
Advertisements

Lecture 8: Asynchronous Network Algorithms
Adaptive multi-scale model for simulating cardiac conduction Presenter: Jianyu Li, Kechao Xiao.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Chapter 14 Ancestor Tree. Copyright © 2005 Pearson Addison-Wesley. All rights reserved Chapter Objectives Provide a case study example from problem.
Coupling Continuum Model and Smoothed Particle Hydrodynamics Methods for Reactive Transport Yilin Fang, Timothy D Scheibe and Alexandre M Tartakovsky Pacific.
Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.
Application of Parallel Computing to the Simulation of Chaotic Dynamics AndrewKostousov, Ural State University.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
1 One Torus to Rule Them All: Multi-dimensional Queries in P2P Systems Prasanna Ganesan Beverly Yang Hector Garcia-Molina Stanford University.
Space Partitioning for Broad Sweep Collision Detection Part 1 - Grids Game Design Experience Professor Jim Whitehead February 11, 2009 Creative Commons.
A New Household Security Robot System Based on Wireless Sensor Network Reporter :Wei-Qin Du.
An Impulse-Response Based Methodology for Modeling Complex Interconnect Networks Zeynep Dilli, Neil Goldsman, Akın Aktürk Dept. of Electrical and Computer.
Efficient Parallelization for AMR MHD Multiphysics Calculations Implementation in AstroBEAR.
COMP 110 Introduction to Programming Mr. Joshua Stough.
Support for Adaptive Computations Applied to Simulation of Fluids in Biological Systems Immersed Boundary Method Simulation in Titanium Siu Man Yau, Katherine.
CSI Uncertainty in A.I. Lecture 141 The Bigger Picture (Sic) If you saw this picture, what game would you infer you were watching? How could we get.
Data Abstraction and Object- Oriented Programming CS351 – Programming Paradigms.
DEVS and DEVS Model Dr. Feng Gu. Cellular automata with fitness.
Chapter 14 Synchronizers. Synchronizers : Introduction Simulate a synchronous network over an asynchronous underlying network Possible in the absence.
Chapter 6.6, (event-driven simulation) Queues 1CSCI 3333 Data Structures.
Spatial data models (types)
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
Multi-dimensional Queries in P2P Systems. Applications Photo-sharing (photographs tagged with metadata) Multi-player online games (locate objects and.
Chapter 3 Parallel Algorithm Design. Outline Task/channel model Task/channel model Algorithm design methodology Algorithm design methodology Case studies.
Develop DEVS Models Using DEVSJAVA Dr. Feng Gu. DEVS atomic model Elements of an atomic model input events output events state variables state transition.
Emergent Robustness in Software Systems through Decentralized Adaptation: an Ecologically-Inspired ALife Approach Franck Fleurey, Benoit Baudry, Benoit.
A Peer-to-Peer Approach to Resource Discovery in Grid Environments (in HPDC’02, by U of Chicago) Gisik Kwon Nov. 18, 2002.
Objects & Dynamic Dispatch CSE 413 Autumn Plan We’ve learned a great deal about functional and object-oriented programming Now,  Look at semantics.
Definition of cell-shaped spaces. CCA = n C cell’s state variables; n S finite alphabet to represent each cell’s state; n n dimensional space; n N neighboring.
Data Structures: Advanced Damian Gordon. Advanced Data Structure We’ll look at: – Linked Lists – Trees – Stacks – Queues.
DEVS M&S Tutorial 2 Chungman Seo
Teaching Assistant Demonstrator - Contribution - Jan Beutel, Michael Eisenring, Marco Platzner, Christian Plessl, Lothar Thiele Computer Engineering and.
Object Recognition in ROS Using Feature Extractors and Feature Matchers By Dolev Shapira.
08 - StructuralCSC4071 Structural Patterns concerned with how classes and objects are composed to form larger structures –Adapter interface converter Bridge.
Structural Patterns1 Nour El Kadri SEG 3202 Software Design and Architecture Notes based on U of T Design Patterns class.
Programming Paradigms Lecturer Hamza Azeem. What is PP ? Revision of Programming concepts learned in CPLB Learning how to perform “Object-Oriented Programming”
Tarry vs Awerbuchs Shawn Biesan. Background Tarry’s Transversal Algorithm – Initiator forwards token to one of neighbors, each neighbor forwards token.
Enabling Self-management of Component-based High-performance Scientific Applications Hua (Maria) Liu and Manish Parashar The Applied Software Systems Laboratory.
Solve equations using addition and subtraction.
NETWORK TOPOLOGY Network topology is the study of the arrangement or mapping of the elements of a network,especially the physical.
Transforming DEVS to Non-Modular Form For Faster Cellular Space Simulation Arizona Center for Integrative Modeling and Simulation Electrical and Computer.
DEVS-based Modeling and Simulation References: 1.B. P. Zeigler, Hessam S. Sarjoughian, Introduction to DEVS Modeling and Simulation with JAVA: Developing.
ECE 449/549 Class Notes #2 Introduction to Discrete-Event Systems Specification (DEVS) Sept
Dynamic Load Balancing Tree and Structured Computations.
CIS 825 Lecture 9. Minimum Spanning tree construction Each node is a subtree/fragment by itself. Select the minimum outgoing edge of the fragment Send.
Clustering In Mobile Networks Presented By: Assaf Mizrachi Shimrit Artzi Tutor: Dr. Michael Segal.
Subject Four Graphs Data Structures. What is a graph? A data structure that consists of a set of nodes (vertices) and a set of edges that relate the nodes.
The Biologically Inspired Distributed File System: An Emergent Thinker Instantiation Presented by Dr. Ying Lu.
Data Center Network Architectures
Global Circulation Models
Stefan Mihalas Ernst Niebur Krieger Mind/Brain Institute and
Self Healing and Dynamic Construction Framework:
Goal: use counters to add integers
Continue the car washer example Experimental frame
FluidEarth 2 Launch Meeting Linking Area Type Time Stepping Models (An Overview) HR Wallingford, 18th April 2013 Dr David M Kelly
Chapter 9 Cellular Spaces
Decorator Design Pattern
Lecture 9: Asynchronous Network Algorithms
Abstract Data Types (ADTs)
Routing in Packet Networks Shortest Path Routing
DEVS Background DEVS = Discrete Event System Specification
Arrays and Linked Lists
Physics-based simulation for visual computing applications
Graphs.
A Heap Implementation Chapter 26 Adapted from Pearson Education, Inc.
A Heap Implementation Chapter 26 Adapted from Pearson Education, Inc.
Resource Allocation in a Middleware for Streaming Data
DEVS Background DEVS = Discrete Event System Specification
Stencil Pattern ITCS 4/5145 Parallel computing, UNC-Charlotte, B. Wilkinson Jan 28,
Presentation transcript:

Dynamic Structure Modeling Advantages: Increase the Modeling Power Biological Systems, e.g., adapt to a evolving environment Engineered Systems, e.g., dynamically adding/removing computing nodes Deal with Simulation Performance for large scale models

An Simple Example addModel(C); addCoupling(C, COutputPort, B, BInputPort); removeModel(A);

Dynamical Structure Operations Add Model Remove Model Add Coupling Remove Coupling Add interfaces (ports) Remove interfaces (ports)

Who initiates a change and what to change The structure change is controlled by a centralized Executor Every atomic model can initiate a structure change with operation boundaries Every atomic model can initiate a structure change for models everywhere in the model tree

Operation Boundaries addModel(…): a model can only add components to its parent coupled model. removeModel(…): a model can only remove itself and its brothers. addCoupling(…): a model can only add couplings involving itself, its parent, and its brothers. removeCoupling(…): a model can only remove couplings involving itself, its parent, and its brothers. adding/removing ports: a model can only add/remove ports of itself and its brothers.

An Demonstrative Example in SimView variableStructure.CouplingHier

Variable Structure Example: Pulse Pipeline One Dimensional Cell Space 1 2 3 4 5 6 7 8 initialize the cell space with first, second and last cells oneDCell zero = addCell(0,new pulseCell( 0, fireDelay )); oneDCell one = addCell(1,new pulseCell( 1, fireDelay )); oneDCell last = addCell(numCells-1,new pulseCell( numCells-1, fireDelay )); addCoupling( this, "in", zero, "in" ); addCoupling(last, "out", this, "out" ); addCoupling(zero, "out",one,"in"); The advantage of VS is that we do not have to load all of the cells at initialization -- important for large numbers public void addPipeNeighbor(){ addNeighbor(1,new pulseCell(id+1,10)); addNeighborCoupling(+1,"out","in"); } add a call in deltext to create a neighbor and its couplings add neighbor cells as they become active public void deltext( double e, message x ) { addPipeNeighbor(); Continue( e ); if ( phaseIs( "passive" ) && somethingOnPort( x, "in" ) ) holdIn( "fire", rg.expon( fireDelay ) ); } oneDimCellSpace. pipeLineRand

Example: Variable GPT Model Models can be added/removed at the same digraph level and levels underneath it, but they can’t be added to the parent level or from one digraph model into another digraph model at the peer-level.

ForestFire (a) (b) (c) (d) (e) (f)

ForestFire -- Dynamical Resolution Simulation using all low resolution cells Simulation using all high resolution cells Simulation using dynamic resolution cells