EOVSA STATE FRAME ASSEMBLY, DISTRIBUTION, AND SYNCHRONIZATION Gelu Nita NJIT 15-17 MARCH 2012 EOVSA PDR MEETING 1.

Slides:



Advertisements
Similar presentations
Network II.5 simulator ..
Advertisements

System Integration and Performance
Tivoli Service Request Manager
COM vs. CORBA.
Umut Girit  One of the core members of the Internet Protocol Suite, the set of network protocols used for the Internet. With UDP, computer.
Protocol Configuration in Horner OCS
Pipeline transfer testing. The purpose of pipeline transfer increase the bandwidth for synchronous slave peripherals that require several cycles to return.
C# and Windows Programming Application Domains and Remoting.
(4.4) Internet Protocols Layered approach to Internet Software 1.
Introduction to push technology © 2009 Research In Motion Limited.
Dale E. Gary Professor, Physics, Center for Solar-Terrestrial Research New Jersey Institute of Technology 1 3/15/2012OVSA Preliminary Design Review Meeting.
Dale E. Gary Professor, Physics, Center for Solar-Terrestrial Research New Jersey Institute of Technology 1 11/7/2011OVSA Technical Design Meeting.
Dale E. Gary Professor, Physics, Center for Solar-Terrestrial Research New Jersey Institute of Technology 1 11/7/2011OVSA Technical Design Meeting.
UDP - User Datagram Protocol UDP – User Datagram Protocol Author : Nir Shafrir Reference The TCP/IP Guide - ( Version Version.
Inter Process Communication:  It is an essential aspect of process management. By allowing processes to communicate with each other: 1.We can synchronize.
Network Programming. The biggest difficult part in networking programming lies in understanding networking not in using java networking package. Since.
TCP/IP Protocol Suite 1 Chapter 11 Upon completion you will be able to: User Datagram Protocol Be able to explain process-to-process communication Know.
Domain Name System: DNS
Gelu M. Nita NJIT. OUTADATED Noise Diode Control Day/Night Attn. Ctrl. Solar Burst Attn. Ctrl. V/H RF Power Out Attn. Ctrl. Temperature Sensors OUTADATED.
EOVSA PROJECT REVIEW: MONITOR & CONTROL SYSTEM Gelu Nita NJIT SEPTEMBER 2012 EOVSA PROJECT REVIEW MEETING 1.
Dale E. Gary Professor, Physics, Center for Solar-Terrestrial Research New Jersey Institute of Technology 1 09/24/2012Prototype Review Meeting.
The University of New Hampshire InterOperability Laboratory Serial ATA (SATA) Protocol Chapter 10 – Transport Layer.
Process-to-Process Delivery:
Dynamic Host Configuration Protocol (DHCP)
USB host for web camera connection
OCP: Open Core Protocol Marta Posada ESA/ESTEC June 2006.
Chapter 17 Networking Dave Bremer Otago Polytechnic, N.Z. ©2008, Prentice Hall Operating Systems: Internals and Design Principles, 6/E William Stallings.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Lecture 2 TCP/IP Protocol Suite Reference: TCP/IP Protocol Suite, 4 th Edition (chapter 2) 1.
Chapter 17 Domain Name System
RFid Technology TELE 480 Presentation. What is RFid? RFid is an ADC technology that uses radio- frequency waves to transfer data between a reader and.
NETW 3005 I/O Systems. Reading For this lecture, you should have read Chapter 13 (Sections 1-4, 7). NETW3005 (Operating Systems) Lecture 10 - I/O Systems2.
LWIP TCP/IP Stack 김백규.
Jozef Goetz, Application Layer PART VI Jozef Goetz, Position of application layer The application layer enables the user, whether human.
TCP1 Transmission Control Protocol (TCP). TCP2 Outline Transmission Control Protocol.
Transmission Control Protocol
Digital Packaging Processor Gordon Hurford Jim McTiernan EOVSA PDR 15-March-2012.
Inter-process communication: Socket. socket Internet socket From Wikipedia, the free encyclopedia Jump to: navigation,
1 Kyung Hee University Chapter 18 Domain Name System.
Li Tak Sing COMPS311F. Case study: consumers and producers A fixed size buffer which can hold at most certain integers. A number of producers which generate.
File Transfer And Access Chapter 26 Chapter 26 Group 3 Presentation Deepak Mittal Nishit Ranjan Venugopal Janapati Amit Palshikar Ref: Internetworking.
The Alternative Larry Moore. 5 Nodes and Variant Input File Sizes Hadoop Alternative.
Accessing I/O Devices Processor Memory BUS I/O Device 1 I/O Device 2.
TCP/IP (Transmission Control Protocol / Internet Protocol)
1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Dynamic Host Configuration Protocol (DHCP)
Chapter 13 – I/O Systems (Pgs ). Devices  Two conflicting properties A. Growing uniformity in interfaces (both h/w and s/w): e.g., USB, TWAIN.
Configuration Mapper Sonja Vrcic Socorro,
Digital Packaging Processor - Overview Gordon Hurford Nov 7, 2011 EOVSA Technical Design Meeting - NJIT.
Mapping IP Addresses to Hardware Addresses Chapter 5.
CSI 3125, Preliminaries, page 1 Networking. CSI 3125, Preliminaries, page 2 Networking A network represents interconnection of computers that is capable.
Lecture 4 Mechanisms & Kernel for NOSs. Mechanisms for Network Operating Systems  Network operating systems provide three basic mechanisms that support.
Unit 1 Lecture 4.
Software development Control system of the new IGBT EE switch.
Computer Science Lecture 3, page 1 CS677: Distributed OS Last Class: Communication in Distributed Systems Structured or unstructured? Addressing? Blocking/non-blocking?
Hour 6 The Transport Layer 1. What You'll Learn in This Hour Connections oriented and connectionless protocols Ports and sockets TCP UDP 2.
Lecture 4 General-Purpose Input/Output NCHUEE 720A Lab Prof. Jichiang Tsai.
1 Channel Access Concepts – IHEP EPICS Training – K.F – Aug EPICS Channel Access Concepts Kazuro Furukawa, KEK (Bob Dalesio, LANL)
Embedded Computer - Definition When a microcomputer is part of a larger product, it is said to be an embedded computer. The embedded computer retrieves.
1 Kyung Hee University Chapter 11 User Datagram Protocol.
UDP: User Datagram Protocol Chapter 12. Introduction Multiple application programs can execute simultaneously on a given computer and can send and receive.
1 DAQ.IHEP Beijing, CAS.CHINA mail to: The Readout In BESIII DAQ Framework The BESIII DAQ system consists of the readout subsystem, the.
Chapter 27 Network Management Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 11 User Datagram Protocol
Muen Policy & Toolchain
z/Ware 2.0 Technical Overview
Net 431 D: ADVANCED COMPUTER NETWORKS
Process-to-Process Delivery:
CS4470 Computer Networking Protocols
Transport Layer 9/22/2019.
Presentation transcript:

EOVSA STATE FRAME ASSEMBLY, DISTRIBUTION, AND SYNCHRONIZATION Gelu Nita NJIT MARCH 2012 EOVSA PDR MEETING 1

EOVSA STATE FRAME DEFINITION AND SPECIFICATIONS  Describes the state of the system during the preceding second of operation in a form of a fixed-length structure that does not change during system operation, but may be changed as the result of a software update.  May contain scalar parameters valid for the entire second, or arrays of parameters corresponding to a predefined number of sub-second time slots.  It is provided, upon request, in a form of a binary package that is formatted according to a predefined data template, to any client that connects to the State Frame Server via TCP/IP during a predefined time interval in which any new state frame resides in a fixed length memory buffer before being transferred to the RDBMS system MARCH 2012EOVSA PDR MEETING 2

STATE FRAME SYNCHRONIZATION  The EOVSA State Frame will be assembled based on a 50 PPS timing source that will be derived from, and aligned with, the1PPS GPS timing source.  Each State Frame will be uniquely identified by the state frame 1 PPS Timestamp assigned by the EOVSA master clock.  Each State Frame will be composed from 50 time bins aligned with the 50 PPS timing source.  Any EOVSA state switch, such tunings, attenuation changes, etc., will occur exactly on the rising edge of a 50 PPS trigger.  It is planned for all transition states not to last more than 1ms after the 50 PPS trigger.  The EOVSA Correlator must synchronize its accumulations such as to be started and ended within the 19 ms stationary time interval laying between two subsequent 50 PPS ticks MARCH 2012EOVSA PDR MEETING 3

STATE FRAME SYNCHRONIZATION  One 50 PPS Time Slot MARCH 2012EOVSA PDR MEETING 4 Accumulation (18.773ms) Transition interval 1ms 50 PPS tick Tuning 50 PPS tick Tuning 1ms

STATE FRAME SYNCHRONIZATION  One Second State Frame Interval MARCH 2012EOVSA PDR MEETING 5 1 PPS tick State Frame Start 1 PPS tick SF Start I I I I I I I I I I I I I I I I I I I I I I I I 50 PPS ticks

EOVSA STATE FRAME ASSEMBLY  The EOVSA State Frame will be assembled by the real-time Array Control Computer, which will gather partial information from the Field Antenna Controllers, the Downconverter System, the LO System, and from the Task Scheduler, and combine everything in a fixed-length data structure that may contain, if needed, pre allocated slots that may be later filled with post-assembly parameters not yet available, such as acknowledgement flags that other data processing EOVSA subsystems may need to set at a later time.  On the 1 PPS tick, the fully assembled state frame will be stored in the State Frame Server’s memory buffer, when it will reside and be available to be served upon request, until all post-processing tags are filled in, or the time comes for being transferred to the RDBMS system MARCH 2012EOVSA PDR MEETING 6

STATE FRAME ASSEMBLY STEPS AND LATENCY MARCH 2012EOVSA PDR MEETING 7 All distributed EOVSA control and monitor real-time subsystems gather and pack sub- frame information corresponding to 50 20ms time slots 1PPS tick: Start of a new state frame assembly Previous second sub-frame data is sent to ACC 1PPS tick TBD x 50 PPS ticks All previous second sub-frames are assembled together TBD x 50 PPS ticks State Frame is available for being retrieved upon request from the State Frame Server State Frame Latency: 1s+TBD x 50 PPS ticks

SERVER-CLIENT STATE FRAME TEMPLATE TRANSACTION  Before starting to receive state frames from the server, any client must obtain from the State Frame Server a description of the most recent state frame structure in a form of a self-describing template generated by the server at its start-up.  OPTIONS:  GENERAL PURPOSE TCP/IP SOCKET (Needs more transaction steps and a request-response protocol to be implemented)  DEDICATED TCP/IP SOCKET (Much simpler implementation since the server would know in advance what the client is waiting for)  An variable-length XML-based convention will be used to describe the fixed-length state frame structure MARCH 2012EOVSA PDR MEETING 8

EXAMPLE: EOVSA SUBSYSTEM TESTBED (EST) STATE FRAME TEMPLATE STATEFRAME 17 Timestamp …......more here………….. BAND 10 ……………more here……… uvw 3 10 ……………more here…… Trackstatus 4 Timestamp Antenna1 0 Antenna2 0 Antenna3 0 ……………more here…… MARCH 2012EOVSA PDR MEETING 9

LABVIEW-IDL FIXED-LENGTH NUMERICAL DATA TYPE CORRESPONDENCE LabVIEW Numeric Data Type#bitsSymbolIDL Equivalent Data Type 8-bit Integer 8I8NONE 16-bit Integer 16I16INT 32-bit Integer 32I32LONG 64-bit Integer 64I64LONG64 Unsigned 8-bit Integer 8U8BYTE Unsigned 16-bit Integer 16U16UNSIGNED Unsigned 32-bit Integer 32U32ULONG Unsigned 64-bit Integer 64U64ULONG64 Single-Precision Floating- Point Number 32SGLFLOAT Double-Precision Floating- Point Number 64DBLDOUBLE Single-Precision Complex Floating-Point Number 64CSGCOMPLEX MARCH 2012EOVSA PDR MEETING 10

THREE IMPORTANT DETAILS THAT WILL NOT BE CONTAINED BY THE STATE FRAME TEMPLATE  Data will be transmitted by the State Frame Server to all its clients as a binary stream having a big-endian format  The data block corresponding to an array data type will be always preceded by as many I32-slots as needed to store each of the array dimensions. This information would be redundant but required by the internal memory mapping at State Frame Server side.  Multidimensional arrays will follow a row major convention Therefore, the state frame data section corresponding to an array that would be represented by IDL as arr=bindgen(2,3) would be transmitted as MARCH 2012EOVSA PDR MEETING 11

SERVER-CLIENT STATE FRAME TRANSACTION (PART I)  OPTIONS:  GENERAL PURPOSE TCP/IP SOCKET (Needs more transaction steps and a request-response protocol to be implemented)  DEDICATED PORT (Much simpler implementation)  TRANSACTION STEPS:  Server listens at a port for a client to connect  Client connects and asks for a specific state frame identified by an 1PPS timestamp  Server searches the buffer and sends the matched state frame  Client acknowledges receiving it and closes connection with the server at its side  Server receives acknowledgement and closes connection with the client at its side MARCH 2012EOVSA PDR MEETING 12

SERVER-CLIENT STATE FRAME TRANSACTION (PART II)  OPTIONS:  Server transmits the entire state frame to its clients (Simple implementation compatible to using a dedicated state frame socket)  Server transmits only the relevant information to its clients (requires some overhead associated with extracting the relevant information and would need a request/response protocol or an individualized dedicated socket for each type of client )  The state frame may contain dedicated slots for:  Flagging the current transaction status corresponding to each of its registered clients (sent, delivered, processed, etc. ?)  Flagging the updating status of those fields needed to be updated by its clients (waiting, updated, etc. ?)  State Frame updating transactions:  If a client needs to update a state frame field, the client will send only the relevant information tagged by the 1PPS timestamp of the state frame to be updated  Such transactions may need dedicated TCP/IP communication channels independent of the state frame channel.  The updated information would be sent by the clients having the same format as the one described in the corresponding slot of state frame template MARCH 2012EOVSA PDR MEETING 13