From logical to physical architecture The following slides uses the example of RT-knobs to study the transition of logical to physical architecture.

Slides:



Advertisements
Similar presentations
Computer Architecture
Advertisements

Categories of I/O Devices
Control Architectures: Feed Forward, Feedback, Ratio, and Cascade
Types of Logic Circuits
©Ian Sommerville 2004Software Engineering, 7th edition. Chapter 9 Distributed Systems Architectures Slide 1 1 Chapter 9 Distributed Systems Architectures.
MotoHawk Training Model-Based Design of Embedded Systems.
GS 540 week 6. HMM basics Given a sequence, and state parameters: – Each possible path through the states has a certain probability of emitting the sequence.
20 September 2000 LHC slow timing implementations brainstorming on slow timing Wednesday 20 September M.Jonker.
Using Computers CS French Chapter 1.
12a.1 Introduction to Parallel Computing UNC-Wilmington, C. Ferner, 2008 Nov 4, 2008.
Problem Solving and Program Design. COMP104 Problem Solving / Slide 2 Our First Program // a simple program #include using namespace std; int main() {
A brief look at CORBA. What is CORBA Common Object Request Broker Architecture developed by OMG Combine benefits of OO and distributed computing Distributed.
Satzinger, Jackson, and Burd Object-Orieneted Analysis & Design
WSN Simulation Template for OMNeT++
Chapter 2: Impact of Machine Architectures What is the Relationship Between Programs, Programming Languages, and Computers.
Learning Outcomes  Know the basic components of a network  Know data transmission methods, including types of signals, modulation, demodulation, and.
ESA UNCLASSIFIED – For Official Use Deterministic Communication with SpaceWire Martin Suess CCSDS Spring Meeting /03/2015.
1 LAN switching and Bridges Relates to Lab 6. Covers interconnection devices (at different layers) and the difference between LAN switching (bridging)
An Introduction to Rational Rose Real-Time
1 Shared-memory Architectures Adapted from a lecture by Ian Watson, University of Machester.
Engineering 1040: Mechanisms & Electric Circuits Fall 2011 Introduction to Embedded Systems.
Network Topologies.
Computer Organization Computer Organization & Assembly Language: Module 2.
1 Shawlands Academy Higher Computing Software Development Unit.
Momentum 2009 Spyder® for Plant Control John Hutchey – Lou Jones.
Bluetooth Background Ericsson, IBM, Intel, Nokia, and Toshiba
GBT Interface Card for a Linux Computer Carson Teale 1.
1 The Software Development Process  Systems analysis  Systems design  Implementation  Testing  Documentation  Evaluation  Maintenance.
Real time control Logical architecture Discussion of logical architecture of real time control systems M.Jonker.
UHD::3320::CH121 DESIGN PHASE Chapter 12. UHD::3320::CH122 Design Phase Two Aspects –Actions which operate on data –Data on which actions operate Two.
95-843: Service Oriented Architecture 1 Master of Information System Management Service Oriented Architecture Lecture 7: BPEL Some notes selected from.
Prog. techniques. Standard prog. techniques Complex programs can be broken down into simpler parts called “Modules” These come in 2 types,“Procedures”
CSC 480 Software Engineering Lecture 18 Nov 6, 2002.
LHC Collimation Project Integration into the control system Michel Jonker External Review of the LHC Collimation Project 1 July 2004.
4.3 Multiplexing FDM TDM. Introduction Definition 1. The transmission of information from one or more source to one or more destination over the same.
Chapter2 Networking Fundamentals
The Software Development Process
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
The Structure of the “THE”- Multiprogramming System Edsger W. Dijkstra Presented by: Jin Li.
IETF 67 – SIMPLE WG SIMPLE Problem Statement Draft-rang-simple-problem-statement-01 Tim Rang - Microsoft Avshalom Houri – IBM Edwin Aoki – AOL.
Firewall for regression testing Tor Stålhane According to White, Jaber, Robinson and Rajlich.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 CH. 8: SWITCHING & DATAGRAM NETWORKS 7.1.
NETWORK TOPOLOGY Network topology is the study of the arrangement or mapping of the elements of a network,especially the physical.
Reconfigurable Communication Interface Between FASTER and RTSim Dec0907.
1 The Software Development Process ► Systems analysis ► Systems design ► Implementation ► Testing ► Documentation ► Evaluation ► Maintenance.
Chapter 2 Network topology and Networking devices.
Slide 1 2/22/2016 Policy-Based Management With SNMP SNMPCONF Working Group - Interim Meeting May 2000 Jon Saperia.
1 Device Controller I/O units typically consist of A mechanical component: the device itself An electronic component: the device controller or adapter.
1 3 Computing System Fundamentals 3.2 Computer Architecture.
TC 25th October1 Real-time A system -- e.g., application system, computer system, operating system -- operates in real time to the degree that those of.
1 LAN switching and Bridges Relates to Lab Outline Interconnection devices Bridges/LAN switches vs. Routers Bridges Learning Bridges Transparent.
XFEL The European X-Ray Laser Project X-Ray Free-Electron Laser Wojciech Jalmuzna, Technical University of Lodz, Department of Microelectronics and Computer.
Embedded Real-Time Systems Processing interrupts Lecturer Department University.
COMP8330/7330/7336 Advanced Parallel and Distributed Computing Tree-Based Networks Cache Coherence Dr. Xiao Qin Auburn University
1 Chapter 1 Basic Structures Of Computers. Computer : Introduction A computer is an electronic machine,devised for performing calculations and controlling.
Switching By, B. R. Chandavarkar, CSE Dept., NITK, Surathkal Ref: B. A. Forouzan, 5 th Edition.
Victoria Ibarra Mat:  Generally, Computer hardware is divided into four main functional areas. These are:  Input devices Input devices  Output.
1 Seminar on SOA Seminar on Service Oriented Architecture BPEL Some notes selected from “Business Process Execution Language for Web Services” by Matjaz.
Lecture 11. Switch Hardware Nowadays switches are very high performance computers with high hardware specifications Switches usually consist of a chassis.
©Ian Sommerville 2000 Software Engineering, 6th edition. Chapter 10Slide 1 Chapter 5:Architectural Design l Establishing the overall structure of a software.
Dr D. Greer, Queens University Belfast ) Software Engineering Chapter 7 Software Architectural Design Learning Outcomes Understand.
1 load [2], [9] Transfer contents of memory location 9 to memory location 2. Illegal instruction.
Deterministic Communication with SpaceWire
Programmable Logic Controllers (PLCs) An Overview.
COMP60621 Fundamentals of Parallel and Distributed Systems
Internet Protocols IP: Internet Protocol
May 2004 doc.: IEEE /629r1 May 2004 The Nature of an ESS
Coherent caches Adapted from a lecture by Ian Watson, University of Machester.
COMP60611 Fundamentals of Parallel and Distributed Systems
Presentation transcript:

