MTS Volume 1, for Example, Introduces the User to MTS and Describes in General the MTS Operating System, While MTS Volume 10 Deals Exclusively with BASIC

Total Page:16

File Type:pdf, Size:1020Kb

MTS Volume 1, for Example, Introduces the User to MTS and Describes in General the MTS Operating System, While MTS Volume 10 Deals Exclusively with BASIC M T S The Michigan Terminal System The Michigan Terminal System Volume 1 Reference R1001 November 1991 University of Michigan Information Technology Division Consulting and Support Services DISCLAIMER The MTS manuals are intended to represent the current state of the Michigan Terminal System (MTS), but because the system is constantly being developed, extended, and refined, sections of this volume will become obsolete. The user should refer to the Information Technology Digest and other ITD documentation for the latest information about changes to MTS. Copyright 1991 by the Regents of the University of Michigan. Copying is permitted for nonprofit, educational use provided that (1) each reproduction is done without alteration and (2) the volume reference and date of publication are included. 2 CONTENTS Preface ........................................................................................................................................................ 9 Preface to Volume 1 .................................................................................................................................. 11 A Brief Overview of MTS .......................................................................................................................... 13 History .................................................................................................................................................. 13 Access to the System ............................................................................................................................ 14 The File System .................................................................................................................................... 15 Device Support ..................................................................................................................................... 15 Accounting and Billing ......................................................................................................................... 15 Bulk-Data Input and Output ............................................................................................................... 16 Virtual Memory .................................................................................................................................... 16 Resource Manager ................................................................................................................................ 17 The User’s View .................................................................................................................................... 17 Terminal Jobs .................................................................................................................................. 18 Server Connections .......................................................................................................................... 18 Batch Jobs ........................................................................................................................................ 18 Files and Editing .............................................................................................................................. 18 File and Devices Names ................................................................................................................... 19 Program Execution .......................................................................................................................... 20 MTS Command Language ................................................................................................................... 21 Debugging ........................................................................................................................................ 22 File Handling ................................................................................................................................... 22 Miscellaneous .................................................................................................................................. 23 The Editor Command Language .......................................................................................................... 24 The Debug Command Language .......................................................................................................... 24 UserIDs, Limits, and Sigfiles ................................................................................................................... 25 Passwords ............................................................................................................................................. 25 Time and Funds Limits ........................................................................................................................ 26 Page and Card Limits ........................................................................................................................... 29 Sigfiles .................................................................................................................................................. 29 Project Sigfiles ...................................................................................................................................... 30 Sigfiles and Security ............................................................................................................................ 30 Batch Use of MTS ..................................................................................................................................... 33 What is a Batch Job? .......................................................................................................................... 33 Reasons for Using Batch .................................................................................................................. 33 Submitting a Batch Job ........................................................................................................................ 34 Entering Commands in a File .......................................................................................................... 35 How Long Does Batch Take? ......................................................................................................... 35 Monitoring a Batch Job .................................................................................................................... 36 Logging Batch Output ..................................................................................................................... 36 Viewing Batch Output ..................................................................................................................... 37 Cancelling a Batch Job .................................................................................................................... 37 3 Common Errors with Batch ............................................................................................................. 37 Changing Batch Defaults ..................................................................................................................... 38 Job Selection and Rates ................................................................................................................... 39 Estimating Time and Pages ............................................................................................................. 40 Assigning a Job Name ...................................................................................................................... 41 Mounting Magnetic Tapes ............................................................................................................... 41 Setting Print Routes and Delivery Codes ........................................................................................ 41 Printed Output For Batch Jobs ............................................................................................................ 44 Head Sheet, Tail Sheet, and Job Statistics ..................................................................................... 44 Changing Print Options ................................................................................................................... 45 Cancelling Hardcopy Output ........................................................................................................... 45 Other Things You Should Know .......................................................................................................... 46 Rerunning Batch Jobs ..................................................................................................................... 46 Conditional Sign-off ......................................................................................................................... 47 Sigfile Processing ............................................................................................................................. 47 Getting Printed Output ............................................................................................................................ 49 What is *PRINT*? ............................................................................................................................. 49 When to Use $COPY and $LIST .......................................................................................................... 49 Printing Options ................................................................................................................................... 50 Setting Print Options for the Entire Session
Recommended publications
  • Getting Started Computing at the Al Lab by Christopher C. Stacy Abstract
    MASSACHUSETTS INSTITUTE OF TECHNOLOGY ARTIFICIAL INTELLI..IGENCE LABORATORY WORKING PAPER 235 7 September 1982 Getting Started Computing at the Al Lab by Christopher C. Stacy Abstract This document describes the computing facilities at the M.I.T. Artificial Intelligence Laboratory, and explains how to get started using them. It is intended as an orientation document for newcomers to the lab, and will be updated by the author from time to time. A.I. Laboratory Working Papers are produced for internal circulation. and may contain information that is, for example, too preliminary or too detailed for formal publication. It is not intended that they should be considered papers to which reference can be made in the literature. a MASACHUSETS INSTITUTE OF TECHNOLOGY 1982 Getting Started Table of Contents Page i Table of Contents 1. Introduction 1 1.1. Lisp Machines 2 1.2. Timesharing 3 1.3. Other Computers 3 1.3.1. Field Engineering 3 1.3.2. Vision and Robotics 3 1.3.3. Music 4 1,3.4. Altos 4 1.4. Output Peripherals 4 1.5. Other Machines 5 1.6. Terminals 5 2. Networks 7 2.1. The ARPAnet 7 2.2. The Chaosnet 7 2.3. Services 8 2.3.1. TELNET/SUPDUP 8 2.3.2. FTP 8 2.4. Mail 9 2.4.1. Processing Mail 9 2.4.2. Ettiquette 9 2.5. Mailing Lists 10 2.5.1. BBoards 11 2.6. Finger/Inquire 11 2.7. TIPs and TACs 12 2.7.1. ARPAnet TAC 12 2.7.2. Chaosnet TIP 13 3.
    [Show full text]
  • Storage Organization and Management in TENEX I. Introduction
    Storage Organization and Management in TENEX http://www.linique.com/dlm/tenex/fjcc72/ Storage Organization and Management in TENEX by Daniel L. Murphy Presented at the Fall Joint Computer Conference, 1972. Originally published in AFIPS Conference Proceedings Volume 41. I. Introduction In early 1969, BBN began an effort aimed at developing a new time-shared operating system. It was felt at the time that none of the commercially available systems could meet the needs of the research planned and in progress at BBN. The foremost requirement of the desired operating system was that it support a directly addressed process memory in which large list-processing computations could be performed. The cost of core storage prohibited the acquisition of sufficient memory for even one such process, and the problems of swapping such very large processes in a time-sharing environment made that solution technically infeasible as well. Paging was therefore the logical alternative, and our study and experience with list processing systems(1,2) led us to believe that using a demand-paged virtual memory system for such computations was a feasible approach. With demand paged process virtual memory added to our requirements, we found no existing system which could adequately meet our needs. Our approach was to take an existing system which was otherwise appropriate and add the necesary hardware to support paging. The system chosen was the DEC PDP-10 (3), which, although not paged, was available with a time-shared operating system and substantial support software. Consideration was given to modifying the existing PDP-10 operating system to support demand paging, but that approach was rejected because of the substantial amount of work which would be required, because of the inherent constraints imbedded in the architecture of any large system, and because development of a new operating system would allow the inclusion of a great many other features and facilities which were judged desirable.
    [Show full text]
  • NWG/RFC# 752 MRC 2-Jan-79 01:22 Nnnnn a Universal Host Table
    NWG/RFC# 752 MRC 2-Jan-79 01:22 nnnnn A Universal Host Table Network Working Group Mark Crispin Request for Comments 752 SU-AI NIC nnnnn 2 January 1979 A Universal Host Table ABSTRACT: The network host table in use at MIT and Stanford is described. This host table is superior to the NIC and Tenex host tables in several ways. A binary file, compiled from this host table, is also described. This file is used by subsystems on MIT's ITS and Stanford's WAITS timesharing systems for efficiency in host and network lookups. HISTORY: As with many other sites on the Arpanet, we found the NIC's host table unsuited to our needs. Part of the problem was because the NIC host table was often inaccurate and all too often failed to include several nicknames in common usage in our communities. In addition, the NIC host table's format was awkward for user programs to use, especially those which wanted to have the host table mapped into memory in some sort of structured binary form for efficient lookups. Finally, the NIC host table neglects to include some essential information. The ITS host table was originally designed to be compiled along with a network handling program (MIDAS, the PDP-10 assembler used, has a pseudo-op to insert a file into an assembly). In order to make the host table palatable to the assembler, every comment line began with a semicolon, and every actual data line began with the word HOST. Each program which used the host table defined HOST as an assembly macro before inserting the host table into the assembly.
    [Show full text]
  • Engineering Strategy Overview Preliminary
    March 1982 Engineering Preliminary Strategy Company Overview Confidential If.-t8···· L..4L ~ \:')' j.~.! / .;.' ' 1985 1990 1995 2000 - P,O S SIB L E DEC PRO Due T S - $lJOO cellular radio net discontinouous.100 word ~ lim! ted context HANDHELD speaker independent speaker independent $1.0K speech recogn. • sketchpad , interpretation Glata structures , ' & relat~onsh~ps object filing natural languaqe (invisible, protected structures) $40K I CAB I NET I ,4 (dedicated fixture) ~~~n limited context [:~~~~e~ ~~~:~~i:ti~n ~ ak rind pendent • voice ~tuate~ retrieval spe ~ e _ .. • te1econferenc1ng center cont1nued speechlrecogn~tion " ;., encryption associa tiveJparallel a;;;'e'los (, ..j." .---~ provide CAtt= ASSISTANT -------...--- .. • LIBRARlj\N ~ ?ertified "best match" retrieval ~ (secure) os (holographic? ) $650K BD 1/15/81 PRELIMINARY ENGINEERING STRATEGY OVERVIEW MARCH lYtil SECONIJ IJRAFT PRELIMINARY ENGINEERING STRATEGY OVERVIEW TABLE OF CONTENTS ,Preface Chapter I fhe Product Strategy and Transitioning to the Fifth Generation - Product Strategy Overview - The Transitions - Personal Computer Clusters, PCC, Are An Alternative to Timeshared Computers - The Product Strategy - Fifth and Sixth Computer Technology Generations - Uistributed Processing and Limits to Its Growth Chapter II Essays on the Criteria for Allocation of Engineering Resources - Overview, - Heuristics for Building Great Products, - Proposed Resource Allocation Criteria - UEC's Position in the VAN - Buyout Philosophy/Process/Criteria - Example of a "Make vs Buy" Analysis - Engineering Investment Sieve Chapter III Essays on Strategic Threats and Opportunities - Uverview, - Strategic Threats - Getting Organized in Engineering and Manufacturing to Face Our Future Competitors p - View of Competitors ---~,.~".~.-~ l f;t-1) IPrT Co?"! v. 7U/L, / IJ ...J - Te-Iecommunications Environment ) ;2f e-c.. - Competitive TeChnology Exercise, ltv • Chapter IV TeChnology Managers Committee Report ,MC- .
    [Show full text]
  • Lisp: Program Is Data
    LISP: PROGRAM IS DATA A HISTORICAL PERSPECTIVE ON MACLISP Jon L White Laboratory for Computer Science, M.I.T.* ABSTRACT For over 10 years, MACLISP has supported a variety of projects at M.I.T.'s Artificial Intelligence Laboratory, and the Laboratory for Computer Science (formerly Project MAC). During this time, there has been a continuing development of the MACLISP system, spurred in great measure by the needs of MACSYMAdevelopment. Herein are reported, in amosiac, historical style, the major features of the system. For each feature discussed, an attempt will be made to mention the year of initial development, andthe names of persons or projectsprimarily responsible for requiring, needing, or suggestingsuch features. INTRODUCTION In 1964,Greenblatt and others participated in thecheck-out phase of DigitalEquipment Corporation's new computer, the PDP-6. This machine had a number of innovative features that were thought to be ideal for the development of a list processing system, and thus it was very appropriate that thefirst working program actually run on thePDP-6 was anancestor of thecurrent MACLISP. This earlyLISP was patterned after the existing PDP-1 LISP (see reference l), and was produced by using the text editor and a mini-assembler on the PDP-1. That first PDP-6 finally found its way into M.I.T.'s ProjectMAC for use by theArtificial lntelligence group (the A.1. grouplater became the M.I.T. Artificial Intelligence Laboratory, and Project MAC became the Laboratory for Computer Science). By 1968, the PDP-6 wasrunning the Incompatible Time-sharing system, and was soon supplanted by the PDP-IO.Today, the KL-I 0, anadvanced version of thePDP-10, supports a variety of time sharing systems, most of which are capable of running a MACLISP.
    [Show full text]
  • Non Unix Family Tree and Timeline Version 0.3.2
    Non Unix family tree and Timeline Version 0.3.2 1958 FMS SOS 1958 Late 1950's Late 1950's 1960 1960 IBM 1410/1710 OS Early 1960's CTSS 1961-1962 1962 IBSYS PDP-1 OS 1962 Early 1960's 1962 SABRE 1962-64 EXEC I 1964 Tops-10 1.4 1964 1964 Early 1960's OS/360 Multics TOS (BOS, TOS,DOS) 1965 1965 EXEC II Early 1960's DOS CP-40 1966 (CP-67) Tops-10 1.9 MS/8 1966 1966 1966 1966 CAL BPS/360 CP/CMS Tops-10 2.18 Late 1960's ITS WAITS EXEC 3 Late 1960's 1967 1967 1967 1967 Late 1960's DOS/VSE 1968 PARS Tops-10 3.27 1968 1968 SCOPE TDOS 1968 Late 1960's EXEC 4 Late 1960's Late 1960's VMOS ACP v4 EXEC 8 OS/MFT Tops-10 4.50 ACP TENEX Unix Late 1960's 1969 1969 1969 1969 MSS 4.0 1969 Late 1960's Tops-10 4.72 10/1969 1969 MSS 5.0 1970 12/1969 1970 Tops-10 5.01 DOS/Batch 11 MSS 6.0 1970 1970 3/1970 MSS 7.0 3/1970 MSS 8.0 6/1970 1971 RSTS-11 1971 1971 Tops-10 5.02 Tape Scope 2 KRONOS 1971 OS/8 Early 1970's Early 1970's VS/9 Chios 1971 VM/CMS Earl 1970's Early 1970's 1972 OS/VS1 Tops-10 5.03 BKY 1972 1972 1972 Early 1970's Tops-10 5.04 5/1972? KI-TELNEX Tops-10 5.05 mid 1972 7/1972? Tops-10 5.06 1973 11/1972 1973 VSE RSX-11D 5/1973 RT-11 OS/12 Alto 7/1973 1973 OS/VS2 r1 1974 1974 MSS 22.0 1974 RSX-11M 1/1974 1974 Tops-10 5.07 Tops-10 6.01 MR 1.0 CP/M 1.0 5/1974 5/1974 6/1974 1974 OS/VS2 r2 7/1974 1975 1975 OS/VS2 MVS r3 3/1975 Tops-10 5.07A Tops-10 6.01A 5/1975 5/1975 CP/M 1.3 1976 Tops-10 6.02 1975 RSX-11M Plus 1976 Tops-20 1 MSS 28.0 1976 2/1976 2/1976 Tops-20 1A 4/1976 Tops-20 1B 10/1976 Tops-20 101B 12/1976 1977 1977 Tops-10 6.03 p-System I.0 3/1977
    [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]
  • The UNIX Time- Sharing System
    1. Introduction There have been three versions of UNIX. The earliest version (circa 1969–70) ran on the Digital Equipment Cor- poration PDP-7 and -9 computers. The second version ran on the unprotected PDP-11/20 computer. This paper describes only the PDP-11/40 and /45 [l] system since it is The UNIX Time- more modern and many of the differences between it and older UNIX systems result from redesign of features found Sharing System to be deficient or lacking. Since PDP-11 UNIX became operational in February Dennis M. Ritchie and Ken Thompson 1971, about 40 installations have been put into service; they Bell Laboratories are generally smaller than the system described here. Most of them are engaged in applications such as the preparation and formatting of patent applications and other textual material, the collection and processing of trouble data from various switching machines within the Bell System, and recording and checking telephone service orders. Our own installation is used mainly for research in operating sys- tems, languages, computer networks, and other topics in computer science, and also for document preparation. UNIX is a general-purpose, multi-user, interactive Perhaps the most important achievement of UNIX is to operating system for the Digital Equipment Corpora- demonstrate that a powerful operating system for interac- tion PDP-11/40 and 11/45 computers. It offers a number tive use need not be expensive either in equipment or in of features seldom found even in larger operating sys- human effort: UNIX can run on hardware costing as little as tems, including: (1) a hierarchical file system incorpo- $40,000, and less than two man years were spent on the rating demountable volumes; (2) compatible file, device, main system software.
    [Show full text]
  • David Walden and Raymond Nickerson
    Chapter 18 Distributed Computing at BBN Network Computing Software Infrastructure and Distributed Applications from 1970-1995 Richard Schantz In this article we review highlights of the history of BBN and distributed computing from a number of different perspectives: early investigations, distributed systems infrastructure (later to be more commonly known as Middleware), and network-centric applications which utilized the emerging distributed systems capabilities in new and innovative ways, with lasting impact. 18.1 Introduction The innovations being pursued in the area of packet switching and inter-computer communications (see Chapter 17 on networking) spawned a simultaneous interest and investigation into how to utilize this emerging new data oriented communication capability. To complement its activities in pioneering network communications, from the earliest conception of the ARPANET and continuing to this day, BBN initiated and participated in a number of the leading edge, innovative activities aimed at delivering value from the increasing interconnectivity through network centric applications and by providing the network centric infrastructure needed to more easily build these types of applications (see also Chapter 19 on email and 20 relating to distributed simulation). We use the term “Distributed Computing” to loosely tie together these activities covering both advanced, higher levels of multi-host1 infrastructure and the innovative distributed applications themselves, and to distinguish it from the lower level capabilities (e.g.,
    [Show full text]
  • A Study on Various Programming Languages to Keep Pace with Innovation
    S.Sridhar* et al. (IJITR) INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGY AND RESEARCH Volume No.5, Issue No.2, February – March 2017, 5681-5704. A Study On Various Programming Languages To Keep Pace With Innovation S.SRIDHAR Professor & Director RV Centre for Cognitive & Central Computing R.V.College of Engineering, Mysore Road Bangalore-560059 India Abstract: A programming language is a formal computer language designed to communicate instructions to a machine, particularly a computer. Programming languages can be used to create programs to control the behaviour of a machine or to express algorithms. The earliest known programmable machine preceded the invention of the digital computer and is the automatic flute player described in the 9th century by the brothers Musa in Baghdad, "during the Islamic Golden Age". From the early 1800s, "programs" were used to direct the behavior of machines such as Jacquard looms and player pianos. Thousands of different programming languages have been created, mainly in the computer field, and many more still are being created every year. Many programming languages require computation to be specified in an imperative form (i.e., as a sequence of operations to perform) while other languages use other forms of program specification such as the declarative form (i.e. the desired result is specified, not how to achieve it). The description of a programming language is usually split into the two components of syntax (form) and semantics (meaning). Some languages are defined by a specification document (for example, the C programming language is specified by an ISO Standard) while other languages (such as Perl) have a dominant implementation that is treated as a reference.
    [Show full text]
  • CS 1550: Introduction to Operating Systems
    Operating Systems Lecture1 - Introduction Golestan University Hossein Momeni [email protected] Outline What is an operating system? Operating systems history Operating system concepts System calls Operating system structure User interface to the operating system Anatomy of a system call 2 Operating Systems Course- By: Hossein Momeni Samples of Operating Systems IBSYS (IBM 7090) MACH OS/360 (IBM 360) Apollo DOMAIN TSS/360 (360 mod 67) Unix (System V & BSD) Michigan Terminal System Apple Mac (v. 1– v. 9) CP/CMS & VM 370 MS-DOS MULTICS (GE 645) Windows NT, 2000, XP, 7 Alto (Xerox PARC) Novell Netware Pilot (Xerox STAR) CP/M Linux IRIX FreeBSD Solaris PalmOS MVS PocketPC VxWorks VxWorks 3 Operating Systems Course- By: Hossein Momeni Samples of Operating Systems (continue…) 4 Operating Systems Course- By: Hossein Momeni What is an Operating System? An Operating System is a program that acts as an intermediary/interface between a user of a computer and the computer hardware. It is an extended machine Hides the messy details which must be performed Presents user with a virtual machine, easier to use It is a resource manager Each program gets time with the resource Each program gets space on the resource 5 Operating Systems Course- By: Hossein Momeni Static View of System Components User 1 User 2 User 3 User 4 … User n Compiler Editor Database Calculator WP Operating System Hardware 6 Operating Systems Course- By: Hossein Momeni Dynamic View of System Components 7 Operating Systems Course- By: Hossein Momeni
    [Show full text]
  • MINOS 5.51 User's Guide
    SYSTEMS OPTIMIZATION LABORATORY DEPARTMENT OF MANAGEMENT SCIENCE AND ENGINEERING STANFORD UNIVERSITY STANFORD, CALIFORNIA, USA MINOS 5.51 USER’S GUIDE by Bruce A. Murtagh† and Michael A. Saunders‡ TECHNICAL REPORT SOL 83-20R December 1983 Revised September 23, 2003 Copyright c 1983–2002 Stanford University †Graduate School of Management, Macquarie University, Sydney, NSW, Australia ([email protected]). ‡Dept of Management Science and Engineering, Terman Building, Stanford University, Stanford, CA 94305-4026, USA ([email protected]). Research and reproduction of this report were supported by the Department of Energy contract DE-AM03-76SF00326, PA No. DE-AT03-76ER72018; National Science Foundation grants MCS- 7926009, ECS-8012974 and CCR-9988205; the Office of Naval Research contracts N00014-75-C-0267 and N00014-02-1-0076; and the Army Research Office contract DAAG29-81-K-0156. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the views of the above sponsors. Reproduction in whole or in part is permitted for any purposes of the United States Government. ii Contents Preface to MINOS 5.51 vii Preface to MINOS 5.0 xv 1 Introduction 3 1.1 LinearProgramming .................................. 4 1.2 Problems with a Nonlinear Objective . 5 1.3 Problems with Nonlinear Constraints . ..... 7 1.4 ProblemFormulation................................. ... 9 1.5 Restrictions....................................... 10 1.6 Storage .......................................... 10 1.7 Files............................................ 11 1.8 InputDataFlow ...................................... 11 1.9 MultipleSPECSFiles .................................. 12 1.10 Internal Modifications . 13 2 User-written Subroutines 15 2.1 Subroutine funobj . 15 2.2 Subroutine funcon . 17 2.3 Constant Jacobian Elements .
    [Show full text]