CS252 Projects 2 nd Week Jaein Jeong Johnathon Jamison.

Slides:



Advertisements
Similar presentations
How SAS implements structured programming constructs
Advertisements

Dependence Precedence. Precedence & Dependence Can we execute a 1000 line program with 1000 processors in one step? What are the issues to deal with in.
Integrity & Malware Dan Fleck CS469 Security Engineering Some of the slides are modified with permission from Quan Jia. Coming up: Integrity – Who Cares?
CS1104: Computer Organisation School of Computing National University of Singapore.
Optimizing single thread performance Dependence Loop transformations.
Finding bugs: Analysis Techniques & Tools Comparison of Program Analysis Techniques CS161 Computer Security Cho, Chia Yuan.
CS 111: Introduction to Programming Midterm Exam NAME _________________ UIN __________________ 10/30/08 1.Who is our hero? 2.Why is this person our hero?
LECTURE 1 CMSC 201. Overview Goal: Problem solving and algorithm development. Learn to program in Python. Algorithm - a set of unambiguous and ordered.
Race Conditions. Isolated & Non-Isolated Processes Isolated: Do not share state with other processes –The output of process is unaffected by run of other.
Repeating Actions While and For Loops
This set of slides is provided by the author of the textbook1 Introductory Topics (Continued) l Computer Components l Basic Control Structures l Problem.
Advanced VLSI Design Project Verification Bobby Dixon ELEC
1 Objectives You should be able to describe: Relational Expressions The if-else Statement Nested if Statements The switch Statement Common Programming.
EE 231 Digital Electronics Fall 01 week 1-slide 1 Digital Hardware Systems Digital Systems Digital vs. Analog Waveforms Analog: values vary over a broad.
1 Verifying Architecture Jaein Jeong Johnathon Jamison This presentation will probably involve audience discussion, which will create action items. Use.
Chapter 7 Input/Output. Input/Output Problems Wide variety of peripherals —Delivering different amounts of data —At different speeds —In different formats.
First Programming Assignment For MIPS R3000 Processor Department of Computer Science Southern Illinois University Edwardsville Fall, 2015 Dr. Hiroshi Fujinoki.
Stack Stack Pointer A stack is a means of storing data that works on a ‘Last in first out’ (LIFO) basis. It reverses the order that data arrives and is.
2 Objectives You should be able to describe: Relational Expressions Relational Expressions The if-else Statement The if-else Statement Nested if Statements.
Week 2.  Understand what the processor is and what it does.  Execute basic LMC programs.  Understand how CPU characteristics affect performance.
Joseph Cordina 1/11 The Use of Model-Checking for the Verification of Concurrent Algorithms Joseph Cordina Department of C.S.&A.I.
Fundamental Programming: Fundamental Programming K.Chinnasarn, Ph.D.
IXA 1234 : C++ PROGRAMMING CHAPTER 1. PROGRAMMING LANGUAGE Programming language is a computer program that can solve certain problem / task Keyword: Computer.
What does C store? >>A = [1 2 3] >>B = [1 1] >>[C,D]=meshgrid(A,B) c) a) d) b)
1 Example: traffic light controller Guarantee no collisions Guarantee eventual service E S N.
CS101 Computer Programming I Chapter 4 Extra Examples.
Probabilistic Verification of GBN Group Members: Lin Huang(lh2647), Yuechen Qin(yq2158), Xi Chen(xc2257), Runxi Zhou(rz2286), Shuang Zhang(sz2426) 04/08/2014.
Software Reliability Research Pankaj Jalote Professor, CSE, IIT Kanpur, India.
Layali Rashid, Karthik Pattabiraman and Sathish Gopalakrishnan D EPARTMENT OF E LECTRICAL AND C OMPUTER E NGINEERING T HE U NIVERSITY OF B RITISH C OLUMBIA.
1 Original Source : and Problem and Problem Solving.ppt.
Oct 13, 2005CS477: Analog and Digital Communications1 PLL and Noise in Analog Systems Analog and Digital Communications Autumn
Lecture 2 Conditional Statement. chcslonline.org Conditional Statements in PHP Conditional Statements are used for decision making. Different actions.
Programming in C++ Dale/Weems/Headington Chapter 1 Overview of Programming and Problem Solving.
Using Loop Invariants to Detect Transient Faults in the Data Caches Seung Woo Son, Sri Hari Krishna Narayanan and Mahmut T. Kandemir Microsystems Design.
Testing Chapter 23 IB103 Week 12 (part 3). Verify that a complex (any) program works correctly, that the program meets specifications The chapter reviews.
CS 0401 Debugging Hints and Programming Quirks for Java by John C. Ramirez University of Pittsburgh.
EGR 115 Introduction to Computing for Engineers Branching & Program Design – Part 3 Friday 03 Oct 2014 EGR 115 Introduction to Computing for Engineers.
Chapter - Software Engineering Fail safe design problems Component jams Operator detected failure Erroneous input Unsafe modes Programming errors Sabotage.
Chapter 4 Test Design Techniques MNN1063 System Testing and Evaluation.
Ways to act like a computer scientist. Be curious Look at different menus Run code to see what happens Check the effects of different settings Answer.
The Big Picture. My Story  Wrote great programs  Didn’t understand how they worked.
Introduction to Computer Programming using Fortran 77.
Interrupts and Exception Handling. Execution We are quite aware of the Fetch, Execute process of the control unit of the CPU –Fetch and instruction as.
Static Analysis Introduction Emerson Murphy-Hill.
Software Engineering Algorithms, Compilers, & Lifecycle.
Week#3 Software Quality Engineering.
1 CS 192 Lecture 4 Winter 2003 December 8-9, 2003 Dr. Shafay Shamail.
CPMGT 300 Week 3 Learning Team Planning Process Groups and Developing the Scope Check this A+ tutorial guideline at
While and Do-while action action while ( ) { } do { } while ( );
CS 286 Computer Organization and Architecture
Chapter 8 – Software Testing
Setting up your DEV C++.
Computer Organization
When I want to execute the subroutine I just give the command Write()
Team A.W.E.S.O.M.-O 4000 February 20, 2007.
Program Design Introduction to Computer Programming By:
Douglas Lacy & Daniel LeCheminant CS 252 December 10, 2003
المدخل إلى تكنولوجيا التعليم في ضوء الاتجاهات الحديثة
Test Automation CS 4501 / 6501 Software Testing
Computer Architecture and Assembly Language CS 233 Lecture 1
Learning Intention I will learn about programming using selection (making choices) with one condition.
Understand the interaction between computer hardware and software
CS 286 Computer Organization and Architecture
COMP108 Algorithmic Foundations Searching
CS-1020 and Exception Handling
COMP108 Algorithmic Foundations Searching
Computer Architecture and Assembly Language CS 233 Lecture 1
Programming language translators
 Is a machine that is able to take information (input), do some work on (process), and to make new information (output) COMPUTER.
Types of Errors And Error Analysis.
Presentation transcript:

CS252 Projects 2 nd Week Jaein Jeong Johnathon Jamison

Assumptions about our system May have transient errors Check possible errors with given verification code Check verification code in chunks rather than for each instruction To be run on SimpleScalar

Models to compare with Standard system Doesn ’ t have transient errors Assumed to have 100% performance A system that executes each instruction twice and detects transient errors Assumed to have a little more than 50% performance

Measurements of system Inputs Rate of Errors Size of Epics Varying Programs Others(?) # of Components Code sizes Outputs Performance False Negative prob. False Positive prob.

Steps of comparison Source code (Possibly with VC) Standard gccour gcc Standard codeOur code + VC Normal CPUOur CPU Code Size Comparison Performance False negative False positive Comparison