From logical to physical architecture The following slides uses the example of RT-knobs to study the transition of logical to physical architecture.

Real time knobs some reflections on rt knobs Real time knobs fit in perfectly in an rt control architecture. If an rt-knob is controlled by an rt measurment, we have an rt-feedback system. Here they are used to study possible physical architectures. How are they defined and how do they work What do they have in common with other RT control such as feedback. What is needed to control them What are the physical architectural issues

Real time knobs Definition of a knob (real time or software) a parameter that is linked to a set of equipment with some precisely defined knob-functions to modify the setting of the equipment: EquipValue n = Knob.Function n (Knob.value) Examples I QF (t) = IRef QF (t) + Delta IQF * QhKnob.value I QF (t) = IRef QF (t) + IRef QF (t) * delta IQF * QhKnob.value The Knob Function may include other reference parameters as well: I QF (t) = IRef QF (t) + EnergyRef(t) * Delta IQF * QhKnob.value To use a knob with a Knob Function that include reference values on a device while the reference functions are changing (I.e. during a ramp) requires that the knob converters know the reference functions and that they are synchronised with the equipment.

Knob D Knob CKnob B RT-knobs: Logical Connection diagram Knob A Device-1Device-2Device-3 RTdev-1RTdev-2RTdev-3 Function A-1 Device-4Device-5 Device-6 Function A-2Function A-3Function B-2Function B-3Function B-4Function C-1Function C-5Function D-6 Function D-99 Device-99 Sum-1Sum-2Sum-3Sum-4Sum-5

Real time knobs Observations: A single knob can be linked to more than one equipment. More than on knob can be linked to the same equipment. The knob function can be expressed as a function of the knob variable, and any of the equipment reference variable (provided that they can be made known to the knob- converter) The knob functions do not have a rigid definition, their definition can be modified when needed. Real time knobs are made from knobs by linking the knob value to a real-time output device (operator console, q- measurement feedback)

