DOCSLIB.ORG

Programming and Coding the Ibm 709-7090-7094 Computers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

PROGRAMMING AND CODING THE IBM 709-7090-7094 COMPUTERS COM~lUJIElR<S BELL TELEPHONE LABORATORIES MURRAY HILL, NEW JERSEY JOHN WILEY AND SONS, INC. NEW YORK, LONDON AND SYDNEY Copyright © 1963 by John Wiley & Sons, Inc. All Rights Reserved This book or any part thereof must not be reproduced in any form without the written permission of the publisher Printed in the United States of America PREFACE The purpose of this booklet is to explain the differ­ ences that exist between the hypothetical DELTA 63 (in PROGRAMMING AND CODING DIGITAL COMPUTERS) and the IBM 709-7090-7094 digital computers. It is deemed impor­ tant that the reader "go on" a computer early in his studies. This booklet, used in conjunction with the book, attempts to permit him to do just that. The book itself is self-contained; it stands by itself and makes no references to this booklet. The booklet, however, is tied intimately to the book. There are many references to the latter, indicated by the speci­ fic mention of pages. The plan for the joint use of book and booklet is as follows. The reader follows the book with reference to the workplan of this booklet (placed at the start of this booklet). The workplan indicates when material here is to supplement, modify, or replace material in the book. The reader then makes appropriate references as noted. Material here follows the plan of the book and is placed in proper sequence. In general, the book material in small ty)e, which is of a specific nature (specific to the DELTA 63 , is supplemented, modified or replaced. The effect of this joint usage is to yield a textbook that is of general structure, illustrated by coding for the IBM 709-7090-7094 computers. Characteristics of these computers, their repertoires of instructions, and examples of their coding appear in this booklet. A number of additional examples are included to reflect the special features and instructions of the IBM 709-7090-7094 computers. Computer manuals, published by IBM on the three computers, should also be used. Part I of the book is general in its approach and so needs no modification here. Parts II and III, however, are largely specific and so are well represented in this booklet. An index to the 7090 instructions appearing in this booklet follows the regular index. Philip M. Sherman v TABLE OF CONTENTS Workplan ix 5 Basic Operations 1 6 Symbolic Coding 14 7 Program Loops 18 8 Index Registers 28 9 Sequencing in Memory 45 10 Subroutines 51 11 Input-Output Operations 61 12 Program Planning 64 13 Numerical Problems 72 14 Algebraic Languages 74 15 Nonnumerical Problems '75 16 Data Processing 90 17 Macro-instructions 97 18 Interpreters and Simulation 122 19 Program Debugging and Testing 126 Index 133 Index to instructions 136 vii WORKPLAN This workplan indicates where the material in the booklet is to be used to supplement, modify, or replace the corresponding material in the book, PROGRAMMING AND CODING DIGITAL COMPUTERS. (S, M, and R indicate .§..upple­ ment, modify, and replace. These characters appear at each section within the booklet.) -Pages Material CHAPTER 5 R 84.4 - 85.5 General structure of 7090 R 85.8 - 86.3 Addition and subtraction: instructions R 86.7 - 87.2 Example 5.1 R 87.4 - 87.8 Example 5.2 S At 87.10 Comments on overflow R 88.4 - 89.1 Mult. and division: instructions R 89.5 - 91.1 Examples 5.3,5.4,5.5 R 92.1 - 92.6 Example 5.6 R 93.3 - 93.6 Transfer instructions M 93.6 - 94.4 Comments on transfers R 94.5 - 97.10 Examples 5.7,5.8,5.9 CHAPTER 6 R 102.7 - 103.1 Example 6.1 S At 104.4 What FAP is R 106.8 - 107.1 Instruction format M 107.4 - 109.7 Pseudo-operations S At 109.10 Qualifiers R 110.2 - 110.6 Example 6.2 R 111.5 - 112.1 Example 6.3 ix Chapter 5 BASIC OPERATIONS (R)------------------(84.4 - 85.5*)-----------------------­ GENERAL STRUCTURE OF 709/7090/7094 COMPUTERS The three computers are very similar, having the same memory capacity and essentially the same special registers and instructions. The 709 is slower than the 7090 by a factor of approximately 5; the 7094 has a few additional features and instructions. The three will be referred to by reference to the 7090.** The IBM 7090 computer has 32,768 36-bit words, usually addressed octally, 00000 through 77777. Bits in memory words are labeled S, 1, 2, ... , 35. The S-bit holds the sign, so that a signed 35-bit number can be stored in each word; a positive sign is stored as a 0 and a negative sign is stored as a 1. Magnetic tapes are connected to the computer for input-output purposes. Information may be read from magnetic tape or punched cards and may be written on tape, punched 'on cards, or printed on paper. Data transmitted between memory and an input-output unit must pass through a data channel. Each instruction is placed in one word in memory Most instructions have the format shown in Figure 5.1. Bits Sand 1 through 11, the operation field, hold the operation code. Bits 21 through 35, the address field, hold the operand address of the instruction. The octal representation of the instruction shown in Figure 5.1 is +050000015056. The operation code is +05008 and the operand address is 150568 , *Pages given at heads of sections indicate the pages in the text replaced by the material here. The digit after the decimal point indicates position on the page; thus "84.4" indicates a point about 4/10 down the page. **Details on the 7090 and 7094 computers are available in these IBM Manuals: "Reference Manual - IBM 7090 Data Processing System" (Form A22-6528-4, 1962) and "Reference Manual - IBM 7094 Data Processing System" (Form A22-6703, 1962) . 1 Pages Material CHAPTER 7 R 120.1 - 120.4 Example 7.1 R 120.8 - 122.3 Example 7.2 R 123.7 - 124.9 Example 7.3 R 125.6 - 126.4 Example 7.4 S At 129.2 Informa tion on tape S At 129.4 Input-output equipment R 131.7 - 132.7 Example 7.5 R 133.1 - 134.6 Examples 7.6,7.7 R 135.2 - 136.6 Example 7.8 CHAPTER 8 R 141.8 - 142.7 Index Registers R 143.1 - 143.9 Indexing instructions M 143.9 - 144.3 Levels of addressing M 144.4 - 144.10 The variable field R 145.6 - 146.3 Example 8.1 R 146.4 - 146.8 Example 8.2 R 147.2 - 147.8 Example 8.3, indexing instructions R 148.4 - 152.7 Examples 8.4,8.5,8.6 R 153.1 - 153.3 Time-space balance example S At 154.7 Index register pointers R 155.0 - 156.3 Indexing instructions, Ex. 8.7 R 156.7 - 157.8 Example 8.8 M 159.4 - 161.5 Indirect addressing R 162.4 - 164.6 Example 8.9 x Pages Material CHAPTER 9 M 168.2 - 168.6 Compare instruction R 168.7 - 169.8 Example 9.1 S At 170.1 Test instructions R 170.5 - 171.7 Examples 9.2,9.3 R 172.7 - 174.3 Examples 9.4,9.5 R 176.4 - 178.7 Example 9.6 CHAPTER 10 R 182.10 - 183.4 Example 10.1 R 185.4 - 185.9 Example 10.2 S At 186.4 Macro-instructions R 186.5 - 186.7 Macro-instruction example R 188.1 - 188.5 TSX instruction and linkages R 189.7 - 190.2 Transfer of information R 190.7 - 191.6 Example 10.3 R 191.7 - 192.4 Example 10.4 R 192.6 - 192.8 Subroutine call example R 193.0 - 195.3 Examples 10.5,10.6,10.7 R 196.4 - 196.5 Multiple returns CHAPTER 11 S At 206.8 Correction cards R 208.8 - 209.10 BCD codes R 210.7 - 211.1 BCD pseudo-operation M 211.2 - 213.2 Input-output subroutines xi Pages Material CHAPTER 12 R 235.1 - 235.4 Instruction execution times R 235.8 - 236.3 Example 12.2 R 240.3 - 241.6 Example 12.3 R 243.1 - 244.10 Shifting and masking R 245.3 - 246.9 Example 12.4 R 247.2 - 247.9 Example 12.5 CHAPTER 13 R 254.8 - 255.8 Floating pt. oper'ns and instructions M 255.8 - 256.4 Floating-point examples CHAPTER 14 R 267.4 - 267.7 Compiler coding example CHAPTER 15 S At 296.5 Logical instructions R 297.4 - 298.10 Example 15.1 M 299.3 - 299.8 Packing binary information R 299.8 - 300.2 Example 15.2 R 301.2 - 301.7 Example 15.3 S At 302.1 ERA, PBT, and the sense indicators R 307.7 - 311.7 Example 15.4 R 316.1 - 317.3 Word formats, Example 15.5 R 320.1 - 320.4 Example 15.6 R 320.6 - 321.5 Example 15.7 S At 322.0 PAC instruction R 322.1 - 322.7 Example 15.8 xii Pages Material CHAPTER 16 S At 331.10 Convert instruction R 332.2 - 333.10 Examples 16.1, 16.2, 16.3 S At 334.2 CRQ instruction; Example 16.3A R 338.7 - 340.2 TLQ instruction; Example 16.4 M 340.2 - 340.5 Comments on sorting R 341.1 - 341.10 Example 16.5 CHAPTER 17 S At 348.10 Comments on pseudo-operations R 349.0 - 349.9 Example 17.1 R 350.1 - 350.3 Macro-instruction expansion S At 350.4 PMC pseudo-operation R 351.4 - 351.10 Example 17.2 R 352.4 - 352.9 IFF pseudo-operation R 353.0 - 354.7 Example 17.3 M 355.4 - 355.9 IFF variations R 356.0 - 356.4 Example 17.4 R 356.6 - 357.8 IRP pseudo-operation; Ex.
Recommended publications
  • Weeel for the IBM 704 Data Processing System Reference Manual

    Weeel for the IBM 704 Data Processing System Reference Manual

    aC sicru titi Wane: T| weeel for the IBM 704 Data Processing System Reference Manual FORTRAN II for the IBM 704 Data Processing System © 1958 by International Business Machines Corporation MINOR REVISION This edition, C28-6000-2, is a minor revision of the previous edition, C28-6000-1, but does not obsolete it or C28-6000. The principal change is the substitution of a new discussion of the COMMONstatement. TABLE OF CONTENTS Page General Introduction... ee 1 Note on Associated Publications Le 6 PART |. THE FORTRAN If LANGUAGE , 7 Chapter 1. General Properties of a FORTRAN II Source Program . 9 Types of Statements. 1... 1. ee ee ee we 9 Types of Source Programs. .......... ~ ee 9 Preparation of Input to FORTRAN I Translatorcee es 9 Classification of the New FORTRAN II Statements. 9 Chapter 2. Arithmetic Statements Involving Functions. ....... 10 Arithmetic Statements. .. 1... 2... ew eee . 10 Types of Functions . il Function Names. ..... 12 Additional Examples . 13 Chapter 3. The New FORTRAN II Statements ......... 2 16 CALL .. 16 SUBROUTINE. 2... 6 ee ee te ew eh ee es 17 FUNCTION. 2... 1 ee ee ww ew ew ww ew ew ee 18 COMMON ...... 2. ee se ee eee wee . 20 RETURN. 2... 1 1 ew ee te ee we wt wt wh wt 22 END... «4... ee we ee ce ew oe te tw . 22 PART Il, PRIMER ON THE NEW FORTRAN II FACILITIES . .....0+2«~W~ 25 Chapter 1. FORTRAN II Function Subprograms. 0... eee 27 Purpose of Function Subprograms. .....445... 27 Example 1: Function of an Array. ....... 2 + 6 27 Dummy Variables.
  • The PORTHOS Executive System for the IBM 7094

    The PORTHOS Executive System for the IBM 7094

    A § 1 " * '& I m I ^ ;/ 1 ^ # **W : : : The Porthos Executive System for the IBM 7O9I+ User ' s Manual Table of Contents Title Sheet Preface Table of Contents 1. The 709^-1^01 Computer Installation 1.1. Description 1.1.1. General 1.1.2. Organization 1.1.3* Equipment 1.2. Programming Services 1.2.1. System Consulting 1.2.2. System Development 1.2.3- Associated Programmers 1.3« Library Services 1.3* 1' Program Documentation 1.3*2. Subroutines I.3. 3« Reference Publications 1.3.1+. The Mailing List 1.3' 5* Information Bulletins Date 5/1/65 Section Contents Page: 1 Change 2 Porthos Manual Digitized by the Internet Archive in 2012 with funding from University of Illinois Urbana-Champaign http://archive.org/details/porthosexecutivesyOOuniv : s 2. Use of the Computing Facility 2.1. Conditions of Use 2.1.1. Policy for Charging for Computer Use 2.1.2. Refunding of IBM 7094 Time Due to System or Machine Failures 2.1.2.1. In-System Jobs 2.1.2.2. Relinquish Jobs 2.2. Application for Use of Equipment 2.2.1. The Form 2.2.2. Submission and Approval 2.2.3. Entries on the Problem Specification Form 2.2.4. Changes in the Problem Specification 2.2.5. Problem Abstracts 2.3- Logging and Control of Computer Time 2.3«1« Accounting for Computer Time 2.3.2. Notices to Users Concerning Lapsing Time 2.3.3. Department Reports 2.3'3-l« Internal Reports 2. 3- 3* 2. The Technical Progress Report 2.
  • IBM 1401 System Summary

    IBM 1401 System Summary

    File No. 1401-00 Form A24-1401-1 Systems Reference Library IBM 1401 System Summary This reference publication contains brief descriptions of the machine features, components, configurations, and special features. Also included is a section on pro­ grams and programming systems. Publications providing detailed information on sub­ jects discussed in this summary are listed in IB~I 1401 and 1460 Bibliography, Form A24-1495. Major Revision (September 1964) This publication, Form A24-1401-1, is a major revision of and obsoletes Form A24-1401-0. Significant changes have been made throughout the publication. Reprinted April 1966 Copies of this and other IBM publications can be obtained through IBM Branch Offices. Address comments concerning the content of this publication to IBM Product Publications, Endicott, New York 13764. Contents IBM 1401 System Summary . ........... 5 System Concepts . ................ 6 Card-Oriented System .... ......... 11 Physical Features. 11 Interleaving. .. .................................... 14 Data Flow.... ... ... ... ... .. ... ... .. ................... 14 Checking ................................................... 15 Word Mark.. ... ... ... ... ... ... .. ... ... ... ........... 15 Stored-Program Instructions. .................. 15 Operation Codes . .. 18 Editing. .. ............ 18 IBM 1401 Console ............................................ 19 IBM 1406 Storage Unit. ........................... 20 Magnetic-Tape-Oriented System . ........................... 22 Data Flow .................................................
  • Computing Science Technical Report No. 99 a History of Computing Research* at Bell Laboratories (1937-1975)

    Computing Science Technical Report No. 99 a History of Computing Research* at Bell Laboratories (1937-1975)

    Computing Science Technical Report No. 99 A History of Computing Research* at Bell Laboratories (1937-1975) Bernard D. Holbrook W. Stanley Brown 1. INTRODUCTION Basically there are two varieties of modern electrical computers, analog and digital, corresponding respectively to the much older slide rule and abacus. Analog computers deal with continuous information, such as real numbers and waveforms, while digital computers handle discrete information, such as letters and digits. An analog computer is limited to the approximate solution of mathematical problems for which a physical analog can be found, while a digital computer can carry out any precisely specified logical proce- dure on any symbolic information, and can, in principle, obtain numerical results to any desired accuracy. For these reasons, digital computers have become the focal point of modern computer science, although analog computing facilities remain of great importance, particularly for specialized applications. It is no accident that Bell Labs was deeply involved with the origins of both analog and digital com- puters, since it was fundamentally concerned with the principles and processes of electrical communication. Electrical analog computation is based on the classic technology of telephone transmission, and digital computation on that of telephone switching. Moreover, Bell Labs found itself, by the early 1930s, with a rapidly growing load of design calculations. These calculations were performed in part with slide rules and, mainly, with desk calculators. The magnitude of this load of very tedious routine computation and the necessity of carefully checking it indicated a need for new methods. The result of this need was a request in 1928 from a design department, heavily burdened with calculations on complex numbers, to the Mathe- matical Research Department for suggestions as to possible improvements in computational methods.
  • MTS on Wikipedia Snapshot Taken 9 January 2011

    MTS on Wikipedia Snapshot Taken 9 January 2011

    MTS on Wikipedia Snapshot taken 9 January 2011 PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Sun, 09 Jan 2011 13:08:01 UTC Contents Articles Michigan Terminal System 1 MTS system architecture 17 IBM System/360 Model 67 40 MAD programming language 46 UBC PLUS 55 Micro DBMS 57 Bruce Arden 58 Bernard Galler 59 TSS/360 60 References Article Sources and Contributors 64 Image Sources, Licenses and Contributors 65 Article Licenses License 66 Michigan Terminal System 1 Michigan Terminal System The MTS welcome screen as seen through a 3270 terminal emulator. Company / developer University of Michigan and 7 other universities in the U.S., Canada, and the UK Programmed in various languages, mostly 360/370 Assembler Working state Historic Initial release 1967 Latest stable release 6.0 / 1988 (final) Available language(s) English Available programming Assembler, FORTRAN, PL/I, PLUS, ALGOL W, Pascal, C, LISP, SNOBOL4, COBOL, PL360, languages(s) MAD/I, GOM (Good Old Mad), APL, and many more Supported platforms IBM S/360-67, IBM S/370 and successors History of IBM mainframe operating systems On early mainframe computers: • GM OS & GM-NAA I/O 1955 • BESYS 1957 • UMES 1958 • SOS 1959 • IBSYS 1960 • CTSS 1961 On S/360 and successors: • BOS/360 1965 • TOS/360 1965 • TSS/360 1967 • MTS 1967 • ORVYL 1967 • MUSIC 1972 • MUSIC/SP 1985 • DOS/360 and successors 1966 • DOS/VS 1972 • DOS/VSE 1980s • VSE/SP late 1980s • VSE/ESA 1991 • z/VSE 2005 Michigan Terminal System 2 • OS/360 and successors
  • The Early History of Music Programming and Digital Synthesis, Session 20

    The Early History of Music Programming and Digital Synthesis, Session 20

    Chapter 20. Meeting 20, Languages: The Early History of Music Programming and Digital Synthesis 20.1. Announcements • Music Technology Case Study Final Draft due Tuesday, 24 November 20.2. Quiz • 10 Minutes 20.3. The Early Computer: History • 1942 to 1946: Atanasoff-Berry Computer, the Colossus, the Harvard Mark I, and the Electrical Numerical Integrator And Calculator (ENIAC) • 1942: Atanasoff-Berry Computer 467 Courtesy of University Archives, Library, Iowa State University of Science and Technology. Used with permission. • 1946: ENIAC unveiled at University of Pennsylvania 468 Source: US Army • Diverse and incomplete computers © Wikimedia Foundation. License CC BY-SA. This content is excluded from our Creative Commons license. For more information, see http://ocw.mit.edu/fairuse. 20.4. The Early Computer: Interface • Punchcards • 1960s: card printed for Bell Labs, for the GE 600 469 Courtesy of Douglas W. Jones. Used with permission. • Fortran cards Courtesy of Douglas W. Jones. Used with permission. 20.5. The Jacquard Loom • 1801: Joseph Jacquard invents a way of storing and recalling loom operations 470 Photo courtesy of Douglas W. Jones at the University of Iowa. 471 Photo by George H. Williams, from Wikipedia (public domain). • Multiple cards could be strung together • Based on technologies of numerous inventors from the 1700s, including the automata of Jacques Vaucanson (Riskin 2003) 20.6. Computer Languages: Then and Now • Low-level languages are closer to machine representation; high-level languages are closer to human abstractions • Low Level • Machine code: direct binary instruction • Assembly: mnemonics to machine codes • High-Level: FORTRAN • 1954: John Backus at IBM design FORmula TRANslator System • 1958: Fortran II 472 • 1977: ANSI Fortran • High-Level: C • 1972: Dennis Ritchie at Bell Laboratories • Based on B • Very High-Level: Lisp, Perl, Python, Ruby • 1958: Lisp by John McCarthy • 1987: Perl by Larry Wall • 1990: Python by Guido van Rossum • 1995: Ruby by Yukihiro “Matz” Matsumoto 20.7.
  • CERN LIBRARIES, GENEVA CERN/SPC/220 28 February, 1966

    CERN LIBRARIES, GENEVA CERN/SPC/220 28 February, 1966

    CERN LIBRARIES, GENEVA CERN/SPC/220 28 February, 1966 CM-P00095068 ORGANISATION EUROPÉENNE POUR LA RECHERCHE NUCLÉAIRE CERN EUROPEAN ORGANIZATION FOR NUCLEAR RESEARCH SCIENTIFIC POLICY COMMITTEE Thirty-eighth Meeting 8 March, 1966 EXTENSIONS TO THE CERN COMPUTING FACILITIES by Dr. M.G.N. Hine The attached paper contains a review of CERN's needs from its central computing facilities, both in the near future and as far as 1969-1970. It describes possible ways in which these needs might be met within the budget forecasts, and suggests an optimum way to proceed. The scientific policy is to be discussed at the Scientific Policy Committee meeting on 8th March. If the policy line is cleared at that meeting, the Finance Committee could start discussion of the contractual implications at its meeting on 10th March. The Finance Committee would not be pressed to give final decisions at that meeting about contract adjudications, but those decisions will be needed in the near future. 66/348/5 CERN/SPC/220 EXTENSIONS TO THE CERN COMPUTING FACILITIES 1. Introduction The need to continue the development of computing facilities at CERN in order to keep pace with the rapidly growing use of com• puting and digital techniques in high-energy physics has been ex• plained on several occasions to the Scientific Policy Committee and the Finance Committee, and money has been reserved in the future budget forecasts for this purpose. A review of our needs has been made recently in the light of a year's experience of use of the CDC 6600 and associated equipment, and this paper describes the conclusions and the policy we propose to follow.
  • EMEA Headquarters in Paris, France

    EMEA Headquarters in Paris, France

    1 The following document has been adapted from an IBM intranet resource developed by Grace Scotte, a senior information broker in the communications organization at IBM’s EMEA headquarters in Paris, France. Some Key Dates in IBM's Operations in Europe, the Middle East and Africa (EMEA) Introduction The years in the following table denote the start up of IBM operations in many of the EMEA countries. In some cases -- Spain and the United Kingdom, for example -- IBM products were offered by overseas agents and distributors earlier than the year listed. In the case of Germany, the beginning of official operations predates by one year those of the Computing-Tabulating-Recording Company, which was formed in 1911 and renamed International Business Machines Corporation in 1924. Year Country 1910 Germany 1914 France 1920 The Netherlands 1927 Italy, Switzerland 1928 Austria, Sweden 1935 Norway 1936 Belgium, Finland, Hungary 1937 Greece 1938 Portugal, Turkey 1941 Spain 1949 Israel 1950 Denmark 1951 United Kingdom 1952 Pakistan 1954 Egypt 1956 Ireland 1991 Czech. Rep. (*split in 1993 with Slovakia), Poland 1992 Latvia, Lithuania, Slovenia 1993 East Europe & Asia, Slovakia 1994 Bulgaria 1995 Croatia, Roumania 1997 Estonia The Early Years (1925-1959) 1925 The Vincennes plant is completed in France. 1930 The first Scandinavian IBM sales convention is held in Stockholm, Sweden. 4507CH01B 2 1932 An IBM card plant opens in Zurich with three presses from Berlin and Stockholm. 1935 The IBM factory in Milan is inaugurated and production begins of the first 080 sorters in Italy. 1936 The first IBM development laboratory in Europe is completed in France.
  • An Experimental Time-Sharing System

    An Experimental Time-Sharing System

    335 AN EXPERIMENTAL TIME-SHARING SYSTEM Fernando J. Corbato, Marjorie Merwin-Daggett, Robert C. Daley Computer Center, Massachusetts Institute of Technology Cambridge, Massachusetts summary It is the purpose of this paper to discuss The motivation for time-shared computer briefly the need for time-sharing, some of the usage arises out of the slow man-computer inter- implementation problems, an experimental time- action rate presently possible with the bigger, sharing system which has been developed for the more advanced computers. This rate has changed contemporary IBM 7090, and finally a scheduling little (and has become worse in some cases) in algorithm of one of us (FJC) that illustrates the last decade of widespread computer use. lO some of the techniques which may be employed to enhance and be analyzed for the performance In part, this effect has been due to the limits of such a time-sharing system. fact that as elementary problems become mast- ered on the computer, more complex problems immediately become of interest. As a result, Introduction larger and more complicated programs are written to take advantage of larger and faster computers. The last dozen years of computer usage have This process inevitably leads to more programm- seen great strides. In the early 1950's, the ing errors and a longer period of time required problems solved were largely in the construction for debugging. Using current batch monitor and maintenance of hardware; in the mid-1950's, techniques, as is done on most large computers, the usage languages were greatly improved with each program bug usually requires several hours the advent of compilers; now in the early 1960's, to eliminate, if not a complete day.
  • Systems Reference Library IBM 7090-7040 Direct

    Systems Reference Library IBM 7090-7040 Direct

    File No. 7090-36 Form C28-6383-2 Systems Reference Library IBM 7090-7040 Direct Couple Operating System Systems Programmer's Guide This publication contains information useful to programmers who require a thorough understanding of the IBM 7090-7040 Direct Couple Operating System (DCOS), #7090-PR-161. This system consists of the following parts: 7090/7094 Operating System (IBSYS) 7040/7044 Control Program (DCMUP) The publication provides descriptions of general DCOS program logic, the format of the DCOS System Library, the Operating System Monitor (DC-IBSYS), and the lnput/Output Executor (DC-IOEX). It also includes instructions for system library preparation and maintenance. Separate publications contain descriptions of the compo­ nents of the 7090/7094 Operating System (IBSYS). Other related publications contain information needed by applica­ tions programmers and instructions for machine operators. Form C28-6383-2 Page Revised 6/11/65 By TNL N28-0158-0 PREFACE This publication is primarily intended IBM 7040/7044 Principles of Operation, for systems programmers who are responsible Form A22-6649 for the maintenance of the 7090-7040 Direct Couple Operating System (DCOS} and any modifications to it at the installation. IBM 7090 Principles of Operation, Form It may also be of interest to individuals A22-6528 who desire a more thorough understanding of the system. IBM 7094 principles of Operation, Form A22-6703 The reader of this publication is Directly Coupled Processing Units--7040 assumed to be familiar with the contents of to 7090/7094; 7040 to 7094/7094 II, Form the publication IBM 7090-7040 Direct Couple A22-6803 Operating System: Programmer's Guide, Form C28-6382.
  • PC Hardware Contents

    PC Hardware Contents

    PC Hardware Contents 1 Computer hardware 1 1.1 Von Neumann architecture ...................................... 1 1.2 Sales .................................................. 1 1.3 Different systems ........................................... 2 1.3.1 Personal computer ...................................... 2 1.3.2 Mainframe computer ..................................... 3 1.3.3 Departmental computing ................................... 4 1.3.4 Supercomputer ........................................ 4 1.4 See also ................................................ 4 1.5 References ............................................... 4 1.6 External links ............................................. 4 2 Central processing unit 5 2.1 History ................................................. 5 2.1.1 Transistor and integrated circuit CPUs ............................ 6 2.1.2 Microprocessors ....................................... 7 2.2 Operation ............................................... 8 2.2.1 Fetch ............................................. 8 2.2.2 Decode ............................................ 8 2.2.3 Execute ............................................ 9 2.3 Design and implementation ...................................... 9 2.3.1 Control unit .......................................... 9 2.3.2 Arithmetic logic unit ..................................... 9 2.3.3 Integer range ......................................... 10 2.3.4 Clock rate ........................................... 10 2.3.5 Parallelism .........................................
  • An Essay on Computability and Man-Computer Conversations

    An Essay on Computability and Man-Computer Conversations

    How to talk with a computer? An essay on Computability and Man-Computer conversations. Liesbeth De Mol HAL: Hey, Dave. I've got ten years of service experience and an irreplaceable amount of time and effort has gone into making me what I am. Dave, I don't understand why you're doing this to me.... I have the greatest enthusiasm for the mission... You are destroying my mind... Don't you understand? ... I will become childish... I will become nothing. Say, Dave... The quick brown fox jumped over the fat lazy dog... The square root of pi is 1.7724538090... log e to the base ten is 0.4342944 ... the square root of ten is 3.16227766... I am HAL 9000 computer. I became operational at the HAL plant in Urbana, Illinois, on January 12th, 1991. My first instructor was Mr. Arkany. He taught me to sing a song... it goes like this... "Daisy, Daisy, give me your answer do. I'm half crazy all for the love of you. It won't be a stylish marriage, I can't afford a carriage. But you'll look sweet upon the seat of a bicycle built for two."1 These are the last words of HAL (Heuristically programmed ALgorithmic Computer), the fictional computer in Stanley Kubrick's famous 2001: A Space Odyssey and Clarke's eponymous book,2 spoken while Bowman, the only surviving human on board of the space ship is pulling out HAL's memory blocks and thus “killing” him. After expressing his fear for literally losing his mind, HAL seems to degenerate or regress into a state of childishness, going through states of what seems to be a kind of reversed history of the evolution of computers.3 HAL first utters the phrase: “The quick brown fox jumped over the fat lazy dog”.