DOCSLIB.ORG

Principles of Computer Architecture

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Principles of Computer Architecture PRINCIPLES OF COMPUTER ARCHITECTURE CLASS TEST EDITION – AUGUST 1999 Miles J. Murdocca Department of Computer Science Rutgers University New Brunswick, NJ 08903 (USA) [email protected] http://www.cs.rutgers.edu/~murdocca/ Vincent P. Heuring Department of Electrical and Computer Engineering University of Colorado Boulder, CO 80309-0425 (USA) [email protected] http://ece-www.colorado.edu/faculty/heuring.html Copyright © 1999 Prentice Hall For Ellen, Alexandra, and Nicole and For Gretchen PREFACE iii PREFACE About the Book Our goal in writing this book is to expose the inner workings of the modern digital computer at a level that demystifies what goes on inside the machine. The only prerequisite to Principles of Computer Architecture is a working knowledge of a high-level programming language. The breadth of material has been chosen to cover topics normally found in a first course in computer architecture or computer organization. The breadth and depth of coverage have been steered to also place the beginning student on a solid track for con- tinuing studies in computer related disciplines. In creating a computer architecture textbook, the technical issues fall into place fairly naturally, and it is the organizational issues that bring important features to fruition. Some of the features that received the greatest attention in Principles of Computer Architecture include the choice of the instruction set architecture (ISA), the use of case studies, and a voluminous use of examples and exercises. THE INSTRUCTIONAL ISA A textbook that covers assembly language programming needs to deal with the issue of which instruction set architecture (ISA) to use: a model architecture, or one of the many commercial architectures. The choice impacts the instruc- tor, who may want an ISA that matches a local platform used for student assembly language programming assignments. To complicate matters, the local platform may change from semester to semester: yesterday the MIPS, today the Pentium, tomorrow the SPARC. The authors opted for having it both ways by adopting a SPARC-subset for an instructional ISA, called “A RISC Computer” (ARC), which is carried through the mainstream of the iv PREFACE book, and complementing it with platform-independent software tools that sim- ulate the ARC ISA as well as the MIPS and x86 (Pentium) ISAs. CASE STUDIES, EXAMPLES, AND EXERCISES Every chapter contains at least one case study as a means for introducing the stu- dent to “real world” examples of the topic being covered. This places the topic in perspective, and in the authors’ opinion, lends an air of reality and interest to the material. We incorporated as many examples and exercises as we practically could, cover- ing the most significant points in the text. Additional examples and solutions are available on-line, at the companion Web site (see below.) Coverage of Topics Our presentation views a computer as an integrated system. If we were to choose a subtitle for the book, it might be “An Integrated Approach,” which reflects high level threads that tie the material together. Each topic is covered in the context of the entire machine of which it is a part, and with a perspective as to how the implementation affects behavior. For example, the finite precision of binary numbers is brought to bear in observing how many 1’s can be added to a floating point number before the error in the representation exceeds 1. (This is one rea- son why floating point numbers should be avoided as loop control variables.) As another example, subroutine linkage is covered with the expectation that the reader may someday be faced with writing C or Java programs that make calls to routines in other high level languages, such as Fortran. As yet another example of the integrated approach, error detection and correc- tion are covered in the context of mass storage and transmission, with the expec- tation that the reader may tackle networking applications (where bit errors and data packet losses are a fact of life) or may have to deal with an unreliable storage medium such as a compact disk read-only memory (CD-ROM.) Computer architecture impacts many of the ordinary things that computer pro- fessionals do, and the emphasis on taking an integrated approach addresses the great diversity of areas in which a computer professional should be educated. This emphasis reflects a transition that is taking place in many computer related undergraduate curricula. As computer architectures become more complex they must be treated at correspondingly higher levels of abstraction, and in some ways PREFACE v they also become more technology-dependent. For this reason, the major portion of the text deals with a high level look at computer architecture, while the appen- dices and case studies cover lower level, technology-dependent aspects. THE CHAPTERS Chapter 1: Introduction introduces the textbook with a brief history of com- puter architecture, and progresses through the basic parts of a computer, leaving the student with a high level view of a computer system. The conventional von Neumann model of a digital computer is introduced, followed by the System Bus Model, followed by a topical exploration of a typical computer. This chapter lays the groundwork for the more detailed discussions in later chapters. Chapter 2: Data Representation covers basic data representation. One’s comple- ment, two’s complement, signed magnitude and excess representations of signed numbers are covered. Binary coded decimal (BCD) representation, which is fre- quently found in calculators, is also covered in Chapter 2. The representation of floating point numbers is covered, including the IEEE 754 floating point stan- dard for binary numbers. The ASCII, EBCDIC, and Unicode character repre- sentations are also covered. Chapter 3: Arithmetic covers computer arithmetic and advanced data represen- tations. Fixed point addition, subtraction, multiplication, and division are cov- ered for signed and unsigned integers. Nine’s complement and ten’s complement representations, used in BCD arithmetic, are covered. BCD and floating point arithmetic are also covered. High performance methods such as carry-lookahead addition, array multiplication, and division by functional iteration are covered. A short discussion of residue arithmetic introduces an unconventional high perfor- mance approach. Chapter 4: The Instruction Set Architecture introduces the basic architectural components involved in program execution. Machine language and the fetch-execute cycle are covered. The organization of a central processing unit is detailed, and the role of the system bus in interconnecting the arithmetic/logic unit, registers, memory, input and output units, and the control unit are dis- cussed. Assembly language programming is covered in the context of the instructional ARC (A RISC Computer), which is loosely based on the commercial SPARC architecture. The instruction names, instruction formats, data formats, and the vi PREFACE suggested assembly language syntax for the SPARC have been retained in the ARC, but a number of simplifications have been made. Only 15 SPARC instruc- tions are used for most of the chapter, and only a 32-bit unsigned integer data type is allowed initially. Instruction formats are covered, as well as addressing modes. Subroutine linkage is explored in a number of styles, with a detailed dis- cussion of parameter passing using a stack. Chapter 5: Languages and the Machine connects the programmer’s view of a computer system with the architecture of the underlying machine. System soft- ware issues are covered with the goal of making the low level machine visible to a programmer. The chapter starts with an explanation of the compilation process, first covering the steps involved in compilation, and then focusing on code gen- eration. The assembly process is described for a two-pass assembler, and examples are given of generating symbol tables. Linking, loading, and macros are also cov- ered. Chapter 6: Datapath and Control provides a step-by-step analysis of a datapath and a control unit. Two methods of control are discussed: microprogrammed and hardwired. The instructor may adopt one method and omit the other, or cover both methods as time permits. The example microprogrammed and hardwired control units implement the ARC subset of the SPARC assembly language intro- duced in Chapter 4. Chapter 7: Memory covers computer memory beginning with the organization of a basic random access memory, and moving to advanced concepts such as cache and virtual memory. The traditional direct, associative, and set associative cache mapping schemes are covered, as well as multilevel caches. Issues such as overlays, replacement policies, segmentation, fragmentation, and the translation lookaside buffer are also discussed. Chapter 8: Input and Output covers bus communication and bus access meth- ods. Bus-to-bus bridging is also described. The chapter covers various I/O devices commonly in use such as disks, keyboards, printers, and displays. Chapter 9: Communication covers network architectures, focusing on modems, local area networks, and wide area networks. The emphasis is primarily on net- work architecture, with accessible discussions of protocols that spotlight key fea- tures of network architecture. Error detection and correction are covered in depth. The TCP/IP protocol suite is introduced in the context of the Internet. PREFACE vii Chapter 10: Trends in Computer Architecture covers advanced architectural features that have either emerged or taken new forms in recent years. The early part of the chapter covers the motivation for reduced instruction set computer (RISC) processors, and the architectural implications of RISC. The latter portion of the chapter covers multiple instruction issue machines, and very large instruc- tion word (VLIW) machines. A case study makes RISC features visible to the programmer in a step-by-step analysis of a C compiler-generated SPARC pro- gram, with explanations of the stack frame usage, register usage, and pipelining. The chapter covers parallel and distributed architectures, and interconnection networks used in parallel and distributed processing.
Load more

