ISO 9126: Software Quality Internal Quality: Maintainability

Slides:



Advertisements
Similar presentations
Lesson 8 CPUs Used in Personal Computers.
Advertisements

Instruction Level Parallelism and Superscalar Processors
HISTORY OF MICROPROCESSORS Gursharan Singh Tatla 1.
Goals for Today Today we want to learn about the microprocessor, the key component, the brain, of a computer We’ll learn about the function of a microprocessor.
More Intel machine language and one more look at other architectures.
Lecture 12: Machine Processing Intro to IT COSC1078 Introduction to Information Technology Lecture 12 Machine Processing James Harland
Microprocessors. Von Neumann architecture Data and instructions in single read/write memory Contents of memory addressable by location, independent of.
CSC 2400 Computer Systems I Lecture 3 Big Ideas. 2 Big Idea: Universal Computing Device All computers, given enough time and memory, are capable of computing.
CSCE101 – 4.2, 4.3 October 17, Power Supply Surge Protector –protects from power spikes which ruin hardware. Voltage Regulator – protects from insufficient.
RISC. Rational Behind RISC Few of the complex instructions were used –data movement – 45% –ALU ops – 25% –branching – 30% Cheaper memory VLSI technology.
Parallel Algorithms - Introduction Advanced Algorithms & Data Structures Lecture Theme 11 Prof. Dr. Th. Ottmann Summer Semester 2006.
3.1Introduction to CPU Central processing unit etched on silicon chip called microprocessor Contain tens of millions of tiny transistors Key components:
CPU Performance Assessment As-Bahiya Abu-Samra *Moore’s Law *Clock Speed *Instruction Execution Rate - MIPS - MFLOPS *SPEC Speed Metric *Amdahl’s.
Basic Microcomputer Design. Inside the CPU Registers – storage locations Control Unit (CU) – coordinates the sequencing of steps involved in executing.
1 More on Computer Components Computer switches Binary number system Inside the CPU Cache memory Types of RAM Computer buses Creating faster CPUs NEXT.
Lecture#14. Last Lecture Summary Memory Address, size What memory stores OS, Application programs, Data, Instructions Types of Memory Non Volatile and.
Technology in Focus: Under the Hood
Computer Performance Computer Engineering Department.
Parallel and Distributed Systems Instructor: Xin Yuan Department of Computer Science Florida State University.
Introduction Computer Organization and Architecture: Lesson 1.
Multi-core Programming Introduction Topics. Topics General Ideas Moore’s Law Amdahl's Law Processes and Threads Concurrency vs. Parallelism.
Led the WWII research group that broke the code for the Enigma machine proposed a simple abstract universal machine model for defining computability devised.
Lecture 1: Performance EEN 312: Processors: Hardware, Software, and Interfacing Department of Electrical and Computer Engineering Spring 2013, Dr. Rozier.
Chapter 2 Parallel Architecture. Moore’s Law The number of transistors on a chip doubles every years. – Has been valid for over 40 years – Can’t.
Outline  Over view  Design  Performance  Advantages and disadvantages  Examples  Conclusion  Bibliography.
Parallel Processing Sharing the load. Inside a Processor Chip in Package Circuits Primarily Crystalline Silicon 1 mm – 25 mm on a side 100 million to.
Computer Organization & Assembly Language © by DR. M. Amer.
Multi-Core Development Kyle Anderson. Overview History Pollack’s Law Moore’s Law CPU GPU OpenCL CUDA Parallelism.
Ted Pedersen – CS 3011 – Chapter 10 1 A brief history of computer architectures CISC – complex instruction set computing –Intel x86, VAX –Evolved from.
CS162 Week 5 Kyle Dewey. Overview Announcements Reactive Imperative Programming Parallelism Software transactional memory.
Shashwat Shriparv InfinitySoft.
Chapter Overview Microprocessors Replacing and Upgrading a CPU.
Presentation 31 – Multicore, Multiprocessing, Multithreading, and Multitasking. When discussing modern PCs, the term “Multi” is thrown around a lot as.
MULTICORE PROCESSOR TECHNOLOGY.  Introduction  history  Why multi-core ?  What do you mean by multicore?  Multi core architecture  Comparison of.
Performance Tuning John Black CS 425 UNR, Fall 2000.
Von Neumann Computers Article Authors: Rudolf Eigenman & David Lilja
Introduction Why Study Algorithms? Design and Analysis of Algorithms I.
Capability of processor determine the capability of the computer system. Therefore, processor is the key element or heart of a computer system. Other.
M211 – Central Processing Unit
Computer Operation. Binary Codes CPU operates in binary codes Representation of values in binary codes Instructions to CPU in binary codes Addresses in.
Hardware Trends CSE451 Andrew Whitaker. Motivation Hardware moves quickly OS code tends to stick around for a while “System building” extends way beyond.
Lecture # 10 Processors Microcomputer Processors.
Intel’s 3D Transistor BENJAMIN BAKER. Where we are headed  What is a transistor?  What it is and what does it do?  Moore’s Law  Who is Moore and what.
Computer Organization IS F242. Course Objective It aims at understanding and appreciating the computing system’s functional components, their characteristics,
1 A simple parallel algorithm Adding n numbers in parallel.
History of Computers and Performance David Monismith Jan. 14, 2015 Based on notes from Dr. Bill Siever and from the Patterson and Hennessy Text.
MAHARANA PRATAP COLLEGE OF TECHNOLOGY SEMINAR ON- COMPUTER PROCESSOR SUBJECT CODE: CS-307 Branch-CSE Sem- 3 rd SUBMITTED TO SUBMITTED BY.
1 Week 1: The History of Computing (PART II) READING: Chapter 1.
Performance. Moore's Law Moore's Law Related Curves.
William Stallings Computer Organization and Architecture 6th Edition
ECE 3055: Computer Architecture and Operating Systems
مقدمة في علوم الحاسب Lecture 5
Chapter 4 Processor Technology and Architecture
Multi-core processors
Assembly Language for Intel-Based Computers, 5th Edition
Hardware September 19, 2017.
Multi-core processors
Architecture & Organization 1
Unit 2 Computer Systems HND in Computing and Systems Development
Architecture & Organization 1
BIC 10503: COMPUTER ARCHITECTURE
Technology Forecasting: Moore’s Law
Chapter 1 Introduction.
INTRODUCTION TO COMPUTER ARCHITECTURE
Computer Evolution and Performance
COMS 361 Computer Organization
Lecture 20 Parallel Programming CSE /27/2019.
Intel CPU for Desktop PC: Past, Present, Future
Course Code 114 Introduction to Computer Science
Presentation transcript:

ISO 9126: Software Quality Internal Quality: Maintainability Analyzability, Testability, Stability, Changeability External Quality Functionality Usability Reliability Portability Efficiency

Moore's Law Noted that the number of transistors per unit area had doubled every year from 1958 to 1965 Expected the trend to last “for at least ten years” Gordon Moore Co-founder of Intel Often misquoted as “the speed will double every 18 months”

Intel Processor Speeds over Time 10 GHz 1 GHz 100 MHz 10 MHz 1 MHz Pentium 4 Pentium III Pentium II Pentium 80486 80386 80286 8086 8080 8008 4004 1970 1980 1990 2000 2010

What’s the State-of-the-Art? Fastest commercially available CPU: ~4GHz Fastest experimental CPU: 500Ghz Need to cool it down to 4°K, though Fastest theoretical transistor: 1THz

The End of Moore’s Law? Production limitations Physical limitations Bottleneck issues Market issues

pre-1940s Mechanical 1940s Electromagnetic Relays 1950s Vacuum Tubes 1960s Transistors since 1970s Integrated Circuits The Future Quantum Computers?

The Current Solution: Parallelism

Process-Level Parallelism Early computers (1950s and 1960s) could only run one program at a time When it finished, it would run the next one Multi-programming operating systems (1970s) made it appear as if multiple programs were running simultaneously 10

Instruction-Level Parallelism Rather than wait for an instruction to finish, start the next one as soon as possible Very common in RISC architectures Pipelining: Fetch/decode one instruction while executing another 11

Thread-Level Parallelism Modern programming languages support threads, which allow a program to do more than one thing at a time Examples Reading data from one source while writing to another Performing two parts of a calculation simultaneously Handling interaction with multiple users at the same time 12

Today Concurrency (threads) in C Does concurrency really make your code faster? Race conditions and synchronization Short break; head to Moore 207 Lab assignment