Sonics Bus Modeling for Felix/VCC EE249 Project Presentation December 3, 1999 Mike Sheets.

Slides:



Advertisements
Similar presentations
Bus arbitration Processor and DMA controllers both need to initiate data transfers on the bus and access main memory. The device that is allowed to initiate.
Advertisements

1 Dynamic Interconnection Networks Buses CEG 4131 Computer Architecture III Miodrag Bolic.
IT253: Computer Organization
14-MAC Sub-layer Dr. John P. Abraham Professor UTPA.
NetFPGA Project: 4-Port Layer 2/3 Switch Ankur Singla Gene Juknevicius
Chapter 10 Input/Output Organization. Connections between a CPU and an I/O device Types of bus (Figure 10.1) –Address bus –Data bus –Control bus.
1/1/ / faculty of Electrical Engineering eindhoven university of technology Processor support devices Part 1:Interrupts and shared memory dr.ir. A.C. Verschueren.
Parallel I/O Interface Memory CPUI/OTransducer Actuator Output Device Input Device Parallel Interface Microprocessor / Microcontroller Direct memory access(DMA)
Addressing the System-on-a-Chip Interconnect Woes Through Communication-Based Design N. Vinay Krishnan EE249 Class Presentation.
S. Barua – CPSC 440 CHAPTER 8 INTERFACING PROCESSORS AND PERIPHERALS Topics to be covered  How to.
Interfacing Processors and Peripherals Andreas Klappenecker CPSC321 Computer Architecture.
SOC Design at BWRC: A Case Study EE249 Discussion November 30, 1999 Mike Sheets.
Processor Design 5Z0321 Processor Design 5Z032 Chapter 8 Interfacing Processors and Peripherals Henk Corporaal.
10 - Network Layer. Network layer r transport segment from sending to receiving host r on sending side encapsulates segments into datagrams r on rcving.
1 ENTS689L: Packet Processing and Switching Buffer-less Switch Fabric Architectures Buffer-less Switch Fabric Architectures Vahid Tabatabaee Fall 2006.
1 Interfacing Processors and Peripherals I/O Design affected by many factors (expandability, resilience) Performance: — access latency — throughput — connection.
CSCI 4550/8556 Computer Networks Comer, Chapter 11: Extending LANs: Fiber Modems, Repeaters, Bridges and Switches.
1 Link Division Multiplexing (LDM) for NoC Links IEEE 2006 LDM Link Division Multiplexing Arkadiy Morgenshtein, Avinoam Kolodny, Ran Ginosar Technion –
COMP381 by M. Hamdi 1 Input/Output Systems. COMP381 by M. Hamdi 2 Motivation: Who Cares About I/O? CPU Performance: 60% per year I/O system performance.
Lecture Focus: Data Communications and Networking  Data Link Layer  Media Access Control (MAC) Lecture 24 CSCS 311.
Medium Access Control Sublayer
Pipelined Two Step Iterative Matching Algorithms for CIOQ Crossbar Switches Deng Pan and Yuanyuan Yang State University of New York, Stony Brook.
Lecture 12 Today’s topics –CPU basics Registers ALU Control Unit –The bus –Clocks –Input/output subsystem 1.
Computer Architecture Lecture 08 Fasih ur Rehman.
1 Token Passing: IEEE802.5 standard  4 Mbps  maximum token holding time: 10 ms, limiting packet length  packet (token, data) format:  SD, ED mark start,
Digital System Bus A bus in a digital system is a collection of (usually unbroken) signal lines that carry module-to-module communications. The signals.
1 (Based on text: David A. Patterson & John L. Hennessy, Computer Organization and Design: The Hardware/Software Interface, 3 rd Ed., Morgan Kaufmann,
1 Adaptive QoS Framework for Wireless Sensor Networks Lucy He Honeywell Technology & Solutions Lab No. 430 Guo Li Bin Road, Pudong New Area, Shanghai,
Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Medium Access Control Sublayer.
Token Passing: IEEE802.5 standard  4 Mbps  maximum token holding time: 10 ms, limiting packet length  packet (token, data) format:  SD, ED mark start,
DEVICES AND COMMUNICATION BUSES FOR DEVICES NETWORK
(More) Interfacing concepts. Introduction Overview of I/O operations Programmed I/O – Standard I/O – Memory Mapped I/O Device synchronization Readings:
CSIS 3510 Dr. Hoganson Bus Construction CSIS 3510 Computer Organization and Architecture Bus construction alternatives Bus control issues Bus arbitration.
1. Performance Guarantees Introduction –by asking sources about flow behavior it is possible to construct networks that could guarantee performance for.
Bus Mr. Mukul Varshney. Bus A bus, in computing, is a set of physical connections (cables, printed circuits, etc.) which can be shared by multiple hardware.
MODES OF Details of Pins Pin 1GND –Connected Ground Pins 2-16 AD14-AD0–acts as both input/output. Outputs address at the first part of the cycle.
Performance Characterization and Architecture Exploration of PicoRadio Data Link Layer Mei Xu and Rahul Shah EE249 Project Fall 2001 Mentor: Roberto Passerone.
Interrupts, Buses Chapter 6.2.5, Introduction to Interrupts Interrupts are a mechanism by which other modules (e.g. I/O) may interrupt normal.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 4 Switching Concepts.
I/O Computer Organization II 1 Interconnecting Components Need interconnections between – CPU, memory, I/O controllers Bus: shared communication channel.
August 1, 2001Systems Architecture II1 Systems Architecture II (CS ) Lecture 9: I/O Devices and Communication Buses * Jeremy R. Johnson Wednesday,
ISLIP Switch Scheduler Ali Mohammad Zareh Bidoki April 2002.
Belgrade University Aleksandra Smiljanić: High-Capacity Switching Switches with Input Buffers (Cisco)
Lecture 3 Applications of TDM ( T & E Lines ) & Statistical TDM.
Forwarding.
5: DataLink Layer 5a-1 Multiple Access protocol. 5: DataLink Layer 5a-2 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single.
6.1 CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
Multi-objective Topology Synthesis and FPGA Prototyping Framework of Application Specific Network-on-Chip m Akram Ben Ahmed Xinyu LI, Omar Hammami.
Fundamentals of Programming Languages-II
1 Multiplexing Introduction  Multiplexing  The set of techniques that allow the simultaneous transmission of multiple signals across a single data link.
بسم الله الرحمن الرحيم MEMORY AND I/O.
Mohamed Younis CMCS 411, Computer Architecture 1 CMCS Computer Architecture Lecture 26 Bus Interconnect May 7,
1  2004 Morgan Kaufmann Publishers Page Tables. 2  2004 Morgan Kaufmann Publishers Page Tables.
Chapter 4 CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
Token Passing: IEEE802.5 standard  4 Mbps  maximum token holding time: 10 ms, limiting packet length  packet (token, data) format:
CPU scheduling.  Single Process  one process at a time  Maximum CPU utilization obtained with multiprogramming  CPU idle :waiting time is wasted 2.
Basic Concepts Maximum CPU utilization obtained with multiprogramming
COMPUTER NETWORKS CS610 Lecture-13 Hammad Khalid Khan.
2. Data Link Layer: Medium Access Control. Scheduling.
Interconnection Structures
What is a bus? Slow vehicle that many people ride together
Overview Parallel Processing Pipelining
Module 5: CPU Scheduling
3: CPU Scheduling Basic Concepts Scheduling Criteria
EE 122: Lecture 7 Ion Stoica September 18, 2001.
Operating System , Fall 2000 EA101 W 9:00-10:00 F 9:00-11:00
Module 5: CPU Scheduling
Module 5: CPU Scheduling
William Stallings Computer Organization and Architecture
Presentation transcript:

Sonics Bus Modeling for Felix/VCC EE249 Project Presentation December 3, 1999 Mike Sheets

December 3, 1999Modeling Sonics in Felix/VCC2 Introduction What is involved in a bus model? Sonics two level arbitration scheme Modeling the arbiter in VCC Performance simulation Problems with the model

December 3, 1999Modeling Sonics in Felix/VCC3 Modeling in Felix/VCC Architecture exploration requires mapping behavior onto architecture SiliconBackplane is fundamentally a bus Bus models are fundamentally arbitration models Can model Sonics architecture by adding a new arbiter to VCC

December 3, 1999Modeling Sonics in Felix/VCC4 TDMA Arbitration Time Division Multiple Access Each slot is allocated to at most one transmitter Each slot has a fixed time duration Each frame contains n slots Frame repeats continuously … frame (length n) n-1 slot (time slice) 0123…

December 3, 1999Modeling Sonics in Felix/VCC5 Token Passing Arbitration Token Passing Arbitration (Round Robin) Token is passed in a predefined order Transmitter can only send when has token When finished transmitting, passes token on n-1 … current token owner

December 3, 1999Modeling Sonics in Felix/VCC6 Bus Arbitration Scheme Fixed slots Guaranteed bandwidth Potentially wasteful Tokens Guaranteed fair, but might slow down fast initiators Slot allocated when needed Round-robin (token passing) TDMA Reliability Flexibility

December 3, 1999Modeling Sonics in Felix/VCC7 Sonics Hybrid Arbitration Scheme Implemented as two tiers, slice (TDMA) and token (round robin) Owner of the slice gets right of refusal If owner not ready to send, uses token arbiter Can trade-off between slice, token, and both to balance reliability and flexibility

December 3, 1999Modeling Sonics in Felix/VCC8 Sonics Bus Model Flexible bandwidth arbitration model TDMA slot map gives slot owner right of refusal Unowned/unused slots fall to round-robin arbitration SBClk typically different from IClk and TClk so synchronization required Latency after slice granted is user-specified between 2-7 SBClk cycles Initiator Core Initiator Agent ProcessorClock synch., SB handshaking IClkSBClk Interconnect OCP Target Agent Target Core Clock synch., SB handshaking Memory, I/O ports SBClkTClk OCP Pipelined commands Posted writes Selectable read latency Sonics SiliconBackplaneSenderReceiver Arbiter

December 3, 1999Modeling Sonics in Felix/VCC9 Sonics Architecture Cores conform to Open Core Protocol (OCP) SiliconBackplane is synthesized by Sonics tools

December 3, 1999Modeling Sonics in Felix/VCC10 Behavioral Model Four initiator agents and four target agents in a daisy-chain Initiator agent access patterns are uniform pulse trains Target agents simply sink the data

December 3, 1999Modeling Sonics in Felix/VCC11 Hardware Mapping TestCores mapped to hardware cores Communication mapped to SiliconBackplane

December 3, 1999Modeling Sonics in Felix/VCC12 Arbitration Model in VCC Sender CTA Arbiter 1) Posted write Behaviors run continuously Receiver 2) Submit transaction 3) Complete transaction 4) Receive data instantaneoustime delay

