An Operating Systems Vade Mecum

Total Page:16

File Type:pdf, Size:1020Kb

An Operating Systems Vade Mecum An Operating Systems Vade Mecum Raphael A. Finkel University of Wisconsin at Madison Prentice Hall Englewood Cliffs, New Jersey 07632 Contents iii CONTENTS PREFACE xi Chapter 1 INTRODUCTION 1 1 Philosophy of the book 1 2 The Resource Principle 3 3 Historical development 4 3.1 Open shop 4 3.2 Operator-driven shop 5 3.3 Of¯ine transput 6 3.4 Spooling systems 8 3.5 Batch multiprogramming 8 3.6 Interactive multiprogramming 11 3.7 Distributed computing 12 4 The Beauti®cation Principle 12 5 The kernel and processes 14 5.1 Context blocks 14 5.2 Process lists 17 5.3 Service calls 17 6 Virtual machines 20 7 Further reading 24 8 Exercises 25 Chapter 2 TIME MANAGEMENT 27 1 Goals, measures, and assumptions 29 2 Policies 31 2.1 First come, ®rst served (FCFS) 34 2.2 Round robin (RR) 37 2.3 Shortest process next (SPN) 39 2.4 Preemptive shortest process next (PSPN) 41 2.5 Highest penalty ratio next (HPRN) 41 2.6 Multiple-level feedback (FB) 42 2.7 Sel®sh round robin (SRR) 44 2.8 Hybrid methods 46 2.9 State-dependent priority methods 46 2.10 External priority methods 47 3 Perspective 47 3.1 Classi®cation of scheduling policies 48 3.2 Evaluating policies 49 3.3 Scheduling levels 51 3.4 Countermeasures 52 3.5 Guiding principles 52 4 Further reading 53 iv Contents 5 Exercises 54 Chapter 3 SPACE MANAGEMENT 57 1 Preliminaries 57 1.1 Swapping 57 1.2 Storage hierarchies 58 1.3 Physical and virtual store 59 1.4 Address translation 60 1.5 Sharing 62 1.6 Initial loading and execution 63 2 Fixed partitions 65 2.1 Security 67 2.2 Overlays 69 3 Single segment 70 3.1 Mechanism 70 3.2 Bene®ts 73 3.3 Placement and replacement policies 74 4 Two segments 76 5 Segmentation 77 5.1 Implementation 78 5.2 Storing the necessary information 81 5.3 Swapping 81 5.4 Large segment spaces 82 5.5 Shared segments 83 5.6 Unusable space 83 5.7 Initial loading and execution 84 6 Paging 85 6.1 Implementation 87 6.2 Security and sharing 90 6.3 Case study: Multics 91 6.4 Case study: VAX 96 6.5 Paging in virtual machines 97 7 Page-replacement policies 101 7.1 Random replacement 103 7.2 Min 104 7.3 First in, ®rst out (FIFO) 105 7.4 Least recently used (LRU) 107 7.5 Not used recently (NUR) 108 7.6 Second-chance cyclic 110 7.7 Global policies 110 7.8 Working set 111 7.9 Page-fault frequency (PFF) 112 7.10 Working size 112 7.11 WSCLOCK 113 7.12 Missing Used ®eld 113 7.13 Classi®cation of replacement methods 113 When is a page swapped in? 114 Contents v Which page should be swapped out? 114 Startup-phase con¯icts. 115 8 Perspective 116 9 Further reading 118 10 Exercises 118 Chapter 4 RESOURCE DEADLOCK 121 1 Nuts and bolts 122 2 Deadlock and starvation 124 3 Dining philosophers 128 4 One-shot allocation 131 5 Hierarchical allocation 132 6 Advance-claim algorithm 133 7 Deadlock detection 138 8 Deadlock recovery 141 9 Starvation 141 10 Perspective 142 11 Further reading 144 12 Exercises 144 Chapter 5 TRANSPUT 147 1 Device hardware 148 1.1 Disks 148 1.2 Magnetic tape 150 1.3 Drums 152 1.4 Communication lines 152 Hardware characteristics. 153 Synchronous transmission. 153 Asynchronous transmission. 154 1.5 Summary of device characteristics 155 2 The device interface 156 2.1 Device registers 156 2.2 Direct memory access (DMA) 158 2.3 Channels 159 3 Device drivers 160 3.1 Two levels of device driver 161 3.2 Clock device driver 162 3.3 Terminal device drivers 163 3.4 Disk device drivers 164 4 Data modi®cation 168 4.1 Data compaction 168 4.2 Data encryption 168 4.3 Reliability 170 5 The process interface 172 5.1 To block or not to block 173 5.2 Main-store addresses 174 vi Contents 5.3 Implementing the service calls 177 5.4 Buffer depletion 179 6 Perspective 181 7 Further reading 182 8 Exercises 182 Chapter 6 FILE STRUCTURES 185 1 Naming structure of ®les 186 1.1 One-level (¯at) directories 187 1.2 Two-level directories 188 1.3 Aliases and indirect ®les 189 1.4 Hierarchical directories 192 2 Access control 195 2.1 A formal model of access control 196 2.2 Capability lists 198 2.3 Access lists 199 2.4 Directories and access control 202 2.5 Aliases and indirect ®les 204 3 Access methods 205 3.1 Sequential access 205 3.2 Direct access 206 3.3 Mapped access 206 3.4 Structured ®les 207 3.5 Databases 207 4 File recovery 208 4.1 Dumps 208 4.2 Backup ®les and versions 209 4.3 Partial deletion 210 5 Transactions 211 5.1 Synchronization atomicity 211 5.2 Failure atomicity 213 6 Physical representation 214 6.1 Allocation 215 6.2 File layout 217 6.3 Disk layout 222 6.4 Multiple disks 223 6.5 Multiple machines 225 6.6 Implementing transactions 227 7 Perspective 228 8 Further reading 231 9 Exercises 231 Chapter 7 THE USER INTERFACE 234 1 The command interpreter 235 1.1 Invoking programs and establishing environments 236 1.2 The User Principle 237 Contents vii 1.3 Interacting with programs 240 1.4 Advanced features 242 Wild cards. 242 History. 243 Command completion. 243 Subordinate command interpreters. 244 Redirection of transput. 244 Bit-mapped displays. 246 2 Interactive programs 248 3 Utility programs 249 3.1 Document preparation 249 3.2 Program preparation 250 3.3 Data management 251 3.4 Communication 253 4 Perspective 253 5 Further reading 254 6 Exercises 255 Chapter 8 CONCURRENCY 256 1 The problems 257 1.1 Mutual exclusion 258 1.2 Synchronization 259 2 Mechanisms 260 2.1 Disable interrupts 261 2.2 Busy wait on MutEx 262 2.3 Switch variable 263 2.4 Non-alternating switch 265 2.5 Locks 267 2.6 Semaphores 268 2.7 Critical regions 271 2.8 Conditional critical regions 272 2.9 Monitors 273 2.10 Crowd monitors 280 2.11 Event counts and sequencers 281 2.12 Path expressions 284 2.13 Invariant expressions 287 3 Perspective 289 4 Further reading 290 5 Exercises 291 Chapter 9 CO-OPERATING PROCESSES 294 1 Process creation and naming 295 1.1 Service calls 296 1.2 Programming language syntax 296 2 Inter-process communication 297 2.1 Semaphores 297 viii Contents 2.2 Virtual interrupts 297 2.3 Pipes 298 2.4 Ports 301 Data. 302 Access. 302 Naming and transfer. 303 2.5 Semantics of Read and Write 307 3 Distributed operating systems 308 3.1 Multiprocessors 308 3.2 Local-area networks 309 3.3 Long-haul networks 311 3.4 Multicomputers 312 4 The communication-kernel approach 313 4.1 Processes and threads 314 4.2 Communication 315 4.3 Space management 316 4.4 Other services 316 5 Perspective 317 6 Further reading 318 7 Exercises 319 REFERENCES 322 GLOSSARY 328 INDEX 352 Contents ix Balance is a registered trademark of Sequent Computer Systems, Inc. CMS is a registered trademark of IBM. CP/M is a registered trademark of Digital Research. Cray-1 is a registered trademark of Cray Research. Cray-2 is a registered trademark of Cray Research. Cyber is a registered trademark of Control Data Corporation. DEC is a registered trademark of Digital Equipment Corporation. DECnet is a registered trademark of Digital Equipment Corporation. Dynix is a registered trademark of Sequent Computer Systems, Inc. Exec-8 is a registered trademark of Sperry Rand. IBM is a registered trademark of International Business Machines Corporation. Locus is a registered trademark of Locus Computing Corporation. MS-DOS is a registered trademark of Microsoft Corporation. MVS is a registered trademark of IBM. NonStop is a registered trademark of Tandem Computers. OS/360 is a registered trademark of IBM. PDP-10 is a registered trademark of Digital Equipment Corporation. PDP-11 is a registered trademark of Digital Equipment Corporation. RT-11 is a registered trademark of Digital Equipment Corporation. Tenex is a registered trademark of BBN. Tops-10 is a registered trademark of Digital Equipment Corporation. Tops-20 is a registered trademark of Digital Equipment Corporation. Univac is a registered trademark of Sperry Rand. Unix is a registered trademark of Bell Laboratories. VAX is a registered trademark of Digital Equipment Corporation. VM/370 is a registered trademark of IBM. VMS is a registered trademark of Digital Equipment Corporation. PREFACE Traditionally, a vade mecum (pronounced ``VAHdee MAYkem'') is a laboratory manual that guides the student step by step through complex procedures. Operating systems are complex mixtures of policy and mechanism, of algorithm and heuristic, and of theoretical goals and practical experience. This vade mecum tries to unify these diverse points of view and guide the novice step by step through the complexities of the subject. As a text, this book is intended for a ®rst course in operating systems at the undergraduate level. The subject has so many individual parts that its practitioners and teachers often concen- trate on subareas and ignore the larger concepts that govern the entire subject. I have tried to rectify that situation in this book by structuring the presentation about the dual ideas of resource management and beauti®cation. To unify disparate threads of discussion, I have taken the liberty introducing names for recurrent themes and glorifying them with the title ``principles.'' I hope that this organization and nomenclature will help the reader to understand the subject better and to integrate new ideas into the same framework.
Recommended publications
  • Object Management System Concepts: Supporting Integrated Office Workstation Applications
    Object Management System Concepts: Supporting Integrated Office Workstation Applications by Stanley Benjamin Zdonik, Jr. S.B., Massachusetts Institute of Technology (1970) S.M., Massachusetts Institute of Technology (1980) E.E., Massachusetts Institute of Technology (1980) Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the Massachusetts Institute of Technology May 1983 © Massachusetts Institute of Technology 1983 Signature of Author............... .. ..... .... Department of Electric~l Eng~neering and Computer Science May 13, 1983 Certified by . .* .* .. Michael Hammer Thesis Supervisor Accepted . ...... .-.----4 p . Arthur C. Smith Chairman, Departmental Committee on Graduate Students Object Management System Concepts: Supporting Integrated Office Workstation Applications by Stanley B. Zdonik, Jr. Submitted to the Department of Electrical Engineering and Computer Science on May 13, 1983, in partial fulfillment of the requirements for the Degree of Doctor of Philosophy Abstract The capabilities of a system for storing and retrieving office style objects are described in this work. Traditional file systems provide facilities for the storage and retrieval of objects that are created in user programs, but the semantics of these objects are not available to the file system. Database management systems provide a means of describing the semantics of objects using a single basic paradigm, the record. This model is inadequate for describing the richer semantics of office objects. An object management system combines the advantages of both a file system and a database management system in that it can store arbitrarily defined programming language objects and at the same time maintain a high-level description of their meaning. This work presents a high-level model of data that can be used to describe office objects more effectively than data processing oriented models.
    [Show full text]
  • A VLSI Architecture for Enhancing Software Reliability Kanad Ghose Iowa State University
    Iowa State University Capstones, Theses and Retrospective Theses and Dissertations Dissertations 1988 A VLSI architecture for enhancing software reliability Kanad Ghose Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/rtd Part of the Computer Sciences Commons Recommended Citation Ghose, Kanad, "A VLSI architecture for enhancing software reliability " (1988). Retrospective Theses and Dissertations. 9345. https://lib.dr.iastate.edu/rtd/9345 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Retrospective Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. INFORMATION TO USERS The most advanced technology has been used to photo­ graph and reproduce this manuscript from the microfilm master. UMI films the original text directly from the copy submitted. Thus, some dissertation copies are in typewriter face, while others may be from a computer printer. In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyrighted material had to be removed, a note will indicate the deletion. Oversize materials (e.g., maps, drawings, charts) are re­ produced by sectioning the original, beginning at the upper left-hand comer and continuing from left to right in equal sections with small overlaps. Each oversize page is available as one exposure on a standard 35 mm slide or as a 17" x 23" black and white photographic print for an additional charge.
    [Show full text]
  • Secure Foundational Exabyte Hpc Systems for 2020 and Beyond Sv/128 - Risc-V
    SECURE FOUNDATIONAL EXABYTE HPC SYSTEMS FOR 2020 AND BEYOND SV/128 - RISC-V Steven J. Wallach ([email protected]) Presentation Outline • Background Material (Part 1) • Previous efforts/research on protection • Full Proposal (Part 2) • 128 bit logical address • 64 bit Unique Object ID • First implementation (Part 3 & 4) • RISC-V SV128 ([21] Github) • 32 bit Object ID • Programmer Visible State • Hardware 훍-State [19] • Contemporary security issues March 2020 - SV128 - BSC 2 What’s Next • “The end of Moore’s law could be the best thing that has happened in computing since the beginning of Moore’s law. Confronting the end of an epoch should enable a new era of creativity by encouraging computer scientists to invent biologically inspired devices, circuits, and architectures implemented using recently emerging technologies. “ [6] R. Stanley Williams, “The End of Moore’s Law”, Computing in Science & Engineering, IEEE CS and AIP, March/April 2017 March 2020 - SV128 - BSC 3 OBJECTIVES THE BEST BENCHMARK IS THE ONE YOUR COMPETITION CAN NOT RUN • Why a 128 bit address space? • Security • Cluster wide shared virtual address • Heterogeneous Nodes • Time to do something different not just keep adding more bits • Begin the decade of Exascale computing on a scalable technology • Software/OS oriented • Upward Compatible with RV32 and RV64 • Otherwise we will continue to implement and support the sins of our parents/grandparents. • We can now begin to design & build SECURE PROGRAMMABLE EXABYTE (ZETABYTE) distributed memory systems March 2020 - SV128
    [Show full text]
  • Intel 432 System Summary: Manager's Perspective
    INTEL 432 SYSTEM SUMMARY: MANAGER'S PERSPECTIVE Manual Order Number: 171867-001 Copyright © 1981 Intel Corporation Intel Corporation, 3065 Bowers Avenue, Santa Clara, California 95051 Additional copies of this manual or other Intel literature may be obtained from: Literature Department Intel Corporation 3065 Bowers Avenue Santa Clara, CA 95051 The information in this document is subject to change without notice. Intel Corporation makes no warranty of any kind with regard to this material, including, but not limited to, the implied warranties of merchantability and fitness for a particular purpose. Intel Corporation assumes no responsibility for any errors that may appear in this document. Intel Corporation makes no commitment to update nor to keep current the information contained in this document. Intel Corporation assumes no responsibility for the use of any circuitry other than circuitry embodied in an Intel product. No other circuit patent licenses are implied. Intel software products are copyrighted by and shall remain the property of Intel Corporation. Use, duplication or disclosure is subject to restrictions stated in Intel's software license, or as defined in ASPR 7-104.9(a)(9). No part of this document may be copied or reproduced in any form or by any means without the prior written consent of Intel Corporation. The following are trademarks of Intel Corporation and its affiliates and may be used only to identify Intel products: BXP Intelevision Micromap CREDIT Intellec Multibus i iRMX Multimodule ICE iSBC Plug-A-Bubble iCS iSBX PROMPT im Library Manager Promware INSITE MCS RMX/80 Intel Megachassis System 2000 Intel Micromainframe UPI pScope and the combination of ICE, iCS, iMMX, iRMX, iSBC, iSBX, MCS, or RMX and a numerical suffix.
    [Show full text]
  • 210620-004 Literature Guide Sep Oct 1984.Pdf
    INTRODUCTiON Welcome to tile intel Ut,~raHm~ Cwcie --- a full·fledged libfilry of ter.hnical support documenta­ tion for today's leadino .nemary ano ITIlcroproC8?sor component and system products. This comprehensive literature selection guide is a tool to help you, the Intel customer, during product selection, desiqn and operation. It is for this reason tha'l we \ieep its contents up to date. THE NEED FOR SUPPORT DOCUMENTATION As systems design becomes mcr'easlngi\! software-dependent, development time and costs will continue to rise. To help reduce, both systems ilnd en9ill8ering costs, Intel will be deslgn- ami manufacturing products Wilich will integrate more and mors software functions into system hardware. ThiS ('I' complex, hlgflly inte9rated product 'will require substantial support clocumentation, Wli! tY' incoi'poraleC) into the Intel Literature, Guilie as !11ese products emerge. - HOW TO ORDER When ordering from Tim; Utera(uP?, GUide. please use ~he order form located at the front of thio; bookiet. To 'facjHtat~} on1t;(, pleas6 tH:: SUit'} to endose H'j8 You \lv~a always receive the editjop (Y: Hny PUhUc2tion you or~jer. to change.) PleaSE} \Ilif:jte (ntt~i's Literatufe Departil~ent JOu[; Bc:vvers /\venue, Santa C1a(8., CA 95051, lol' additionai infonllation. Please note and as.',umes riO r,::!~;pol;:,ib;iity tor Ci~I}' err~)fS wl"lIe!llnay appear in ;i'formCltlon cnntc'iinecl h,~'ein :ntel retain::, thE: nghr tc. make any wirnout notice MUL­ PROMPT, MCS "0 code and i~:, 110t Sci.:::nces Corp0railon Intei ~~:o~poration LITERATURE In addition to the product line Handbooks listed below.
    [Show full text]
  • P-1935-J-Conc-Biblio
    5.0 Conclusions The intent of this document has been: (1) to provide a comprehensive overview of the important properties of traditional capability-based systems, (2) to point out the advantages and deficiencies of such systems with regard to the NCSC [TCSEC83] requirements, (3) to outline some possible approaches for the elimination of such deficiencies, and (4) to compare the properties of such systems to those of descriptor-based systems (with which the computer security community has been somewhat more familiar). Thus, this document can be used as a background document by both evaluators and designers of capability-based systems. 'In both cases, the reader should make use of the references provided in this document in order to help him understand some of its more subtle conclusions. [For the readers with special research and/or development interests in this area, an extensive bibliography is also provided as an appendix to this paper.] The research work necessary for this paper has led to the following findings. First, the notion of a "traditional" capability-based system can be defined based on a set of properties which are common to many capability-based systems. These properties are found in the areas of capability-based addressing and protection, and they support a number of general security and integrity policies. The discussion of the set of common properties has been essential to the investigation of the TCSEC impact on traditional capability systems. Without such a defmition, the impact and corresponding analysis would be questionable at best, because no general conclusions could be drawn from individual case studies.
    [Show full text]
  • An Overview of Ada 202X 159
    TThehe journaljournal forfor thethe internationalinternational AdaAda communitycommunity AdaAda UserUser Volume 41 Journal Number 3 Journal September 2020 Editorial 121 Quarterly News Digest 122 Conference Calendar 149 Forthcoming Events 156 Special Contribution J. Cousins An Overview of Ada 202x 159 Articles from the 20th International Real-Time Ada Workshop L.M. Pinho, S. Royuela, E. Quiñones Real-Time Issues in the Ada Parallel model with OpenMP 177 J. Garrido, D. Pisonero Fuentes, J.A. de la Puente, J. Zamorano Vectorization Challenges in Digital Signal Processing 183 Puzzle J. Barnes The Problem of the Nested Squares 187 In memoriam: Ian Christopher Wand 188 Produced by Ada-Europe Editor in Chief António Casimiro University of Lisbon, Portugal [email protected] Ada User Journal Editorial Board Luís Miguel Pinho Polytechnic Institute of Porto, Portugal Associate Editor [email protected] Jorge Real Universitat Politècnica de València, Spain Deputy Editor [email protected] Patricia López Martínez Universidad de Cantabria, Spain Assistant Editor [email protected] Kristoffer N. Gregertsen SINTEF, Norway Assistant Editor [email protected] Dirk Craeynest KU Leuven, Belgium Events Editor [email protected] Alejandro R. Mosteo Centro Universitario de la Defensa, Zaragoza, Spain News Editor [email protected] Ada-Europe Board Tullio Vardanega (President) Italy University of Padua Dirk Craeynest (Vice-President) Belgium Ada-Belgium & KU Leuven Dene Brown (General Secretary) United Kingdom SysAda Limited Ahlan Marriott (Treasurer) Switzerland White Elephant GmbH Luís Miguel Pinho (Ada User Journal) Portugal Polytechnic Institute of Porto António Casimiro (Ada User Journal) Portugal University of Lisbon Ada-Europe General Secretary Dene Brown Tel: +44 2891 520 560 SysAda Limited Email: [email protected] Signal Business Center URL: www.ada-europe.org 2 Innotec Drive BT19 7PD Bangor Northern Ireland, UK Information on Subscriptions and Advertisements Ada User Journal (ISSN 1381-6551) is published in one volume of four issues.
    [Show full text]
  • Fusionpldsm Catalog AMD + Fusionpld Partners = Customer
    FusionPLDsM Catalog Advanced Design Support Tools for AMD's Programmable Logic Micro Spring 1991 Devices AMD + FusionPLD Partners = Customer Solutions. FusionPLD Catalog Design Support Tools for AMD's Programmable Logic Spring 1991 ADVANCED MICRO DEVICES TRADEMARKS AADELAY and ATGEN are trademarks of Acugen Software, Inc. ABEL, ABEL-HDL, AutoLabel, AutoLaser, PLDgrade, SmartPart, TesterLink, and Unisite, are trademarks of Data I/O Corporation PLDtest is a registered trademark of Data I/0 Corporation Adapt-A-Socket is a registered trademark of Emulation Technology, Inc. Allegro, Logic Workbench, RapidSIM, System PGA, SystemPLD, and ValidGED are trademarks of Valid Logic Systems, Inc. OnCUPL, ALLPRO, CUPL, PLPartition, SERIALPRO, and DAC-per-PIN are trademarks of Logical Devices, Inc. Am29000, Lab Pro, and MACH are trademarks of AMD AMD, PALASM, and PAL are registered trademarks of AMD Apollo is a registered trademark of Apollo Computer, Inc. a unit of, HP. Inc. DEC, VAX, and VMS are registered trademarks of Digital Equipment Corp. ULTRIX is a trademark of Digital Equipment Corp. UNIX is a trademark of AT&T GAL is a registered trademark of Lattice Semiconductor Corp. HP is a registered trademark of Hewlett-Packard, Inc. IBM PC, PC-XT, PC-AT, PC-DOS, and PS/2 are trademarks of International Business Machines Corp. IBM is a registered trademark of International Business Machines Corp. Intergraph is a registered trademark of Intergraph Corporation. LCA is a trademark of XiUnx, Inc. LOG/iC is a registered trademark of ISDAT A GmbH. Macintosh is a registered trademark of Apple Computer. MS-DOS is a trademark of Microsoft Corp. OrCAD is a registered trademark of OrCAD OrCAD/MOD, OrCADIPCB, OrCAD/PLD, OrCADNST, andOrCAD/SDTare trademarks ofOrCAD PGA Designer and PLDesigner are trademarks of Mine, Inc.
    [Show full text]
  • Oracle Rdb™ SQL Reference Manual Volume 2
    Oracle Rdb™ SQL Reference Manual Volume 2 Release 7.3.3.0 for HP OpenVMS Industry Standard 64 for Integrity Servers and OpenVMS Alpha operating systems November 2018 ® SQL Reference Manual, Volume 2 Oracle Rdb Release 7.3.3.0 for HP OpenVMS Industry Standard 64 for Integrity Servers and OpenVMS Alpha operating systems Copyright © 1987, 2018 Oracle Corporation. All rights reserved. Primary Author: Rdb Engineering and Documentation group This software and related documentation are provided under a license agreement containing restrictions on use and disclosure and are protected by intellectual property laws. Except as expressly permitted in your license agreement or allowed by law, you may not use, copy, reproduce, translate, broadcast, modify, license, transmit, distribute, exhibit, perform, publish, or display any part, in any form, or by any means. Reverse engineering, disassembly, or decompilation of this software, unless required by law for interoperability, is prohibited. The information contained herein is subject to change without notice and is not warranted to be error-free. If you find any errors, please report them to us in writing. If this is software or related documentation that is delivered to the U.S. Government or anyone licensing it on behalf of the U.S. Government, the following notice is applicable: U.S. GOVERNMENT RIGHTS Programs, software, databases, and related documentation and technical data delivered to U.S. Government customers are "commercial computer software" or "commercial technical data" pursuant to the applicable Federal Acquisition Regulation and agency-specific supplemental regulations. As such, the use, duplication, disclosure, modification, and adaptation shall be subject to the restrictions and license terms set forth in the applicable Government contract, and, to the extent applicable by the terms of the Government contract, the additional rights set forth in FAR 52.227-19, Commercial Computer Software License (December 2007).
    [Show full text]
  • Volume 41 Number 3 September 2020
    To receive the Ada User Journal, apply to Ada-Europe at: http://www.ada -europe.org/join ADA Volume 41 USER Number 3 September 2020 JOURNAL Contents Page Editorial Policy for Ada User Journal 120 Editorial 121 Quarterly News Digest 122 Conference Calendar 149 Forthcoming Events 156 Special Contribution J. Cousins “An Overview of Ada 202x” 159 Articles from the 20th International Real-Time Ada Workshop (IRTAW'2020) L. M. Pinho, S. Royuela, E. Quiñones “Real-Time Issues in the Ada Parallel Model with OpenMP” 177 J. Garrido, D. Pisonero Fuentes, J. A de la Puente, J. Zamorano “Vectorization Challenges in Digital Signal Processing” 183 Puzzle J. Barnes “The Problem of the Nested Squares” 187 In memoriam: Ian Christopher Wand 188 Ada-Europe Associate Members (National Ada Organizations) 190 Ada-Europe Sponsors Inside Back Cover Ada User Journal Volume 41, Number 3, September 2020 122 Quarterly News Digest Alejandro R. Mosteo Centro Universitario de la Defensa de Zaragoza, 50090, Zaragoza, Spain; Instituto de Investigación en Ingeniería de Aragón, Mariano Esquillor s/n, 50018, Zaragoza, Spain; email: [email protected] I ask for your indulgence for closing this New(?) Intros to Ada and preface with a project I started and Contents actively develop (in collaboration, chiefly, Spark on adacore.com with Fabien Chouteau from AdaCore): Preface by the News Editor 122 Alire (after Ada Library Repository), a From: Paul Rubin Ada in Education 122 package manager for Ada and SPARK <[email protected]> Ada-related Resources 125 has entered public beta, and debuts in this Subject: new(?) intros to Ada and Spark on Ada-related Tools 125 issue [4].
    [Show full text]
  • A Bibliography of Publications in ACM SIGOPS Operating Systems Review
    A Bibliography of Publications in ACM SIGOPS Operating Systems Review Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 07 June 2021 Version 1.49 Title word cross-reference 3 [ASR+17, GPY+17, KDS+06, MAS+06]. < [Zho16]. > [Zho16]. TM [FPG89]. ≈ [KLK17]. δ [ZLX01b]. µ [Dru92, HHLS97, LBB+91]. * [TYKZ07]. */ [TYKZ07]. *icomment [TYKZ07]. -core [ZLX01b]. -fully [FPG89]. -kernel [Dru92, LBB+91]. -kernel-based [HHLS97]. /*icomment [TYKZ07]. /evolution [Pat02a]. 0 [Woo85]. 0-932376-52-5. [Woo85]. 1 [SF80, SDV+87]. 10 [BBMT72, SHSB75]. 11 [MA79, PK75, Ros78, ZDP83]. 11/45 [HB80]. 13th [Laz92a, Laz92b]. '16 1 2 [Tsa16]. 17th [LE00]. 1981 [Wai83a]. 1982 [Had83, OSV82, Sta83, Wai83b]. 1983 [F^ea83, Had84, Had85, OST83]. 1984g [San86]. 1986 [OSV86]. 1988 [Lev88]. 1994 [Sat95]. 1st [BY08, CM13]. 2 [Als72, WCW+04]. 2.0 [KL07]. 2000 [Pas92]. 2007 [Isa08]. 2009 [Bel10]. 2012 [MvR13]. 2013 [SG14, VZ14]. 2015 [DK15]. 21364 [MSB+02]. 2L [SDH+97]. 3 [HBG+06]. 370 [San81]. 3G [JHC+11]. 3rd [PP09, Sub11, WTC09]. 4 [PCD91]. 4.0 [Vog99, Vog00]. 432 [PKW81]. 4381 [GPR87]. 45 [HB80]. 4th [BCC+94]. 5. [Woo85]. 5th [BR10, LS09, OFB16, RAVC12]. 60 [BB75]. 6000 [HO91]. 64 [ZRMH00]. 64-bit [CBHLL92, THK95]. 6th [BM17]. 736 [AD07]. 7th [Gue87]. 80 [BSUH87]. 802.11n [AHB15]. 8800 [Cla87]. 8th [CJRV15]. 9 [Gan08, PPT+93].
    [Show full text]
  • Garbage Collection
    DOLPHIN: PERSISTENT, OBJECT-ORIENTED AND NETWORKED A REPORT SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF STRATHCLYDE CONSISTING OF A DOCTOR OF PHILOSOPHY THESIS DISSERTATION By Gordon W. Russell February 1995 The copyright of this thesis belongs to the author under the terms of the United Kingdom Copyright Acts as qualified by University of Strathclyde Regulation . Due acknowledgement must always be made of the use of any material contained in, or derived from, this thesis. c Copyright 1995 iii Abstract This thesis addresses the problems associated with the design of a new generation of high-performance computer systems for use with object-oriented languages. The major contribution is a novel design for the utilization of object addressing and multiple stacks within RISC-style processors, and a pro- posal for object-addressed stable electronic memory capable of supporting much higher performance than contemporary designs based on the use of disk backing store. The impact of the new designs in discussed and evaluated by simulation within the context of object-oriented system design. iv Publications and Acknowledgements A number of publications have been created from this work: Four machine descriptions and critiques have been reproduced in [Russell and Cockshott, 1993a] from an early draft of chapter 3. This paper is also available as a technical report [Russell and Cockshott, 1993b]. A technical report discussing DAIS' caching strategy has been produced [Russell and Shaw, 1993a]. A cut down version of chapter 5, discussing only the cache structure and its advantages, appears in [Russell et al., 1995]. DAIS' register file is based on a dynamically-resizing shift register.
    [Show full text]