Level-1 Missing Energy Significance Trigger Specification

Size: px
Start display at page:

Download "Level-1 Missing Energy Significance Trigger Specification"

Transcription

1 Level-1 Missing Energy Significance Trigger Specification Steve Hillier with significant contributions from Ian Brawn, Diego Casedei, Norman Gee, Murrough Landon, Alan Watson 15/12/2010 Level-1 Missing Energy Significance Trigger Specification 1

2 I m not going to talk about: Motivation See Diego s talks Specification and firmware details See file attached to agenda Also Ian Brawn s talk on Monday: Details of manpower, timelines, testing I ve just spent 1 week writing all this in the specification If you re interested, read it! One brief comment the workload is high and the schedule is tight 15/12/2010 Level-1 Missing Energy Significance Trigger Specification 2

3 What I will talk about: Interfaces This is what really impacts people outside L1Calo CTP output RoI format changes Trigger Menu requirements Level-1 XS definition Some points for discussion Potential for other modifications 15/12/2010 Level-1 Missing Energy Significance Trigger Specification 3

4 Output to CTP Just one L1Calo output/ctp input cable is affected Used to contain 4 x TE bits, 8 x XE bits Now will contain 8 x TE bits, 8 x XE bits, 8 x XS bits Should be relatively easy for CTP to handle this But note that old bits (XE) have been moved as well as bits added Description in Trigger Menu must be updated Will need a re-timing exercise of real-time signals to CTP Pair 33 Cable 0 Pair 0 G D P C 8b MET-Sig Hit 8b EtMiss Hit 8b Sum Et Hit 7b Reserved K Map Map Map Clock Parity Signal Ground 14-Dec-10 CMMCablefmt.xls/esum_cmm-ctp 15/12/2010 Level-1 Missing Energy Significance Trigger Specification 4

