DOCSLIB.ORG

Topics in Computer Organization

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Topics in Computer Organization Topics in Computer Organization (based on old class notes) D. Salomon Feb 2008 (619) 443-6528 [email protected] http://www.davidsalomon.name/ Modern computer programming is a race between programmers striving to write bigger and better idiot-proof programs, and the Universe trying to produce bigger and better idiots. So far, the Universe is winning. —Rich Cook Preface The dictionary definition of the term “organizing” is “to put together into an orderly, functional, structured whole.” This term applies twice to this text because it tries to “put together into an orderly, functional, structured whole” the main components of computers; the way computers are organized. More and more people use computers, but to most computer users the computer is a “black box,” and writing a program is akin to uttering magical incantations. This text tries to clear up these mysteries. It attempts to give the reader a robust framework to which new knowledge can later be added by more studying. Specifically, the text answers the question “how do computers work?” It describes the main components of the computer and their interrelationships. It includes material on the control unit, memory, and input/output processing, as well as topics such as logic devices, microprocessor components, microprogramming, machine instructions, assembly language and assembler operation, and a survey of the main features of some existing computers. The title of this text is “Computer Organization.” This term refers to a conceptual understanding, rather than an engineering understanding, of the inner workings of computers. A more formal definition of this term is “the logical arrangement of the hardware components and how they are interconnected.” Another important term commonly used with computers is “computer architecture.” This term answers the question “how is a computer designed?” rather than “how does the computer work?”. An alternative definition of computer architecture is “the components or attributes of the computer that are visible to the assembler language programmer.” As a result of these definitions, features such as the instruction set, the word size, addressing modes, and interrupt handling are architectural. Features such as memory technology, bus organization, and handshaking signals are organizational. A typical example is input/output (abbreviated I/O). The I/O instructions in the instruction set are an architectural feature. The physical implementation of those instructions (by way of a DMA device, a channel, or something else) is an organizational feature. The distinction between organization and architecture can be traced back to 1964. In that year, IBM released its system/360, the first family of computers. The different models in the family had different performances (and prices) and, as a result, different organizations. However, they were upward compatible, which means they had the same architecture. The success of the 360 family encouraged IBM and other manufacturers to design many more families of computers, thereby establishing the distinction between organization and architecture. Here are a few more general terms used with computers. “Software” refers to how the computer is used. “Hardware” refers to how the computer is constructed (its physical building blocks). The general term “computing” refers to problem solving on computers by means of programming. The computer itself is a machine that performs tasks and solve problems by storing and manipulating information. Information stored in computers is digital (it consists of discrete digits). ii Preface These notes are based on experience gained from teaching computer organization over many years. Much of the material found here was originally included in response to questions and requests from students. The exercises constitute an important part of the notes and should be worked out! The answers are provided, but should be consulted only as a last resort. Remember what the Dodo said: “Why,” said the Dodo, “the best way to explain it is to do it.” —Lewis Carroll (1832–1898) The text is divided into three parts as follows: Part I consists of the first six chapters and covers the main concepts of computer organization. Chap- ter 1 introduces the control unit, instruction fetch and execution, memory, ALU, microprogramming, and interrupts. Chapter 2 is a review of machine instructions and data types. It discusses instruction formats, opcodes, addressing modes, instruction types, floating-point, BCD, and fixed-point numbers, and carry and overflow. Chapter 3 is devoted to the important topic of input/output (I/O). It consists of three parts, the I/O processor, I/O codes, and computer communications. The first part discusses register I/O, memory- mapped I/O, DMA, and other types of I/O processors. The second part introduces the ASCII and Unicode codes, continues with a coverage of reliable (i.e., error-detecting and error-correcting) codes, and of data compression methods, and concludes with a description of important cryptographic methods (secure codes). Part three explains serial I/O and how computers are connected in local-area and wide-area networks. Microprogramming is the topic of chapter 4. The chapter includes a review of the basic concepts and a detailed example of a simple, microprogrammed computer. Parallel computers are discussed in chapter 5. The discussion concentrates on MIMD computers, but SIMD and data flow computers are also mentioned. The short chapter 6 introduces the reader to the concept of reduced instruction-set computers (RISC). Part II consists of chapters 7 through 9. This is an introduction to digital devices and computer design. Chapter 7 introduces the main digital devices used in computers. It starts with the logic gates and covers latches, counters, decoders, multiplexors, and other devices. Chapter 8 is an introduction to computer memory. The main types of memory and their internal operations are discussed. The ALU and its circuits is the topic of chapter 9. Digital circuits for integer arithmetic, for shifts, and for comparisons are explained in detail. Part III consists of appendixes that provide information on the history of computers, Unicode, and CD-ROMs. Hating, as I mortally do, all long unnecessary preface, I shall give you good quarter in this, and use no farther apology, than to prepare you for seeing the loose part of my life, wrote with the same liberty that I led it. —John Cleland, 1749, Fanny Hill Contents Preface i 1. Introduction 1 1 Terminology 1 2 The Control Unit 2 3 The Memory 5 4 Instruction Execution 11 5 CPU Bus Structure 17 6 Microprogramming 18 7 Interrupts 20 8 I/O Interrupts 26 9 Interrupts in a Microprocessor 28 10 The ALU 30 2. Machine Instructions 33 1 Instruction Formats 33 2 The Opcode Size 34 3 Addressing Modes 36 4 The Direct Mode 37 5 The Relative Mode 37 6 The Immediate Mode 38 7 The Index Mode 38 8 The Indirect Mode 38 9 Multilevel or Cascaded Indirect 39 10 Other Addressing Modes 40 11 Instruction Types 41 12 Data Movement Instructions 41 13 Operations 42 14 N-Operand Instructions 48 15 Actual Instruction Sets 48 16 The VAX Instruction Set 49 17 The RISC I Instruction Set 52 18 Non-Numeric Data Types 53 19 Numeric Data Types 54 20 Signed Integers 54 21 Floating-Point Numbers 57 22 Fixed-Point Numbers 63 23 Decimal (BCD) Numbers 64 24 Other BCD Codes 65 25 Rational Numbers 67 26 Carry and Overflow 68 iv Contents 3. Input/Output 71 1 The I/O Processor 71 2 Polled I/O 73 3 Interrupt I/O 75 4 DMA 75 5 I/O Channels 78 6 I/O Codes 79 7 ASCII and Other Codes 80 8 Information Theory and Algebraic Coding 83 9 Error-Detecting and Error-Correcting Codes 84 10 Data Compression 93 11 Variable-Size Codes 94 12 Huffman Codes 95 13 Facsimile Compression 97 14 Dictionary-Based Methods 100 15 Approaches to Image Compression 102 16 Secure Codes 107 17 Transposition Ciphers 114 18 Transposition by Turning Template 116 19 Columnar Transposition Cipher 118 20 Steganography 126 21 Computer Communications 131 22 Serial I/O 131 23 Modern Modems 143 24 ISDN and DSL 144 25 T-1, DS-1 and Their Relatives 145 26 Computer Networks 148 27 Internet Organization 152 28 Internet: Physical Layout 153 29 CSUN in the Internet 160 30 ICANN and IANA 163 31 The World Wide Web 163 4. Microprogramming 167 1 Basic Principles 167 2 A Short History of Microprogramming 168 3 The Computer Clock 169 4 An Example Microarchitecture 169 5 The Microinstructions 170 6 Microinstruction Timing 172 7 The Control Path 175 8 The Machine Instructions 177 9 The Microcode 178 10 Final Notes 184 11 A Horizontal Example 187 Contents v 5. Parallel Computers 189 1 Introduction 189 2 Classifying Architectures 189 3 Parallel Processing Methods 190 4 Design Criteria 190 5 The Hypercube 191 6 Array Processors 193 7 Example: MPP 195 8 Example: The Connection Machine 197 9 MIMD Computers 199 10 Parallel Algorithms 200 11 The Intel iPSC/1 202 12 Vector Processors 204 13 The Von-Neumann Bottleneck 205 14 Associative Computers 206 15 Data Flow Computers 209 6. Reduced Instruction Set Computers 219 1 Reduced and Complex Instruction Sets 219 2 A Short History of RISC 221 3 The RISC I Computer 222 4 Conclusions 226 7. Digital Devices 227 1 Combinational and Sequential Devices 228 2 Multivibrators 228 3 Counters 232 4 Registers 236 5 Multiplexors 236 6 Decoders 237 7 Encoders 237 8. The Memory 241 1 A Glossary of Memory Terms 241 2 Static RAM 242 3 ROM 243 4 PLA 245 9. The ALU 247 1 Integer Addition and Subtraction 247 2 The Accumulator 250 3 Integer Multiplication 252 4 Integer Division 260 5 Shifts 261 6 Comparisons 263 10. Assemblers 267 1 Introduction 267 2 A Short History of Assemblers 270 3 Types of Assemblers and Loaders 272 4 Assembler Operation 272 5 The Two-Pass Assembler 276 6 The One-Pass Assembler 280 7 Absolute and Relocatable Object Files 283 8 Absolute and Rel.
Load more