Knob D Knob CKnob B RT-knobs: implementation 1, Central knob processing Knob A Device-1Device-2Device-3 RTdev-1RTdev-2RTdev-3 Function A-1 Device-4Device-5 Device-6 Function A-2Function A-3Function B-2Function B-3Function B-4Function C-1Function C-5Function D-6 Function D-99 Device-99 Sum-1Sum-2Sum-3Sum-4Sum-5

RT-knobs: implementation 1, Central knob processing Description: –RT output devices send RTknob values to a central RTknob process –The RTknob process sends one correction value message for every knob update to the involved devices. Multiple knob updates in the same slot are combined The RTknob process may also broadcast correction values even if nothing changed  Since the summing is done centrally, the knob processing is best performed centrally. RT output devices have to communicate with the central RTknob process.  The central RTknob process may take into account dependencies between knobs values (cross terms: EquipValue = function(knob.A, knob.B) )  Bandwidth usage: –Nknobs * knob-update-frequency + –Ndevices * knob-update-frequency

Knob D Knob CKnob B RT-knobs: implementation 2 summing by the devices Knob A Device-1Device-2Device-3 RTdev-1RTdev-2RTdev-3 Function A-1 Device-4Device-5 Device-6 Function A-2Function A-3Function B-2Function B-3Function B-4Function C-1Function C-5Function D-6 Function D-99 Device-99 Sum-1Sum-2Sum-3Sum-4Sum-5

RT-knobs: implementation 2 summing by the devices Description: –RT output devices send RTknob values to a dedicated RTknob process –The RTknob process sends one correction value message for every knob update to the involved devices. Multiple knob updates in the same slot are combined The RTknob process may also broadcast correction values even if nothing changed –The summing of the knob corrections is done on the device  Since the summing is on the device, the knob processing may be distributed.  RT output devices may include the RTknob process  Dependencies between knobs values (cross terms) can only be managed if the knobs are handled by the same RTknob process.  Bandwidth usage:  Number of knobs * knob-update-frequency +   (Ndevices/knob * knob-update-frequency) (summed over all the knobs)

Knob D Knob CKnob B RT-knobs: implementation 3 knob functions in the devices Knob A Device-1Device-2Device-3 RTdev-1RTdev-2RTdev-3 Function A-1 Device-4Device-5 Device-6 Function A-2Function A-3Function B-2Function B-3Function B-4Function C-1Function C-5 Function A-6Function A-99 Device-99 Sum-1Sum-2Sum-3Sum-4Sum-5

RT-knobs: implementation 3 knob functions in the devices Description: –RT output devices send RTknob values to all subscribed devices The device executes the Knob calculation locally The summing of the knob corrections is done locally Dependencies between knobs values (cross terms) can be managed locally on the device.  RTknobs can be used more easily during ramps.  Bandwidth usage is the lowest –Number of knobs * knob-update-frequency  Processing on the device is highest (however, if only simple linear knob functions are used this should be ok)  RTKnob values can be broadcast (no point to point communication). It could use the slow-timing services or any other means.  The ramp itself could be implemented as an RTknob ( although in reality one will not have all the freedom as one may think, e.g. variable ramp speeds, due to dynamic effects ).

Gateway controller Knob D Knob CKnob B RT-knobs: implementation 4 knob functions distributed as processes of local fieldbus masters Knob A Device-1Device-2Device-3 RTdev-1RTdev-2RTdev-3 Function A-1 Device-101Device-102 Device-6 Function A-2Function A-3Function B-2Function B-3Function B-101Function C-1Function C-102 Function A-6Function A-99 Device-99 Sum-1Sum-2Sum-3Sum-101Sum-102 Ranp Function R-1 Ranp Function R-2 Ranp Function R-3 Ranp Function R-101 Ranp Function R-102 Fieldbus timing

RT-knobs: implementation 4 knob functions distributed as processes of local fieldbus masters –A combination of implementation 1 and 3. –Processing is done distributed in processors that have access to the local equipment bus.  The high bandwidth communication is isolated on the local equipment bus.  This system is more appropriate for local feedback loops.  The function generation could be implemented in software modules running on the local processors.  More flexibility on the long term.  Simpler electronics.  Function generation (for test and debugging) can be done locally from the local equipment bus control processor.