Recommended publications
  • Introduction to the Ipaddress Module
    Introduction to the ipaddress Module An Introduction to the ipaddress Module Overview: This document provides an introduction to the ipaddress module used in the Python language for manipulation of IPv4 and IPv6 addresses. At a high level, IPv4 and IPv6 addresses are used for like purposes and functions. However, since there are major differences in the address structure for each protocol, this tutorial has separated into separate sections, one each for IPv4 and IPv6. In today’s Internet, the IPv4 protocol controls the majority of IP processing and will remain so for the near future. The enhancements in scale and functionality that come with IPv6 are necessary for the future of the Internet and adoption is progressing. The adoption rate, however, remains slow to this date. IPv4 and the ipaddress Module: The following is a brief discussion of the engineering of an IPv4 address. Only topics pertinent to the ipaddress module are included. A IPv4 address is composed of 32 bits, organized into four eight bit groupings referred to as “octets”. The word “octet” is used to identify an eight-bit structure in place of the more common term “byte”, but they carry the same definition. The four octets are referred to as octet1, octet2, octet3, and octet4. This is a “dotted decimal” format where each eight-bit octet can have a decimal value based on eight bits from zero to 255. IPv4 example: 192.168.100.10 Every packet in an IPv4 network contains a separate source and destination address. As a unique entity, a IPv4 address should be sufficient to route an IPv4 data packet from the source address of the packet to the destination address of the packet on a IPv4 enabled network, such as the Internet.
    [Show full text]
  • How Many Bits Are in a Byte in Computer Terms
    How Many Bits Are In A Byte In Computer Terms Periosteal and aluminum Dario memorizes her pigeonhole collieshangie count and nagging seductively. measurably.Auriculated and Pyromaniacal ferrous Gunter Jessie addict intersperse her glockenspiels nutritiously. glimpse rough-dries and outreddens Featured or two nibbles, gigabytes and videos, are the terms bits are in many byte computer, browse to gain comfort with a kilobyte est une unité de armazenamento de armazenamento de almacenamiento de dados digitais. Large denominations of computer memory are composed of bits, Terabyte, then a larger amount of nightmare can be accessed using an address of had given size at sensible cost of added complexity to access individual characters. The binary arithmetic with two sets render everything into one digit, in many bits are a byte computer, not used in detail. Supercomputers are its back and are in foreign languages are brainwashed into plain text. Understanding the Difference Between Bits and Bytes Lifewire. RAM, any sixteen distinct values can be represented with a nibble, I already love a Papst fan since my hybrid head amp. So in ham of transmitting or storing bits and bytes it takes times as much. Bytes and bits are the starting point hospital the computer world Find arrogant about the Base-2 and bit bytes the ASCII character set byte prefixes and binary math. Its size can vary depending on spark machine itself the computing language In most contexts a byte is futile to bits or 1 octet In 1956 this leaf was named by. Pages Bytes and Other Units of Measure Robelle. This function is used in conversion forms where we are one series two inputs.
    [Show full text]
  • The Application of File Identification, Validation, and Characterization Tools in Digital Curation
    THE APPLICATION OF FILE IDENTIFICATION, VALIDATION, AND CHARACTERIZATION TOOLS IN DIGITAL CURATION BY KEVIN MICHAEL FORD THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Library and Information Science in the Graduate College of the University of Illinois at Urbana-Champaign, 2011 Urbana, Illinois Advisers: Research Assistant Professor Melissa Cragin Assistant Professor Jerome McDonough ABSTRACT File format identification, characterization, and validation are considered essential processes for digital preservation and, by extension, long-term data curation. These actions are performed on data objects by humans or computers, in an attempt to identify the type of a given file, derive characterizing information that is specific to the file, and validate that the given file conforms to its type specification. The present research reviews the literature surrounding these digital preservation activities, including their theoretical basis and the publications that accompanied the formal release of tools and services designed in response to their theoretical foundation. It also reports the results from extensive tests designed to evaluate the coverage of some of the software tools developed to perform file format identification, characterization, and validation actions. Tests of these tools demonstrate that more work is needed – particularly in terms of scalable solutions – to address the expanse of digital data to be preserved and curated. The breadth of file types these tools are anticipated to handle is so great as to call into question whether a scalable solution is feasible, and, more broadly, whether such efforts will offer a meaningful return on investment. Also, these tools, which serve to provide a type of baseline reading of a file in a repository, can be easily tricked.
    [Show full text]
  • 1 Powers of Two
    A. V. GERBESSIOTIS CS332-102 Spring 2020 Jan 24, 2020 Computer Science: Fundamentals Page 1 Handout 3 1 Powers of two Definition 1.1 (Powers of 2). The expression 2n means the multiplication of n twos. Therefore, 22 = 2 · 2 is a 4, 28 = 2 · 2 · 2 · 2 · 2 · 2 · 2 · 2 is 256, and 210 = 1024. Moreover, 21 = 2 and 20 = 1. Several times one might write 2 ∗ ∗n or 2ˆn for 2n (ˆ is the hat/caret symbol usually co-located with the numeric-6 keyboard key). Prefix Name Multiplier d deca 101 = 10 h hecto 102 = 100 3 Power Value k kilo 10 = 1000 6 0 M mega 10 2 1 9 1 G giga 10 2 2 12 4 T tera 10 2 16 P peta 1015 8 2 256 E exa 1018 210 1024 d deci 10−1 216 65536 c centi 10−2 Prefix Name Multiplier 220 1048576 m milli 10−3 Ki kibi or kilobinary 210 − 230 1073741824 m micro 10 6 Mi mebi or megabinary 220 40 n nano 10−9 Gi gibi or gigabinary 230 2 1099511627776 −12 40 250 1125899906842624 p pico 10 Ti tebi or terabinary 2 f femto 10−15 Pi pebi or petabinary 250 Figure 1: Powers of two Figure 2: SI system prefixes Figure 3: SI binary prefixes Definition 1.2 (Properties of powers). • (Multiplication.) 2m · 2n = 2m 2n = 2m+n. (Dot · optional.) • (Division.) 2m=2n = 2m−n. (The symbol = is the slash symbol) • (Exponentiation.) (2m)n = 2m·n. Example 1.1 (Approximations for 210 and 220 and 230).
    [Show full text]
  • Computers and the Thai Language
    [3B2-6] man2009010046.3d 12/2/09 13:47 Page 46 Computers and the Thai Language Hugh Thaweesak Koanantakool National Science and Technology Development Agency Theppitak Karoonboonyanan Thai Linux Working Group Chai Wutiwiwatchai National Electronics and Computer Technology Center This article explains the history of Thai language development for computers, examining such factors as the language, script, and writing system, among others. The article also analyzes characteristics of Thai characters and I/O methods, and addresses key issues involved in Thai text processing. Finally, the article reports on language processing research and provides detailed information on Thai language resources. Thai is the official language of Thailand. Certain vowels, all tone marks, and diacritics The Thai script system has been used are written above and below the main for Thai, Pali, and Sanskrit languages in Bud- character. dhist texts all over the country. Standard Pronunciation of Thai words does not Thai is used in all schools in Thailand, and change with their usage, as each word has a most dialects of Thai use the same script. fixed tone. Changing the tone of a syllable Thai is the language of 65 million people, may lead to a totally different meaning. and has a number of regional dialects, such Thai verbs do not change their forms as as Northeastern Thai (or Isan; 15 million with tense, gender, and singular or plural people), Northern Thai (or Kam Meuang or form,asisthecaseinEuropeanlanguages.In- Lanna; 6 million people), Southern Thai stead, there are other additional words to help (5 million people), Khorat Thai (400,000 with the meaning for tense, gender, and sin- people), and many more variations (http:// gular or plural.
    [Show full text]
  • American National Dictionary for Information Processing
    NAT L INST OF STAND & TECH R.j^C. NIST X3/TR-1—77 PUBLICATIONS -SniDB 517103 1977 SEPTEMBER X3 TECHNICAL REPORT Adopted tor Use by the Federal Government AMERICAN NATIONAL DICTIONARY FOR INFORMATION PROCESSING FIPS 11-1 See Notice on Inside Front Cover M AMERICAN NATIONAL STANDARDS COMMITTEE X3 — COMPUTERS & INFORMATION PROCESSING JKm - ■ PRsA2> tlD II- I iq-n ab( TTTli This DICTIONARY has been adopted for Federal Government use as a basic reference document to promote a common understanding of information processing terminology. Details concerning the specific use of this DICTIONARY are contained in Federal Information Processing Standards Publication 11-1, DICTIONARY FOR INFORMATION PROCESSING For a complete list of publications avail¬ able in the FIPS Series, write to the Office of ADP Standards Management, Institute for Computer Sciences and Technology, National Bureau of Stan¬ dards, Washington, D C 20234 f-^oftH Qvlas vi StzaiiTft DEC 7 1378 X3/TR-1-77 not (\ Cc - ;<£ 1977 September SKI American National Dictionary for Information Processing American National Standards Committee X3 — Computers and Information Processing Secretariat: Computer and Business Equipment Manufacturers Association Published by Computer and Business Equipment Manufacturers Association 1828 L Street NW, Washington DC 20036 202/466-2299 Copyright © 1977 by Computer and Business Equipment Manufacturers Association All rights reserved. Permission is herby granted for quotation, with accreditation to "American National Dictionary for Information Processing, X3/TR-1-77". of up to fifty terms and their definitions. Other than such quotation, no part of this publication may be reproduced in any form, in an electronic retrieval system or otherwise, without the prior written permission of the publisher.
    [Show full text]
  • Tutor Talk Binary Numbers
    What are binary numbers and why do we use them? BINARY NUMBERS Converting decimal numbers to binary numbers The number system we commonly use is decimal numbers, also known as Base 10. Ones, tens, hundreds, and thousands. For example, 4351 represents 4 thousands, 3 hundreds, 5 tens, and 1 ones. Thousands Hundreds Tens ones 4 3 5 1 Thousands Hundreds Tens ones 4 3 5 1 However, a computer does not understand decimal numbers. It only understands “on and off,” “yes and no.” Thousands Hundreds Tens ones 4 3 5 1 In order to convey “yes and no” to a computer, we use the numbers one (“yes” or “on”) and zero (“no” or “off”). To break it down further, the number 4351 represents 1 times 1, 5 times 10, DECIMAL NUMBERS (BASE 10) 3 times 100, and 4 times 1000. Each step to the left is another multiplication of 10. This is why it is called Base 10, or decimal numbers. The prefix dec- 4351 means ten. 4x1000 3x100 5x10 1x1 One is 10 to the zero power. Anything raised to the zero power is one. DECIMAL NUMBERS (BASE 10) Ten is 10 to the first power (or 10). One hundred is 10 to the second power (or 10 times 10). One thousand is 10 to the third 4351 power (or 10 times 10 times 10). 4x1000 3x100 5x10 1x1 103=1000 102=100 101=10 100=1 Binary numbers, or Base 2, use the number 2 instead of the number 10. 103 102 101 100 The prefix bi- means two.
    [Show full text]
  • Lab – Calculating Ipv4 Subnets (Instructor Version) Instructor Note: Red Font Color Or Gray Highlights Indicate Text That Appears in the Instructor Copy Only
    Lab – Calculating IPv4 Subnets (Instructor Version) Instructor Note: Red font color or Gray highlights indicate text that appears in the instructor copy only. Objectives Part 1: Determine IPv4 Address Subnetting • Determine the network address. • Determine the broadcast address. • Determine the number of hosts. Part 2: Calculate IPv4 Address Subnetting • Determine the number of subnets created. • Determine number of hosts per subnet. • Determine the subnet address. • Determine the host range for the subnet. • Determine the broadcast address for the subnet. Background / Scenario The ability to work with IPv4 subnets and determine network and host information based on a given IP address and subnet mask is critical to understanding how IPv4 networks operate. The first part is designed to reinforce how to compute network IP address information from a given IP address and subnet mask. When given an IP address and subnet mask, you will be able to determine other information about the subnet such as: • Network address • Broadcast address • Total number of host bits • Number of hosts per subnet In the second part of the lab, for a given IP address and subnet mask, you will determine such information as follows: • Network address of this subnet • Broadcast address of this subnet • Range of host addresses for this subnet • Number of subnets created • Number of hosts for each subnet Instructor Note: This activity can be done in class or assigned as homework. If the assignment is done in class, you may wish to have students work alone or in teams of 2 students each. It is suggested that the first problem is done together in class to give students guidance as to how to proceed for the rest of the assignment.
    [Show full text]
  • Computer Network
    Computer Network Unit 1 Q 1. What are the topologies in computer n/w ? Ans: Network topologies are categorized into the following basic types: bus ring star tree mesh Bus Topology Bus networks use a common backbone to connect all devices. A single cable, the backbone functions as a shared communication medium that devices attach or tap into with an interface connector. Ring Topology In a ring network, every device has exactly two neighbors for communication purposes. All messages travel through a ring in the same direction. A failure in any cable or device breaks the loop and can take down the entire network. Star Topology Many home networks use the star topology. A star network features a central connection point called a "hub" that may be a hub, switch orrouter. Tree Topology Tree topologies integrate multiple star topologies together onto a bus. In its simplest form, only hub devices connect directly to the tree bus, and each hub functions as the "root" of a tree of devices. Mesh Topology Mesh topologies involve the concept of routes. Unlike each of the previous topologies, messages sent on a mesh network can take any of several possible paths from source to destination. Q 2. What is Computer n/w ? Ans: A computer network is a group of two or more computers connected to each electronically. This means that the computers can "talk" to each other and that every computer in the network can send information to the others. Q 3. How we arrived 7 layers of OSI reference model? Why not less than 7 or more than 7 ? Ans: The ISO looked to create a simple model for networking.
    [Show full text]
  • A Hextet Refers to a Segment Of
    A Hextet Refers To A Segment Of Which Hansel panders so methodologically that Rafe dirk her sedulousness? When Bradford succumbs his tastiness retool not bearishly enough, is Zak royalist? Hansel recant painstakingly if subsacral Zak cream or vouch. A hardware is referred to alternate a quartet or hextet each query four hexadecimal. Araqchi all disputable issues between Iran and Sextet ready World. What aisle the parts of an IPv4 address A Host a Network 2. Quantitative Structure-Property Relationships for the. The cleavage structure with orange points of this command interpreter to qsprs available online library of a client program output from another goal of aesthetics from an old pitch relationships between padlock and? The sextet V George Barris SnakePit dragster is under for sale. The first recording of Ho Bynum's new sextet with guitarist Mary Halvorson. Unfiltered The Tyshawn Sorey Sextet at the Jazz Gallery. 10 things you or know about IPv6 addressing. In resonance theory the resonant sextet number hH k of a benzenoid. Sibelius 7 Reference Guide. The six-part romp leans hard into caricatures to sing of mortality and life's. A percussion instrument fashioned out of short segments of hardwood and used in. Arrangements as defined by the UIL State Direc- tor of Music. A new invariant on hyperbolic Dehn surgery space 1 arXiv. I adore to suggest at least some attention the reasons why the sextet is structured as it. Cosmic Challenge Seyferts Sextet July 2020 Phil Harrington This months. Download PDF ScienceDirect. 40 and 9 are octets and 409 is a hextet since sleep number declare the octet.
    [Show full text]
  • Representing Information in English Until 1598
    In the twenty-first century, digital computers are everywhere. You al- most certainly have one with you now, although you may call it a “phone.” You are more likely to be reading this book on a digital device than on paper. We do so many things with our digital devices that we may forget the original purpose: computation. When Dr. Howard Figure 1-1 Aiken was in charge of the huge, Howard Aiken, center, and Grace Murray Hopper, mechanical Harvard Mark I calcu- on Aiken’s left, with other members of the Bureau of Ordnance Computation Project, in front of the lator during World War II, he Harvard Mark I computer at Harvard University, wasn’t happy unless the machine 1944. was “making numbers,” that is, U.S. Department of Defense completing the numerical calculations needed for the war effort. We still use computers for purely computational tasks, to make numbers. It may be less ob- vious, but the other things for which we use computers today are, underneath, also computational tasks. To make that phone call, your phone, really a com- puter, converts an electrical signal that’s an analog of your voice to numbers, encodes and compresses them, and passes them onward to a cellular radio which it itself is controlled by numbers. Numbers are fundamental to our digital devices, and so to understand those digital devices, we have to understand the numbers that flow through them. 1.1 Numbers as Abstractions It is easy to suppose that as soon as humans began to accumulate possessions, they wanted to count them and make a record of the count.
    [Show full text]
  • Technical Study Universal Multiple-Octet Coded Character Set Coexistence & Migration
    Technical Study Universal Multiple-Octet Coded Character Set Coexistence & Migration NIC CH A E L T S T U D Y [This page intentionally left blank] X/Open Technical Study Universal Multiple-Octet Coded Character Set Coexistence and Migration X/Open Company Ltd. February 1994, X/Open Company Limited All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without the prior permission of the copyright owners. X/Open Technical Study Universal Multiple-Octet Coded Character Set Coexistence and Migration ISBN: 1-85912-031-8 X/Open Document Number: E401 Published by X/Open Company Ltd., U.K. Any comments relating to the material contained in this document may be submitted to X/Open at: X/Open Company Limited Apex Plaza Forbury Road Reading Berkshire, RG1 1AX United Kingdom or by Electronic Mail to: [email protected] ii X/Open Technical Study (1994) Contents Chapter 1 Introduction............................................................................................... 1 1.1 Background.................................................................................................. 2 1.2 Terminology................................................................................................. 2 Chapter 2 Overview..................................................................................................... 3 2.1 Codesets.......................................................................................................
    [Show full text]