16 Pages

Lec10b-Lab3(1)

Course: COMP 3400, Fall 2010
School: Auburn
Rating:
 
 
 
 
 

Word Count: 802

Document Preview

4300 COMP Computer Architecture Laboratory Assignment 3: Pipelined Datapath with Interlocks and Forwarding Dr. Xiao Qin Auburn University http://www.eng.auburn.edu/~xqin xqin@auburn.edu Fall, 2010 1 Introduction From your multi-cycle machine to a machine with pipelined datapath Based on the five stage MIPS pipeline You are allowed to create your own pipeline 2 Introduction (cont.) Implementation of branch...

Register Now

Unformatted Document Excerpt

Coursehero >> Alabama >> Auburn >> COMP 3400

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
4300 COMP Computer Architecture Laboratory Assignment 3: Pipelined Datapath with Interlocks and Forwarding Dr. Xiao Qin Auburn University http://www.eng.auburn.edu/~xqin xqin@auburn.edu Fall, 2010 1 Introduction From your multi-cycle machine to a machine with pipelined datapath Based on the five stage MIPS pipeline You are allowed to create your own pipeline 2 Introduction (cont.) Implementation of branch or load delay slots is NOT required. Implement each part as described Answer all related questions Submit your programs. You must test (i.e., compile and run) your simulator on a Linux machine. 3 Your Pipeline A load-store GPR-based 3-operand machine Execute the subset of MIPS instructions Implement interlocks between pipe stages to recognize and resolve data hazards: through forwarding when feasible, including forwarding through the register file through NOPs otherwise (interlocks) 4 Hazard Detection Situations LD R1, 45(R2) DADD R5, R1, R7 (Requires stall) 5 Comparators detect the use of R1 in the DADD and stall the DADD (and future instructions) before the DADD begins EX. LD R1, 45(R2) DADD R5, R6, R7 DSUB R8, R1, R7 (Requires forwarding) Comparators detect the use of R1 in DSUB and forward result of load to ALU in time for DSUB to begin EX. Hardware interlock Remaining Stalls Some data hazards cannot be resolved by forwarding: LW SUB AND OR R1,0(R2) R4, R1, R5 R6, R1, R7 R8, R1, R9 Hazard detection causes stall until hazard is cleared. Hardware interlock 6 Implement Load Interlocks Recall that the following code requires a stall or load interlock to prevent Read After Write (RAW) hazards LW SUB AND OR R1,0(R2) R4, R1, R5 R6, R1, R7 R8, R1, R9 Hazard can be detected in the ID stage by comparing rt and rs registers 7 In which State Should Data Hazards be Checked? Instruction issue when instruction transfers from ID stage into EX stage Data hazards checked in ID stage * If stall is required, instruction is stalled before it is issued * If forwarding is needed, controls are set 8 Load Interlock Detection Logic Opcode field Opcode field of of ID/EX IF/ID (IF/ID.IR0..5) (ID/EX0..5) Matching Operand Fields Load Register-register ALU ID/EX.IR[rt]==IF/ID.IR[rs] Load Register-register ALU ID/EX.IR[rt]==IF/ID.IR[rt] Load Load, store, ALU ID/EX.IR[rt]==IF/ID.IR[rs] immediate, or branch 6 bits 5 bits 16 bits op rs rt offset 6 bits 9 5 bits 5 bits 5 bits 5 bits op rs rt rd 5 bits I-Format 6 bits shamt funct R-Format Implementing a Stall after Detection Change opcode in ID/EX pipeline register to 00000 (NOP) Recirculate contents of IF/ID register to hold stalled instruction 10 Forwarding Logic Detection is similar to detecting RAW, but more cases All forwarding values originate at ALU or data memory output Terminate at ALU input, data memory input or zero detection unit 11 Forwarding Logic 12 Additional MUX inputs and paths Building a Pipeline Simulate concurrent behavior PCSrc RegWrite 1 0 W Control M W E M W ADD ADD 4 Branch <<2 RegWrite PC ADDR RD Instruction Memory rs 32 rt RN1 5 RN2 5 WN 5 WD RD1 Ze ro ALUSrc Register File RD2 ALU ADDR Data Memory 0 1 immed 16 E X T N D 13 1 ALU Control 6 RegDst 0 5 ALUOp MemRead 1 5 IF/ID 0 WD 32 rt rd RD ID/EX EX/MEM MEM/WB Building a Pipeline Push Model vs. Pull Model "push" model: Fetch the next instruction and use that to push the behavior of all the downstream pipeline stages. "pull" model: Complete the instruction in the WB stage, emptying that stage and pulling the upstream activities down the pipe. Which is better? 14 Building a Pipeline Pipeline must behave as follows The fetch stage: use the current value in the PC to index memory, and retrieve the instruction from the memory. Put it in a buffer (you could call it the IF/ID latch !) where it will be grabbed by decode in the next clock cycle. Decode reads zero, one or two values out of the register file and stores them in a buffer (the ID/EX latch) for use by the execute stage in the next clock cycle. If you're using the "pull" model you'll need to delay the change of PC until then. Execute: The result could be put in an EX/MEM latch. The memory stage: If the instruction in MEM is an R-type instruction, the MEM/WB latch should buffer the result that was being held in the EX/MEM latch. Write-back puts the results of an R-type instruction or a load into the register file. This value should come from 15 the MEM/WB latch. A Test Case To instrument your simulator to keep track of number of clock cycles of execution, total instruction count, and number of NOPs executed. Take nearly the same example program you used for Lab 2 - but with NOPs inserted after each load or branch - and run it on your pipeline. 16
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Auburn - COMP - 3400
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureInstruction-level parallelism:Instruction DependenceDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101ILP Challenges How many instructions can we execute inparallel? Definition
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureControl DependenciesDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Instruction Dependence ExampleFor the following code identify all data and name dependencebetween instruction
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureReview: Control DependenciesDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Review: Preserving the data flow Consider the following example:daddu r1,r2,r3beqz r4,Ldsubu r1,r5,
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureScoreboardDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Typical Scoreboard Structure2 FP multiply, 1 FP adder, 1 FP divider, 1 integer2Using A Scoreboard: 4 stages1.Issue d
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureScoreboard An ExampleDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Scoreboard Example Cycle 1InstructionstatusInstructionjkLDF634+ R2LDF245+ R3MULTDF0F2F4SUBD F8
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureInstruction-level parallelism:TomasuloDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Review: Scoreboard Techniques to deal with data hazards in instructionpipelines by: Resul
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureInstruction-level parallelism:Tomasulo (cont.)Dr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Tomasulos Algorithm Tracks when operands for instructions areavailable. Minimizes
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureTomasulo - A loop exampleDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Tomasulo Loop ExampleLoop: LDMULTDSDSUBIBNEZF0F4F4R1R10R1F0 F20R1R1 #8Loop This time ass
Auburn - COMP - 3400
Memory Hierarchy: IntroductionDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Memory Systems - the BigPicture withMemory provides processor Instructions Data Problem: memory is too slow and too smallProces
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureSet-Associative CacheBlock IdentificationDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Direct-Mapped Cache with n one-wordblocks Pros: find data fast Con: What if access 000
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureReview for Final ExamDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Final Exam ReviewFocus on materials after the midterm,including Pipeline Exceptions Control for Pipelined
Auburn - COMP - 3400
COMP4300 Computer ArchitectureFall 2010Auburn UniversityInstructor: Dr. Xiao QinStudy Guide for MidtermThe midterm exam will occur on Friday, Oct. 8. This exam is closed book and closed notes. The examis worth 20% of your final grade. Although a cal
Auburn - COMP - 7370
Are Clouds Secure?Security and PrivacyImplications ofCloud ComputingSubra Kumaraswamy, SunTim Mather, RSA04/21/09 | Session ID: HOT-105Session Classification: IntermediateWhat Were Not Going to Discuss Existing aspects of information security whi
Auburn - COMP - 7370
CloudAV: N-Version Antivirus in the Network CloudJon Oberheide, Evan Cooke, Farnam JahanianElectrical Engineering and Computer Science DepartmentUniversity of Michigan, Ann Arbor, MI 48109cfw_jonojono, emcooke, farnam@umich.eduAbstractAntivirus soft
Auburn - COMP - 7370
LestWeRemember:ColdBootAttacksonLestWeRemember:ColdBootAttacksonEncryptionKeysJ.AlexHalderman,SethD.Schoen,NadiaHeninger,WilliamClarkson,WilliamPaul,JosephA.Calandrino,ArielJ.Feldman,JacobAppelbaum,andEdwardW.FeltenInProceedingsofthe2008USENIXSecurit
Auburn - COMP - 7370
Freenet: A Distributed Anonymous InformationStorage and Retrieval SystemIan Clarke1 , Oskar Sandberg2 , Brandon Wiley3 , and Theodore W. Hong414Uprizer, Inc., 1007 Montana Avenue #323, Santa Monica, CA 90403, USAian@octayne.com2Mrbydalen 12, 18252
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityHomework 2 FeedbackDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduSpring, 201112Goals of Homework 2Homework 2 vs. Paper reviewingHomework 2 vs. Choosing a research probl
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityHomework 3 FeedbackDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduSpring, 20111Goals of Homework 2/3 Paper reviewing Choosing a research problem2Good Organizations Jame
Auburn - COMP - 7370
L. Sweeney. k-anonymity: a model for protecting privacy. International Journal on Uncertainty,Fuzziness and Knowledge-based Systems, 10 (5), 2002; 557-570.k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY1LATANYA SWEENEYSchool of Computer Science, Carnegie
Auburn - COMP - 7370
Generalizing Data to Provide Anonymity when Disclosing InformationExtended AbstractPierangela SamaratiComputer Science LaboratorySRI InternationalMenlo Park, CA 94025, USAsamarati@csl.sri.comLatanya SweeneyLaboratory for Computer ScienceMassachus
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduCOMP 7370, Auburn UniversitySlide 01-1Introduce YourselvesNameM.S. or Ph.D. studentYour research interestsYour ongoing res
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityCold Boot Attacks on Encryption KeysA memory remanence attack aims to obtain memory images and recover cryptographickeys from DRAM after a reset or moving the DRAM to another system.1. Motivation: How to
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityLec02aDRAM Remanence EffectsDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduSpring, 20111Decay at operating temperature2Decay at operating temperature3Decay at operatin
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityCold Boot Attacks on Encryption Keys (2)Topics: Imaging Residual MemoryKey reconstructionIdentifying keys in memoryTopic 1: Imaging Residual Memory1. Memory Wiping Can wiping memory at POST (Power-On S
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityImaging residual memoryKey reconstructionIdentifying keys in memoryDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduSpring, 20111Optimal decoding is 0 if more than nr ofth
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityCold Boot Attacks on Encryption Keys (3)Topics:1. Identifying keys in memory2. Attacking encrypted disks3. CountermeasuresTopic 1: Identifying keys in memory Question: How will you identify keys in RAM
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityCold Boot Attacks on Encryption Keys (4)Topics:1. NSF CCLI-TUES11 Conference2. Homework 1, Question 13. CountermeasuresTopic 1: CCLI-TUES11 Conf. About CS conferences/workshop CCLI-TUES11 -&gt; Conf. in
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityCloudAV: N-Version Antivirus in the Network Cloud (1)Topics:1. Research Tip: How to choose a research topic?2. Security of cloud computingAnnouncement: Homework 1 is due by tonight at 11:55pm.Topic 1: R
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityTopics:1. Comments on Homework 12. Introduction to Project 1Announcement: Project 1 is due at 11:55pm on March 1st.Topic 1: Comments on Homework 1 No new findings. See slide 2o derived from Table 1 and
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityComments on Homework 1Dr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduSpring, 20111No New Findings2Uncomparable items3Good presentation?4Better presentation?5Highlig
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityCloudAV: N-Version Antivirus in the Network Cloud (2)Topics:1. Software as a service (SaaS)2. Security as a ServiceTopic 1: Software as a service (SaaS) Can you give some examples?o Hotmail.o Google d
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityCloudAV: N-Version Antivirus in the Network Cloud (3)Topics:1. Motivations2. Basic IdeasTopic 1: Motivations (Limitations) Antivirus softwareo Malicious/unwanted softwareo $10 billion dollars (2008)o
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityCloudAV: N-Version Antivirus inthe Network CloudDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduSpring, 20111Vulnerability Window2Vulnerability Window (cont.)3Antivirus
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityAnnouncement: midterm exam March 3rd, 2011.CloudAV: N-Version Antivirus in the Network Cloud (4)Topics:1. Architecture and Design Issues2. Evaluation (not covered, next time)Topic 1: Architecture Basic
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityCloudAV: N-Version Antivirus inthe Network CloudDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduSpring, 20111Implementation2Dashboard3Executable Launches4Executable L
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityComments on Project 1Dr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduSpring, 2011123456Good Scripts Well document Readability is good Considers many cases7The Best
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityGeneralizing Data to Provide Anonymity when Disclosing Information (1)Topics:1. Problem descriptiona. How to formally define a problem?Topic 1: Problem Description Motivation:o Protect individual-speci
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityGeneralizing Data to ProvideAnonymity when Disclosing Information- MotivationDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduSpring, 20111Motivational Example Re-identify
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityGeneralizing Data to Provide Anonymity when Disclosing Information (2)Comments on homework 2.Topics:1. Problem descriptiona. How to define a term formally?Review: Problem Description Motivation:o Prot
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityGeneralizing Data to ProvideAnonymity when Disclosing InformationDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduSpring, 20111ReviewDB:Private dataOther dataRemovePriv
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityGeneralizing Data to Provide Anonymity when Disclosing Information (3)Comments on homework 2.Review: K-anonymityT[Q1]: T[ethnicity] : each sequence; 2 sequences; both 5 black and 6 Caucasian &gt;= k (sayk i
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityGeneralizing Data to ProvideAnonymity when Disclosing Information- K-anonymityDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduSpring, 20111K-anonymityIf each quasi-identi
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityGeneralizing Data to Provide Anonymity when Disclosing Information (4)Topics:1. Time management2. Domain generalization hierarchyTopic 1: Time management Emailso Google: How to Read 100 Emails, Fasto
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityGeneralizing Data to ProvideAnonymity when Disclosing Information- K-anonymityDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduSpring, 20111K-minimal generalization2K-min
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityThe MinGen AlgorithmDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduSpring, 20111Step 1: PT vs. PT[QI]vs.2Step 2: history &lt;- [d_1, d_n]Use subscripts to represent genera
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityThe VectorCover Algorithm (2)Dr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduSpring, 20111Minimal Distance Vectors2The Outlier Set and All Set Outliers: Tuples which have
Auburn - COMP - 7370
Auburn - COMP - 7370
COMP 7370Advanced Computer and Network SecurityThe VectorCover Algorithm (2)Dr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduSpring, 20111Minimal Distance Vectors2The Outlier Set and All Set Outliers: Tuples which have
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityGeneralizing Data to Provide Anonymity when Disclosing Information (5)Topics:1. Introduction2. ArchitectureTopic 1: Introduction Why we should read this paper?o Citation rate: 2164 (4/19/2011)o http:/
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityFreenet: A Distributed Anonymous Information Storage and Retrieval System (2)Topics:1. ArchitectureTopic 1: Architecture Big pictureo Cooperative distributed file systemo Each node local datastoreo Lo
Auburn - COMP - 7370
COMP7370 Advanced Computer and Network SecurityFreenet: A Distributed Anonymous Information Storage and Retrieval System (3)Topics:1.2.3.4.Retrieve DataStore filesManage filesSecurity issuesRetrieve datao Need binary file keys to retrieve file
Auburn - COMP - 7370
2/10/2008Cloud Computing - Evaluating SecurityIT ProfessionalsDevelopersSolutionseBook LibraryWebopediaS earch.New sBlogsFebruary 10, 2011CIO UpdateForum sCareers/StaffingHot topics :CIO InsightsLoginRegisterCIOUpdate.comTechnology Tren
DeVry Columbus - KELLER - IS517
Name: _Arnold Ruzvidzo_ Date submitted: _IS582 Week 3 Out-of-class AssignmentFor this assignment, please email your response as an attachment by Friday, Nov. 18.1. Give an example of an entity with subtypes.in your text on p.156.Hint: use something d
DeVry Columbus - KELLER - IS517
IS582 Week 5 Out-of-class AssignmentAs noted in class, I stress the importance of using your own words. Quotes are fine, but alsomake sure to explain in your own words. On this assignment, please answer the first twoquestions and at least one of the re
Butler Community College - HIST - 2301
Texas History study guide1. annexation - the formal joining of one political region to another; many Texansdesired to see this occur by the United States2. revenues - government income3. Treaty of Tehuacana Creeek - peace and trade agreement signed in
Butler Community College - HIST - 2301
Timeline3500 BCE: Mesopotamia, the world's first civilization, developed in Sumer, nowsoutheastern Iraq.633 CE: Syria and Iraq are conquered by Muslims680: Mayyad caliph troops murdered Husayn, Shiites successor to the caliphate. Thistriggered the S
Butler Community College - HIST - 2302
1.Backcountry: a colonial region that ran along the Appalachian Mountains.2.Boston Massacre: The first bloodshed of the Amercan Revolution, as British guardsat the Boston Customs House opened fire on a crowd killing five Americans3.Boston Tea Party:
Butler Community College - HIST - 2302
The main terms of the Treaty of Versailles were:War Guilt Clause - Germany should accept the blame for starting World War OneReparations - Germany had to pay 6,600 million for the damage caused by thewarDisarmament - Germany was only allowed to have a
Butler Community College - HIST - 1301
World War 2 IntroWorld War II killed more people, involved more nations, and cost more moneythan any other war in history. Altogether, 70 million people served in the armed forcesduring the war and 17 million combatants died. Civilian deaths were ever
Butler Community College - BIOL - 2302
Defense AdaptationsCryptic coloration: Camouflage that makes prey difficult to spotAposematic coloration: Bright, warning coloration exhibited byanimals with effective chemical or physical defensesBatesian mimicry: a harmless species looks like a spe