Table Of Content.« 4. «.%^-4»'«i.«i'4|K*^1«)««>4Mk^4i^^'«»»«^i^ ^m/mmm.my^fmm4^^*t «.i« m^m^t
APPLICATIONS
CONCEPTS
HAT«!)WARE
'^6ftware
Adam
0\'crvie\v bv Osborne
C
Foreword bvThomas Bartee
i^i3N a"a7-aa7i7E-i
McGraw-Hill
N
aDMPUTER
HANDBOOK
Harry Helms
992 pages, 475 illustrations
Here is the all-inclusive and highly definitive
handbook the computer world has been
waiting for!
Whether your interest is professional, per-
sonal, business, or academic, The McGraw-
Hill Computer Handbook is a standard ref-
erence that will be essential in answering
virtually any question that may arise in the
use of today's computers.
Written by a staff of world-renowned
experts, this working tool offers comprehen-
sive, authoritative, and practical information
and techniques on mainframe computer,
minicomputer, and microcomputer hard-
ware, software, theory, and applications.
Clearly written and extensively illustrated for
quick comprehension, this book has a spe-
cial feature: it assumes no priorknowledge
ofcomputerscience; thus, nonspecialists
and enthusiasts can benefit from the knowl-
edge as well as any professional.
Another key feature is that it is organized for
easy reference. This relevant anthology
begins with the elementary concepts appli-
cable to all computer systems, large or
small. It then examines the basic compo-
nents of all computer systems and moves
on to specific systems.
By gathering the broad spectrum of com-
puter science information into one place,
The McGraw-Hill Computer Handbook will
prove invaluable to both the experienced
user and the beginner. Here is a sampling
of topics that are detailed in this text:
* basic computer theory
* computer structures
(continuedon backflap)
Digitized by the Internet Archive
2012
in
http://archive.org/details/mcgrawhillcomputOOhelm
The
McGraw-Hill
Computer
Handbook
The
McGraw-Hill
Computer
Handbook
Editor in Chief
Harry Helms
Overview by
Adam
Osborne
Foreword by
Thomas
C. Bartee
McGraw-Hill Book Company
New York St. Louis San Francisco Auckland
Bogota Hamburg Johannesburg London Madrid
Mexico Montreal New Delhi Panama Paris
Sao Paulo Singapore Sydney Tokyo Toronto
LibraryofCongressCataloginginPublicationData
Mainentryundertitle:
TheMcGraw-Hillcomputerhandbook.
Includes index.
1. Computers—Handbooks, manuals,etc.
2. Programming(Electroniccomputers)—Handbooks,
manuals, etc. 3. Programminglanguages(Electronic
—
computers) Handbooks, manuals,etc. I. Helms,
HarryL. II. McGraw-Hill BookCompany.
QA76.M37 1983 001.64 83-1044
ISBN 0-07-027972-1-
©
Copyright 1983 McGraw-Hill, Inc. All rights reserved. Printed in the
United States ofAmerica. Exceptas permitted under the United States
Copyright Act of 1976, no part ofthis publication may be reproducedor
distributed in any form or by any means, or stored in a data base or
retrieval system, without the prior written permission of the publisher.
34567890 KGP/KGP 8 9 8 7 6 5 4
ISBN 0-n7-DE7T72-l
The editors for this book were Patricia Allen-Browne and Margaret Lamb,
the productionsupervisorwas Teresa F. Leaden, and the designer was
Mark E. Safran. It was set in Times Roman by University Graphics, Inc.
Printed and bound by The Kingsport Press.
Contents
Contributors xi
Overview xiii
Foreword xv
1. Computer History and Concepts 1-1 Boolean Algebra and Logic
Networks 4-1
1-1 Introduction 1-1
1-2 Historical Perspective 1-2 4-1 Introduction 4-1
1-3 A Classification ofAutomatic 4-2 Boolean Algebra 4-2
Computers 1-5 4-3 Truth Tables and Boolean
1-4 The Nature ofa Computer System 1-6 Expressions 4-3
1-5 Principlesof Hardware Organization 1-7 4-4 Boolean Algebra Theorems 4-7
1-6 Conventions on Use ofStorage 1-10 4-5 Using the Boolean Algebra
1-7 Elementsof Programming 1-11 Theorems 4-9
1-8 Principlesofthe Space-Time 4-6 The Karnaugh Map Method of Boolean
Relationship 1-13 Simplification 4-13
4-7 Logic Networks 4-20
4-8 Additional Logic Gates 4-21
2. Computer Structures 2-1
5. Sequential Networks 5-1
2-1 Introduction 2-1
2-2 Functional Units 2-2 5-1 Introduction 5-1
2-3 Input Unit 2-5 5-2 The Flip-Flop Element 5-1
2-4 Memory Unit 2-5 5-3 State Tables and State Diagrams 5-6
2-5 Arithmetic and Logic Unit 2-7 5-4 Converting a State Table into a Logic
2-6 Output Unit 2-8 Diagram 5-10
2-7 Control Unit 2-9 5-5 Converting a Logic Diagram into a State
2-8 Basic Operational Concepts 2-10 Table 5-14
2-9 Bus Structures 2-12 5-6 Design Examples 5-18
5-7 Important Sequential Networks 5-26
3. Number Systems and Codes 3-1 6. The Arithmetic-Logic Unit 6-1
3-1 Number Systems 3-1 6-1 Introduction 6-1
3-2 Binary Codes 3-5 6-2 Construction ofthe ALU 6-2
3-3 Error Detection and Correction 3-8 6-3 Integer Representation 6-3
1
CONTENTS
VI
6-4 The Binary Half Adder 6-4 7-19 Magnetic Drum Storage 7-51
6-5 The Full Adder 6-5 7-20 Parallel and Serial Operation ofa
6-6 A Parallel Binary Adder 6-7 Magnetic Drum 7-53
6-7 Positiveand Negative Numbers 6-8 7-21 Magnetic Disk Memories 7-55
—
6-8 Addition in the IS Complement 7-22 Flexible Disk Storage Systems the
System 6-9 Floppy Disk 7-60
6-9 Addition in the 2S Complement 7-23 Magnetic Tape 7-63
System 6-10 7-24 Tape Cassettes and Cartridges 7-69
6-10 Addition and Subtraction in a Parallel 7-25 Magnetic Bubble and CCD
Arithmetic Element 6-12 Memories 7-71
6-11 Full Adder Designs 6-14 7-26 Digital Recording Techniques 7-72
6-12 The Binary-Coded-Decimal (BCD) 7-27 Return-to-Zero and Return-to-Bias
Adder 6-16 RecordingTechniques 7-73
6-13 Positiveand Negative BCD 7-28 Non-Return-to-Zero Recording
Numbers 6-19 Techniques 7-75
6-14 Addition and Subtraction in the 9S
Complement System 6-19
8. Software 8-1
6-15 The Shift Operation 6-24
6-16 Basic Operations 6-25 8-1 Introduction 8-1
6-17 Binary Multiplication 6-27 8-2 Languages and Translators 8-2
6-18 Decimal Multiplication 6-31 8-3 Loaders 8-4
6-19 Division 6-32 8-4 Linkers 8-7
6-20 Logical Operations 6-37 8-5 Operating Systems 8-10
6-21 Floating-Point Number Systems 6-40
6-22 Performing Arithmetic Operations with
9. Input, Output, and Secondary
Floating-Point Numbers 6-44
Storage Devices 9-1
9-1 Introduction 9-1
7. The Memory Element 7-1
9-2 Input-Output Devices 9-2
7-1 Introduction 7-2 9-3 Long-Term Storage and Intermediate
7-2 Random-Access Memories 7-3 Input-Output 9-8
7-3 Linear-Select Memory 9-4 Medium-Term Storage Devices 9-16
Organization 7-5 9-5 Speed and Capacity Comparisons 9-19
7-4 Decoders 7-9
7-5 Dimensions of Memory Access 7-1
10. Timesharing Systems 10-1
7-6 Connecting Memory Chips to a
Computer Bus 7-16 10-1 Introduction 10-1
7-7 Random-Access Semiconductor 10-2 The User Viewpoint and Some
Memories 7-21 Consequences 10-3
7-8 Bipolar IC Memories 7-22 10-3 ChoiceofTime Slice 10-9
7-9 Static MOS Memories 7-26 10-4 The MIT CTSS System 10-10
7-10 Dynamic Memories 7-29 10-5 The APL System 10-12
7-11 Read-Only Memories 7-31 10-6 Performance Measurement 10-16
7-12 Magnetic Core Storage 7-37 10-7 A Timesharing System Simulator
7-13 Storage of Information in Magnetic 10-19
Cores in a Two-Dimensional 10-8 IBM Timesharing Option (TSO) For
Array 7-40 System/360/370 10-28
7-14 Assembly ofCore Planes into a Core 10-9 The G.E. Information Service
Memory 7-42 Network 10-35
7-15 Timing Sequence 7-44
7-16 Driving the X- and Y-Selection
11. Assembly and System Level
Lines 7-46
Programming 11-1
7-17 Memory Buffer Register and Associated
Circuitry 7-17 11-1 Introduction 11-1
7-18 Core-Memory Organization and Wiring 11-2 The Raw Machine: Initial Program
Schemes 7-49 Load 11-2
