DOCSLIB.ORG

Instead of Motivation Three Decades of Runtime Attacks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Instead of Motivation Three Decades of Runtime Attacks instead of Motivation Three Decades of Runtime Attacks return-into- Return-oriented Morris Worm libc programming Continuing Arms 1988 Solar Designer Shacham Race 1997 CCS 2007 … Borrowed Code Code Chunk Injection Exploitation AlephOne Krahmer 1996 2005 Recent Attacks Attacks on Tor Browser [2013] Stagefright [Drake, BlackHat 2015] FBI Admits It Controlled Tor Servers These issues in Stagefright code critically Behind Mass Malware Attack. expose 95% of Android devices, an estimated 950 million devices MMS Adversary Cisco Router Exploit [2016] The Million Dollar Dissident [2016] Million CISCO ASA Firewalls potentially Government targeted human rights vulnerable to attacks defender with a chain of zero-day exploits to infect his iPhone with spyware. Adversary Relevance and Impact High Impact of Attacks • Web browsers repeatedly exploited in pwn2own contests • Zero-day issues exploited in Stuxnet/Duqu [Microsoft, BH 2012] • iOS jailbreak Industry Efforts on Defenses • Microsoft EMETCan includes either a ROP be detection bypassed, engine or may not • Microsoft Controlbe Flow sufficiently Guard (CFG) effectivein Windows 10 • Google‘s compiler extension VTV (Virtual Table Verification) [Davi et al, Blackhat2014], [Liebchen et al CCS2015], • Intel’s Hardware[Schuster, Extension et CET al S&P2015] (Control-flow Enforcement Technology) Hot Topic of Research • A large body of recent literature on attacks and defenses Runtime Attacks & Defenses: Continuing Arms Race Defenses Still seeking practicalAttacks and CFI, ROPGuard, BinCFI, ROPecker, secure solutions kBouncer, CCFIR, vTint, vfGuard, SafeDispatch, MoCFI, ROP wo Returns, RockJIT, TVip, Out-of-Control, StackArmor, CPI/CPS, Stitching the Oxymoron, XnR, Gadgets, SROP, JIT- Isomeron, ROP, BlindROP, O-CFI, COOP, StackDefiler, Readactor, "Missing the HAFIX, point(er)" ... The whole story ….. Runtime Attacks Code-Injection Attack Code-Reuse Attack Basic Blocks (BBL) A Entry: instruction target of a branch A (e.g., first instruction of a function) Exit: Any branch B (e.g., indirect or direct jump/call, return) B corrupt code C D pointer C D E F E F X DEPX inject malicious corrupt code pointer code Adversary Data flow Data Execution Prevention Program flow Return-oriented Programing (ROP): Prominent Code-Reuse Attack ROP shown to be Turing-complete ROP: Basic Ideas/Steps Use small instruction sequences instead of whole functions Instruction sequences have length 2 to 5 All sequences end with a return instruction, or an indirect jump/call Instruction sequences chained together as gadgets Gadget perform particular task, e.g., load, store, xor, or branch Attacks launched by combining gadgets Generalization of return-to-libc Threat Model: Code-reuse Attacks Application RX ? Code 1 Writable Executable Code? Code? ? 2 ⊕ ? ? Opaque Memory Layout RW Data ? Data? Data ? 3 Disclose readable Memory RX ? ? Code? Data? 4 Manipulate writable Memory RW? 5 Computing Engine Data? Main Defenses against Code Reuse 1. Code Randomization 2. Control-Flow Integrity (CFI) Randomization vs. CFI Randomization Control-flow Integrity Low Performance Overhead Formal Security (Explicit Control Flow Scales well to complex Checks) Software (OS, browser) Information Disclosure Tradeoff: hard to prevent Performance & Security Challenging to integrate High entropy required in complex software, coverage EPISODE I Code Randomization Make gadgets locations unpredictable Fine-Grained ASLR Application Run 1 Application Run 2 Library (e.g., libc) Library (e.g., libc) Instruction RET Instruction Sequence 3 RET Sequence 1 Instruction RET Instruction Sequence 1 RET Sequence 2 Instruction RET Instruction Sequence 2 RET Sequence 3 Instruction reordering/substitution within a BBL ORP [Pappas et al., IEEE S&P 2012] Randomizing each instruction‘s location: ILR [Hiser et al., IEEE S&P 2012] Permutation of BBLs: STIR [Wartell et al., CCS 2012] & XIFER [with Davi et al., AsiaCCS 2013] Randomization: Memory Leakage Problem Direct memory disclosure • Pointer leakage on code pages • e.g., direct call and jump instruction Indirect memory disclosure • Pointer leakage on data pages such as stack or heap • e.g., return addresses, function pointers, pointers in vTables JIT-ROP: Bypassing Randomization via Direct Memory Disclosure Just-In-Time Code Reuse: On the Effectiveness of Fine-Grained Address Space Layout Randomization IEEE Security and Privacy 2013, and Blackhat 2013 Kevin Z. Snow, Lucas Davi, Alexandra Dmitrienko, Christopher Liebchen, Fabian Monrose, Ahmad-Reza Sadeghi Just-In-Time ROP: Direct Memory Disclosure 1 Undermines fine-grained ASLR Shows memory disclosures are far more 2 damaging than believed 3 Can be instantiated with real-world exploit Readactor: Towards Resilience to Memory Disclosure Readactor: Practical Code Randomization Resilient to Memory Disclosure IEEE Security and Privacy 2015 Stephen Crane, Christopher Liebchen, Andrei Homescu, Lucas Davi, Per Larsen, Ahmad-Reza Sadeghi, Stefan Brunthaler, Michael Franz CodeCode Randomization: Randomization: AttackAttack & & Defense Defense Techniques Techniques Attack Timeline Static Attack RX Application Morris Worm / (Fine-grained) Return to libc [Solar Function_A Randomization Designer Bugtraq’97] ?Execute? - Function_B? Just-In-Time ROP [Snow et ? al. IEEE S&P’13] Direct code <instructions>only <instructions>Trampoline? Target disclosure call Function_A Isomeron (Attack) [Davi et poppopMemory ebx?ebx ? Execute-only pop ebx ? ?? al. NDSS’15] poppop? ecx?ecx ? Memory (XoM) ret?ret ? TrampolineXoM Trampoline Indirect code RW Reuse Attacks disclosure Pointers Register Code-pointer Return Address randomization hiding Code Randomization: Attack & Defense Techniques RX Application Attack Timeline JIT Code JIT Code Attacks Counterfeit Object-oriented Same Protection Programming (COOP) XoM? ? ? as for AOT Code ? ? [Schuster et al. IEEE S&P’15] TrampolineXoM Crash-Resistant Oriented Brute-force X-Virtual Table Programming [Gawlik et al. Attacks on vFunc2 Tramp NDSS’16] Entropy Booby Traps BoobyXoM Trap Terminate Process vFunc1 Tramp RW Pointers Function Pointer Trampoline Function Virtual Table ? Reuse for Reuse Attacks Ptrvirt.X Function1-virt table Attack Surface Single Function Trampolines & virt. Function2 Large enough? Pointers Booby Traps EPISODE II Control-Flow Integrity (CFI) Restricting indirect targets to a pre-defined control-flow graph Original CFI Label Checking [Abadi et al., CCS 2005 & TISSEC 2009] BBL A label_A ENTRY asm_ins, … EXIT ATwo Questions CFI CHECK: 1. Benign and correct execution?EXIT(A) -> label_B ? C 2. BRuntimeBBL enforcement? B label_B ENTRY asm_ins, … EXIT CFI: CFG Analysis and Coverage Problem CFG Analysis • Conservative “points-to” analysis • e.g., over-approximate to avoid breaking the program CFG Coverage • Precision of CFG analysis determines security of CFI policy • e.g., more precise more secure Which Instructions to Protect? • Purpose: Return to calling function Returns • CFI Relevance: Return address located on stack Indirect • Purpose: switch tables, dispatch to library functions • CFI Relevance: Target address taken from either Jumps processor register or memory Indirect • Purpose: call through function pointer, virtual table calls • CFI Relevance: Target address taken from either processor Calls register or memory Label Granularity: Trade-Offs (1/2) Many CFI checks are required if unique labels are assigned per node CFI Check Exit(B) == Label_1 [Label_3, Label_4, Label_5] A Basic Block B Label_2 Label Label_3 C D Label_4 E F Label_5 Label_6 Label Granularity: Trade-Offs (2/2) Optimization step: Merge labels to allow single CFI check However, this allows for unintended control-flow paths CFI Check Exit(B) == Label_3 A Label_1 Basic Block B Label_2 Label Label_3 C D Label_3Label_4 Exit(C) == Label_3 E F Label_5Label_3 Label_6 Label Problem for Returns Static CFI label checking Shadow stack allows for leads to coarse-grained fine-grained return protection for returns address protection but incurs higher overhead Forward- CALL RET Edge CFI Backup State Check Label_1 Label_2 Shadow Stack A‘ A B B‘ Backup storage for CALL return addresses R Return Addr … … RET Backward -Edge CFI Exit(R) == [Label_1, Label_2] Return Addr A’ Forward- vs. Backward-Edge Some CFI schemes consider only forward-edge CFI Google’s VTV and IFCC [Tice et al., USENIX Sec 2015] SAFEDISPATCH [Jang et al., NDSS 2014] And many more: TVIP, VTint, vfguard Assumption: Backward-edge CFI through stack protection Problems of stack protections: Stack Canaries: memory disclosure of canary ASLR (base address randomization of stack): memory disclosure of base address Variable reordering (memory disclosure) Losing Control: On the Effectiveness of Control-Flow Integrity under Stack Attacks ACM CCS 2015 Christopher Liebchen, Marco Negro, Per Larsen, Lucas Davi, Ahmad-Reza Sadeghi, Stephen Crane, Mohaned Qunaibit, Michael Franz, Mauro Conti StackDefiler • Goal: • Bypass fine-grained Control-Flow Integrity • IFCC & VTV (CFI implementations by Google for GCC and LLVM) • Approach: • Due to optimization by compiler critical CFI pointer is spilled on the stack • StackDefiler discloses the stack address and overwrites the spilled CFI pointer • At restoring of spilled registers a malicious CFI pointer is used for future CFI checks • No stack-based vulnerability needed Bypassing (Coarse-grained) CFI COOP IEEE S&P 2015 USENIX Security 2014 Felix Schuster, Thomas Tendyck, Lucas Davi, Daniel Lehmann, Christopher Liebchen, Lucas Davi, Ahmad-Reza Sadeghi, Fabian Monrose Ahmad-Reza
Load more