December 3, 1999Modeling Sonics in Felix/VCC13 Communication Delay Model 1. Receive a bus transaction 2. Synchronize request to SiliconBackplane clock 3. Arbitrate multiple simultaneous requests to determine the correct time slice 4. Add SiliconBackplane pipeline delays 5. Notify communication complete

December 3, 1999Modeling Sonics in Felix/VCC14 Sonics Arbiter Parameters Bus parameters TDMA time-wheel counter maximums Token-passing order Bus frequency Initiator parameters (communication link) Arbitration policy (slice, token, both) TDMA look-up table (slot map) Minimum number of slots between requests

December 3, 1999Modeling Sonics in Felix/VCC15 Simulation Results Gantt charts show access pattern Legend

December 3, 1999Modeling Sonics in Felix/VCC16 Simulation Results (2) Statistics are provided in tabular form Bus utilization (total or per initiator) Arbitration mean latency (total or per initiator) Most/least utilized connection Results used to tweak arbitration parameters Arbitration policy, slot map, token ordering Bus frequency

December 3, 1999Modeling Sonics in Felix/VCC17 Queuing Receiver Communication Can be implemented using behavior framework Code generation for queue Estimation for queue Sender CTA Arbiter Posted write ReceiverQueue Data available Acknowledge handshake Posted writes can come at any rate

December 3, 1999Modeling Sonics in Felix/VCC18 Queuing Sender Communication Output queue behavior cannot be implemented using any current VCC framework Can fake it by adding CTA queues inside arbiter Problem is being addressed in a future version of VCC Receiver CTA Arbiter SenderQueue Need a handshake here, but the required signals are not available Posted writes can come at any rate

December 3, 1999Modeling Sonics in Felix/VCC19 Summary Sonics SiliconBackplane can be implemented as an arbiter model in VCC Mapping communication to the arbiter model yields useful bus utilization statistics Model is cycle accurate, but made fast by skipping unimportant cycles Queuing model in VCC has some problems