Advanced Computer Architecture - Baylor University

1y ago
11 Views
2 Downloads
801.89 KB
44 Pages
Last View : 11d ago
Last Download : 3m ago
Upload by : Ellie Forte
Transcription

Advanced Computer ArchitectureThe Architecture ofParallel Computers

Computer SystemsNo ComponentCan be TreatedIn IsolationFrom the chitecture

Hardware Issues Number and Type of ProcessorsProcessor ControlMemory HierarchyI/O devices and PeripheralsOperating System SupportApplications Software Compatibility

Operating System Issues Allocating and Managing Resources Access to Hardware Features– Multi-Processing– Multi-Threading I/O Management Access to Peripherals Efficiency

Applications Issues Compiler/Linker SupportProgrammabilityOS/Hardware Feature AvailabilityCompatibilityParallel Compilers– Preprocessor– Precompiler– Parallelizing Compiler

Architecture Evolution Scalar ArchitecturePrefetch Fetch/Execute OverlapMultiple Functional UnitsPipeliningVector ProcessorsLock-Step ProcessorsMulti-Processor

Flynn’s Classification Consider Instruction Streams and DataStreams Separately. SISD - Single Instruction, Single DataStream SIMD - Single Instruction, Multiple DataStreams MIMD - Multiple Instruction, Multiple DataStreams. MISD - (rare) Multiple Instruction, SingleData Stream

SISD Conventional Computers.Pipelined SystemsMultiple-Functional Unit SystemsPipelined Vector ProcessorsIncludes most computers encountered ineveryday life

SIMD Multiple Processors Execute a SingleProgram Each Processor operates on its own data Vector Processors Array Processors PRAM Theoretical Model

MIMD Multiple Processors cooperate on a singletask Each Processor runs a different program Each Processor operates on different data Many Commercial Examples Exist

MISD A Single Data Stream passes throughmultiple processors Different operations are triggered ondifferent processors Systolic Arrays Wave-Front Arrays

Programming Issues Parallel Computers are Difficult to Program Automatic Parallelization Techniques areonly Partially Successful Programming languages are few, not wellsupported, and difficult to use. Parallel Algorithms are difficult to design.

Performance IssuesClock Rate / Cycle Time τCycles Per Instruction (Average) CPIInstruction Count IcTime, T Ic CPI τp Processor Cycles, m Memory Cycles,k Memory/Processor cycle ratio T Ic (p m k) τ

Performance Issues II Ic & p affected by processor design andcompiler technology. m affected mainly by compiler technologyτ affected by processor design k affected by memory hierarchy structureand design

Other Measures MIPS rate - Millions of instructions persecond Clock Rate for similar processors MFLOPS rate - Millions of floating pointoperations per second. These measures are not neccessarily directlycomparable between different types ofprocessors.

Parallelizing Code Implicitly– Write Sequential Algorithms– Use a Parallelizing Compiler– Rely on compiler to find parallelism Explicitly– Design Parallel Algorithms– Write in a Parallel Language– Rely on Human to find Parallelism

Multi-Processors Multi-Processors generally share memory,while multi-computers do not.– Uniform memory model– Non-Uniform Memory Model– Cache-Only MIMD Machines

Multi-Computers Independent Computers that Don’t ShareMemory. Connected by High-Speed CommunicationNetwork More tightly coupled than a collection ofindependent computers Cooperate on a single problem

Vector Computers Independent Vector HardwareMay be an attached processorHas both scalar and vector instructionsVector instructions operate in highlypipelined mode Can be Memory-to-Memory or Register-toRegister

SIMD Computers One Control Processor Several Processing Elements All Processing Elements execute the sameinstruction at the same time Interconnection network between PEsdetermines memory access and PEinteraction

The PRAM Model SIMD Style ProgrammingUniform Global MemoryLocal Memory in Each PEMemory Conflict Resolution––––CRCW - Common Read, Common WriteCREW - Common Read, Exclusive WriteEREW - Exclusive Read, Exclusive WriteERCW - (rare) Exclusive Read, Common Write

The VLSI Model Implement Algorithm as a mostlycombinational circuit Determine the area required forimplementation Determine the depth of the circuit

Advanced Computer ArchitectureThe Architecture ofParallel Computers

Computer SystemsNo ComponentCan be TreatedIn IsolationFrom the chitecture

Hardware Issues Number and Type of ProcessorsProcessor ControlMemory HierarchyI/O devices and PeripheralsOperating System SupportApplications Software Compatibility

Operating System Issues Allocating and Managing Resources Access to Hardware Features– Multi-Processing– Multi-Threading I/O Management Access to Peripherals Efficiency

Applications Issues Compiler/Linker SupportProgrammabilityOS/Hardware Feature AvailabilityCompatibilityParallel Compilers– Preprocessor– Precompiler– Parallelizing Compiler

Architecture Evolution Scalar ArchitecturePrefetch Fetch/Execute OverlapMultiple Functional UnitsPipeliningVector ProcessorsLock-Step ProcessorsMulti-Processor

Flynn’s Classification Consider Instruction Streams and DataStreams Separately. SISD - Single Instruction, Single DataStream SIMD - Single Instruction, Multiple DataStreams MIMD - Multiple Instruction, Multiple DataStreams. MISD - (rare) Multiple Instruction, SingleData Stream

SISD Conventional Computers.Pipelined SystemsMultiple-Functional Unit SystemsPipelined Vector ProcessorsIncludes most computers encountered ineveryday life

SIMD Multiple Processors Execute a SingleProgram Each Processor operates on its own data Vector Processors Array Processors PRAM Theoretical Model

MIMD Multiple Processors cooperate on a singletask Each Processor runs a different program Each Processor operates on different data Many Commercial Examples Exist