Recommended publications
  • System Design for a Computational-RAM Logic-In-Memory Parailel-Processing Machine
    System Design for a Computational-RAM Logic-In-Memory ParaIlel-Processing Machine Peter M. Nyasulu, B .Sc., M.Eng. A thesis submitted to the Faculty of Graduate Studies and Research in partial fulfillment of the requirements for the degree of Doctor of Philosophy Ottaw a-Carleton Ins titute for Eleceical and Computer Engineering, Department of Electronics, Faculty of Engineering, Carleton University, Ottawa, Ontario, Canada May, 1999 O Peter M. Nyasulu, 1999 National Library Biôiiothkque nationale du Canada Acquisitions and Acquisitions et Bibliographie Services services bibliographiques 39S Weiiington Street 395. nie WeUingtm OnawaON KlAW Ottawa ON K1A ON4 Canada Canada The author has granted a non- L'auteur a accordé une licence non exclusive licence allowing the exclusive permettant à la National Library of Canada to Bibliothèque nationale du Canada de reproduce, ban, distribute or seU reproduire, prêter, distribuer ou copies of this thesis in microform, vendre des copies de cette thèse sous paper or electronic formats. la forme de microficbe/nlm, de reproduction sur papier ou sur format électronique. The author retains ownership of the L'auteur conserve la propriété du copyright in this thesis. Neither the droit d'auteur qui protège cette thèse. thesis nor substantial extracts fkom it Ni la thèse ni des extraits substantiels may be printed or otherwise de celle-ci ne doivent être imprimés reproduced without the author's ou autrement reproduits sans son permission. autorisation. Abstract Integrating several 1-bit processing elements at the sense amplifiers of a standard RAM improves the performance of massively-paralle1 applications because of the inherent parallelism and high data bandwidth inside the memory chip.
    [Show full text]
  • Dop – a Cpu Core for Teaching Basics of Computer Architecture
    DOP – A CPU CORE FOR TEACHING BASICS OF COMPUTER ARCHITECTURE Milos Becvar, Alois Pluhacek and Jiri Danecek Department of Computer Science and Engineering Faculty of Electrical Engineering Czech Technical University in Prague, Abstract: A simple 16-bit processor core called DOP and its teaching environment is presented. The DOP processor illustrates the basic principles of computer organization and is therefore used in the introductory hardware course. Its major features are simplicity, availability of an FPGA implementation and a C compiler. This paper presents the description of the core, HW and SW tools and teaching methodology. computing performance. The DOP processor core was 1. INTRODUCTION developed at our department together with various SW and HW visualization tools (Danecek et al., 1994a). An introductory computer hardware course should teach students to the fundamental principles of computer The goal of this paper is to describe this processor core internal functionality. Students, who are familiar with and its learning environment for teaching basics of programming in high-level languages, are required to computer organization. The paper is organized as understand the interaction between a processor, a follows - section 2 outlines the introductory course and memory and I/O devices, an internal organization of characterizes the students, section 3 describes the DOP processor, computer arithmetic and basics of digital processor core, section 4 describes the SW and HW design. Our experience has shown that it is not an easy tools supporting this processor and finally section 5 task for most of them. The functionality of the processor outlines the use of the DOP in our introductory course.
    [Show full text]
  • 10. Assembly Language, Models of Computation
    10. Assembly Language, Models of Computation 6.004x Computation Structures Part 2 – Computer Architecture Copyright © 2015 MIT EECS 6.004 Computation Structures L10: Assembly Language, Models of Computation, Slide #1 Beta ISA Summary • Storage: – Processor: 32 registers (r31 hardwired to 0) and PC – Main memory: Up to 4 GB, 32-bit words, 32-bit byte addresses, 4-byte-aligned accesses OPCODE rc ra rb unused • Instruction formats: OPCODE rc ra 16-bit signed constant 32 bits • Instruction classes: – ALU: Two input registers, or register and constant – Loads and stores: access memory – Branches, Jumps: change program counter 6.004 Computation Structures L10: Assembly Language, Models of Computation, Slide #2 Programming Languages 32-bit (4-byte) ADD instruction: 1 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 opcode rc ra rb (unused) Means, to the BETA, Reg[4] ß Reg[2] + Reg[3] We’d rather write in assembly language: Today ADD(R2, R3, R4) or better yet a high-level language: Coming up a = b + c; 6.004 Computation Structures L10: Assembly Language, Models of Computation, Slide #3 Assembly Language Symbolic 01101101 11000110 Array of bytes representation Assembler 00101111 to be loaded of stream of bytes 10110001 into memory ..... Source Binary text file machine language • Abstracts bit-level representation of instructions and addresses • We’ll learn UASM (“microassembler”), built into BSim • Main elements: – Values – Symbols – Labels (symbols for addresses) – Macros 6.004 Computation Structures L10: Assembly Language, Models
    [Show full text]
  • Programmable Digital Microcircuits - a Survey with Examples of Use
    - 237 - PROGRAMMABLE DIGITAL MICROCIRCUITS - A SURVEY WITH EXAMPLES OF USE C. Verkerk CERN, Geneva, Switzerland 1. Introduction For most readers the title of these lecture notes will evoke microprocessors. The fixed instruction set microprocessors are however not the only programmable digital mi• crocircuits and, although a number of pages will be dedicated to them, the aim of these notes is also to draw attention to other useful microcircuits. A complete survey of programmable circuits would fill several books and a selection had therefore to be made. The choice has rather been to treat a variety of devices than to give an in- depth treatment of a particular circuit. The selected devices have all found useful ap• plications in high-energy physics, or hold promise for future use. The microprocessor is very young : just over eleven years. An advertisement, an• nouncing a new era of integrated electronics, and which appeared in the November 15, 1971 issue of Electronics News, is generally considered its birth-certificate. The adver• tisement was for the Intel 4004 and its three support chips. The history leading to this announcement merits to be recalled. Intel, then a very young company, was working on the design of a chip-set for a high-performance calculator, for and in collaboration with a Japanese firm, Busicom. One of the Intel engineers found the Busicom design of 9 different chips too complicated and tried to find a more general and programmable solu• tion. His design, the 4004 microprocessor, was finally adapted by Busicom, and after further négociation, Intel acquired marketing rights for its new invention.
    [Show full text]
  • The Hpc C Compiler 2.1 Introduction
    ™ MICROCONTROLLER DEVELOPMENT SUPPORT ( MOLE HPC™ C COMPILER USER'S MANUAL ( ( ( ( ~ National Semiconductor Corporation Customer Order Number 424410883-001 NSC Publication Number 424410883-001C October 1988 HPC™ C Compiler User's Manual @l 1988 National Semiconductor Corporation 2900 Semiconductor Drive P.O. Box 58090 Santa Clara. California 95052-8090 CONTENTS Chapter 1 OVERVIEW 1.1 INTRODUCTION............................. 1-1 1.2 MANUAL ORGANIZATION. .. 1-2 1.3 DOCUMENTATION CONVENTIONS. .. 1-2 1.3.1 General Conventions . .. 1-2 1.3.2 Conventions in Syntax Descriptions ............. 1-2 1.3.3 Example Conventions. .. 1-3 1.3.4 Additional Conventions .................... 1-3 Chapter 2 THE HPC C COMPILER 2.1 INTRODUCTION............................. 2-1 2.2 COMPILER COMMAND SYNTAX 2-1 Chapter 3 BASIC DEFINITIONS 3.1 INTRODUCTION............................. 3-1 3.2 NAMES.................................. 3-1 3.3 CONSTANTS............................... 3-1 3.4 ESCAPE SEQUENCES . .. 3-2 3.5 COMMENTS............................... 3-3 3.6 DATA TYPES. .. 3-3 3.7 PREPROCESSOR DIRECTIVES . .. 3-4 3.8 PROGRAM ORGANIZATION. .. 3-4 3.9 INITIALIZATION OF VARIABLES . .. 3-4 3.10 OPERATORS . .. 3-5 3.11 IN-LINE MICROASSEMBLER CODE . .. 3-5 Chapter 4 IMPLEMENTATION-DEPENDENT CONSIDERATIONS 4.1 INTRODUCTION............................. 4-1 4.2 MEMORy................................. 4-1 4.3 STORAGE CLASSES . .. 4-1 4.3.1 Storage Class Modifiers. .. 4-1 4.4 C STACK FORMAT . .. 4-3 4.5 USING IN-LINE MICROASSEMBLER CODE. .. 4-4 4.6 EFFICIENCY CONSIDERATIONS . .. 4-6 4.6.1 Declaration Syntax . .. 4-9 4.7 STATEMENTS AND IMPLEMENTATION .............. 4-10 4.8 RUN-TIME NOTES ........................... 4-11 v Appendix A CCHPC SPECIFICATIONS Appendix B CONVERTING BETWEEN STANDARD C AND CCHPC Appendix C INVOCATION LINE SYNTAX C.l INTRODUCTION............................
    [Show full text]
  • WCAE 2003 Workshop on Computer Architecture Education
    WCAE 2003 Proceedings of the Workshop on Computer Architecture Education in conjunction with The 30th International Symposium on Computer Architecture DQG 2003 Federated Computing Research Conference Town and Country Resort and Convention Center b San Diego, California June 8, 2003 Workshop on Computer Architecture Education Sunday, June 8, 2003 Session 1. Welcome and Keynote 8:45–10:00 8:45 Welcome Edward F. Gehringer, workshop organizer 8:50 Keynote address, “Teaching and teaching computer Architecture: Two very different topics (Some opinions about each),” Yale Patt, teacher, University of Texas at Austin 1 Break 10:00–10:30 Session 2. Teaching with New Architectures 10:30–11:20 10:30 “Intel Itanium floating-point architecture,” Marius Cornea, John Harrison, and Ping Tak Peter Tang, Intel Corp. ................................................................................................................................. 5 10:50 “DOP — A CPU core for teaching basics of computer architecture,” Miloš BeþváĜ, Alois Pluháþek and JiĜí DanƟþek, Czech Technical University in Prague ................................................................. 14 11:05 Discussion Break 11:20–11:30 Session 3. Class Projects 11:30–12:30 11:30 “Superscalar out-of-order demystified in four instructions,” James C. Hoe, Carnegie Mellon University ......................................................................................................................................... 22 11:50 “Bridging the gap between undergraduate and graduate experience in
    [Show full text]
  • Series 3000 Reference Manua
    inter Series 3000 Family Of Computing Elements - The Total System Solution. Since its introduction in September, 1974, the Series 3000 family of computing elements has found acceptance in a wide range of high performance applications from disk controllers to airborne CPU's. The Series 3000 family represents more than a simple collection of bipolar components, it is a complete family of computing elements and hardware/software support that greatly simplifies the task of transforming a design from concept to production. The Series 3000 Component Family A complete set of computing elements that are designed as a system requiring a minimum amount of ancillary circuitry. 3001 Microprogram Control Unit. 3002 Central Processing Element. 3003 . Look-Ahead Carry Generator. 3212 Multi-Mode Latch Buffer. 3214 Interrupt Control Unit. 3216/26 Parallel Bi-directional Bus Driver. ROMs/PROMs A complete set of bipolar ROMs and PROMs. RAMs A Complete family of MOS and bipolar RAMs. rhe Series 3000 Support A comprehensive support system that assists the designer in writing microprograms, debugging hardware and microcode, and programming prototype and production PROMs. CROMIS Cross microprogram assembler. MDS-800 Microcomputer development system with TTY/CRT, line printer, diskette, PROM programmer and high speed paper tape reader facilities. ICE-30 In-circuit emulation for the 3001 MCU. ROM-SIM ROM simulation for all of Intel's Bipolar ROMs and PROMs. Application Central processor and disk controller designs and Notes system timing considerations. Customer Comprehensive 3 day course covering the component Course family, CPU and controller designs, microprogramming and the MDS-800, ICE-30 and ROM-SIM operation.
    [Show full text]
  • Answers to Exercises
    Answers to Exercises A bird does not sing because he has an answer, he sings because he has a song. —Chinese Proverb Intro.1: abstemious, abstentious, adventitious, annelidous, arsenious, arterious, face- tious, sacrilegious. Intro.2: When a software house has a popular product they tend to come up with new versions. A user can update an old version to a new one, and the update usually comes as a compressed file on a floppy disk. Over time the updates get bigger and, at a certain point, an update may not fit on a single floppy. This is why good compression is important in the case of software updates. The time it takes to compress and decompress the update is unimportant since these operations are typically done just once. Recently, software makers have taken to providing updates over the Internet, but even in such cases it is important to have small files because of the download times involved. 1.1: (1) ask a question, (2) absolutely necessary, (3) advance warning, (4) boiling hot, (5) climb up, (6) close scrutiny, (7) exactly the same, (8) free gift, (9) hot water heater, (10) my personal opinion, (11) newborn baby, (12) postponed until later, (13) unexpected surprise, (14) unsolved mysteries. 1.2: A reasonable way to use them is to code the five most-common strings in the text. Because irreversible text compression is a special-purpose method, the user may know what strings are common in any particular text to be compressed. The user may specify five such strings to the encoder, and they should also be written at the start of the output stream, for the decoder’s use.
    [Show full text]
  • Micro Machine·Independent Microassembler
    MICRO MACHINE·INDEPENDENT MICROASSEMBLER 11 July 1980 ... by. Edward Fiala Peter Deutsch Butler Lampson Xerox Palo Alto Research Center 3333 Coyote Hill Rd. Palo Alto, CA. 94304 Filed on: [Maxcl]<AltoDOCS>Micro.Press Sources on: [Ivy]<DoradoSource)MicroMemo.Dm This manual describes a machine-independent microassembly language originally developed for the Maxcl computer and since used for the Maxc2, Dorado, and DO computers as well as for several smaller projects. This manual is the property of Xerox Corporation and is to be used solely for evaluative purposes. No part thereof may be reproduced, stored in a retrieval system transmited, disseminated, or disclosed to others in any form or by any means without prior written permission of Xerox. Micro: Machine-Independent MicroAssembler 11 July 1980 2 TABLE OF CONTENTS 1. Introduction . .. 3 2. Assembly Procedures . .. 3 3. Error Messages. .. 6 4. Assembly Listings ..............'. .. 7 5. Cross Reference Listings. .. 8 6. Comments .................................... 9 7. Statements.................................... 10 7.1 Builtins.................................. 11 7.2 Defining Symbols . ............... 11 7.3 Tokens.................................. 13 7.4 Neutrals and Tails ........................... 14 7.5 Clause Evaluation ........................... 16 7.6 Treatment of Arguments ...................... 16 7.7 Undefined Symbols. .. 17 7.7.1 Destination Addresses .................... 18 7.7.2 Octal Numbers ......................... 18 7.7.3 Literals .............................
    [Show full text]
  • C-Ware Software Toolset Tutorial Workbook
    User Guide C-WARE SOFTWARE TOOLSET TUTORIAL WORKBOOK C-WARE SOFTWARE TOOLSET VERSION 2.2 CSTTW-UG/D Rev 00 C-Ware Software Toolset Tutorial Workbook C-WARE SOFTWARE TOOLSET, VERSION 2.2 CSTTW-UG/D Rev 00 Copyright © 2003 Motorola, Inc. All rights reserved. No part of this documentation may be reproduced in any form or by any means or used to make any derivative work (such as translation, transformation, or adaptation) without written permission from Motorola. Motorola reserves the right to revise this documentation and to make changes in content from time to time without obligation on the part of Motorola to provide notification of such revision or change. Motorola provides this documentation without warranty, term, or condition of any kind, either implied or expressed, including, but not limited to, the implied warranties, terms or conditions of merchantability, satisfactory quality, and fitness for a particular purpose. Motorola may make improvements or changes in the product(s) and/or the program(s) described in this documentation at any time. C-3e, C-5, C-5e, C-Port, C-Ware, Q-3, and Q-5 are all trademarks of C-Port, a Motorola Company. Motorola and the stylized Motorola logo are registered in the US Patent & Trademark Office. All other product or service names are the property of their respective owners. CSTTW-UG/D Rev 00 CONTENTS About This Guide Guide Overview . 9 Using PDF Documents . 10 Guide Conventions . 11 References to CST Pathnames . 12 Revision History . 13 Related Product Documentation . 14 LESSON 1 Workbook Overview Overview . 17 Lessons . 17 Lessons in This Workbook .
    [Show full text]
  • Parallel Processing Implementations of a Contextual Classifier for Multispectral Remote Sensing Data Howard J
    Purdue University Purdue e-Pubs LARS Technical Reports Laboratory for Applications of Remote Sensing 1-1-1980 Parallel Processing Implementations of a Contextual Classifier for Multispectral Remote Sensing Data Howard J. Siegel Philip H. Swain Bradley W. Smith Follow this and additional works at: http://docs.lib.purdue.edu/larstech Siegel, Howard J.; Swain, Philip H.; and Smith, Bradley W., "Parallel Processing Implementations of a Contextual Classifier for Multispectral Remote Sensing Data" (1980). LARS Technical Reports. Paper 51. http://docs.lib.purdue.edu/larstech/51 This document has been made available through Purdue e-Pubs, a service of the Purdue University Libraries. Please contact [email protected] for additional information. PARALLEL PROCESSING IMPLEMENTATIONS 060380 OF A CONTEXTUAL CLASSIFIER FOR MULTISPECTRAL REMOTE SENSING DATA HOWARD JAY SIEGEL J PHILIP H. SWAIN J AND BRADLEY W. SMITH Purdue University ABSTRACT pIer algorithms used for remote sensing data analysis) typically require large a­ Contextual classifiers are being de­ mounts of computation time. One way to veloped as a method to exploit the spati­ reduce the execution time of these tasks al/spectral context of a pixel to achieve is through the use of parallelism. Vari­ accurate classification. Classification ous parallel processing systems that can algorithms such as the contextual classi­ be used for remote sensing have been fier typically require large amounts of built or proposed. The Control Data Cor­ computation time. One way to reduce the poration Flexible Processor system is a execution time of these tasks is through commercially available multiprocessor sys­ the use of parallelism. The applicability tem which has been recommended for use in of the CDC Flexible Processor system and remote sensing [4,5].
    [Show full text]
  • Ir^Is*»?.'2R-£
    DENSITY ADD MAGNETIC FIELD MEASUREMENTS IN THE TOHHAC IV-c PLASMA ;.ir^is*»?.'2r-£ John Halter Coonrod, Jr. ^riSSKSss-*"*! Lawrence Berkeley Laboratory Berkeley, California 94720 lO DiSTmm-narLT — -iii- TABLE OF CONTENTS ABSTRACT vii PREFACE ix 1. INTRODUCTION 1 1.1 Tormac Concept 1 1.2 Tormac IV . 5 1.3 Experimental Sequence 5 1.4 Motivation for Tormac IV-c 7 1.5 Diagnostics 9 1.5.1 Table of Typical Tormac IV-c Values . 10 1.6 Questions and Conclusions 11 1.7 References 13 2. EXPERIMENTAL DATA AND ANALYSIS 15 2.1 Data Summary 15 2.2 Overall Picture 16 2.3 Spectral Measurements 17 2.3.1 Reconstruction Technique 18 2.3.4 Problems with Reconstruction ..... 24 2.3.3 Do Profiles and Density 25 2.3.4 He 4686 Profiles and Fluctuations ... 37 2.4 Thomson Scattering 44 2.5 Magnetic Measurements 48 2.5.1 Flux Exclusion 50 2.5.2 Description of Small Probes 55 2.5.3 Small Probe Data 59 2.6 Interferometer Measurements 73 2.6.1 Description and Access 73 2.6.2 Alignment and Calibration Procedure . 77 2.6.3 Analysis Technique 78 2.6.4 Radial Density Profiles 79 2.7 Overall Particle Accounting ... 79 2.8 References 105 3. EXPERIMENT LAYOUT AND CONSTRUCTION 107 3.1 Glass Vessel 107 3.2 Cusp Winding 110 3.3 Cusp Bank and Switches 113 3.4 Bias Circuit 116 3.5 Pre-ionize Circuit 116 3.6 Heater Circuit 117 3.7 Floor Plan 118 3.8 Vacuum System 118 3.9 Safety Interlocks 122 3.10 References 123 -iv- 4.
    [Show full text]