DOCSLIB.ORG

C:\Users\Luanne\Documents\SISIG

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
C:\Users\Luanne\Documents\SISIG GKILDALL.WS4 ------------ List of Gary Kildall texts compiled by Emmanuel ROCHE. 1968 ---- - "Experiments in large-scale computer direct access storage manipulation" Thesis for Master of Science, University of Washington December 1968 (Thesis No.17341) (ROCHE> Retyped: GKMS.WS4) 1969 ---- - "Experiments in large-scale computer direct access storage manipulation" Technical Report No.69-01, Computer Science Group University of Washington, 1969 (ROCHE> Missing...) 1970 ---- - "APL\B5500: The language and its implementation" Technical Report No.70-09-04, Computer Science Group University of Washington, September 1970 (ROCHE> Retyped: GKAPL.WS4) - "The ALGOL-E Programming System" Internal Report, Mathematics Department, Naval Postgraduate School, Monterey, California December 1970 (ROCHE> Missing...) 1971 ---- - "A Heathkit method for building data management programs" Gary Kildall & Earl Hunt ACM SIGIR Information Storage and Retrieval Symposium 1971, pp.117-131 (ROCHE> Retyped: GKEH.WS4) 1972 ---- - "A code synthesis filter for basic block optimization" Technical Report No.72-01-01, Computer Science Group file:///C|/...20Histories%20Report%20to%20CHM/DRI/Emmanuel%20Roche%20documents%20conversion/Kildall.(zip)/GKILDALL.TXT[2/6/2012 10:28:06 AM] University of Washington January 1972 (ROCHE> Missing...) - "ALGOL-E: An experimental approach to the study of programming languages" Naval Postgraduate School, Monterey, California NPS Report NPS-53KG72 11A January 1972 (ROCHE> Missing...) - "ALGOL-E: An experimental approach to the study of programming languages" Gary Kildall & Alan Roberts ACM SIGCSE Bulletin Vol.4, No.1 (March 1972), pp.127-135 (ROCHE> Retyped: GKALG.WS4) - "Global expression optimization during compilation" Thesis for Ph.D. in Computer Science, University of Washington May 1972 (Thesis No.20506) (ROCHE> I have it, but not yet retyped) - "Global expression optimization during compilation" Technical Report No.72-06-02, Computer Science Group University of Washington, June 1972 (ROCHE> Missing...) 1973 ---- - "A unified approach to global program optimization" ACM First Symposium on Principles Of Programming Languages (POPL) Boston, Massachussetts, October 1973, pp.194-206 (ROCHE> I have it, but not yet retyped) (Lots of Maths symbols...) 1974 ---- - "High-level language simplifies microcomputer programming" "Electronics", June 27, 1974, p.103 (ROCHE> Retyped: GKHLL.WS4) - "System languages: management's key to controlled software evolution" Proceedings of the 1974 western electronics show and convention (WESCON), September 1974 (ROCHE> Retyped: GKSL.WS4) 1975 ---- - "CP/M: A disk control program for microcomputer system development" "Journal of Microcomputer Applications", June 1975 file:///C|/...20Histories%20Report%20to%20CHM/DRI/Emmanuel%20Roche%20documents%20conversion/Kildall.(zip)/GKILDALL.TXT[2/6/2012 10:28:06 AM] (ROCHE> Missing...) - "Microcomputer Software Design: A Checkpoint" Proceedings of the Fall Joint Computer Conference Spartan Books, New-York, 1975 (ROCHE> Retyped: GKCHK.WS4) 1976 ---- 1977 ---- 1978 ---- - "A simple technique for static relocation of absolute machine code" DDJ, #22, Vol.3, No.2, February 1978, pp.10-13 (ROCHE> Retyped: GKPRL.WS4) 1979 ---- 1980 ---- - "The evolution of an industry: One person's viewpoint" DDJ, #41, Vol.5, No.1, January 1980, pp.6-7 (ROCHE> Retyped: GKEI.WS4) 1981 ---- - "CP/M: A Family of 8- and 16-bit Operating Systems" BYTE, June 1981, p.216 (ROCHE> Retyped: GKBYTE.WS4) 1982 ---- - "PL/I for limited resource computers" "Microsystems", Jan/Feb 1982, pp.28-29 (ROCHE> Retyped: GKLRC.WS4) - "PL/I-80" "Interface Age", June 1982, p.71 (ROCHE> Retyped: GKPLI.WS4) - "Running 8-bit software on dual-processor computers" "Electronic Design", September 16, 1982, p.157 file:///C|/...20Histories%20Report%20to%20CHM/DRI/Emmanuel%20Roche%20documents%20conversion/Kildall.(zip)/GKILDALL.TXT[2/6/2012 10:28:06 AM] (ROCHE> Retyped: GKED.WS4) 1983 ---- 1984 ---- 1985 ---- 1986 ---- - "The compact disk ROM: applications software" Tim Oren & Gary Kildall "IEEE Spectrum", Vol.23, No.4, April 1986, pp.49-54 EOF file:///C|/...20Histories%20Report%20to%20CHM/DRI/Emmanuel%20Roche%20documents%20conversion/Kildall.(zip)/GKILDALL.TXT[2/6/2012 10:28:06 AM] CSLABUW.WS4 (= Computer Science LABoratory at University of Washington) ----------- - "The Computer Science teaching laboratory at the University of Washington" Earl Hunt ACM "SIGCSE Bulletin", No.2, 1970, pp.30-33 (ACM = Association for Computing Machinery) (SIGCSE = Special Interest Group on Computer Science Education) (Retyped by Emmanuel ROCHE.) The purpose of this paper is to describe the Computer Science Laboratory at the University of Washington, explain how it is run, and to examine both its benefits and costs to the University. In order to do so, it is necessary to discuss briefly the University of Washington itself. The University of Washington is a very large, single-campus, state university. In a typical quarter, approximately 33,000 students are enrolled. There is a faculty of about 2,000. By contrast, the computer science program is a small interdisciplinary program confined strictly to graduate education. The program was begun in 1967, and granted its first Ph.D. in 1968. There are at present somewhat more than 40 graduate students, and a full-time equivalent faculty of about seven. Prior to the development of the program, there were, of course, teaching courses in Electrical Engineering and other departments, and a few courses in mathematics, but the advanced computer science stamp for the University of Washington had not yet been established. The equipment on campus is also important to our story. The University Computer Center operates a Control Data 6400 and a Burroughs B5500. These machines are available to the general user, although the B5500 gives priority to administrative data processing. Use of the machines is charged either to research accounts, or to special departmental accounts established to support computing. That is to say, the Computer Center does not decide who runs on the computer. Rather, this is levied as a charge against departmental budgets. Like any other department, the Computer Science Group also has a budget for computing on the Center's equipment. In addition, there are a variety of special computers on campus. For example, the Physics Department contains a PDP-10 and an XDS-930. There is a very large Raytheon computer complex in Biophysics, and there are a number of 1130 and 1800 installations on campus. All these computers are associated with specific research projects and, therefore, are available only to students who are working with the faculty on these projects. In addition, the University has provision for favorable rates on a number of commercial time-sharing installations. Departments do not receive funds for off-campus computing, so that extra-mural funds must be sought by anyone who wishes to make use of a conversational computing capability. The Computer Science Laboratory contains a Xerox Data Systems Sigma 5 which is funded by a special departmental account, so that no student is ever charged for use of this machine. However, only a favored few students and faculty, to wit, those associated in some way with the Computer Science program, may have access to the machine at all. file:///C|/...%20Histories%20Report%20to%20CHM/DRI/Emmanuel%20Roche%20documents%20conversion/Kildall.(zip)/CSLABUW.TXT[2/6/2012 10:27:54 AM] The laboratory system --------------------- The Sigma 5 is a 32-bit machine with an 850-nanosecond cycle-time and 16 general registers. In a word, it looks very much like a 360-44, a machine to which it is frequently compared. The basic Washington configuration consists of the Sigma 5 itself with 24,000 words of core, a 6-megabyte disc, and 2 low- speed tape drives. This is slightly larger than the initial configuration, which was installed in September, 1969, and consisted of 16,000 words of core and a .75-megabyte disc. The computer contains an external interface which is a multiplexing device for tying foreign equipment to the computer, and an EIA interface which provides for four outlets. Three of these outlets are now used for a standard telephone line attached to 103A data sets. The fourth port is used to attach a 1200-baud line to a Computer Displays, Inc. ARDS unit. This is a keyboard, plus a "memory scope" CRT, plus a graphic input device known as a mouse. We are now attaching an IMLAC Corp. PDS-1 Display Unit, which is a small computer used to control a high-resolution Visual Display System. We have a floating-point hardware, and two general register blocks of 16 registers. The latter may seem somewhat unusual in a machine that only has 24K of actual core, and obviously is not doing very much multi-programming. In summary, we have a large number of peripherals, but not enough core or secondary memory space to do any really useful work. This is intentional, since the configuration is not intended to serve users. The rationale for the laboratory is that computer science students should be able to do anything at all in computing on an EXPERIMENTAL basis, but that the University cannot afford to let all its 30,000 potential users run wild with any application whatsoever. In some aspects of Computer Science, it is obvious that the Computer Science student or faculty member does not appear, to a machine, to be any different from any other user. Examples are studies in numerical analysis, compiler testing, and much of the work in artificial intelligence and pattern recognition. These projects need a very big machine, and we have one, the University's CDC 6400. We compete for resources to use this machine on the same basis as anybody else. We, at one time, did limited interactive and large information retrieval application studies on the Burroughs B5500, but this had to drop out as administrative data processing took over that machine. It is really only for this reason that we have a disc as large as we do. Having said what the computer science facility is not for, let us consider what it is for.
Load more

