Computer Systems - HS
|
|
- Chad Perkins
- 5 years ago
- Views:
Transcription
1 What have we leared so far? Computer Systems High Level ENGG1203 2d Semester, Applicatios Sigals Systems & Cotrol Systems Computer & Embedded Systems Digital Logic Combiatioal Logic Sequetial Logic Circuits Basic Circuit Theory Electrical Sigals Voltage, Curret Power & Eergy Dr. Hayde So Departmet of Electrical ad Electroic Egieerig Low Level 2d sem, Computer i the 60s Src: 2d sem, Computer Systems - HS 2 Today s Computer DEC s PDP-10 Computer Systems - HS 3 2d sem, Computer Systems - HS 4
2 3 Classes of Computers Desktop Computer Desktop Most people s everyday ecouter to computers Server Embedded System Sigifies by the rise of persoal computer (PC) i the early 1990s Typical examples: Domiate the Future PC with a tower Notebook computers Apple imac, Mac Pro Same fudametal priciple of operatio, but with differet desig optimizatios ad tradeoffs. 2d sem, Computer Systems - HS 5 Embedded Systems i.e. Computer systems as compoets Perform simple, dedicated fuctios as part of a larger system Limited resources Processig power Memory Storage 2d sem, Netbook Nettop Tablet Smart Phoes 2d sem, Computer Systems - HS Embedded systems everywhere Perform far more tha simple, dedicated tasks Not so limited resources Cost & power cosumptio are major desig cocers Cost & power cosumptio are major desig cocers Computer Systems - HS 6 Moder Embedded Systems A computer system embedded withi a larger system Post-PC Era 7 2d sem, Computer Systems - HS 8
3 Server Icludes may of the most powerful computers i operatios Most moder servers are implemeted usig highly parallel multiprocessor systems Super computer Computer cluster Usually accessed oly through etwork Resposible for the most demadig computig eeds Web, video streamig Dataceter Scietific computatios Fiacial computatios Google hadles > 1 billio searches per day 2d sem, Computer Systems - HS 9 Warehouse Scale Computer A ew class of computer for massively parallel cluster of computers Dataceter as a computer ~100,000 servers iclude desig choices i electrical, electroic ad buildig costructio Exploit service level parallelism Desiged for cloud-based services 2d sem, Computer Systems - HS 10 The Big Challege Performace Power/ Eergy Geerally speakig, power cosumptio icreases with performace Techical challege: fid ways to improve performace without sigificat icrease to power TOP500 Gree d sem, Computer Systems - HS 11 2d sem, Computer Systems - HS 12
4 Stored Program Architecture Sometimes called the vo Neuma architecture Named after Joh vo Neuma Taleted mathematicia Key perso behid the developmet of EDVAC i the 1940s A stored-program computer stores both program istructio ad data i the same memory storage; performs computatio by executig istructios stored i the memory Stored-Program Computer Get the curret istructio Execute the istructio Determies the ext istructio to fetch 2d sem, Computer Systems - HS 13 2d sem, Computer Systems - HS 14 Ex: Calculatig Class Grades* grade = 0.1 lab mt +0.3 hw proj; grade = 0; tmp = 0.1 lab; grade = grade + tmp; tmp = 0.2 mt; grade = grade + tmp; tmp = 0.3 hw; grade = grade + tmp; tmp = 0.4 proj; grade = grade + tmp; *This is ot how we are goig to calculate your grades Time 2d sem, Computer Systems - HS 15 Calculatio i Processors 0.1 lab tmp grade clock cycle lab tmp grade + clock cycle mt tmp grade Values are loaded from memory ito CPU for computatio Results are stored back to memory CPU performs differet computatio o each cycle: 1 st cycle: x, 2 d cycle +, Oe operatio per cycle TIME As may cycle as eeded to complete applicatio clock cycle 3 2d sem, Computer Systems - HS mt tmp grade 0.4 proj + + tmp grade clock cycle 0.4 proj tmp grade
5 5 Classic Compoets of a Computer Computatio CPU 1. Cotrol path 2. Data path Computers as Electroic Systems Iput Process Output Memory Memory 3. Memory Iput Datapath Output Iteract with outside world I/O 4. Iput 5. Output Cotrol 2d sem, Computer Systems - HS 17 2d sem, Computer Systems - HS 18 Iput/Output The iterface betwee a computer ad the outside world Iterface with huma keyboard, mouse, speaker, microphoe, display touch scree, webcam Iterface with other computers Network coectios: WiFi, Etheret, Bluetooth, etc Permaet storage Harddisk Memory Stores istructios ad data Istructios: Cotrol the operatio of the CPU Obtaied from a user s software program through a process called compilatio. Data User iput Temporary data Computed output e.g. d = (a + b) c Iput data: values of a,b,c Temp data: (a+b) Output data: d 2d sem, Computer Systems - HS 19 2d sem, Computer Systems - HS 20
6 The CPU Cetral Processig Uit Cotrols the operatios of all parts of the system Arithmetic operatios Decisio makig A physical CPU (such as oe you buy from Itel or AMD) may iclude fuctios of other parts of the system Part of the memory system Part of I/O Two parts of the CPU Datapath The hardware portio that is eeded to carry out the operatios required by the processor (The muscles of the CPU) Cotrol The hardware portio that cotrols the operatios of the datapath (The brai of the CPU) I this course, CPU refers to just its core fuctio 2d sem, Computer Systems - HS 21 2d sem, Computer Systems - HS 22 CPU Datapath The datapath of a CPU performs the actual computatio Typical fuctios: Arithmetic: + Bit operatios: shift left/right, bitwise AND, OR Compariso: < > = Usually performed usig a Arithmetic ad Logical Uit (ALU) iside the CPU ALU ca be set to perform ay oe of the predefied fuctios Cotrolled accordig to istructio CPU Cotrol Determies what to do based o Istructio Result of previous computatio Iteral cotrol Determies the fuctio of the ALU based o the give istructio Determies if ad whe should a memory read/write be performed Determies if the CPU should perform a reset of the datapath Typical cotrol-related istructios Brachig: determies the ext istructio to fetch from the memory Memory operatios: load/store data from memory 2d sem, Computer Systems - HS 23 2d sem, Computer Systems - HS 24
7 Quick Summary: Reality Check Multi-Core CPU Datapath + Cotrol Memory (cache) I/O 2d sem, Computer Systems - HS 25 Itel Lyfield processor (source: AadTech) 2d sem, Computer Systems - HS 26 Represetig Numbers Negative Itegers No-Negative Itegers (Lecture 2) Negative Real Numbers No-Negative Real Numbers 2d sem, Computer Systems - HS 27 2d sem, Computer Systems - HS 28
8 Number Systems Huma teds to use a base 10 system a decimal umber system Biary umber system represets umbers i base 2 E.g.: = Hexadecimal umber system represets umbers i base 16 E.g.: = Used i computers together with base 2 system Easy coversio betwee hex ad bi Ca be thought as a shorthad for biary system Dec Bi Hex A B C D E F Biary ßà Hexadecimal From right to left, each group of 4 bits i biary form oe digit i hex represetatio Similarly, each hex digit expads ito 4 biary digits Example: = 2A3 16 3C 16 = Dec Bi Hex A B C D E F 2d sem, Computer Systems - HS 29 2d sem, Computer Systems - HS 30 From Decimal to Bi/Hex Ca similarly be foud usig short divisio : Successively divide the divided by the base (2 or 16) Ed whe remaider < base The remaiders form the umber i the resultig system whe couted from the bottom Example: Coverts ito hexadecimal umber D è = 14D 16 From Bi/Hex to Decimal The value of a biary/hexadecimal umber ca similarly be calculated as: 1 i=0 B i d i where d i is the value of digit at positio i coutig from the least sigificat digit (right-most) as 0, ad B is the base of the umber system = = = 23 3C4 16 = = = 964 2d sem, Computer Systems - HS 31 2d sem, Computer Systems - HS 32
9 Usiged Numbers Represet o-egative biary umbers (0, 1, 2, 3, ) usig their atural biary represetatios A -bit bitstrig ca represet umbers i "0, # 2 1$ % Represets equally spaced itegers o the umber lie Value Biary Bitstrig (8- bit) d sem, Computer Systems - HS 33 Negative Itegers Q: How do we represet the value of egative twety three i decimal? A: -23 Q: How do we represet the value of egative twety three i biary? A: Q: How do we represet the value of egative twety three i computers? A: Sig-Magitude 1 s complemet 2 s complemet 2d sem, Computer Systems - HS 34 Siged-Magitude Represetatio Add a sig bit to a bitstrig to represet the sig of a iteger E.g. Use a 1 to represet egative, 0 to represet positive ; A -bit bitstrig ca represet umbers i [ (2 1 1), 2 1 1] Pros: Easy to uderstad Cos: Two zeros Difficult to perform calculatio o values of differet sigs Patter Sig-Mag values Usiged values 2d sem, Computer Systems - HS Addig Sig-Magitude Numbers Record the sig A + B yes Apped the stored sig Start Same sig? Doe Record the sig of A A - B A is +ve? Ivert the sig of result 2d sem, Computer Systems - HS 36 yes o
10 1 s complemet To fid the egative of positive umber, apply bitwise NOT operatio to all bits E.g., with 8-bit umbers: A -bit bitstrig ca represet umbers i the rage [ (2 1 1), 2 1 1] Pros: Additio easier tha sig-mag Cos: Still has 2 zeros Patter 1 s comp Usiged values Sig-Mag values o Additio with 1 s complemet Start A + B Carry out? Doe yes Add 1 Ex. [eg + pos] : (-3) + 5 = = = ß carry out. Add 1 = 0010 Ex [eg + eg], A + B < 2 (-1) (-3) + (-2) = = = ß carry out. Add 1 = d sem, Computer Systems - HS 37 2d sem, Computer Systems - HS 38 Two s Complemet (1) Negative umbers are represeted by the 2 s complemet of the absolute value of that umber 2 s complemet of a -bit umber v is the value 2 - v For example, to represet value -3 usig a 4- bit bitstrig: = 16-3 = Two s complemet (2) 2 s complemet of a umber ca be obtaied by addig 1 to the 1 s complemet of the umber Origial s complemet s complemet The value of a bitstrig { b 1 b 2 b 0 } i 2 s complemet ca be calculated as: i= 0 Rage: Note that is asymmetric 2 i b i [ 2 1, 2 1 1] 2d sem, Computer Systems - HS 39 2d sem, Computer Systems - HS 40
11 Additio with 2 s complemet Start A + B Doe Ex. [eg + pos] : (-3) + 5 = = = 0010 ß igore carry out Ex [eg + eg], A + B < 2 (-1) (-3) + (-2) = = = 1011 Number Represetatio Summary Patter Usiged values Sig-Mag values 1 s comp 2 s comp d sem, Computer Systems - HS 41 2d sem, Computer Systems - HS 42 Subtractio i Computers To subtract two umbers i computer, a aïve way is to follow the stadard way of borrowig i decimal subtractio A smart way to do subtractio is to use the existig additio fuctio i the ALU A B = A + (-B) As log as we ca fid the egative value of a umber Subtractio usig Additio Recall that to fid the egative of a umber usig 2 s complemet, oe should 1. egate all the bits (1à0, 0à1) 2. Add 1 Sice egatig the bits is easy, ad we have a ALU that is capable of performig a add, we ca simply reuse the existig add hardware 2 s complemet represetatio makes it trivial 2d sem, Computer Systems - HS 43 2d sem, Computer Systems - HS 44
12 Coceptual Add/Sub Block Diagram A B A B Neg? issubtract Neg? issubtract A B A xor B C + C 1 or 0 + C carry i Recall that carry i is simply the 3 rd iput to a adder d sem, Computer Systems - HS 45 2d sem, Computer Systems - HS 46 Few Notes About Itegers Note that the very same bitstrig may represet completely differet values depedig o how you iterpret it Oly 2 s complemet represetatios allow direct additio/subtractio betwee +ve ad ve umbers without first detectig the sig I order to represet ve umbers, there must be a agreed-upo width Most moder computers represet itegers as 2 s complemets - Represetig Numbers Negative Itegers Negative Real Numbers No-Negative Itegers (Lecture 2) No-Negative Real Numbers 2d sem, Computer Systems - HS 47 2d sem, Computer Systems - HS 48
13 Real Numbers How to represet real umbers i biary? 0.37, 2/5, Recall how do you represet twety six poit five i decimal The digits to the left of the decimal poit have weights 10 0, 10 1,, ad the digits to the right of the decimal poit have 10-1,10-2 i.e., 26.5 Decimal poit 26.5 = But how do we represet 26.5 i biary? Biary Poit A biary poit represets the coefficiet of term 2 0 = 1. Coefficiets to the left of the biary poit have weights 2 0, 2 1, 2 2 Coefficiets to the right of the biary poit have weight 2-1, 2-2, 2-3 For example, the umber represets: = = d sem, Computer Systems - HS 49 2d sem, Computer Systems - HS 50 Floatig Poit Numbers A floatig poit umber embeds the biary poit locatio withi the umber represetatio Expoet: locatio of BP Value: = Sigificad: value Similar to the traditioal scietific otatio, except i biary Sigificad s 2 e Expoet IEEE Floatig Poit Number A stadard way to represet floatig poit umber for cross-platform compatibility IEEE 754 stadard is the most widely used floatig poit stadard Sigle precisio (32-bit) Double precisio (64-bit) Defies: Number represetatio format Exceptioal values (e.g. NaN) Roudig rules 2d sem, Computer Systems - HS 51 2d sem, Computer Systems - HS 52
14 IEEE 754 umber format (SP) IEEE Floatig Poit (SP,DP) Sigle precisio values: expoet 32-bit wide MSB is sig bit Sig-magitude represetatio Expoet is 8 bit wide Bias-127 (excess-127) for e < FF used for sub-ormal (small) umbers FF used for NaN & sigificad Sigificad is 23 bit wide Usually ormalized i the form 1.xxxxxxxx But may represet 0.xxxxxxx if expoet is Expoet Sigificad = 0 Sigificad 0 Equatio 00 0 Subormal -1 s sigificad 01 FE Normalized values -1 s 2 (e-127) 1.sigificad FF ± NaN Double precisio has similar format, but with 64 bits: Expoet: 11bits (biased 1023) Sigificad: 52bits Expoet Sigificad = 0 Sigificad 0 Equatio Subormal -1 s sigificad 001 7FE Normalized values -1 s 2 (e-1023) 1.sigificad 7FF ± NaN 2d sem, Computer Systems - HS 53 2d sem, Computer Systems - HS 54 Floatig Poit No-Associativity (a + b)+ c a + (b + c) The order of calculatio affects the results i floatig poit umbers Occurs due to limited size i siificad error due to roudig Associativity Example (Decimal) ! ! ! (rouded)! ! ! (rouded)! ! ! ! ! ! ! (rouded)! 2d sem, Computer Systems - HS 55 2d sem, Computer Systems - HS 56
15 Floatig Poit Number Lie Floatig poit umbers are ot uiformly distributed i the umber lie Deser as the magitude gets smaller Iteger Floatig Poit 2 e k k depeds o actual implemetatio (3 i this drawig) 8 I coclusio 3 classes of moder computer Servers most powerful Desktop stadard Embedded processors power ad cost coscious 5 compoets of a computer CPU: datapath + cotrol Memory I/O Numbers are represeted as biary bit strigs i computers 2 s complemet is the most commo way to represet +ve/-ve itegers i computers Adder/Subtractor desigs are highly similar with 2 s comp rep Floatig poit umbers represet real-umbers 2d sem, Computer Systems - HS 57 2d sem, Computer Systems - HS 58
Chapter 3. Floating Point Arithmetic
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 3 Floatig Poit Arithmetic Review - Multiplicatio 0 1 1 0 = 6 multiplicad 32-bit ALU shift product right multiplier add
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationIntroduction CHAPTER Computers
Iside a Computer CHAPTER Itroductio. Computers A computer is a electroic device that accepts iput, stores data, processes data accordig to a set of istructios (called program), ad produces output i desired
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationChapter 4 The Datapath
The Ageda Chapter 4 The Datapath Based o slides McGraw-Hill Additioal material 24/25/26 Lewis/Marti Additioal material 28 Roth Additioal material 2 Taylor Additioal material 2 Farmer Tae the elemets that
More informationEE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )
EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationUNIVERSITY OF MORATUWA
UNIVERSITY OF MORATUWA FACULTY OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING B.Sc. Egieerig 2014 Itake Semester 2 Examiatio CS2052 COMPUTER ARCHITECTURE Time allowed: 2 Hours Jauary 2016
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationComputer Graphics Hardware An Overview
Computer Graphics Hardware A Overview Graphics System Moitor Iput devices CPU/Memory GPU Raster Graphics System Raster: A array of picture elemets Based o raster-sca TV techology The scree (ad a picture)
More informationEE University of Minnesota. Midterm Exam #1. Prof. Matthew O'Keefe TA: Eric Seppanen. Department of Electrical and Computer Engineering
EE 4363 1 Uiversity of Miesota Midterm Exam #1 Prof. Matthew O'Keefe TA: Eric Seppae Departmet of Electrical ad Computer Egieerig Uiversity of Miesota Twi Cities Campus EE 4363 Itroductio to Microprocessors
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Single-Cycle Disadvantages & Advantages
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 4 The Processor Pipeliig Sigle-Cycle Disadvatages & Advatages Clk Uses the clock cycle iefficietly the clock cycle must
More informationLesson 1. The datapath
Lesso. Computers Structure ad Orgaizatio Graduate i Computer Scieces / Graduate i Computers Egieerig Computers Structure ad Orgaizatio. Graduate i Computer Scieces / Graduate i Computer Egieerig Automatic
More informationBACHMANN-LANDAU NOTATIONS. Lecturer: Dr. Jomar F. Rabajante IMSP, UPLB MATH 174: Numerical Analysis I 1 st Sem AY
BACHMANN-LANDAU NOTATIONS Lecturer: Dr. Jomar F. Rabajate IMSP, UPLB MATH 174: Numerical Aalysis I 1 st Sem AY 018-019 RANKING OF FUNCTIONS Name Big-Oh Eamples Costat O(1 10 Logarithmic O(log log, log(
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationFundamentals of. Chapter 1. Microprocessor and Microcontroller. Dr. Farid Farahmand. Updated: Tuesday, January 16, 2018
Fudametals of Chapter 1 Microprocessor ad Microcotroller Dr. Farid Farahmad Updated: Tuesday, Jauary 16, 2018 Evolutio First came trasistors Itegrated circuits SSI (Small-Scale Itegratio) to ULSI Very
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationBehavioral Modeling in Verilog
Behavioral Modelig i Verilog COE 202 Digital Logic Desig Dr. Muhamed Mudawar Kig Fahd Uiversity of Petroleum ad Mierals Presetatio Outlie Itroductio to Dataflow ad Behavioral Modelig Verilog Operators
More informationLecture 2. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram
Lecture 2 RTL Desig Methodology Trasitio from Pseudocode & Iterface to a Correspodig Block Diagram Structure of a Typical Digital Data Iputs Datapath (Executio Uit) Data Outputs System Cotrol Sigals Status
More informationLecture 3. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram
Lecture 3 RTL Desig Methodology Trasitio from Pseudocode & Iterface to a Correspodig Block Diagram Structure of a Typical Digital Data Iputs Datapath (Executio Uit) Data Outputs System Cotrol Sigals Status
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationCSE 305. Computer Architecture
CSE 305 Computer Architecture Computer Architecture Course Teachers Rifat Shahriyar (rifat1816@gmail.com) Johra Muhammad Moosa Textbook Computer Orgaizatio ad Desig (The Hardware/Software Iterface) David
More informationCMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationForms of Information Representation in Digital Computers.
Chapter Forms of Iformatio Represetatio i Digital Computers.. Geeral Cosideratios There are distiguished the followig two fudametal modes of iformatio represetatio: (.) a) iteral; b) exteral; Iteral represetatios
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationLecture 1: Introduction and Fundamental Concepts 1
Uderstadig Performace Lecture : Fudametal Cocepts ad Performace Aalysis CENG 332 Algorithm Determies umber of operatios executed Programmig laguage, compiler, architecture Determie umber of machie istructios
More informationSolution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:
CS 604 Data Structures Midterm Sprig, 00 VIRG INIA POLYTECHNIC INSTITUTE AND STATE U T PROSI M UNI VERSI TY Istructios: Prit your ame i the space provided below. This examiatio is closed book ad closed
More informationComputer Architecture ELEC3441
CPU-Memory Bottleeck Computer Architecture ELEC44 CPU Memory Lecture 8 Cache Dr. Hayde Kwok-Hay So Departmet of Electrical ad Electroic Egieerig Performace of high-speed computers is usually limited by
More informationChapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationBasic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.
5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator
More informationComputer Architecture. Microcomputer Architecture and Interfacing Colorado School of Mines Professor William Hoff
Computer rchitecture Microcomputer rchitecture ad Iterfacig Colorado School of Mies Professor William Hoff Computer Hardware Orgaizatio Processor Performs all computatios; coordiates data trasfer Iput
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationGE FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III
GE2112 - FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III PROBLEM SOLVING AND OFFICE APPLICATION SOFTWARE Plaig the Computer Program Purpose Algorithm Flow Charts Pseudocode -Applicatio Software Packages-
More informationCMSC Computer Architecture Lecture 3: ISA and Introduction to Microarchitecture. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 3: ISA ad Itroductio to Microarchitecture Prof. Yajig Li Uiversity of Chicago Lecture Outlie ISA uarch (hardware implemetatio of a ISA) Logic desig basics Sigle-cycle
More informationChapter 2. C++ Basics. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 2 C++ Basics Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 2.1 Variables ad Assigmets 2.2 Iput ad Output 2.3 Data Types ad Expressios 2.4 Simple Flow of Cotrol 2.5 Program
More informationInstruction and Data Streams
Advaced Architectures Master Iformatics Eg. 2017/18 A.J.Proeça Data Parallelism 1 (vector & SIMD extesios) (most slides are borrowed) AJProeça, Advaced Architectures, MiEI, UMiho, 2017/18 1 Istructio ad
More informationChapter 4. Procedural Abstraction and Functions That Return a Value. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 4 Procedural Abstractio ad Fuctios That Retur a Value Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 4.1 Top-Dow Desig 4.2 Predefied Fuctios 4.3 Programmer-Defied Fuctios 4.4
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationFPGA IMPLEMENTATION OF BASE-N LOGARITHM. Salvador E. Tropea
FPGA IMPLEMENTATION OF BASE-N LOGARITHM Salvador E. Tropea Electróica e Iformática Istituto Nacioal de Tecología Idustrial Bueos Aires, Argetia email: salvador@iti.gov.ar ABSTRACT I this work, we preset
More informationtop() Applications of Stacks
CS22 Algorithms ad Data Structures MW :00 am - 2: pm, MSEC 0 Istructor: Xiao Qi Lecture 6: Stacks ad Queues Aoucemets Quiz results Homework 2 is available Due o September 29 th, 2004 www.cs.mt.edu~xqicoursescs22
More informationData diverse software fault tolerance techniques
Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationMOTIF XF Extension Owner s Manual
MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationELEG 5173L Digital Signal Processing Introduction to TMS320C6713 DSK
Departmet of Electrical Egieerig Uiversity of Arasas ELEG 5173L Digital Sigal Processig Itroductio to TMS320C6713 DSK Dr. Jigia Wu wuj@uar.edu ANALOG V.S DIGITAL 2 Aalog sigal processig ASP Aalog sigal
More informationOne advantage that SONAR has over any other music-sequencing product I ve worked
*gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationGPUMP: a Multiple-Precision Integer Library for GPUs
GPUMP: a Multiple-Precisio Iteger Library for GPUs Kaiyog Zhao ad Xiaowe Chu Departmet of Computer Sciece, Hog Kog Baptist Uiversity Hog Kog, P. R. Chia Email: {kyzhao, chxw}@comp.hkbu.edu.hk Abstract
More informationNeural Networks A Model of Boolean Functions
Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de
More informationModule Instantiation. Finite State Machines. Two Types of FSMs. Finite State Machines. Given submodule mux32two: Instantiation of mux32two
Give submodule mux32two: 2-to- MUX module mux32two (iput [3:] i,i, iput sel, output [3:] out); Module Istatiatio Fiite Machies esig methodology for sequetial logic -- idetify distict s -- create trasitio
More informationA Comparison of Floating Point and Logarithmic Number Systems for FPGAs
Compariso of Floatig Poit ad Logarithmic Number Systems for FPGs Michael Haselma, Michael Beauchamp, aro Wood, Scott Hauck Dept. of Electrical Egieerig Uiversity of Washigto Seattle, W {haselma, mjb7,
More informationn Explore virtualization concepts n Become familiar with cloud concepts
Chapter Objectives Explore virtualizatio cocepts Become familiar with cloud cocepts Chapter #15: Architecture ad Desig 2 Hypervisor Virtualizatio ad cloud services are becomig commo eterprise tools to
More informationChapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig
More information1. SWITCHING FUNDAMENTALS
. SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig
More informationEnd Semester Examination CSE, III Yr. (I Sem), 30002: Computer Organization
Ed Semester Examiatio 2013-14 CSE, III Yr. (I Sem), 30002: Computer Orgaizatio Istructios: GROUP -A 1. Write the questio paper group (A, B, C, D), o frot page top of aswer book, as per what is metioed
More informationGeneration of Distributed Arithmetic Designs for Reconfigurable Applications
Geeratio of Distributed Arithmetic Desigs for Recofigurable Applicatios Christophe Bobda, Ali Ahmadiia, Jürge Teich Uiversity of Erlage-Nuremberg Departmet of computer sciece Am Weichselgarte 3, 91058
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationIntroduction to Computing Systems: From Bits and Gates to C and Beyond 2 nd Edition
Lecture Goals Itroductio to Computig Systems: From Bits ad Gates to C ad Beyod 2 d Editio Yale N. Patt Sajay J. Patel Origial slides from Gregory Byrd, North Carolia State Uiversity Modified slides by
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationEE123 Digital Signal Processing
Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add
More informationAutomatic Generation of Polynomial-Basis Multipliers in GF (2 n ) using Recursive VHDL
Automatic Geeratio of Polyomial-Basis Multipliers i GF (2 ) usig Recursive VHDL J. Nelso, G. Lai, A. Teca Abstract Multiplicatio i GF (2 ) is very commoly used i the fields of cryptography ad error correctig
More informationSwitching Hardware. Spring 2018 CS 438 Staff, University of Illinois 1
Switchig Hardware Sprig 208 CS 438 Staff, Uiversity of Illiois Where are we? Uderstad Differet ways to move through a etwork (forwardig) Read sigs at each switch (datagram) Follow a kow path (virtual circuit)
More informationComputer Architecture
Computer Architecture Overview Prof. Tie-Fu Che Dept. of Computer Sciece Natioal Chug Cheg Uiv Sprig 2002 Overview- Computer Architecture Course Focus Uderstadig the desig techiques, machie structures,
More informationMultiprocessors. HPC Prof. Robert van Engelen
Multiprocessors Prof. Robert va Egele Overview The PMS model Shared memory multiprocessors Basic shared memory systems SMP, Multicore, ad COMA Distributed memory multicomputers MPP systems Network topologies
More informationAbstract. Chapter 4 Computation. Overview 8/13/18. Bjarne Stroustrup Note:
Chapter 4 Computatio Bjare Stroustrup www.stroustrup.com/programmig Abstract Today, I ll preset the basics of computatio. I particular, we ll discuss expressios, how to iterate over a series of values
More informationMaster Informatics Eng. 2017/18. A.J.Proença. Memory Hierarchy. (most slides are borrowed) AJProença, Advanced Architectures, MiEI, UMinho, 2017/18 1
Advaced Architectures Master Iformatics Eg. 2017/18 A.J.Proeça Memory Hierarchy (most slides are borrowed) AJProeça, Advaced Architectures, MiEI, UMiho, 2017/18 1 Itroductio Programmers wat ulimited amouts
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationUsing the Keyboard. Using the Wireless Keyboard. > Using the Keyboard
1 A wireless keyboard is supplied with your computer. The wireless keyboard uses a stadard key arragemet with additioal keys that perform specific fuctios. Usig the Wireless Keyboard Two AA alkalie batteries
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor Advanced Issues
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 4 The Processor Advaced Issues Review: Pipelie Hazards Structural hazards Desig pipelie to elimiate structural hazards.
More informationCMSC Computer Architecture Lecture 2: ISA. Prof. Yanjing Li Department of Computer Science University of Chicago
CMSC 22200 Computer Architecture Lecture 2: ISA Prof. Yajig Li Departmet of Computer Sciece Uiversity of Chicago Admiistrative Stuff Lab1 out toight Due Thursday (10/18) Lab1 review sessio Tomorrow, 10/05,
More informationThreads and Concurrency in Java: Part 1
Threads ad Cocurrecy i Java: Part 1 1 Cocurrecy What every computer egieer eeds to kow about cocurrecy: Cocurrecy is to utraied programmers as matches are to small childre. It is all too easy to get bured.
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationCMSC Computer Architecture Lecture 10: Caches. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 10: Caches Prof. Yajig Li Uiversity of Chicago Midterm Recap Overview ad fudametal cocepts ISA Uarch Datapath, cotrol Sigle cycle, multi cycle Pipeliig Basic idea,
More informationCS : Programming for Non-Majors, Summer 2007 Programming Project #3: Two Little Calculations Due by 12:00pm (noon) Wednesday June
CS 1313 010: Programmig for No-Majors, Summer 2007 Programmig Project #3: Two Little Calculatios Due by 12:00pm (oo) Wedesday Jue 27 2007 This third assigmet will give you experiece writig programs that
More informationIntroduction to Network Technologies & Layered Architecture BUPT/QMUL
Itroductio to Network Techologies & Layered Architecture BUPT/QMUL 2018-3-12 Review What is the Iteret? How does it work? Whe & how did it come about? Who cotrols it? Where is it goig? 2 Ageda Basic Network
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationIsn t It Time You Got Faster, Quicker?
Is t It Time You Got Faster, Quicker? AltiVec Techology At-a-Glace OVERVIEW Motorola s advaced AltiVec techology is desiged to eable host processors compatible with the PowerPC istructio-set architecture
More informationNeuro Fuzzy Model for Human Face Expression Recognition
IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1
More informationWavelet Transform. CSE 490 G Introduction to Data Compression Winter Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual)
Wavelet Trasform CSE 49 G Itroductio to Data Compressio Witer 6 Wavelet Trasform Codig PACW Wavelet Trasform A family of atios that filters the data ito low resolutio data plus detail data high pass filter
More informationChapter 5: Processor Design Advanced Topics. Microprogramming: Basic Idea
5-1 Chapter 5 Processor Desig Advaced Topics Chapter 5: Processor Desig Advaced Topics Topics 5.3 Microprogrammig Cotrol store ad microbrachig Horizotal ad vertical microprogrammig 5- Chapter 5 Processor
More informationCourse Site: Copyright 2012, Elsevier Inc. All rights reserved.
Course Site: http://cc.sjtu.edu.c/g2s/site/aca.html 1 Computer Architecture A Quatitative Approach, Fifth Editio Chapter 2 Memory Hierarchy Desig 2 Outlie Memory Hierarchy Cache Desig Basic Cache Optimizatios
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationOutline. Applications of FFT in Communications. Fundamental FFT Algorithms. FFT Circuit Design Architectures. Conclusions
FFT Circuit Desig Outlie Applicatios of FFT i Commuicatios Fudametal FFT Algorithms FFT Circuit Desig Architectures Coclusios DAB Receiver Tuer OFDM Demodulator Chael Decoder Mpeg Audio Decoder 56/5/ 4/48
More information