Recommended publications
  • Computer Organization and Architecture Designing for Performance Ninth Edition
    COMPUTER ORGANIZATION AND ARCHITECTURE DESIGNING FOR PERFORMANCE NINTH EDITION William Stallings Boston Columbus Indianapolis New York San Francisco Upper Saddle River Amsterdam Cape Town Dubai London Madrid Milan Munich Paris Montréal Toronto Delhi Mexico City São Paulo Sydney Hong Kong Seoul Singapore Taipei Tokyo Editorial Director: Marcia Horton Designer: Bruce Kenselaar Executive Editor: Tracy Dunkelberger Manager, Visual Research: Karen Sanatar Associate Editor: Carole Snyder Manager, Rights and Permissions: Mike Joyce Director of Marketing: Patrice Jones Text Permission Coordinator: Jen Roach Marketing Manager: Yez Alayan Cover Art: Charles Bowman/Robert Harding Marketing Coordinator: Kathryn Ferranti Lead Media Project Manager: Daniel Sandin Marketing Assistant: Emma Snider Full-Service Project Management: Shiny Rajesh/ Director of Production: Vince O’Brien Integra Software Services Pvt. Ltd. Managing Editor: Jeff Holcomb Composition: Integra Software Services Pvt. Ltd. Production Project Manager: Kayla Smith-Tarbox Printer/Binder: Edward Brothers Production Editor: Pat Brown Cover Printer: Lehigh-Phoenix Color/Hagerstown Manufacturing Buyer: Pat Brown Text Font: Times Ten-Roman Creative Director: Jayne Conte Credits: Figure 2.14: reprinted with permission from The Computer Language Company, Inc. Figure 17.10: Buyya, Rajkumar, High-Performance Cluster Computing: Architectures and Systems, Vol I, 1st edition, ©1999. Reprinted and Electronically reproduced by permission of Pearson Education, Inc. Upper Saddle River, New Jersey, Figure 17.11: Reprinted with permission from Ethernet Alliance. Credits and acknowledgments borrowed from other sources and reproduced, with permission, in this textbook appear on the appropriate page within text. Copyright © 2013, 2010, 2006 by Pearson Education, Inc., publishing as Prentice Hall. All rights reserved. Manufactured in the United States of America.
    [Show full text]
  • Introduction to the Intel® Nios® II Soft Processor
    Introduction to the Intel® Nios® II Soft Processor For Quartus® Prime 18.1 1 Introduction This tutorial presents an introduction the Intel® Nios® II processor, which is a soft processor that can be instantiated on an Intel FPGA device. It describes the basic architecture of Nios II and its instruction set. The Nios II processor and its associated memory and peripheral components are easily instantiated by using Intel’s SOPC Builder or Platform Designer tool in conjunction with the Quartus® Prime software. A full description of the Nios II processor is provided in the Nios II Processor Reference Handbook, which is available in the literature section of the Intel web site. Introductions to the SOPC Builder and Platform Designer tools are given in the tutorials Introduction to the Intel SOPC Builder and Introduction to the Intel Platform Designer Tool, respectively. Both can be found in the University Program section of the web site. Contents: • Nios II System • Overview of Nios II Processor Features • Register Structure • Accessing Memory and I/O Devices • Addressing • Instruction Set • Assembler Directives • Example Program • Exception Processing • Cache Memory • Tightly Coupled Memory Intel Corporation - FPGA University Program 1 March 2019 ® ® INTRODUCTION TO THE INTEL NIOS II SOFT PROCESSOR For Quartus® Prime 18.1 2 Background Intel’s Nios II is a soft processor, defined in a hardware description language, which can be implemented in Intel’s FPGA devices by using the Quartus Prime CAD system. This tutorial provides a basic introduction to the Nios II processor, intended for a user who wishes to implement a Nios II based system on an Intel Development and Education board.
    [Show full text]
  • Computer Organization & Architecture Eie
    COMPUTER ORGANIZATION & ARCHITECTURE EIE 411 Course Lecturer: Engr Banji Adedayo. Reg COREN. The characteristics of different computers vary considerably from category to category. Computers for data processing activities have different features than those with scientific features. Even computers configured within the same application area have variations in design. Computer architecture is the science of integrating those components to achieve a level of functionality and performance. It is logical organization or designs of the hardware that make up the computer system. The internal organization of a digital system is defined by the sequence of micro operations it performs on the data stored in its registers. The internal structure of a MICRO-PROCESSOR is called its architecture and includes the number lay out and functionality of registers, memory cell, decoders, controllers and clocks. HISTORY OF COMPUTER HARDWARE The first use of the word ‘Computer’ was recorded in 1613, referring to a person who carried out calculation or computation. A brief History: Computer as we all know 2day had its beginning with 19th century English Mathematics Professor named Chales Babage. He designed the analytical engine and it was this design that the basic frame work of the computer of today are based on. 1st Generation 1937-1946 The first electronic digital computer was built by Dr John V. Atanasoff & Berry Cliford (ABC). In 1943 an electronic computer named colossus was built for military. 1946 – The first general purpose digital computer- the Electronic Numerical Integrator and computer (ENIAC) was built. This computer weighed 30 tons and had 18,000 vacuum tubes which were used for processing.
    [Show full text]
  • A Modular Soft Processor Core in VHDL
    A Modular Soft Processor Core in VHDL Jack Whitham 2002-2003 This is a Third Year project submitted for the degree of MEng in the Department of Computer Science at the University of York. The project will attempt to demonstrate that a modular soft processor core can be designed and implemented on an FPGA, and that the core can be optimised to run a particular embedded application using a minimal amount of FPGA space. The word count of this project (as counted by the Unix wc command after detex was run on the LaTeX source) is 33647 words. This includes all text in the main report and Appendices A, B and C. Excluding source code, the project is 70 pages in length. i Contents I. Introduction 1 1. Background and Literature 1 1.1. Soft Processor Cores . 1 1.2. A Field Programmable Gate Array . 1 1.3. VHSIC Hardware Definition Language (VHDL) . 2 1.4. The Motorola 68020 . 2 II. High-level Project Decisions 3 2. Should the design be based on an existing one? 3 3. Which processor should the soft core be based upon? 3 4. Which processor should be chosen? 3 5. Restating the aims of the project in terms of the chosen processor 4 III. Modular Processor Design Decisions 4 6. Processor Design 4 6.1. Alternatives to a complete processor implementation . 4 6.2. A real processor . 5 6.3. Instruction Decoder and Control Logic . 5 6.4. Arithmetic and Logic Unit (ALU) . 7 6.5. Register File . 7 6.6. Links between Components .
    [Show full text]
  • Assignment Solutions
    Week 1: Assignment Solutions 1. Which of the following statements are true? a. The ENIAC computer was built using mechanical relays. b. Harvard Mark1 computer was built using mechanical relays. c. PASCALINE computer could multiply and divide numbers by repeated addition and subtraction. d. Charles Babbage built his automatic computing engine in 19th century. Solution: ((b) and (c)) ENIAC was built using vacuum tubes. Charles Babbage designed his automatic computing engine but could not built it. 2. Which of the following statements are true for Moore’s law? a. Moore’s law predicts that power dissipation will double every 18 months. b. Moore’s law predicts that the number of transistors per chip will double every 18 months. c. Moore’s law predicts that the speed of VLSI circuits will double every 18 months. d. None of the above. Solution: (b) Moore’s law only predicts that number of transistors per chip will double every 18 months. 3. Which of the following generates the necessary signals required to execute an instruction in a computer? a. Arithmetic and Logic Unit b. Memory Unit c. Control Unit d. Input/Output Unit Solution: (c) Control unit acts as the nerve center of a computer and generates the necessary control signals required to execute an instruction. 4. An instruction ADD R1, A is stored at memory location 4004H. R1 is a processor register and A is a memory location with address 400CH. Each instruction is 32-bit long. What will be the values of PC, IR and MAR during execution of the instruction? a.
    [Show full text]
  • Register Are Used to Quickly Accept, Store, and Transfer Data And
    Register are used to quickly accept, store, and transfer data and instructions that are being used immediately by the CPU, there are various types of Registers those are used for various purpose. Among of the some Mostly used Registers named as AC or Accumulator, Data Register or DR, the AR or Address Register, program counter (PC), Memory Data Register (MDR) ,Index register,Memory Buffer Register. These Registers are used for performing the various Operations. While we are working on the System then these Registers are used by the CPU for Performing the Operations. When We Gives Some Input to the System then the Input will be Stored into the Registers and When the System will gives us the Results after Processing then the Result will also be from the Registers. So that they are used by the CPU for Processing the Data which is given by the User. Registers Perform:- 1) Fetch: The Fetch Operation is used for taking the instructions those are given by the user and the Instructions those are stored into the Main Memory will be fetch by using Registers. 2) Decode: The Decode Operation is used for interpreting the Instructions means the Instructions are decoded means the CPU will find out which Operation is to be performed on the Instructions. 3) Execute: The Execute Operation is performed by the CPU. And Results those are produced by the CPU are then Stored into the Memory and after that they are displayed on the user Screen. Types of Registers are as Followings 1. MAR stand for Memory Address Register This register holds the memory addresses of data and instructions.
    [Show full text]
  • IAR C/C++ Compiler Reference Guide for V850
    IAR Embedded Workbench® IAR C/C++ Compiler Reference Guide for the Renesas V850 Microcontroller Family CV850-9 COPYRIGHT NOTICE © 1998–2013 IAR Systems AB. No part of this document may be reproduced without the prior written consent of IAR Systems AB. The software described in this document is furnished under a license and may only be used or copied in accordance with the terms of such a license. DISCLAIMER The information in this document is subject to change without notice and does not represent a commitment on any part of IAR Systems. While the information contained herein is assumed to be accurate, IAR Systems assumes no responsibility for any errors or omissions. In no event shall IAR Systems, its employees, its contractors, or the authors of this document be liable for special, direct, indirect, or consequential damage, losses, costs, charges, claims, demands, claim for lost profits, fees, or expenses of any nature or kind. TRADEMARKS IAR Systems, IAR Embedded Workbench, C-SPY, visualSTATE, The Code to Success, IAR KickStart Kit, I-jet, I-scope, IAR and the logotype of IAR Systems are trademarks or registered trademarks owned by IAR Systems AB. Microsoft and Windows are registered trademarks of Microsoft Corporation. Renesas is a registered trademark of Renesas Electronics Corporation. V850 is a trademark of Renesas Electronics Corporation. Adobe and Acrobat Reader are registered trademarks of Adobe Systems Incorporated. All other product names are trademarks or registered trademarks of their respective owners. EDITION NOTICE Ninth edition: May 2013 Part number: CV850-9 This guide applies to version 4.x of IAR Embedded Workbench® for the Renesas V850 microcontroller family.
    [Show full text]
  • Computer Organization and Architecture Structure
    COMPUTER ORGANIZATION AND ARCHITECTURE Computer Architecture refers to those attributes of a system that have a direct impact on the logical execution of a program. Examples: o the instruction set o the number of bits used to represent various data types o I/O mechanisms o memory addressing techniques Computer Organization refers to the operational units and their interconnections that realize the architectural specifications. Examples are things that are transparent to the programmer: o control signals o interfaces between computer and peripherals o the memory technology being used So, for example, the fact that a multiply instruction is available is a computer architecture issue. How that multiply is implemented is a computer organization issue. • Architecture is those attributes visible to the programmer o Instruction set, number of bits used for data representation, I/O mechanisms, addressing techniques. o e.g. Is there a multiply instruction? • Organization is how features are implemented o Control signals, interfaces, memory technology. o e.g. Is there a hardware multiply unit or is it done by repeated addition? • All Intel x86 family share the same basic architecture • The IBM System/370 family share the same basic architecture • This gives code compatibility o At least backwards • Organization differs between different versions STRUCTURE AND FUNCTION • Structure is the way in which components relate to each other • Function is the operation of individual components as part of the structure • All computer functions are: o Data processing: Computer must be able to process data which may take a wide variety of forms and the range of processing. o Data storage: Computer stores data either temporarily or permanently.
    [Show full text]
  • Processor-Organaization.Pdf
    Computer Architecture Faculty Of Computers And Information Technology Second Term 2019- 2020 Dr.Khaled Kh. Sharaf Computer Architecture Chapter 7 CENTRAL PROCESSING UNIT ORGANIZATION Computer Architecture OBJECTIVES • Overview • Processor Unit • Control Unit • CPU Structure and Function • Arithmetic and Logic Unit • Instruction Formats • Addressing Modes • Data Transfer and Manipulation • RISC and CISC Computer Architecture Overview The part of the computer that performs the bulk of data processing operations is called the Central Processing Unit (CPU) and is the central component of a digital computer. Its purpose is to interpret instruction cycles received from memory and perform arithmetic, logic and control operations with data stored in internal register, memory words and I/O interface units. A CPU is usually divided into two parts namely processor unit (Register Unit and Arithmetic Logic Unit) and control unit. Register Unit Control Unit Arithmetic logic Unit (ALU) Components of CPU Computer Architecture Processor Unit The processor unit consists of arithmetic unit, logic unit, a number of registers and internal buses that provides data path for transfer of information between register and arithmetic logic unit. The block diagram of processor unit is shown in figure where all registers are connected through common buses. The registers communicate each other not only for direct data transfer but also while performing various micro-operations. Here two sets of multiplexers select register which perform input data for ALU. A decoder selects destination register by enabling its load input. The function select in ALU determines the particular operation that to be performed. Processor Unit Computer Architecture Processor Unit For an example to perform the operation: R3 = R1 + R2 1.
    [Show full text]
  • Computer Architectures an Overview
    Computer Architectures An Overview PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Sat, 25 Feb 2012 22:35:32 UTC Contents Articles Microarchitecture 1 x86 7 PowerPC 23 IBM POWER 33 MIPS architecture 39 SPARC 57 ARM architecture 65 DEC Alpha 80 AlphaStation 92 AlphaServer 95 Very long instruction word 103 Instruction-level parallelism 107 Explicitly parallel instruction computing 108 References Article Sources and Contributors 111 Image Sources, Licenses and Contributors 113 Article Licenses License 114 Microarchitecture 1 Microarchitecture In computer engineering, microarchitecture (sometimes abbreviated to µarch or uarch), also called computer organization, is the way a given instruction set architecture (ISA) is implemented on a processor. A given ISA may be implemented with different microarchitectures.[1] Implementations might vary due to different goals of a given design or due to shifts in technology.[2] Computer architecture is the combination of microarchitecture and instruction set design. Relation to instruction set architecture The ISA is roughly the same as the programming model of a processor as seen by an assembly language programmer or compiler writer. The ISA includes the execution model, processor registers, address and data formats among other things. The Intel Core microarchitecture microarchitecture includes the constituent parts of the processor and how these interconnect and interoperate to implement the ISA. The microarchitecture of a machine is usually represented as (more or less detailed) diagrams that describe the interconnections of the various microarchitectural elements of the machine, which may be everything from single gates and registers, to complete arithmetic logic units (ALU)s and even larger elements.
    [Show full text]
  • Understanding the Linux Kernel, 3Rd Edition by Daniel P
    1 Understanding the Linux Kernel, 3rd Edition By Daniel P. Bovet, Marco Cesati ............................................... Publisher: O'Reilly Pub Date: November 2005 ISBN: 0-596-00565-2 Pages: 942 Table of Contents | Index In order to thoroughly understand what makes Linux tick and why it works so well on a wide variety of systems, you need to delve deep into the heart of the kernel. The kernel handles all interactions between the CPU and the external world, and determines which programs will share processor time, in what order. It manages limited memory so well that hundreds of processes can share the system efficiently, and expertly organizes data transfers so that the CPU isn't kept waiting any longer than necessary for the relatively slow disks. The third edition of Understanding the Linux Kernel takes you on a guided tour of the most significant data structures, algorithms, and programming tricks used in the kernel. Probing beyond superficial features, the authors offer valuable insights to people who want to know how things really work inside their machine. Important Intel-specific features are discussed. Relevant segments of code are dissected line by line. But the book covers more than just the functioning of the code; it explains the theoretical underpinnings of why Linux does things the way it does. This edition of the book covers Version 2.6, which has seen significant changes to nearly every kernel subsystem, particularly in the areas of memory management and block devices. The book focuses on the following topics: • Memory management, including file buffering, process swapping, and Direct memory Access (DMA) • The Virtual Filesystem layer and the Second and Third Extended Filesystems • Process creation and scheduling • Signals, interrupts, and the essential interfaces to device drivers • Timing • Synchronization within the kernel • Interprocess Communication (IPC) • Program execution Understanding the Linux Kernel will acquaint you with all the inner workings of Linux, but it's more than just an academic exercise.
    [Show full text]
  • The Central Processing Unit (CPU)
    The Central Processing Unit (CPU) Crash Course Computer Science #7 The Central Processing Unit https://www.youtube.com/watch?v=FZGugFqdr60 Internals ● Arithmetic Logic Unit (ALU) ● Control Unit (CU) ● Registers ● Cache Memory ● The Fetch-Execute Cycle Arithmetic Logic Unit An arithmetic logic unit (ALU) is a digital circuit used to perform arithmetic and logic ​ operations. It represents the fundamental building block of the central processing unit ​ (CPU) of a computer. Modern CPUs contain very powerful and complex ALUs. In addition to ALUs, modern CPUs contain a control unit (CU). Most of the operations of a CPU are performed by one or more ALUs, which load data from ​ input registers. A register is a small amount of storage available as part of a CPU. The ​ control unit tells the ALU what operation to perform on that data and the ALU stores the result in an output register. The control unit moves the data between these registers, the ALU, and memory. Control Unit A control unit coordinates how data moves around a cpu. The control unit (CU) is a ​ ​ component of a computer's central processing unit (CPU) that directs operation of the processor. It tells the computer's memory, arithmetic/logic unit and input and output devices how to respond to a program's instructions. ● The control unit obtains data / instructions from memory ● Interprets / decodes the instructions into commands / signals ● Controls transfer of instructions and data in the CPU ● Coordinates the parts of the CPU Registers In computer architecture, a processor register is a quickly accessible location available ​ to a digital processor's central processing unit (CPU).
    [Show full text]