18 Pages

Lec02a

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

Word Count: 856

Document Preview

4300 COMP Computer Architecture Performance Measurement Dr. Xiao Qin Auburn University http://www.eng.auburn.edu/~xqin xqin@auburn.edu Fall, 2010 1 What is Computer Architecture ? Application (Netscape) Software Hardware Operating System Compiler (Unix; Assembler Windows 9x) Processor Memory I/O system Instruction Set Architecture Datapath & Control Digital Design Circuit Design transistors, IC...

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 Performance Measurement Dr. Xiao Qin Auburn University http://www.eng.auburn.edu/~xqin xqin@auburn.edu Fall, 2010 1 What is Computer Architecture ? Application (Netscape) Software Hardware Operating System Compiler (Unix; Assembler Windows 9x) Processor Memory I/O system Instruction Set Architecture Datapath & Control Digital Design Circuit Design transistors, IC layout comp 4300 Key Idea: levels of abstraction 2 hide unnecessary implementation details helps us cope with enormous complexity of real systems Computer Architectures Changing Definition 1950s to 1960s Computer Architecture Course: Computer Arithmetic 1970s to mid 1980s Computer Architecture Course: Instruction Set Design, especially ISA appropriate for compilers 1990s to 2000s Computer Architecture Course: Design of CPU, memory system, I/O system, Multiprocessors, Networks 2010s: Computer Architecture Course: Self adapting systems? Self organizing structures? Green Architecture? DNA Systems/Quantum Computing? 3 COMP 4300 Course Focus Understanding the design techniques, machine structures, technology factors, evaluation methods that will determine the form of computers in 21st Century Technology Parallelism Applications Computer Architecture: Instruction Set Design Instruction-level Parallelism Memory Hierarchy Design History Operating Systems 4 Programming Languages Interface Design (ISA) Compilers Measurement & Evaluation Computer Engineering Methodology Implementation Complexity Evaluate Existing Systems for Systems Bottlenecks Bottlenecks Technology Trends Implement Next Generation System Benchmarks Page 35. Simulate New Designs and Organizations Workloads Architecture design is an iterative process: Searching the space of possible designs at all levels of computer systems 5 Machine Organization 5 classic components of any computer Personal Computer Computer Processor (CPU) (active) Control (brain) Datapath (brawn) Memory (passive) (where programs, & data live when running) Devices Input Output The components of every computer, past and present, belong to one of these five categories 6 Keyboard, Mouse Disk (where programs, & data live when not running) Display, Printer Performance Measurement Outline Performance Metrics: How do we conclude that System-A is better than System-B? Measuring CPU time Amdahls Law: Relates total speedup of a system to the speedup of some portions of that system. 7 Importance of Measurement Architecture design is an iterative process: Search the possible design space Make selections Evaluate the selections made Good measurement tools are required to accurately evaluate the selection. Cost / Performance Analysis Good Ideas Bad Ideas 8 Mediocre Ideas Two notions of performance Plane DC to Paris Speed Passengers Throughput (pmph) Boeing 747 6.5 hours 610 mph 470 286,700 BAD/Sud Concodre 3 hours 1350 mph 132 178,200 Which has higher performance? 1. Time to deliver 1 passenger? 2. Time to deliver 400 passengers? 9 Example of Response Time v. Throughput Flying Time: Concorde Boeing vs. 747? Concord is 6.5 hours / 3 hours = 2.2 times as fast (response time,) Throughput: Boeing vs. Concorde? Boeing 747: 286,700 p-mph / 178,200 p-mph = 1.6 times as fast (throughput, ) Time to do the task (Interest to users) execution time, response time, latency, etc. Tasks per day, hour, week, sec, (Interest to system administrators) throughput, bandwidth, etc. 10 Performance Definitions We are primarily concerned with response time To maximize performance, we must minimize response time for some task: Performancex > Performancey response_timex < response_timey "X is n times as fast as Y" means Performancex = n X Performancey 11 What is Execution Time? Definition 1: Total time to complete a task, including disk accesses, memory accesses, I/O activities, operating system overhead, ... wall-clock time, response time, or elapsed time Definition 2: measure time processor is working on your program only (since multiple processes running at same time) CPU execution time or CPU time Often divided into system CPU time (in OS) and user CPU time (in user program) How to Measure Time? User actual elapsed time to complete particular task is only true basis for comparison sum of I/O time, User + System CPU, time spent on other tasks, boot time, etc. alternatives may mislead! CPU designer want measure relating to how fast processor hardware can perform basic functions (CPU execution time) Measuring CPU Most computers are constructed using a clock that time runs at a constant rate and determines when events take place in the hardware These discrete time intervals called clock cycles Length of clock period: clock cycle time (e.g., 2 nanoseconds or 2 ns) and clock rate (e.g., 500 megahertz, or 500 MHz), which is the inverse of the clock period; 1 2 10 Sec. -9 = 500MHz Execution time = # Clock cycles X clock cycle time Example of Measuring CPU CPU time CPU time = Seconds = Instructions x Cycles x Seconds = Seconds = Instructions x Cycles x Seconds tPime Instruction Cycle Program rogram Program Program Instruction Cycle If a computer has a clock rate of 50 MHz, how long does it take to execute a program with 1,000 instructions, if the CPI for the program is 3.5? Using the equation CPU time = Instruction count x CPI / clock rate gives 15 6 CPU time = 1000 x 3.5 / (50 x 10 ) Example of Measuring CPU time If a computers clock rate increases from 200 MHz to 250 MHz and the other factors remain the same, how many times faster will the computer bCPU time old e? clock rate new 250 MHz ------------------- = ---------------------- = ---------------- = 1.25 CPU time new clock rate old 200 MHZ What simplifying assumptions did we make? 16 Performance Two computers M1 xamplethe same instruction E and M2 with set. For a given program, we have Clock rate (MHz) CPI M1 50 2.8 M2 75 3.2 How many times faster is M2 than M1 for this program? M1 x CPIM1 / Clock RateM1 ExTimeM1 IC 2.8/50 = = = 1.31 ExTimeM2 ICM2 x CPIM2 / Clock RateM2 3.2/75 17 For Next Time 1. Read Chapter 1.4-1.7 2. Performance Measurement (cont.) 18
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
COMP 4300 Computer ArchitecturePerformance MeasurementDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Example of Measuring CPU timeCPU timeCPU time= Seconds = Instructions x Cycles x Seconds= Seconds = Inst
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureInstruction SetDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101The Instruction Set (ISA):a Critical InterfaceTheactualprogrammervisibleinstructionsetsoftwareinstructionsethar
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureInstruction Set (cont.)Dr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Operand Locations in Four ISAClassesGPR2Code Sequence C = A + BCodefor Four Instruction SetsforStack
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureInstruction Set (cont.)Dr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Memory-Memory Architectures Instruction set:(3 operands) add A, B, C(2 operands) add A, Bsub A, B, Cmul
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureTypes of InstructionsDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Review: Types of Addressing ModesAddressing Mode1. Register direct2. Immediate3. Displacement4. Register
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureOperations in the Instruction SetDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Review Memory Addressing Types of Instructions2I-Format vs. R-FormatInstructions Compare wit
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureOperations in the Instruction SetDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Comparisons - What about &lt;, &lt;=, &gt;,&gt;=? bne, beq provide equality comparison slt provides magnitu
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureDatapathDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Datapath for BranchInstructionsbeq rs, rt, offsetif (R[rs] = R[rt]) thenPC PC+4 + s_extend(offset&lt;2)oprsrtoffset/im
Auburn - COMP - 3400
COMP 4300 Computer Architecture1. Single-Cycle Datapath2. Control Unit DesignDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Datapath Components for MIPS beqbeq $R1, $R2, -100if $R1=$R2 then PC = PC+4+4*(-10
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureControl Unit StructureDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101ReviewADD04rsrtrdI[25:21] I[20:16] I[15:11]PC1&lt;2InstructionADDRRDInstructionMemoryI325016
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureMulticycle ImplementationDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101The Problem with Single-CycleProcessor Implementation: Performance Performance is limited by the slowest
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureMulticycle ImplementationDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101The slowest instruction.If all instructions must complete within one clock cycle, then the cycle time has
Auburn - COMP - 3400
COMP 4300 Computer ArchitecturePipeline: IntroductionDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Full Multicycle ImplementationZ eroPCWrite CondControlUnitPCWrit eALUOp2ALUControlIRWritefunctop
Auburn - COMP - 3400
COMP 4300 Computer ArchitecturePipeline: SpeedupDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Pipeline example: lwWBCan you find a problem?2Basic Pipelined Processor (lw)3Single-Cycle vs. Pipelined Exec
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureStructural HazardsDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Review: Pipeline Hazards Limits to pipelining: Hazards prevent nextinstruction from executing during itsdesign
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureData HazardsControl HazardsDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Review: Structural Hazards Attempt to use same resource twice at sametime Example: Single Memory for
Auburn - COMP - 3400
COMP 4300 Computer ArchitecturePipeline: Branch PredictionDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Review: Data Hazards Data hazards occur when data isused before it is storedTime (in clock cycles)CC
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureReviewDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Supercomputer Trends in TopSIMDClusterSingle processor 500ConstellationsSMPMPPwww.top500.orgNov. 2004CPUCPUCPUCPU
Auburn - COMP - 3400
COMP 4300 Computer ArchitecturePipeline: ExceptionsDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Exceptions - Stuff Happens Exceptions definition: unexpectedchange in control flow Another form of control h
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureControl for Pipelined DatapathDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Pipelining in MIPS MIPS architecture was designed to bepipelined Simple instruction format (makes
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureInstruction-level parallelism:IntroductionDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Class ExerciseConsider the following code segment1.LW R1, 0(R4)2.LW R2, 0(R5)3.AD
Auburn - COMP - 3400
COMP 4300 Computer ArchitectureLaboratory Assignment 3:Pipelined Datapath with Interlocksand ForwardingDr. Xiao QinAuburn Universityhttp:/www.eng.auburn.edu/~xqinxqin@auburn.eduFall, 20101Introduction From your multi-cycle machine to amachine
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