MISD A Single Data Stream passes throughmultiple processors Different operations are triggered ondifferent processors Systolic Arrays Wave-Front Arrays

Programming Issues Parallel Computers are Difficult to Program Automatic Parallelization Techniques areonly Partially Successful Programming languages are few, not wellsupported, and difficult to use. Parallel Algorithms are difficult to design.

Performance IssuesClock Rate / Cycle Time τCycles Per Instruction (Average) CPIInstruction Count IcTime, T Ic CPI τp Processor Cycles, m Memory Cycles,k Memory/Processor cycle ratio T Ic (p m k) τ

Performance Issues II Ic & p affected by processor design andcompiler technology. m affected mainly by compiler technologyτ affected by processor design k affected by memory hierarchy structureand design

Other Measures MIPS rate - Millions of instructions persecond Clock Rate for similar processors MFLOPS rate - Millions of floating pointoperations per second. These measures are not neccessarily directlycomparable between different types ofprocessors.

Parallelizing Code Implicitly– Write Sequential Algorithms– Use a Parallelizing Compiler– Rely on compiler to find parallelism Explicitly– Design Parallel Algorithms– Write in a Parallel Language– Rely on Human to find Parallelism

Multi-Processors Multi-Processors generally share memory,while multi-computers do not.– Uniform memory model– Non-Uniform Memory Model– Cache-Only MIMD Machines

Multi-Computers Independent Computers that Don’t ShareMemory. Connected by High-Speed CommunicationNetwork More tightly coupled than a collection ofindependent computers Cooperate on a single problem

Vector ComputersIndependent Vector HardwareMay be an attached processorHas both scalar and vector instructionsVector instructions operate in highlypipelined mode Can be Memory-to-Memory or Register-toRegister

SIMD Computers One Control Processor Several Processing Elements All Processing Elements execute the sameinstruction at the same time Interconnection network between PEsdetermines memory access and PEinteraction

The PRAM Model SIMD Style ProgrammingUniform Global MemoryLocal Memory in Each PEMemory Conflict Resolution––––CRCW - Common Read, Common WriteCREW - Common Read, Exclusive WriteEREW - Exclusive Read, Exclusive WriteERCW - (rare) Exclusive Read, Common Write

The VLSI Model Implement Algorithm as a mostlycombinational circuit Determine the area required forimplementation Determine the depth of the circuit

Advanced Computer Architecture The Architecture of Parallel Computers. Computer Systems Hardware Architecture Operating System Application No Component Software Can be Treated In Isolation From the Others. Hardware Issues Number and Type of Processors Processor Control Memory Hierarchy

Related Documents:

Baylor Scott & White Heart & Vascular Hospital - Dallas Baylor Scott & White Medical Center - Uptown Baylor University Medical Center North Central Surgical Center Baylor Scott & White Medical Center - Sunnyvale Approved by: Baylor Scott & White Health - North Texas Operating, Policy and Procedure Board on June 25, 2019

What is Computer Architecture? “Computer Architecture is the science and art of selecting and interconnecting hardware components to create computers that meet functional, performance and cost goals.” - WWW Computer Architecture Page An analogy to architecture of File Size: 1MBPage Count: 12Explore further(PDF) Lecture Notes on Computer Architecturewww.researchgate.netComputer Architecture - an overview ScienceDirect Topicswww.sciencedirect.comWhat is Computer Architecture? - Definition from Techopediawww.techopedia.com1. An Introduction to Computer Architecture - Designing .www.oreilly.comWhat is Computer Architecture? - University of Washingtoncourses.cs.washington.eduRecommended to you b

Doctor of Nursing Practice Program Orthotics & Prosthetics Program (Nurse Anesthesia) Baylor College of Medicine . Baylor College of Medicine One Baylor Plaza, MS BCM115 . One Baylor Plaza, MS BCM115 DeBakey Bldg., Suite M108 . Debakey Building, Suite M108 Houston, Texas 77030 (713) 798-8650 (713) 798-3098

GAYNOR YANCEY Office Address: Home Address: Baylor University School of Social Work 907 Morning Sun Lane . Baylor University’s Board of Regents *Baylor University Faculty Ombudsperson, 2014-2017 *Designated as Master Teacher by Baylor University, 2016 *Selected as an Outstanding Mentor by the Council of Social Work Education, 2016 *Selected .

american PuBlic Wave III Baylor Religion Survey September 2011 A Research Project funded by Baylor University with support from the National Science Foundation and the John M. Templeton Foundation Conducted by the Department of Sociology, College of Arts and Sciences, and Hankamer School of Business, Baylor University Research Group

2-3 // About Baylor 4-5 // Majors & Minors 6 // Engagement 7 // Faith & Learning 8-9 // A Campus to Call Home 10-11 // Traditions 12-13 // Athletics 14-15 // Applying for Admission 16 // Tips for Transfers 17 // Financial Aid 18-19 // Backing Your Success 20 // Explore Waco 21 // Visit Baylor IN THESE PAGES THE BEST & THE BRIGHTEST SHINE AT BAYLOR. On this campus, academic excellence is elevated,

BAYLOR FIRSTS i The original transplant pioneer, Dr. Thomas Starzl was the inspiration behind Baylor's transplantation program. Dr. Starzl performed the first human liver transplants. In 1983, he made a presentation to Baylor on his transplant team's successes at the University of Pittsburgh. He encouraged Baylor to develop a transplant center,

New Insights to the Depth and Complexity of Religion in the US Selected Findings from The Baylor Religion Survey September 2006 A Research Project funded by the John M. Templeton Foundation Conducted by The Baylor Institute for Studies of Religion and Department of Sociology, Baylor University Research Group Christopher Bader Kevin Dougherty .