5 New RoI data format Fortunately just an addition, no existing data has changed Extra information consists of 8 new XS hit bits 4 additional TE bits Will require extra decoding for Level-2 RoI Type P P P 0 or exactly 3 Energy RoI words 8b Miss-ET-Sig X 3*0 15b Signed Ex Hits O Y 3*0 8b SumET 15b Signed Ey O 8b Missing-ET T 3*0 15b Unsigned SumEt Hits O Parity Error Ex, Ey, Et Overflows RoI Type One of 0-many CP RoI words 2b 4b 3b 3b 8b electron/tau 8b electron 0 0 P S C CPM Chip LC Thresholds Thresholds Crate CPChip Saturation Local Coords Parity Error RoI Type 0 or more Main Jet RoI words 4b JEM 3b 2b C 0 P S 4*0 4*0 No Frm RL 0 or more Forward Jet RoI words 4b JEM 3b 2b 4b Fwd C 1 P S 4*0 No Frm RL Jet Thr Crate RoI Frame RoI Local Coords Saturation Parity Error 1=Fwd 15/12/2010 Level-1 Missing Energy Significance Trigger Specification 5 RoI Type P RoI Type Parity Error P 3* P 3* P 3*0 0 or 1 Jet-ET RoI words 0 or exactly 3 Energy RoI words 8b Miss-ET-Sig X Hits O 15b Signed Ex Y 8b SumET O 15b Signed Ey 8b Missing-ET T Hits O 15b Unsigned SumEt Parity Error Ex, Ey, Et Overflows CP Local Coordinates JEM Frame JEM Local Coordinates (0,1,0 (0,1,1 (1,1,0 (1,1, (0,0,0 (0,0,1 (1,0,0 (1,0, Dec-10 24* b Main Jet Thresholds 8*0 4b Jet ET Slinkfmt.xls/ROD RoIs

6 Trigger Menu Additions Four extra TE thresholds Please give them values, even if they aren t used Forced Threshold mechanism (we like it) We also requested many times that all thresholds are size ordered This was not true for the Heavy Ions Menu for XE thresholds Eight entirely new XS thresholds Several parameters to drive Level-1 XS calculation Two constants in Diego s favourite XS formula: XE min/max value for XS validity XE < min, all XS set to false MET XE > max, all XS set to true METSig = TE min/max value for XS validity a SumET TE < min, all XS set to false TE > max, all XS set to????? ( b) 15/12/2010 Level-1 Missing Energy Significance Trigger Specification 6

7 Min/max bounds on XS XE min/max XS always off below min XS always on above max Has to happen at 63 anyway Fair enough sqrt(te) min/max Not sure if this makes sense? Just let XS do its job? 63 Forbidden XS always true XS thresholds XE XE min/max TE min/max XS always false 0 Sqrt(ET) 63 15/12/2010 Level-1 Missing Energy Significance Trigger Specification 7

8 On a slightly different topic: Virtual Jet Thresholds Received wisdom: There are only 4 FJ thresholds but 8 J thresholds The truth: The JEM implements 8 of both thresholds But we only have backplane bandwidth to send 4 to the CMMs and CTP It would be easy to include the 4 additional bits in the jet RoI information I.E. We could implement 4 extra virtual FJ thresholds at little extra effort By that I mean for next year Question, should we do it? In fact if we d been given warning, we might even have been able to send the 0.8x0.8 energy in the RoI I believe it s far too late to do this for 2011 now Especially since we re now flat out working on MET Significance But could have been a different story if we d been alerted earlier 15/12/2010 Level-1 Missing Energy Significance Trigger Specification 8

9 The moral Don t think of Level-1 as fixed and unchangeable Particularly in 2012 shut-down we could make radical firmware updates if useful But firmware requires time and iteration So give us fair warning Diego did this, though only just! Talk to us about what you think might be useful Some things are easy, others require time and thought See Mimmo s talk at Amsterdam 15/12/2010 Level-1 Missing Energy Significance Trigger Specification 9

Module Performance Report. ATLAS Calorimeter Level-1 Trigger- Common Merger Module. Version February-2005

Module Performance Report. ATLAS Calorimeter Level-1 Trigger- Common Merger Module. Version February-2005 Module Performance Report ATLAS Calorimeter Level-1 Trigger- Common Merger Module B. M. Barnett, I. P. Brawn, C N P Gee Version 1.0 23 February-2005 Table of Contents 1 Scope...3 2 Measured Performance...3

More information

CMX (Common Merger extension module) Y. Ermoline for CMX collaboration Preliminary Design Review, Stockholm, 29 June 2011

CMX (Common Merger extension module) Y. Ermoline for CMX collaboration Preliminary Design Review, Stockholm, 29 June 2011 (Common Merger extension module) Y. Ermoline for collaboration Preliminary Design Review, Stockholm, 29 June 2011 Outline Current L1 Calorimeter trigger system Possible improvement to maintain trigger

More information

CMX online software status

CMX online software status CMX online software status Duc Bao Ta MSU L1 Calo Workshop 19 th May 2014 1 Overview CMX timing software Timing procedure CMX online software CMX package Bit manipulation class, data formats class JEM

More information

CMX Hardware Overview

CMX Hardware Overview Hardware Overview Chip Brock, Dan Edmunds, Philippe Laurens@MSU Yuri Ermoline @CERN Wojciech Fedorko @UBC Michigan State University 12-May-2014 Common Merger extended module () 12-May-2014 2 Overall project

More information

Status and planning of the CMX. Wojtek Fedorko for the MSU group TDAQ Week, CERN April 23-27, 2012

Status and planning of the CMX. Wojtek Fedorko for the MSU group TDAQ Week, CERN April 23-27, 2012 Status and planning of the Wojtek Fedorko for the MSU group TDAQ Week, CERN April 23-27, 2012 : CMM upgrade Will replace CMM: Backplane rate 40 160Mbs Crate to system rate (LVDS) 40 160Mbs Cluster information

More information

Testing Discussion Initiator

Testing Discussion Initiator 27 th February 2003 Testing Discussion Initiator C.N.P.Gee Rutherford Appleton Laboratory C. N. P. Gee February 2003 2 C. N. P. Gee February 2003 3 JEP Tests (1) Step Test Items required Provided by 0

More information

Devel::Cover - An Introduction

Devel::Cover - An Introduction Devel::Cover - An Introduction Paul Johnson paul@pjcj.net 11.1 Introduction Testing is an important part of the software development process. The more important the software, the more important the testing

More information

CMX Hardware Status. Chip Brock, Dan Edmunds, Philippe Yuri Ermoline, Duc Bao Wojciech UBC

CMX Hardware Status. Chip Brock, Dan Edmunds, Philippe Yuri Ermoline, Duc Bao Wojciech UBC Hardware Status Chip Brock, Dan Edmunds, Philippe Laurens@MSU Yuri Ermoline, Duc Bao Ta @CERN Wojciech Fedorko @ UBC Michigan State University 25-Oct-2013 Outline Review of hardware project (Some) hardware

More information

Slide Set 9. for ENCM 369 Winter 2018 Section 01. Steve Norman, PhD, PEng

Slide Set 9. for ENCM 369 Winter 2018 Section 01. Steve Norman, PhD, PEng Slide Set 9 for ENCM 369 Winter 2018 Section 01 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary March 2018 ENCM 369 Winter 2018 Section 01

More information

ENCM 369 Winter 2019 Lab 6 for the Week of February 25

ENCM 369 Winter 2019 Lab 6 for the Week of February 25 page of ENCM 369 Winter 29 Lab 6 for the Week of February 25 Steve Norman Department of Electrical & Computer Engineering University of Calgary February 29 Lab instructions and other documents for ENCM

More information

Lecture Transcript While and Do While Statements in C++

Lecture Transcript While and Do While Statements in C++ Lecture Transcript While and Do While Statements in C++ Hello and welcome back. In this lecture we are going to look at the while and do...while iteration statements in C++. Here is a quick recap of some

More information

LVL1 e/γ RoI Builder Prototype

LVL1 e/γ RoI Builder Prototype LVL e/γ RoI Builder Prototype RoI / s matching and zero suppression Receiver RoI VME Receiver RoI Control Receiver RoI S-Link Interface Receiver Output - LVL / Supervisor RoI Builder discussion - Verilog/VHDL

More information

Recitation 4: Elimination algorithm, reconstituted graph, triangulation

Recitation 4: Elimination algorithm, reconstituted graph, triangulation Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.438 Algorithms For Inference Fall 2014 Recitation 4: Elimination algorithm, reconstituted graph, triangulation

More information

1007 Imperative Programming Part II

1007 Imperative Programming Part II Agenda 1007 Imperative Programming Part II We ve seen the basic ideas of sequence, iteration and selection. Now let s look at what else we need to start writing useful programs. Details now start to be

More information

ATLAS Level-1 Calorimeter Trigger

ATLAS Level-1 Calorimeter Trigger ATLAS EDMS Number: ATL-DA-ER-0030 EDMS Id: 1150213 ATLAS Level-1 Calorimeter Trigger Document Version: 0.8 Document Date: 23 June 2011 Prepared by: L1Calo CMX collaboration Document Change Record Version

More information

ATLAS Level-1 Calorimeter Trigger

ATLAS Level-1 Calorimeter Trigger ATLAS EDMS Number: ATL-DA-ER-0030 EDMS Id: 1150213 Document Version: 1.0 Document Date: 8 August 2011 Prepared by: L1Calo CMX collaboration Document Change Record Version Issue Date Comment 0 0 11 February

More information

ENCM 369 Winter 2018 Lab 9 for the Week of March 19

ENCM 369 Winter 2018 Lab 9 for the Week of March 19 page 1 of 9 ENCM 369 Winter 2018 Lab 9 for the Week of March 19 Steve Norman Department of Electrical & Computer Engineering University of Calgary March 2018 Lab instructions and other documents for ENCM

More information

ENCM 501 Winter 2018 Assignment 2 for the Week of January 22 (with corrections)

ENCM 501 Winter 2018 Assignment 2 for the Week of January 22 (with corrections) page 1 of 5 ENCM 501 Winter 2018 Assignment 2 for the Week of January 22 (with corrections) Steve Norman Department of Electrical & Computer Engineering University of Calgary January 2018 Assignment instructions

More information

ENCM 501 Winter 2016 Assignment 1 for the Week of January 25

ENCM 501 Winter 2016 Assignment 1 for the Week of January 25 page 1 of 5 ENCM 501 Winter 2016 Assignment 1 for the Week of January 25 Steve Norman Department of Electrical & Computer Engineering University of Calgary January 2016 Assignment instructions and other

More information

Signed umbers. Sign/Magnitude otation

Signed umbers. Sign/Magnitude otation Signed umbers So far we have discussed unsigned number representations. In particular, we have looked at the binary number system and shorthand methods in representing binary codes. With m binary digits,

More information

(Refer Slide Time 6:48)

(Refer Slide Time 6:48) Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology Madras Lecture - 8 Karnaugh Map Minimization using Maxterms We have been taking about

More information

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Priority Queues / Heaps Date: 9/27/17

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Priority Queues / Heaps Date: 9/27/17 01.433/33 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Priority Queues / Heaps Date: 9/2/1.1 Introduction In this lecture we ll talk about a useful abstraction, priority queues, which are

More information

n = 1 What problems are interesting when n is just 1?

n = 1 What problems are interesting when n is just 1? What if n=1??? n = 1 What problems are interesting when n is just 1? Sorting? No Median finding? No Addition? How long does it take to add one pair of numbers? Multiplication? How long does it take to

More information

LECTURE 4. Logic Design

LECTURE 4. Logic Design LECTURE 4 Logic Design LOGIC DESIGN The language of the machine is binary that is, sequences of 1 s and 0 s. But why? At the hardware level, computers are streams of signals. These signals only have two

More information

T02 Tutorial Slides for Week 2

T02 Tutorial Slides for Week 2 T02 Tutorial Slides for Week 2 ENEL 353: Digital Circuits Fall 2017 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 19 September, 2017

More information

The electron/photon and tau/hadron Cluster Processor for the ATLAS First-Level Trigger - a Flexible Test System

The electron/photon and tau/hadron Cluster Processor for the ATLAS First-Level Trigger - a Flexible Test System The electron/photon and tau/hadron Cluster Processor for the ATLAS First-Level Trigger - a Flexible Test System V. Perera, I. Brawn, J. Edwards, C. N. P. Gee, A. Gillman, R. Hatley, A. Shah, T.P. Shah

More information

Module: Rasters. 8.1 Lesson: Working with Raster Data Follow along: Loading Raster Data CHAPTER 8

Module: Rasters. 8.1 Lesson: Working with Raster Data Follow along: Loading Raster Data CHAPTER 8 CHAPTER 8 Module: Rasters We ve used rasters for digitizing before, but raster data can also be used directly. In this module, you ll see how it s done in QGIS. 8.1 Lesson: Working with Raster Data Raster

More information

Computer Systems C S Cynthia Lee Today s materials adapted from Kevin Webb at Swarthmore College

Computer Systems C S Cynthia Lee Today s materials adapted from Kevin Webb at Swarthmore College Computer Systems C S 0 7 Cynthia Lee Today s materials adapted from Kevin Webb at Swarthmore College 2 Today s Topics TODAY S LECTURE: Caching ANNOUNCEMENTS: Assign6 & Assign7 due Friday! 6 & 7 NO late

More information

Back to ObjectLand. Contents at: Chapter 5. Questions of Interest. encapsulation. polymorphism. inheritance overriding inheritance super

Back to ObjectLand. Contents at: Chapter 5. Questions of Interest. encapsulation. polymorphism. inheritance overriding inheritance super korienekch05.qxd 11/12/01 4:06 PM Page 105 5 Back to ObjectLand Contents at: Chapter 5 #( encapsulation polymorphism inheritance overriding inheritance super learning the class hierarchy finding classes

More information

EECE.2160: ECE Application Programming

EECE.2160: ECE Application Programming Spring 2018 Programming Assignment #10: Instruction Decoding and File I/O Due Wednesday, 5/9/18, 11:59:59 PM (Extra credit ( 4 pts on final average), no late submissions or resubmissions) 1. Introduction

More information

registers data 1 registers MEMORY ADDRESS on-chip cache off-chip cache main memory: real address space part of virtual addr. sp.

registers data 1 registers MEMORY ADDRESS on-chip cache off-chip cache main memory: real address space part of virtual addr. sp. Cache associativity Cache and performance 12 1 CMPE110 Spring 2005 A. Di Blas 110 Spring 2005 CMPE Cache Direct-mapped cache Reads and writes Textbook Edition: 7.1 to 7.3 Second Third Edition: 7.1 to 7.3

More information

L1Calo Status Report. efex jfex gfex L1Topo ROD Hub TREX FOX Mapping FTM Link-Speed Tests. 15 October 2015 Ian Brawn, on behalf of L1Calo 1

L1Calo Status Report. efex jfex gfex L1Topo ROD Hub TREX FOX Mapping FTM Link-Speed Tests. 15 October 2015 Ian Brawn, on behalf of L1Calo 1 L1Calo Status Report efex jfex gfex L1Topo ROD Hub TREX FOX Mapping FTM Link-Speed Tests 15 October 2015 Ian Brawn, on behalf of L1Calo 1 Sent to manufacture 24/7/15 Bare board (for impedance testing)

More information

Disclaimer. This talk vastly over-simplifies things. See notes for full details and resources.

Disclaimer. This talk vastly over-simplifies things. See notes for full details and resources. Greg Kroah-Hartman Disclaimer This talk vastly over-simplifies things. See notes for full details and resources. https://github.com/gregkh/presentation-spectre Spectre Hardware bugs Valid code can be tricked

More information

Why study algorithms? CS 561, Lecture 1. Today s Outline. Why study algorithms? (II)

Why study algorithms? CS 561, Lecture 1. Today s Outline. Why study algorithms? (II) Why study algorithms? CS 561, Lecture 1 Jared Saia University of New Mexico Seven years of College down the toilet - John Belushi in Animal House Q: Can I get a programming job without knowing something

More information

More About WHILE Loops

More About WHILE Loops More About WHILE Loops http://people.sc.fsu.edu/ jburkardt/isc/week04 lecture 07.pdf... ISC3313: Introduction to Scientific Computing with C++ Summer Semester 2011... John Burkardt Department of Scientific

More information

I have reviewed chapters 1 and 2 of The Idormix Handbook and I have the following changes and comments for you: 7-7 /

I have reviewed chapters 1 and 2 of The Idormix Handbook and I have the following changes and comments for you: 7-7 / Ron - "c"t I have reviewed chapters 1 and 2 of The Idormix Handbook and I have the following changes and comments for you: 7-7 / On page 3 is the first mention of the company starting in my garage. I never

More information

NAME EET 2259 Lab 3 The Boolean Data Type

NAME EET 2259 Lab 3 The Boolean Data Type NAME EET 2259 Lab 3 The Boolean Data Type OBJECTIVES - Understand the differences between numeric data and Boolean data. -Write programs using LabVIEW s Boolean controls and indicators, Boolean constants,

More information

Common clock path pessimism removal (CPPR) Kunal Ghosh

Common clock path pessimism removal (CPPR) Kunal Ghosh Common clock path pessimism removal (CPPR) Kunal Ghosh With On-Chip variation, we might introduce extra pessimism in clock path, common to launch and capture flop clock pins. How? I will get back to this

More information

Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Dynamic Programming I Date: 10/6/16

Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Dynamic Programming I Date: 10/6/16 600.463 Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Dynamic Programming I Date: 10/6/16 11.1 Introduction Dynamic programming can be very confusing until you ve used it a

More information

ECE 550D Fundamentals of Computer Systems and Engineering. Fall 2017

ECE 550D Fundamentals of Computer Systems and Engineering. Fall 2017 ECE 550D Fundamentals of Computer Systems and Engineering Fall 2017 Combinational Logic Prof. John Board Duke University Slides are derived from work by Profs. Tyler Bletsch and Andrew Hilton (Duke) Last

More information

Chapter Operation Pinout Operation 35

Chapter Operation Pinout Operation 35 68000 Operation 35 Chapter 6 68000 Operation 6-1. 68000 Pinout We will do no construction in this chapter; instead, we will take a detailed look at the individual pins of the 68000 and what they do. Fig.

More information

CS 4349 Lecture August 21st, 2017

CS 4349 Lecture August 21st, 2017 CS 4349 Lecture August 21st, 2017 Main topics for #lecture include #administrivia, #algorithms, #asymptotic_notation. Welcome and Administrivia Hi, I m Kyle! Welcome to CS 4349. This a class about algorithms.

More information

Digital Design Review

Digital Design Review Digital Design Review Why? You never learned how - traffic light controllers You have forgotten or are rusty You have bad habits (ad hoc, asynchronous design, old technology) You need a method that will

More information

Slide Set 1. for ENEL 339 Fall 2014 Lecture Section 02. Steve Norman, PhD, PEng

Slide Set 1. for ENEL 339 Fall 2014 Lecture Section 02. Steve Norman, PhD, PEng Slide Set 1 for ENEL 339 Fall 2014 Lecture Section 02 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2014 ENEL 353 F14 Section

More information

Slide Set 5. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary

Slide Set 5. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary Slide Set 5 for ENEL 353 Fall 207 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 207 SN s ENEL 353 Fall 207 Slide Set 5 slide

More information

DB2 Data Sharing Then and Now

DB2 Data Sharing Then and Now DB2 Data Sharing Then and Now Robert Catterall Consulting DB2 Specialist IBM US East September 2010 Agenda A quick overview of DB2 data sharing Motivation for deployment then and now DB2 data sharing /

More information

Slide Set 5. for ENCM 369 Winter 2014 Lecture Section 01. Steve Norman, PhD, PEng

Slide Set 5. for ENCM 369 Winter 2014 Lecture Section 01. Steve Norman, PhD, PEng Slide Set 5 for ENCM 369 Winter 2014 Lecture Section 01 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Winter Term, 2014 ENCM 369 W14 Section

More information

A B C ((NOT A) AND B) OR C

A B C ((NOT A) AND B) OR C chapter5 pg 184 1,2,6 1 Assuming that x=1 and y=2, determine the value of each of the following Boolean expressing: (x=1) AND(y=3) (x1) Not[(x=1) AND (y=2)] Answer: False True False 2 Assume

More information

(Refer Slide Time 3:31)

(Refer Slide Time 3:31) Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology Madras Lecture - 5 Logic Simplification In the last lecture we talked about logic functions

More information

4. Write a sum-of-products representation of the following circuit. Y = (A + B + C) (A + B + C)

4. Write a sum-of-products representation of the following circuit. Y = (A + B + C) (A + B + C) COP 273, Winter 26 Exercises 2 - combinational logic Questions. How many boolean functions can be defined on n input variables? 2. Consider the function: Y = (A B) (A C) B (a) Draw a combinational logic

More information

Finding Similar Sets. Applications Shingling Minhashing Locality-Sensitive Hashing

Finding Similar Sets. Applications Shingling Minhashing Locality-Sensitive Hashing Finding Similar Sets Applications Shingling Minhashing Locality-Sensitive Hashing Goals Many Web-mining problems can be expressed as finding similar sets:. Pages with similar words, e.g., for classification

More information

CSE Lecture 13/14 In Class Handout For all of these problems: HAS NOT CANNOT Add Add Add must wait until $5 written by previous add;

CSE Lecture 13/14 In Class Handout For all of these problems: HAS NOT CANNOT Add Add Add must wait until $5 written by previous add; CSE 30321 Lecture 13/14 In Class Handout For the sequence of instructions shown below, show how they would progress through the pipeline. For all of these problems: - Stalls are indicated by placing the

More information

ENCM 369 Winter 2016 Lab 11 for the Week of April 4

ENCM 369 Winter 2016 Lab 11 for the Week of April 4 page 1 of 13 ENCM 369 Winter 2016 Lab 11 for the Week of April 4 Steve Norman Department of Electrical & Computer Engineering University of Calgary April 2016 Lab instructions and other documents for ENCM

More information

(Refer Slide Time: 01.26)

(Refer Slide Time: 01.26) Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture # 22 Why Sorting? Today we are going to be looking at sorting.

More information

COMP260 Spring 2014 Notes: February 4th

COMP260 Spring 2014 Notes: February 4th COMP260 Spring 2014 Notes: February 4th Andrew Winslow In these notes, all graphs are undirected. We consider matching, covering, and packing in bipartite graphs, general graphs, and hypergraphs. We also

More information

Data Representation and Architecture Modeling Year 1 Exam preparation

Data Representation and Architecture Modeling Year 1 Exam preparation 1 BINARY SYSTEM Data Representation and Architecture Modeling Year 1 Exam preparation 1 Binary system you need to be able to understand and convert numbers between the following different notations: decimal

More information

The MailNinja 7-Step Success Formula For Sending Lead Generating Campaigns

The MailNinja 7-Step Success Formula For Sending Lead Generating  Campaigns The MailNinja 7-Step Success Formula For Sending Lead Generating Email Campaigns The MailNinja 7-Step Success Formula For Sending Lead Generating Email Campaigns Over the past 10 years we ve perfected

More information

News English.com Ready-to-use ESL / EFL Lessons 2005 was a second longer than usual

News English.com Ready-to-use ESL / EFL Lessons 2005 was a second longer than usual www.breaking News English.com Ready-to-use ESL / EFL Lessons The Breaking News English.com Resource Book 1,000 Ideas & Activities For Language Teachers http://www.breakingnewsenglish.com/book.html 2005

More information

APCS-AB: Java. Recursion in Java December 12, week14 1

APCS-AB: Java. Recursion in Java December 12, week14 1 APCS-AB: Java Recursion in Java December 12, 2005 week14 1 Check point Double Linked List - extra project grade Must turn in today MBCS - Chapter 1 Installation Exercises Analysis Questions week14 2 Scheme

More information

Intro. Scheme Basics. scm> 5 5. scm>

Intro. Scheme Basics. scm> 5 5. scm> Intro Let s take some time to talk about LISP. It stands for LISt Processing a way of coding using only lists! It sounds pretty radical, and it is. There are lots of cool things to know about LISP; if

More information

Horn Formulae. CS124 Course Notes 8 Spring 2018

Horn Formulae. CS124 Course Notes 8 Spring 2018 CS124 Course Notes 8 Spring 2018 In today s lecture we will be looking a bit more closely at the Greedy approach to designing algorithms. As we will see, sometimes it works, and sometimes even when it

More information

Slide Set 3. for ENCM 369 Winter 2018 Section 01. Steve Norman, PhD, PEng

Slide Set 3. for ENCM 369 Winter 2018 Section 01. Steve Norman, PhD, PEng Slide Set 3 for ENCM 369 Winter 2018 Section 01 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary January 2018 ENCM 369 Winter 2018 Section

More information

1-D Time-Domain Convolution. for (i=0; i < outputsize; i++) { y[i] = 0; for (j=0; j < kernelsize; j++) { y[i] += x[i - j] * h[j]; } }

1-D Time-Domain Convolution. for (i=0; i < outputsize; i++) { y[i] = 0; for (j=0; j < kernelsize; j++) { y[i] += x[i - j] * h[j]; } } Introduction: Convolution is a common operation in digital signal processing. In this project, you will be creating a custom circuit implemented on the Nallatech board that exploits a significant amount

More information

ENCM 335 Fall 2018 Lab 6 for the Week of October 22 Complete Instructions

ENCM 335 Fall 2018 Lab 6 for the Week of October 22 Complete Instructions page 1 of 5 ENCM 335 Fall 2018 Lab 6 for the Week of October 22 Complete Instructions Steve Norman Department of Electrical & Computer Engineering University of Calgary October 2018 Lab instructions and

More information

Mean Value Analysis and Related Techniques

Mean Value Analysis and Related Techniques Mean Value Analysis and Related Techniques 34-1 Overview 1. Analysis of Open Queueing Networks 2. Mean-Value Analysis 3. Approximate MVA 4. Balanced Job Bounds 34-2 Analysis of Open Queueing Networks Used

More information

Week - 03 Lecture - 18 Recursion. For the last lecture of this week, we will look at recursive functions. (Refer Slide Time: 00:05)

Week - 03 Lecture - 18 Recursion. For the last lecture of this week, we will look at recursive functions. (Refer Slide Time: 00:05) Programming, Data Structures and Algorithms in Python Prof. Madhavan Mukund Department of Computer Science and Engineering Indian Institute of Technology, Madras Week - 03 Lecture - 18 Recursion For the

More information

15100 Fall 2005 Final Project

15100 Fall 2005 Final Project 15100 Fall 2005 Final Project Robby Findler & Jacob Matthews 1 Introduction to Sudoku Sudoku is a logic puzzle set on a nine by nine grid. The goal is to fill in the blank spaces in the puzzle with the

More information

ENCM 339 Fall 2017: Editing and Running Programs in the Lab

ENCM 339 Fall 2017: Editing and Running Programs in the Lab page 1 of 8 ENCM 339 Fall 2017: Editing and Running Programs in the Lab Steve Norman Department of Electrical & Computer Engineering University of Calgary September 2017 Introduction This document is a

More information

Error Detection Codes. Error Detection. Two Dimensional Parity. Internet Checksum Algorithm. Cyclic Redundancy Check.

Error Detection Codes. Error Detection. Two Dimensional Parity. Internet Checksum Algorithm. Cyclic Redundancy Check. Error Detection Two types Error Detection Codes (e.g. CRC, Parity, Checksums) Error Correction Codes (e.g. Hamming, Reed Solomon) Basic Idea Add redundant information to determine if errors have been introduced

More information

CS 261 Fall Floating-Point Numbers. Mike Lam, Professor.

CS 261 Fall Floating-Point Numbers. Mike Lam, Professor. CS 261 Fall 2018 Mike Lam, Professor https://xkcd.com/217/ Floating-Point Numbers Floating-point Topics Binary fractions Floating-point representation Conversions and rounding error Binary fractions Now

More information

Spam. Time: five years from now Place: England

Spam. Time: five years from now Place: England Spam Time: five years from now Place: England Oh no! said Joe Turner. When I go on the computer, all I get is spam email that nobody wants. It s all from people who are trying to sell you things. Email

More information

Numerical Precision. Or, why my numbers aren t numbering right. 1 of 15

Numerical Precision. Or, why my numbers aren t numbering right. 1 of 15 Numerical Precision Or, why my numbers aren t numbering right 1 of 15 What s the deal? Maybe you ve seen this #include int main() { float val = 3.6f; printf( %.20f \n, val); Print a float with

More information

Week 7 Convex Hulls in 3D

Week 7 Convex Hulls in 3D 1 Week 7 Convex Hulls in 3D 2 Polyhedra A polyhedron is the natural generalization of a 2D polygon to 3D 3 Closed Polyhedral Surface A closed polyhedral surface is a finite set of interior disjoint polygons

More information

Slide Set 5. for ENCM 369 Winter 2018 Section 01. Steve Norman, PhD, PEng

Slide Set 5. for ENCM 369 Winter 2018 Section 01. Steve Norman, PhD, PEng Slide Set 5 for ENCM 369 Winter 2018 Section 01 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary February 2018 ENCM 369 Winter 2018 Section

More information

EEN118 LAB THREE. Section A - Conversions A1. Remembering how to start. A2. Exotic Canada

EEN118 LAB THREE. Section A - Conversions A1. Remembering how to start. A2. Exotic Canada EEN118 LAB THREE The purpose of this lab is to ensure that you are confident with - and have had a lot of practice at - writing small clear functions that give precise control over repetitive tasks. The

More information

Architectural Differences nc. DRAM devices are accessed with a multiplexed address scheme. Each unit of data is accessed by first selecting its row ad

Architectural Differences nc. DRAM devices are accessed with a multiplexed address scheme. Each unit of data is accessed by first selecting its row ad nc. Application Note AN1801 Rev. 0.2, 11/2003 Performance Differences between MPC8240 and the Tsi106 Host Bridge Top Changwatchai Roy Jenevein risc10@email.sps.mot.com CPD Applications This paper discusses

More information

Some Hardness Proofs

Some Hardness Proofs Some Hardness Proofs Magnus Lie Hetland January 2011 This is a very brief overview of some well-known hard (NP Hard and NP complete) problems, and the main ideas behind their hardness proofs. The document

More information

!! What is virtual memory and when is it useful? !! What is demand paging? !! When should pages in memory be replaced?

!! What is virtual memory and when is it useful? !! What is demand paging? !! When should pages in memory be replaced? Chapter 10: Virtual Memory Questions? CSCI [4 6] 730 Operating Systems Virtual Memory!! What is virtual memory and when is it useful?!! What is demand paging?!! When should pages in memory be replaced?!!

More information

CS152 Computer Architecture and Engineering SOLUTIONS Caches and the Memory Hierarchy Assigned 9/17/2016 Problem Set #2 Due Tue, Oct 4

CS152 Computer Architecture and Engineering SOLUTIONS Caches and the Memory Hierarchy Assigned 9/17/2016 Problem Set #2 Due Tue, Oct 4 CS152 Computer Architecture and Engineering SOLUTIONS Caches and the Memory Hierarchy Assigned 9/17/2016 Problem Set #2 Due Tue, Oct 4 http://inst.eecs.berkeley.edu/~cs152/sp16 The problem sets are intended

More information

Table of Contents. Part I WageLoch Control 3. Part II WageLoch Roster 20. Contents. Foreword 0. 4 Deleting... a previous roster

Table of Contents. Part I WageLoch Control 3. Part II WageLoch Roster 20. Contents. Foreword 0. 4 Deleting... a previous roster Contents 1 Table of Contents Foreword 0 Part I WageLoch Control 3 1 Staff members... 4 Creating a staff... member 4 Terminating an... employee 5 Re-activating... a terminated employee 6 2 Pay levels...

More information

Lies, Damned Lies, Statistics and SQL

Lies, Damned Lies, Statistics and SQL Lies, Damned Lies, Statistics and SQL by Peter Lavin December 17, 2003 Introduction When I read about the Developer Shed December Giveaway Contest in the most recent newsletter a thought occurred to me.

More information

Lecture 4: Transforms. Computer Graphics CMU /15-662, Fall 2016

Lecture 4: Transforms. Computer Graphics CMU /15-662, Fall 2016 Lecture 4: Transforms Computer Graphics CMU 15-462/15-662, Fall 2016 Brief recap from last class How to draw a triangle - Why focus on triangles, and not quads, pentagons, etc? - What was specific to triangles

More information

Data Representation Type of Data Representation Integers Bits Unsigned 2 s Comp Excess 7 Excess 8

Data Representation Type of Data Representation Integers Bits Unsigned 2 s Comp Excess 7 Excess 8 Data Representation At its most basic level, all digital information must reduce to 0s and 1s, which can be discussed as binary, octal, or hex data. There s no practical limit on how it can be interpreted

More information

Puppet Labs Modules - Feature #11050 firewall: RFE that ensure could support ignore.

Puppet Labs Modules - Feature #11050 firewall: RFE that ensure could support ignore. Puppet Labs Modules - Feature #11050 firewall: RFE that ensure could support ignore. 11/28/2011 05:16 am - Steve Traylen Status: Closed Start date: 11/28/2011 Priority: Normal Due date: Assignee: % Done:

More information

Physics 364, Fall 2012, Lab #9 (Introduction to microprocessor programming with the Arduino) Lab for Monday, November 5

Physics 364, Fall 2012, Lab #9 (Introduction to microprocessor programming with the Arduino) Lab for Monday, November 5 Physics 364, Fall 2012, Lab #9 (Introduction to microprocessor programming with the Arduino) Lab for Monday, November 5 Up until this point we have been working with discrete digital components. Every

More information

Topic 6: SDN in practice: Microsoft's SWAN. Student: Miladinovic Djordje Date:

Topic 6: SDN in practice: Microsoft's SWAN. Student: Miladinovic Djordje Date: Topic 6: SDN in practice: Microsoft's SWAN Student: Miladinovic Djordje Date: 17.04.2015 1 SWAN at a glance Goal: Boost the utilization of inter-dc networks Overcome the problems of current traffic engineering

More information

1099s: Out of the Holding Tank

1099s: Out of the Holding Tank QuickBooks support from Diane Gilson... 1099s: Out of the Holding Tank Here are the basic steps to follow: You pay YOUR taxes, I pay MY taxes, but does everyone else out there pay THEIR taxes? Well, if

More information

1. Truthiness /8. 2. Branch prediction /5. 3. Choices, choices /6. 5. Pipeline diagrams / Multi-cycle datapath performance /11

1. Truthiness /8. 2. Branch prediction /5. 3. Choices, choices /6. 5. Pipeline diagrams / Multi-cycle datapath performance /11 The University of Michigan - Department of EECS EECS 370 Introduction to Computer Architecture Midterm Exam 2 ANSWER KEY November 23 rd, 2010 Name: University of Michigan uniqname: (NOT your student ID

More information

Lecture 1 An Overview of High-Performance Computer Architecture. Automobile Factory (note: non-animated version)

Lecture 1 An Overview of High-Performance Computer Architecture. Automobile Factory (note: non-animated version) Lecture 1 An Overview of High-Performance Computer Architecture ECE 463/521 Fall 2002 Edward F. Gehringer Automobile Factory (note: non-animated version) Automobile Factory (note: non-animated version)

More information

CSC258: Computer Organization. Memory Systems

CSC258: Computer Organization. Memory Systems CSC258: Computer Organization Memory Systems 1 Summer Independent Studies I m looking for a few students who will be working on campus this summer. In addition to the paid positions posted earlier, I have

More information

In examining performance Interested in several things Exact times if computable Bounded times if exact not computable Can be measured

In examining performance Interested in several things Exact times if computable Bounded times if exact not computable Can be measured System Performance Analysis Introduction Performance Means many things to many people Important in any design Critical in real time systems 1 ns can mean the difference between system Doing job expected

More information

ENCM 501 Winter 2017 Assignment 3 for the Week of January 30

ENCM 501 Winter 2017 Assignment 3 for the Week of January 30 page 1 of 7 ENCM 501 Winter 2017 Assignment 3 for the Week of January 30 Steve Norman Department of Electrical & Computer Engineering University of Calgary January 2017 Assignment instructions and other

More information

Comments from the Review committee:

Comments from the Review committee: Comments from the Review committee: 10/27/2003 Page 1 Frank Chlebana, Eric James, and Jonathan Lewis Summer 2005 should be the target to have all updates complete. We thought that the DAQ simulation should

More information

Chapter 4: Programming with MATLAB

Chapter 4: Programming with MATLAB Chapter 4: Programming with MATLAB Topics Covered: Programming Overview Relational Operators and Logical Variables Logical Operators and Functions Conditional Statements For Loops While Loops Debugging

More information

Coding Workshop. Learning to Program with an Arduino. Lecture Notes. Programming Introduction Values Assignment Arithmetic.

Coding Workshop. Learning to Program with an Arduino. Lecture Notes. Programming Introduction Values Assignment Arithmetic. Coding Workshop Learning to Program with an Arduino Lecture Notes Table of Contents Programming ntroduction Values Assignment Arithmetic Control Tests f Blocks For Blocks Functions Arduino Main Functions

More information

Floating Point Numbers

Floating Point Numbers Floating Point Numbers Summer 8 Fractional numbers Fractional numbers fixed point Floating point numbers the IEEE 7 floating point standard Floating point operations Rounding modes CMPE Summer 8 Slides

More information

ENCM 369 Winter 2015 Lab 6 for the Week of March 2

ENCM 369 Winter 2015 Lab 6 for the Week of March 2 page of 2 ENCM 369 Winter 25 Lab 6 for the Week of March 2 Steve Norman Department of Electrical & Computer Engineering University of Calgary February 25 Lab instructions and other documents for ENCM 369

More information

SCHEME 8. 1 Introduction. 2 Primitives COMPUTER SCIENCE 61A. March 23, 2017

SCHEME 8. 1 Introduction. 2 Primitives COMPUTER SCIENCE 61A. March 23, 2017 SCHEME 8 COMPUTER SCIENCE 61A March 2, 2017 1 Introduction In the next part of the course, we will be working with the Scheme programming language. In addition to learning how to write Scheme programs,

More information

61A Lecture 4. Monday, September 9

61A Lecture 4. Monday, September 9 61A Lecture 4 Monday, September 9 Announcements Homework 1 due Tuesday 9/10 at 5pm; Late homework is not accepted! Quiz on Wednesday 9/11 released at 1pm, due Thursday 9/12 at 11:59pm Open-computer: You

More information

Meshes: Catmull-Clark Subdivision and Simplification

Meshes: Catmull-Clark Subdivision and Simplification Meshes: Catmull-Clark Subdivision and Simplification Part 1: What I did CS 838, Project 1 Eric Aderhold My main goal with this project was to learn about and better understand three-dimensional mesh surfaces.

More information