Monitor memory space Address (Hex) Description (Each 24 bits)

Slides:



Advertisements
Similar presentations
Operating Systems File Management.
Advertisements

Memory Section 7.2. Types of Memories Definitions – Write: store new information into memory – Read: transfer stored information out of memory Random-Access.
1 CMPT 300 Introduction to Operating Systems Virtual Memory Sample Questions.
Miss Penalty Reduction Techniques (Sec. 5.4) Multilevel Caches: A second level cache (L2) is added between the original Level-1 cache and main memory.
1 Computer Communication & Networks Lecture 17 & 18 Network Layer: Logical Addressing Waleed Ejaz.
Sumitha Ajith Saicharan Bandarupalli Mahesh Borgaonkar.
Dr. Kalpakis CMSC 661, Principles of Database Systems Representing Data Elements [12]
M. Mateen Yaqoob The University of Lahore Spring 2014.
Chapter 12 Memory Organization
Chapter 9: Virtual-Memory Management. 9.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 9: Virtual Memory Background Demand Paging.
Allocating Memory.
S CRATCHPAD M EMORIES : A D ESIGN A LTERNATIVE FOR C ACHE O N - CHIP M EMORY IN E MBEDDED S YSTEMS - Nalini Kumar Gaurav Chitroda Komal Kasat.
Chapter 101 Virtual Memory Chapter 10 Sections and plus (Skip:10.3.2, 10.7, rest of 10.8)
+======-========-========-========-========-========-========-========-========+ | Bit| 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 | |Byte | | | | | | | | | |======+=======================================================================|
Presentation to DØ STT Stony Brook by Reginald J. Perry, Ph.D. Professor and Chairman Department of Electrical and Computer Engineering (ECE)
Computer System Overview
Memory Management Five Requirements for Memory Management to satisfy: –Relocation Users generally don’t know where they will be placed in main memory May.
David Nelson STAVE Test Electronics July 1, ATLAS STAVE Test Electronics Preliminary V3 Presented by David Nelson.
VIRTUAL MEMORY. Virtual memory technique is used to extents the size of physical memory When a program does not completely fit into the main memory, it.
1/2002JNM1 With 20 bits, 1,048,576 different combinations are available. Each memory location is assigned a different combination. Each memory location.
CACHE MEMORY Cache memory, also called CPU memory, is random access memory (RAM) that a computer microprocessor can access more quickly than it can access.
COS 598: Advanced Operating System. Operating System Review What are the two purposes of an OS? What are the two modes of execution? Why do we have two.
Introduction to Hard Drives Chapter 6 - Key Terms Information Compiled by Diane Ferris, Michele Henderson & Vicki Kertz.
VHDL design and FPLD implementation for Silicon Track Card Presentation by Shweta Lolage In partial fulfillment of the requirements for the degree of Masters.
1 Memory Hierarchy The main memory occupies a central position by being able to communicate directly with the CPU and with auxiliary memory devices through.
LAV Software Status Emanuele Leonardi – Tommaso Spadaro Photon Veto WG meeting – 2015/03/24.
D75P 34 – HNC Computer Architecture Week 5 Memory Maps. © C Nyssen/Aberdeen College 2003 All images © C Nyssen/Aberdeen College except where stated Prepared.
System-On-a-Programmable-Chip (SOPC) Implementation of the Silicon Track Card (STC) Thesis Defense By Arvindh-kumar Lalam Department of Electrical and.
Sampling chip psTDC_02 Jean-Francois Genat – Herve Grabas Mary Heinz – Eric Oberla 1/27/ psTDC_02 presentation.
FPLD Decoder: Components & Functions Florida State University Roberto A Brown 6/11/99.
1 Level 1 Pre Processor and Interface L1PPI Guido Haefeli L1 Review 14. June 2002.
Memory Management Program must be brought (from disk) into memory and placed within a process for it to be run Main memory and registers are only storage.
DAQ Errors John Zweizig LIGO/Caltech LSC Analysis Meeting Tufts June 6, 2004.
Memory: Page Table Structure CSSE 332 Operating Systems Rose-Hulman Institute of Technology.
Input/Output (I/O) Important OS function – control I/O
Memory: Page Table Structure
Basic Paging (1) logical address space of a process can be made noncontiguous; process is allocated physical memory whenever the latter is available. Divide.
Memory Hierarchy Ideal memory is fast, large, and inexpensive
Computer Organization
Jonathan Walpole Computer Science Portland State University
Topics SRAM-based FPGA fabrics: Xilinx. Altera..
Digital readout architecture for Velopix
External Memory.
Chapter 11: File System Implementation
26 - File Systems.
Von Neumann model - Memory
Paging Examples Assume a page size of 1K and a 15-bit logical address space. How many pages are in the system?
The Hardware Interface
Paging Lecture November 2018.
FIGURE 7.1 Conventional and array logic diagrams for OR gate
FIGURE 12-1 Memory Hierarchy
Module IV Memory Organization.
Chapter 11: File System Implementation
Computer Architecture
Direct Mapping.
Module IV Memory Organization.
Operating Systems Placement Algorithm Alok Kumar Jagadev.
Address Space Layout Randomization (ASLR) Dirk Gordon
Memory Management Tasks
Von Neumann model - Memory
Memory Organization.
Clusters, Sectors, and Files
Advance Database System
Jean-Francois Genat – Herve Grabas Mary Heinz – Eric Oberla
Chapter 11: File System Implementation
Requirements Definition
COMP755 Advanced Operating Systems
A+ Guide to Hardware: Managing, Maintaining, and Troubleshooting
Overview Problem Solution CPU vs Memory performance imbalance
Presentation transcript:

Monitor memory space Address (Hex) Description (Each 24 bits) 0 Serr,mismatch,smt_id,seq_id,hdi_id,data (last data word read) 1 Serr error count – Serr bit high 2 mismatch in the seq-id or the HDI-id 3 zero error count – Zero byte not found 10 # of undefined data_type clusters 11 # of axial data_type clusters 12 # of stereo data_type clusters 13 # of Z-axis data_type clusters 20-28 Data activity on Chip(I)

Miscellaneous memory space The miscellaneous memory space constitutes of - 1. Bad channel: 32 X 64 – address : 0400 – 047F 2. Chip ranges : 24 X 1 – address : 0480 3. Pulse area thresholds:36 X 4 – address : 0500 – 0503 4. Miscellaneous parameters: 20 X 1 – SEQ_ID(8), HDI_ID(3),Disable bit(1), and Delay count (8). – address : 0580 5. Cluster threshold values: 17 X 4 – address : 0600 – 0603

Clustering algorithm

Clustering algorithm (continued..)

Hit filter Control Logic

Hit filter Control Logic (continued..)

Hit format Logic

Hit format Logic (continued..)

Approach 1 The synthesis tool was allowed to fit the design in minimum number of FPLDs Number of devices 5 Strip_reader_hitfilter_l3_schematic EPF10K200EGC599-1 Strip_reader_hitfilter_l3_schematic-1 Strip_reader_hitfilter_l3_schematic -2 EPF10K30ETC144-1 Strip_reader_hitfilter_l3_schematic-3 EPF10K30EQC208-1 Strip_reader_hitfilter_l3_schematic-4 EPF10K50EQC208-1 The synthesis tool mapped the design in five FPLDs such that the Embedded Array Blocks (EABs) were uniformly distributed but the major portion of the memory was set in the larger FPLDs. The FPLDs holding the memory had very small percentage of logic cells occupied.

Approach 2 The Hit Filter and L3 buffers are forced in one FPLD each and the synthesis tool is allowed to fit Strip Reader and Centroid Finder Number of devices 3 Hitfilter_schematic EPF10K100EBC356-1 L3_schematic EPF10K200EGC599-1 Strip_reader_hitfilter_l3- 1 EPF10K200SFC484-1 The synthesis tool tries to accommodate some of the excess logic, specially the memory of strip_reader_chip into the FPLD assigned to L3 buffer and very small fraction of it into FPLD assigned to Hit Filter and thus overall design fits into three FPLDs.

Approach 3 The Hit Filter and L3 buffers are forced to fit in one FPLD each and the Strip Reader with Centroid Finder is forced to fit in two FPLDs Number of devices 4 Strip_reader_chip – 1 EPF10K200EGC599-1 Strip_reader_chip -2 EPF10K130EFC484-1 Hitfilter_schematic EPF10K100EBC356-1 L3_schematic The strip reader needed two FPLDs because of the need of EABs for the memory blocks. Each memory block regardless of the memory requirement has minimum of two EABs,this is due to the word length more than 8 bits.

Approach 4 - The Hit Filter, L3 buffers and the Strip Reader with Centroid Finder are forced to fit in one FPLD each Number of devices 3 Hitfilter_schematic EPF10K200SBC356-1 L3_schematic EPF10K200EGC599-1 Strip_reader_schematic EPF10K200SFC484-1 The strip reader design now fits into one chip , because downloaded parameters do not use EABs