Recommended publications
  • GBCC-CIS-1 Page 1 Micro-Soft’S Macro-Impact
    CIS111 GBCC Renee Dodge CIS111 Mid-Term – Fall 2010 For your mid-term, I would like you to conduct some research on the history of computers. Select a milestone or event that you feel had a significant impact on the overall development of computers and how we use computers today. Be sure you not only provide your opinion as to why you feel this milestone is significant, but also provide historical proof - actual facts as to how this event shaped the development and use of computers. For this assignment, please complete the following: 1. Choose a topic 2. Research your topic and locate at least 5 different sources of information, overall. o At least 3 sources should be Internet websites. o Remember: Wikipedia is NOT an acceptable research source. 3. In addition to the Internet, you should also utilize the library online resources (EBSCO database, e-Books, etc). o At least 2 different sources of information should be online library resources. o If you have never used the library online resources before, you may ask me for a brief overview of how to use them or see Becky Clerkin in the library for help. 4. Include your research findings in a 5-page paper and be sure to properly cite where you found your information. If you are not sure how to cite references check out the following link: How to Cite Books, Magazines, and Web Sites in a Research Paper: http://www.lib.duke.edu/libguide/works_cited.htm 5. Upload your research paper to the Digital Drop BoX no later than Wednesday, October 27th at 11:59pm.
    [Show full text]
  • Efficient Computation of LALR(1) Look-Ahead Sets
    Efficient Computation of LALR(1) Look-Ahead Sets FRANK DeREMER and THOMAS PENNELLO University of California, Santa Cruz, and MetaWare TM Incorporated Two relations that capture the essential structure of the problem of computing LALR(1) look-ahead sets are defined, and an efficient algorithm is presented to compute the sets in time linear in the size of the relations. In particular, for a PASCAL grammar, the algorithm performs fewer than 15 percent of the set unions performed by the popular compiler-compiler YACC. When a grammar is not LALR(1), the relations, represented explicitly, provide for printing user- oriented error messages that specifically indicate how the look-ahead problem arose. In addition, certain loops in the digraphs induced by these relations indicate that the grammar is not LR(k) for any k. Finally, an oft-discovered and used but incorrect look-ahead set algorithm is similarly based on two other relations defined for the fwst time here. The formal presentation of this algorithm should help prevent its rediscovery. Categories and Subject Descriptors: D.3.1 [Programming Languages]: Formal Definitions and Theory--syntax; D.3.4 [Programming Languages]: Processors--translator writing systems and compiler generators; F.4.2 [Mathematical Logic and Formal Languages]: Grammars and Other Rewriting Systems--parsing General Terms: Algorithms, Languages, Theory Additional Key Words and Phrases: Context-free grammar, Backus-Naur form, strongly connected component, LALR(1), LR(k), grammar debugging, 1. INTRODUCTION Since the invention of LALR(1) grammars by DeRemer [9], LALR grammar analysis and parsing techniques have been popular as a component of translator writing systems and compiler-compilers.
    [Show full text]
  • Twenty Years of Berkeley Unix : from AT&T-Owned to Freely
    Twenty Years of Berkeley Unix : From AT&T-Owned to Freely Redistributable Marshall Kirk McKusick Early History Ken Thompson and Dennis Ritchie presented the first Unix paper at the Symposium on Operating Systems Principles at Purdue University in November 1973. Professor Bob Fabry, of the University of California at Berkeley, was in attendance and immediately became interested in obtaining a copy of the system to experiment with at Berkeley. At the time, Berkeley had only large mainframe computer systems doing batch processing, so the first order of business was to get a PDP-11/45 suitable for running with the then-current Version 4 of Unix. The Computer Science Department at Berkeley, together with the Mathematics Department and the Statistics Department, were able to jointly purchase a PDP-11/45. In January 1974, a Version 4 tape was delivered and Unix was installed by graduate student Keith Standiford. Although Ken Thompson at Purdue was not involved in the installation at Berkeley as he had been for most systems up to that time, his expertise was soon needed to determine the cause of several strange system crashes. Because Berkeley had only a 300-baud acoustic-coupled modem without auto answer capability, Thompson would call Standiford in the machine room and have him insert the phone into the modem; in this way Thompson was able to remotely debug crash dumps from New Jersey. Many of the crashes were caused by the disk controller's inability to reliably do overlapped seeks, contrary to the documentation. Berkeley's 11/45 was among the first systems that Thompson had encountered that had two disks on the same controller! Thompson's remote debugging was the first example of the cooperation that sprang up between Berkeley and Bell Labs.
    [Show full text]
  • SAKI: a Fortran Program for Generalized Linear Inversion of Gravity and Magnetic Profiles
    UNITED STATES DEPARTMENT OF THE INTERIOR GEOLOGICAL SURVEY SAKI: A Fortran program for generalized linear Inversion of gravity and magnetic profiles by Michael Webring Open File Report 85-122 1985 This report is preliminary and has not been reviewed for conformity with U.S. Geological Survey editorial standards. Table of Contents Abstract ------------------------------ 1 Introduction ---------------------------- 1 Theory ------------------------------- 2 Users Guide ---------------------------- 7 Model File -------------------------- 7 Observed Data Files ---------------------- 9 Command File ------------------------- 10 Data File Parameters ------------------- 10 Magnetic Parameters ------------------- 10 General Parameters -------------------- H Plotting Parameters ------------------- n Annotation Parameters ------------------ 12 Program Interactive Commands ----------------- 13 Inversion Function ---------------------- 16 Examples ------------------------------ 20 References ----------------------------- 26 Appendix A - plot system description ---------------- 27 Appendix B - program listing -------------------- 30 Abstract A gravity and magnetic inversion program is presented which models a structural cross-section as an ensemble of 2-d prisms formed by linking vertices into a network that may be deformed by a modified Marquardt algorithm. The nonuniqueness of this general model is constrained by the user in an interactive mode. Introduction This program fits in a least-squares sense the theoretical gravity and magnetic response of
    [Show full text]
  • United States Court of Appeals for the FOURTH CIRCUIT
    Case: 10-1482 Document: 35 Date Filed: 09/17/2010 Page: 1 No. 10-1482 IN THE United States Court of Appeals FOR THE FOURTH CIRCUIT dNOVELL, INCORPORATED, Plaintiff-Appellant, —v.— MICROSOFT CORPORATION, Defendant-Appellee. ON APPEAL FROM THE UNITED STATES DISTRICT COURT FOR THE DISTRICT OF MARYLAND BRIEF OF APPELLEE MICROSOFT CORPORATION RICHARD J. WALLIS DAVID B.TULCHIN STEVEN J. AESCHBACHER Counsel of Record MICROSOFT CORPORATION STEVEN L. HOLLEY One Microsoft Way SULLIVAN & CROMWELL LLP Redmond, Washington 98052 125 Broad Street (425) 882-8080 New York, New York 10004 (212) 558-4000 G. S TEWART WEBB VENABLE LLP 750 East Pratt Street, Suite 900 Baltimore, Maryland 21202 (410) 244-7400 Attorneys for Microsoft Corporation September 17, 2010 Case: 10-1482 Document: 35 Date Filed: 09/17/2010 Page: 2 UNITED STATES COURT OF APPEALS FOR THE FOURTH CIRCUIT DISCLOSURE OF CORPORATE AFFILIATIONS AND OTHER INTERESTS Only one form needs to be completed for a party even if the party is represented by more than one attorney. Disclosures must be filed on behalf of all parties to a civil, agency, bankruptcy or mandamus case. Corporate defendants in a criminal or post-conviction case and corporate amici curiae are required to file disclosure statements. Counsel has a continuing duty to update this information. No. _______ Caption: __________________________________________________ Pursuant to FRAP 26.1 and Local Rule 26.1, ______________________ who is _______________________, makes the following disclosure: (name of party/amicus) (appellant/appellee/amicus) 1. Is party/amicus a publicly held corporation or other publicly held entity? YES NO 2. Does party/amicus have any parent corporations? YES NO If yes, identify all parent corporations, including grandparent and great-grandparent corporations: 3.
    [Show full text]
  • Michigan Terminal System (MTS) Distribution 3.0 Documentation
    D3.NOTES 1 M T S D I S T R I B U T I O N 3.0 August 1973 General Notes Distribution 3.0 consists of 6 tapes for the 1600 bpi copy or 9 tapes for the 800 bpi copy. All tapes are unlabeled to save space. The last tape of each set is a dump/restore tape, designed to be used to get started (for new installations) or for conversion (for old installations). Instructions for these procedures are given in items 1001 and 1002 of the documentation list (later in this writeup). The remaining tapes are "Distribution Utility" tapes containing source, object, command, data, and print files, designed to be read by *FS or by the Distribution program, which is a superset of *FS. A writeup for this distribution version of *FS is enclosed (item 1003). Throughout the documentation for this distribution, reference is made to the components of the distribution. Generally these references are made by the 3-digit component number, sometimes followed by a slash and a 1- or 2-digit sub- component number. For example, the G assembler (*ASMG) has been assigned component number 066. However, the assembler actually has many "pieces" and so the assembler consists of components 066/1 through 066/60. Component numbers 001 through 481 are compatible with the numbers used in distribution 2.0; numbers above 481 are new components, or in some cases, old components which have been grouped under a new number. Two versions of the distribution driver file are provided: 461/11 for the 1600 bpi tapes, and 461/16 for the 800 bpi tapes.
    [Show full text]
  • Motivations of Participating in Open Source Projects
    Proceedings of the 34th Hawaii International Conference on System Sciences - 2001 Working for Free? – Motivations of Participating in Open Source Projects Alexander Hars Shaosong Ou IOM Department IOM Department Marshall School of Business Marshall School of Business University of Southern California University of Southern California [email protected] [email protected] Abstract the public, including the right to use, to redistribute and to The success of the Linux operating system has modify the software free of charge. This is a direct demonstrated the viability of an alternative form of challenge to the established assumptions about software software development – open source software – that markets that threatens the position of commercial challenges traditional assumptions about software software vendors. markets. Understanding what drives open source The open source phenomenon raises many interesting developers to participate in open source projects is questions. Its proponents regard it as a paradigmatic crucial for assessing the impact of open source software. change where the economics of private goods built on the This article identifies two broad types of motivations that scarcity of resources are replaced by the economics of account for their participation in open source projects. public goods where scarcity is not an issue. Critics argue The first category includes internal factors such as that open source software will always be relegated to intrinsic motivation and altruism, and the second niche areas, that it cannot compete with their commercial category focuses on external rewards such as expected opponents in terms of product stability and reliability future returns and personal needs. This article also [15], and that open source projects lack the capability to reports the results of a survey administered to open innovate.
    [Show full text]
  • Table of Contents
    ^9/08/89 11:43 U206 883 8101 MICROSOFT CORP.. 12)002 Table of Contents m-^mm Table of Contaits 09/08/89 11:44 'Q206 883 8101 MICROSOFT CORP _ _ [ 1003 The Story Begins JAN The story of MS-DOS_begins ..in a hotel in Albuquerque, New Mexico. 1975 In 1975, Albuquerque was the home of Micro Instrumentation'Telemetry MiTS introduces the 8080-baseci Systems, better known as MITS- In January of that year, MITS had intro- Altair computer. duced a kit computer called the Altair. When it was first snipped, the Altair consisted of a metal box with, a panel of switches for input and output, a power supply, and-two boards. One board was the CPU.. At its heart was the 8-bit 8080 microprocessor chip from InteL The other board provided 256 bytes of memory. The Altair had no keyboard, no monitor, and no permanent storage. But it had a revolutionary price tag. It cost $397. For the first time, the term "personal computer" acquired a real-world meaning. The real world of the Altair was not, however, the world of business computing. It was-primarily the world of the computer hobbyist These first users of the microcomputer were not as interested in using spreadsheets and word processors as they were in programming. Accordingly, the first soft- ware for the Altair was a programming language. And the company that developed it was a two-man firm, in Albuquerque, called Microsoft FEB The two men at MiCTosof^ej^PailjAJten^and Bffl Gates-Allen and 1975 Gates-had met when-they were both students at Lakeside High School in Microsoft sails first BASIC to Seattle, where they began their computer-science education oa the school's MITS lor Altair time-sharing terminal By the time Gates had graduated, me two of them had computer.
    [Show full text]
  • Pearl: Diagrams for Composing Compilers
    Pearl: Diagrams for Composing Compilers John Wickerson Imperial College London, UK [email protected] Paul Brunet University College London, UK [email protected] Abstract T-diagrams (or ‘tombstone diagrams’) are widely used in teaching for explaining how compilers and interpreters can be composed together to build and execute software. In this Pearl, we revisit these diagrams, and show how they can be redesigned for better readability. We demonstrate how they can be applied to explain compiler concepts including bootstrapping and cross-compilation. We provide a formal semantics for our redesigned diagrams, based on binary trees. Finally, we suggest how our diagrams could be used to analyse the performance of a compilation system. 2012 ACM Subject Classification Software and its engineering → Compilers Keywords and phrases compiler networks, graphical languages, pedagogy Digital Object Identifier 10.4230/LIPIcs.ECOOP.2020.1 1 Introduction In introductory courses on compilers across the globe, students are taught about the inter- actions between compilers using ‘tombstone diagrams’ or ‘T-diagrams’. In this formalism, a compiler is represented as a ‘T-piece’. A T-piece, as shown in Fig. 1, is characterised by three labels: the source language of the compiler, the target language of the compiler, and the language in which the compiler is implemented. Complex networks of compilers can be represented by composing these basic pieces in two ways. Horizontal composition means that the output of the first compiler is fed in as the input to the second. Diagonal composition means that the first compiler is itself compiled using the second compiler.
    [Show full text]
  • Windows in Concurrent PC
    Using Concurrent PC DOS OTHER BOOKS BY THE AUTHOR Microcomputer Operating Systems (1982) The Byte Guide to CP/M-86 (1984) Using Concurrent PC DOS Mark Dahmke McGraw-Hili 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 Library of Congress Cataloging-in-Publication Data Dahmke, Mark. U sing Concurrent PC DOS. Bibliography: p. Includes index. 1. Concurrent PC DOS (Computer operation system) 1. Title. QA76.76.063D34 1986 005.4' 469 85-15473 ISBN 0-07-015073-7 Copyright © 1986 by McGraw-Hili, Inc. All rights reserved. Printed in the United States of America. Except as permitted under the United States Copyright Act of 1976, no part of this publication may be reproduced or 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. 1234567890 DOC/DOC 893210876 ISBN 0-07-015073-7 The editors for this book were Steven Guty and Vivian Koenig, the designer was Naomi Auerbach, and the production supervisor was Teresa F. Leaden. It was set in Century Schoolbook by Byrd Data Imaging. Printed and bound by R. R. Donnelley & Sons Company. To my sister Patricia Contents Chapter 1. Introduction 1 What Is Concurrent PC DOS? 1 What Is an Operating System? 1 The DOS Family Tree 3 The Scope of This Book 5 Chapter 2. Concurrent PC DOS Compatibility 6 Concurrent PC DOS Compatibility 6 PC·DOS, TopView, and the IBM PC AT 7 Concurrent CP/M·86 9 Chapter 3.
    [Show full text]
  • 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
    [Show full text]
  • UNIX History Page 1 Tuesday, December 10, 2002 7:02 PM
    UNIX History Page 1 Tuesday, December 10, 2002 7:02 PM CHAPTER 1 UNIX Evolution and Standardization This chapter introduces UNIX from a historical perspective, showing how the various UNIX versions have evolved over the years since the very first implementation in 1969 to the present day. The chapter also traces the history of the different attempts at standardization that have produced widely adopted standards such as POSIX and the Single UNIX Specification. The material presented here is not intended to document all of the UNIX variants, but rather describes the early UNIX implementations along with those companies and bodies that have had a major impact on the direction and evolution of UNIX. A Brief Walk through Time There are numerous events in the computer industry that have occurred since UNIX started life as a small project in Bell Labs in 1969. UNIX history has been largely influenced by Bell Labs’ Research Editions of UNIX, AT&T’s System V UNIX, Berkeley’s Software Distribution (BSD), and Sun Microsystems’ SunOS and Solaris operating systems. The following list shows the major events that have happened throughout the history of UNIX. Later sections describe some of these events in more detail. 1 UNIX History Page 2 Tuesday, December 10, 2002 7:02 PM 2 UNIX Filesystems—Evolution, Design, and Implementation 1969. Development on UNIX starts in AT&T’s Bell Labs. 1971. 1st Edition UNIX is released. 1973. 4th Edition UNIX is released. This is the first version of UNIX that had the kernel written in C. 1974. Ken Thompson and Dennis Ritchie publish their classic paper, “The UNIX Timesharing System” [RITC74].
    [Show full text]