DOCSLIB.ORG

A Bibliography of Publications About the AT&T Plan 9 Distributed

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Bibliography of Publications About the AT&T Plan 9 Distributed A Bibliography of Publications about the AT&T Plan 9 Distributed Operating System 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/ 23 March 2021 Version 1.47 Title word cross-reference PPT+92, PPT+93, PPD+95, P+96a, P+96b, Pik00c, Pik00d, Pik00a, Pik02, Pre88, Pre90, PPTT91b, PPTT92, Pre93a, Pre93b, PW93, PPTT94, Ray94, Sko98, Sta12, Tho00b, 81=2 [Pik91, Pik00a]. α [PT00]. Wel93, Wel94, WJV+84]. '93 [ABB93]. '96 [PT00, PT00]. η [PT00]. κ [PT00]. λ [PT00]. [Ano96a]. 9p [MM06]. 9p-based [MM06]. µ [PT00]. ρ [PT00]. σ [PT00]. Acid [Win00a, Win94, Win00b]. Acme 11th [USE02]. 18th [IEE04]. 19th [ABB93]. [Pik94]. Adding [Fla02]. aggregate [VFMM08]. algorithm [Tho68]. 5 [Ano96a]. Algorithms [KP99b]. Analytical [JCSM96, JCMS97]. Annual [USE00]. 9 [Ano90, Ano95a, Ano95b, Ano95c, Ano96a, ANSI [Tri00]. ANSI/POSIX [Tri00]. Ano96b, Ano96d, Ano96c, Anoxxa, Anoxxb, APE [Tri00]. Application [Fla02, Lau00]. Anoxxc, Anoxxd, Ano00a, Bai96b, Bai96a, Applications [BGSL05]. Approach + BGSL05, Cox00, CGP 02, DPP92, Duf90a, [Cox09, MS04, QD02]. April Duf90b, Duf00, Fen96, Fil96, Fla00, Fla02, [IEE04, USE92]. Architecture [Fla02]. Gan08, Goo90, GS93, HF00, Kor96, Kot94, Architectures [USE92, Wel93, Wel94]. + Kue97, Lug81, MKM 14, MS04, PPTT90a, archival [QD02]. assembler [Pik00e]. PPTT90b, PPTT91a, PPT91, Pik91, 1 2 AT&T [Ano95a, Ano96b, Bai96b, Bai96a]. Earlier [Sta12]. Edge [Ano96a]. Editor August [ABB93, USE02]. authentication [Pik87, Pik00h, Ritxx, DL67]. efficient [Gan08]. Automata [MY60, Lau00, RS59]. [Cox10b]. England [USE88]. Enumerating [McI04]. Environment Bad [Fen96]. Bangs [MKM+14]. based [Pik02, Tri00, VFMM08]. Errata [Anoxxd]. [Ier09, MM06, Win94]. bases [ABB93]. Be EurOpen [Eur91]. EUUG [USE88]. [Cox07]. Beautiful [OW07]. Becomes Everywhere [Ano96a]. expect [PPT91]. [BGSL05]. Bell [BGSL05, PPTT90a, Expression [Cox07, Cox09, Cox10a, Cox12, PPTT90b, PPD+95, Pre88, Ray94, Trb16]. Ier09, Cox10b, Ker07, Tho68]. Expressions Beyond [Ano90, Ano96a]. Big [MKM+14]. [KP99b, MY60, Lau00]. Brace [Ano96a]. Built [Win00a]. Fast [Cox07]. Fe [IEE04]. Feature [Fil96]. C [Pik00b, Tho00a]. CA [USE00, USE02]. Feature-Rich [Fil96]. Fi [Goo90]. File Cached [Qui91]. California [Pik00c, Pik00d, Qui91, Tho00b, Wel93, [USE93, USE94]. Came [Trb16]. Can Wel94]. Files [HF00, ZMSD93]. Film [BGSL05, Cox07]. Case [BGSL05]. [Fil96]. Finite [RS59]. First [Ano96a]. Changes [Pik02]. clusters [MM06]. code Fourth [Pik02]. Francisco [USE94, USE02]. [OW07, Cox12]. comment [JCMS97]. Future [Goo90]. Communications [IEE05]. comparison [Wel93, Wel94]. Compiler [Pik00b]. Generation [Kue97]. gets [GS93]. Getting Compilers [Tho00a]. Compressed [Cox00, Pik00c, Pik00d]. GNU [ZMSD93]. computer [PPT91]. [Ano95b, Ano95c, Rob95a, Rob95b]. Go Computing [Ano96a]. Good [Fen96]. Google [Cox12]. [Ano96b, IEE05, MKM+14, MS04]. Grammars [Ier09]. Graphs [MY60]. Grid Conference [ABB93, Eur91, IEE05, USE88, [MS04]. grids [MM06]. Guide USE93, USE94, USE00]. contrary [PPT91]. [Gli00, Kot94, GS93]. controls [Ano95a]. conversion [Lau00]. Costs [Ano96a]. Cutting [Ano96a]. Hawaii [IEE05]. Hello [PT93, PT00]. Hierarchies [JCSM96, JCMS97]. Hike data [ABB93]. Databases [Ano96a]. Dead [Ano96a]. history [Ritxx]. hold [Ano95a]. [MI07]. Debugger [Win94, Win00a]. Holistic [VFMM08]. decision [RS59]. Designing [JCSM96, PPTT91a, PPT91, JCMS97]. IEEE [IEE05]. II [Rob95b]. incomplete Desktop [Ano96a]. deterministic [Lau00]. [Ritxx]. Index [Cox12]. Inferno [Ano96a]. Diego [USE93, USE00]. Distributed installation [GS93]. Installing [Ano96b, BJ94, Eur91, IEE04, MKM+14, [Anoxxa, Ano00a]. integrated [MS04]. PPTT94, PPT91, PPTT91b, PPTT92, Interface [Pik94]. International Ray94, Wel93, Wel94]. Distribution [ABB93, IEE04, IEE05]. Inverted [Anoxxa, Anoxxc, Anoxxd, Ano00a]. DMI [ZMSD93]. Ireland [ABB93]. Irrelevant [Ano96a]. Documents [P+96b]. Dot [Pik00g]. ISDN [Ano96a]. Island [IEE05]. [Pik00c, Pik00d]. Dot-Dot [Pik00c, Pik00d]. Downsizing [Ano96a]. Draft [Kot94]. January [USE93, USE94]. Java [Ano96a]. Dublin [ABB93]. June [USE00]. 3 Kauai [IEE05]. Kernel Open [Eur91, BJ94]. Operating [Ano96c, Kor96, USE92]. Kernels [USE92]. [Fen96, Ano95a, Ray94]. organization Konzepte [B+99]. [PW93]. OSes [MI07]. Other [Pik00f, USE92]. Outer Laboratories [Ray94]. Labs [Ano96c, Kor96, Lug81, WJV+84]. [BGSL05, PPTT90a, PPTT90b, PPD+95, Pre88, Trb16]. Language Parallel [IEE04]. Parsing [Ier09]. Part [Luc97, Win94, Win00a]. Languages [Rob95a, Rob95b, Ano95b, Ano95c]. [KP99b, McI04]. Large [ZMSD93, ABB93]. Partially [ZMSD93]. pattern [Ier09]. Lexical [Pik00c, Pik00d]. Lexicons pattern-matching [Ier09]. PC [Bai96a]. [ZMSD93]. library [Cox10b]. License PerCom [IEE05]. Perspective [Eur91]. [Sta12]. like [PPT91]. Limbo [Luc97]. line Pervasive [BGSL05, IEE05]. Plan [Ano95a]. Link [Ano96a]. Linux [Ano96b, B+99, Kue97, Pik00e, Sko98, Ano90, [Gan08, Min01]. List [Anoxxd]. London Ano95a, Ano95b, Ano95c, Ano96a, Ano96b, [USE88]. look [PPT91]. lot [PPT91]. lp Ano96d, Ano96c, Anoxxa, Anoxxb, Anoxxc, [Gli00]. Anoxxd, Ano00a, Bai96b, Bai96a, BGSL05, Cox00, CGP+02, DPP92, Duf90a, Duf90b, Machine [Cox09]. maintain [Ano95a]. Duf00, Fen96, Fil96, Fla00, Fla02, Gan08, Maintaining [HF00]. man [GS93]. Goo90, GS93, HF00, Kor96, Kot94, Lug81, management [MM06]. Manual MKM+14, MS04, PPTT90a, PPTT90b, [OK00, P+96a, P+96b, Pik00e, Win00b]. PPTT91a, PPT91, Pik91, PPT+92, Manuals [P+96a]. March [IEE05]. PPT+93, PPD+95, P+96a, P+96b, Pik00b, matcher [Ker07]. Matching Pik00c, Pik00d, Pik00a, Pik02, Pre88, Pre90, [Cox07, Cox09, Cox10a, Cox12, Ier09]. PPTT91b, PPTT92, Pre93a, Pre93b, PW93, Matter [MI07]. May [Eur91, PPT91]. PPTT94, Ray94, Rob95a, Rob95b, Sta12, media [Ano96d]. Memory Tho00a, Tho00b, Wel93, Wel94, WJV+84]. [JCSM96, JCMS97, PPTH00]. Mexico plans [Ano95a]. Plumbing [Pik00f]. poor [IEE04]. Micro [USE92]. Micro-Kernels [GS93]. Ports [Ano00b]. POSIX [USE92]. might [PPT91]. Mk [HF00]. [Sko98, Tri00]. Practice [KP99a]. Price Mkfiles [Fla00]. Mobile [Ano96d]. Model [Ano96a]. principled [Cox10b]. Printer [JCSM96, JCMS97]. modifications [Gli00]. Private [Min01]. Problems [Ano95a]. Movie [Fen96]. Multi [Ano96d]. [Sta12, RS59]. Proceedings Multi-media [Ano96d]. Multics [Eur91, USE88, USE92, USE93, USE94, [MKM+14]. Multiprocessor USE02, ABB93, IEE05, IEE04]. Process [PPTH00, Pre90, Pre93a, Pre93b]. [PPTH00, MM06]. Processing [IEE04]. Professionals [Ano96a]. Programmer naechste [Kue97]. Name [P+96a, P+96b]. Programmers [Pik94]. [PPT+92, PPT+93]. Names Programmierung [B+99]. Programming [Pik00c, Pik00d]. Namespaces [Min01]. [KP99a, Luc97, Pik02, Tho68]. protocol Network [Pre88]. networks [PW93]. [PW00]. Netzbetriebssystem [B+99]. News [Kor96]. NFAs [Lau00]. Norway [Eur91]. QED [Ritxx]. o [PT00]. Object [Ano96a]. online [DL67]. RAID [Ano96a]. RAID-5 [Ano96a]. Rc REFERENCES 4 [Duf90a, Duf90b, Duf00]. re2 [Cox10b]. [Eur91]. Reduce [Ano96a]. Regular [Cox07, Cox09, Cox10a, Cox12, KP99b, Ubiquitous [BGSL05]. ugly [GS93]. MY60, Cox10b, Ker07, Lau00, McI04, Tho68]. Universe [MKM+14]. UNIX Relational [Ano96a]. Release [Pik02]. [Bai96a, Eur91, Goo90, Sko98, Ano90, Research [Pik00g]. resource [VFMM08]. Duf90a, Duf90b]. USA Rich [Fil96]. Right [Pik00c, Pik00d]. [USE92, USE93, USE94, USE00]. Use [Ano96a, PPT+92, PPT+93, Pik00b]. User sam [Pik87, Pik00h]. San [OK00, Pik94]. Using [Hol00, ZMSD93]. [USE93, USE94, USE00, USE02]. Santa Utilities [Pik00f]. [IEE04]. Scalable [Ano96b]. School [Ano96a]. Sci [Goo90]. Sci-Fi [Goo90]. Various [Ano00b]. Venti [QD02]. Very Search [Cox12, Tho68]. Searching [ABB93]. Virtual [Cox09]. VLDB [ABB93]. [ZMSD93]. Seattle [USE92]. Security Vnode [Wel93, Wel94]. Volume [CGP+02, USE02, Ray94]. Server [Tho00b]. [P+96a, P+96b]. Service [Ano96a]. Setup [Kot94]. Shared [PPTH00]. Shared-memory [PPTH00]. WA [USE92]. Wakeup [PPTH00]. Well Shell [Duf00, Duf90a, Duf90b]. Simple [BGSL05]. Wild [Cox10a]. window [Cox07]. Sleep [PPTH00]. Slows [Ano96a]. [Pik91, Pik00a]. Winter [USE93, USE94]. Software [KP99b, Pik00g]. Some [MI07]. Work [BGSL05]. worked [Cox12]. Space [Ano96c, Kor96, Lug81, WJV+84]. Workshop [USE92]. Workshops [IEE05]. Spaces [PPT+92, PPT+93]. Specified World [PT93, PT00]. WORM [Qui91]. [ZMSD93]. SPIN [Hol00]. Spooler [Gli00]. Spring [Eur91, USE88]. Sprite XCPU [MM06]. [Wel93, Wel94]. Started [Cox00]. State [MY60]. Still [MI07]. storage [QD02]. Yourself [Ano96a]. Streams [Pre90, Pre93b, Pre93a]. strings [McI04]. Study [BGSL05]. Summer [Ano96a]. Support [Ano96a, Fla02]. References Symposium [IEE04, USE02]. System Agrawal:1993:VLD [Fen96, Kot94, MKM+14, Pik00g, PPTT94, Qui91, Ray94, Ano95a, MM06, Pik91, [ABB93] Rakesh Agrawal, Sean Baker, and Pik00a, PPTT91b, PPTT92, Wel93, Wel94]. David Bell, editors. Very large Systems [BGSL05, Eur91, BJ94, Duf90a, data bases, VLDB '93: pro- Duf90b, PPT91]. ceedings of the 19th Interna- tional Conference on Very Large tagged [Lau00]. Technical [USE00]. Data Bases, August 24{27, 1993, Techniques [Tho68]. Terms [ZMSD93]. Dublin, Ireland. Morgan Kauf- Text [Pik87, Pik00h, Ritxx, Ier09]. their mann Publishers, Los Altos, CA [Lau00, RS59]. there [GS93]. Third 94022, USA, 1993. ISBN 1-55860- [IEE05]. three [Wel93, Wel94]. tight 152-X. LCCN QA76.9.D3 I61 [Ano95a]. tomorrow [PPT91]. tool [Ier09]. 1993. Co-sponsored by VLDB Traditional [BGSL05]. transitions [Lau00]. Endowment and Irish Computer Trigram [Cox12]. Troff [OK00]. Tromsø Society; in co-operation with the REFERENCES 5 IEEE Technical Committee
Load more

Recommended publications
  • Venti Analysis and Memventi Implementation
    Master’s thesis Venti analysis and memventi implementation Designing a trace-based simulator and implementing a venti with in-memory index Mechiel Lukkien [email protected] August 8, 2007 Committee: Faculty of EEMCS prof. dr. Sape J. Mullender DIES, Distributed and Embedded Systems ir. J. Scholten University of Twente ir. P.G. Jansen Enschede, The Netherlands 2 Abstract [The next page has a Dutch summary] Venti is a write-once content-addressed archival storage system, storing its data on magnetic disks: each data block is addressed by its 20-byte SHA-1 hash (called score). This project initially aimed to design and implement a trace-based simula- tor matching Venti behaviour closely enough to be able to use it to determine good configuration parameters (such as cache sizes), and for testing new opti- misations. A simplistic simulator has been implemented, but it does not model Venti behaviour accurately enough for its intended goal, nor is it polished enough for use. Modelled behaviour is inaccurate because the advanced optimisations of Venti have not been implemented in the simulator. However, implementation suggestions for these optimisations are presented. In the process of designing the simulator, the Venti source code has been investigated, the optimisations have been documented, and disk and Venti per- formance have been measured. This allowed for recommendations about per- formance, even without a simulator. Beside magnetic disks, also flash memory and the upcoming mems-based storage devices have been investigated for use with Venti; they may be usable in the near future, but require explicit support. The focus of this project has shifted towards designing and implementing memventi, an alternative implementation of the venti protocol.
    [Show full text]
  • Java Implementation of the Graphical User Interface of the Octopus Distributed Operating System
    Java implementation of the graphical user interface of the Octopus distributed operating system Submitted by Aram Sadogidis Advisor Prof. Spyros Lalis University of Thessaly Volos, Greece October 2012 Acknowledgements I am sincerely grateful for all the people that supported me during my Uni- versity studies. Special thanks to professor Spyros Lalis, my mentor, who had decisive influence in shaping my character as an engineer. Also many thanks to my family and friends, whose support all these years, encouraged me to keep moving forward. 1 Contents 1 Introduction 4 2 System software technologies 6 2.1 Inferno OS . 6 2.2 JavaSE and Android framework . 8 2.3 Synthetic file systems . 10 2.3.1 Styx . 10 2.3.2 Op . 12 3 Octopus OS 14 3.1 UpperWare architecture . 14 3.2 Omero, a filesystem based window system . 16 3.3 Olive, the Omero viewer . 19 3.4 Ox, the Octopus shell . 21 4 Java Octopus Terminal 23 4.1 JOlive . 24 4.2 Desktop version . 25 4.2.1 Omero package . 26 4.2.2 ui package . 27 4.3 Android version . 28 4.3.1 com.jolive.Omero . 28 4.3.2 com.jolive.ui . 29 4.3.3 Pull application's UI . 30 5 Future perspective 33 5.1 GPS resources . 33 5.2 JOp . 34 5.3 Authentication device . 34 5.4 Remote Voice commander . 34 5.5 Conclusion . 35 6 Thesis preview in Greek 38 2 List of Figures 2.1 An application operates on a synthetic file as if it is a disk file, effectively communicating with a synthetic file system server.
    [Show full text]
  • Persistent 9P Sessions for Plan 9
    Persistent 9P Sessions for Plan 9 Gorka Guardiola, [email protected] Russ Cox, [email protected] Eric Van Hensbergen, [email protected] ABSTRACT Traditionally, Plan 9 [5] runs mainly on local networks, where lost connections are rare. As a result, most programs, including the kernel, do not bother to plan for their file server connections to fail. These programs must be restarted when a connection does fail. If the kernel’s connection to the root file server fails, the machine must be rebooted. This approach suffices only because lost connections are rare. Across long distance networks, where connection failures are more common, it becomes woefully inadequate. To address this problem, we wrote a program called recover, which proxies a 9P session on behalf of a client and takes care of redialing the remote server and reestablishing con- nection state as necessary, hiding network failures from the client. This paper presents the design and implementation of recover, along with performance benchmarks on Plan 9 and on Linux. 1. Introduction Plan 9 is a distributed system developed at Bell Labs [5]. Resources in Plan 9 are presented as synthetic file systems served to clients via 9P, a simple file protocol. Unlike file protocols such as NFS, 9P is stateful: per-connection state such as which files are opened by which clients is maintained by servers. Maintaining per-connection state allows 9P to be used for resources with sophisticated access control poli- cies, such as exclusive-use lock files and chat session multiplexers. It also makes servers easier to imple- ment, since they can forget about file ids once a connection is lost.
    [Show full text]
  • HTTP-FUSE Xenoppix
    HTTP-FUSE Xenoppix Kuniyasu Suzaki† Toshiki Yagi† Kengo Iijima† Kenji Kitagawa†† Shuichi Tashiro††† National Institute of Advanced Industrial Science and Technology† Alpha Systems Inc.†† Information-Technology Promotion Agency, Japan††† {k.suzaki,yagi-toshiki,k-iijima}@aist.go.jp [email protected], [email protected] Abstract a CD-ROM. Furthermore it requires remaking the entire CD-ROM when a bit of data is up- dated. The other solution is a Virtual Machine We developed “HTTP-FUSE Xenoppix” which which enables us to install many OSes and ap- boots Linux, Plan9, and NetBSD on Virtual plications easily. However, that requires in- Machine Monitor “Xen” with a small bootable stalling virtual machine software. (6.5MB) CD-ROM. The bootable CD-ROM in- cludes boot loader, kernel, and miniroot only We have developed “Xenoppix” [1], which and most part of files are obtained via Internet is a combination of CD/DVD bootable Linux with network loopback device HTTP-FUSE “KNOPPIX” [2] and Virtual Machine Monitor CLOOP. It is made from cloop (Compressed “Xen” [3, 4]. Xenoppix boots Linux (KNOP- Loopback block device) and FUSE (Filesys- PIX) as Host OS and NetBSD or Plan9 as Guest tem USErspace). HTTP-FUSE CLOOP can re- OS with a bootable DVD only. KNOPPIX construct a block device from many small block is advanced in automatic device detection and files of HTTP servers. In this paper we describe driver integration. It prepares the Xen environ- the detail of the implementation and its perfor- ment and Guest OSes don’t need to worry about mance. lack of device drivers.
    [Show full text]
  • Bell Labs, the Innovation Engine of Lucent
    INTERNSHIPS FOR RESEARCH ENGINEERS/COMPUTER SCIENTISTS BELL LABS DUBLIN (IRELAND) – BELL LABS STUTTGART (GERMANY) Background Candidates are expected to have some experience related to the following topics: Bell Laboratories is a leading end-to-end systems and • Operating systems, virtualisation and computer solutions research lab working in the areas of cloud architectures. and distributed computing, platforms for real-time • big-data streaming and analytics, wireless networks, Software development skills (C/C++, Python). • semantic data access, services-centric operations and Computer networks and distributed systems. thermal management. The lab is embedded in the • Optimisation techniques and algorithms. great traditions of the Bell Labs systems research, in- • Probabilistic modelling of systems performance. ternationally renowned as the birthplace of modern The following skills or interests are also desirable: information theory, UNIX, the C/C++ programming • languages, Awk, Plan 9 from Bell Labs, Inferno, the Experience with OpenStack or OpenNebula or Spin formal verification tool, and many other sys- other cloud infrastructure management software. • tems, languages, and tools. Kernel-level programming (drivers, scheduler,...). • Xen, KVM and Linux scripting/administration. We offer summer internships in our Cloud • Parallel and distributed systems programming Computing team, spread across the facilities in Dublin (Ireland) and Stuttgart (Germany), focusing (MPI, OpenMP, CUDA, MapReduce, StarSs, …). • on research enabling future cloud
    [Show full text]
  • Dynamic Extension of Typed Functional Languages
    Dynamic Extension of Typed Functional Languages Don Stewart PhD Dissertation School of Computer Science and Engineering University of New South Wales 2010 Supervisor: Assoc. Prof. Manuel M. T. Chakravarty Co-supervisor: Dr. Gabriele Keller Abstract We present a solution to the problem of dynamic extension in statically typed functional languages with type erasure. The presented solution re- tains the benefits of static checking, including type safety, aggressive op- timizations, and native code compilation of components, while allowing extensibility of programs at runtime. Our approach is based on a framework for dynamic extension in a stat- ically typed setting, combining dynamic linking, runtime type checking, first class modules and code hot swapping. We show that this framework is sufficient to allow a broad class of dynamic extension capabilities in any statically typed functional language with type erasure semantics. Uniquely, we employ the full compile-time type system to perform run- time type checking of dynamic components, and emphasize the use of na- tive code extension to ensure that the performance benefits of static typing are retained in a dynamic environment. We also develop the concept of fully dynamic software architectures, where the static core is minimal and all code is hot swappable. Benefits of the approach include hot swappable code and sophisticated application extension via embedded domain specific languages. We instantiate the concepts of the framework via a full implementation in the Haskell programming language: providing rich mechanisms for dy- namic linking, loading, hot swapping, and runtime type checking in Haskell for the first time. We demonstrate the feasibility of this architecture through a number of novel applications: an extensible text editor; a plugin-based network chat bot; a simulator for polymer chemistry; and xmonad, an ex- tensible window manager.
    [Show full text]
  • Knowledge Management Enviroments for High Throughput Biology
    Knowledge Management Enviroments for High Throughput Biology Abhey Shah A Thesis submitted for the degree of MPhil Biology Department University of York September 2007 Abstract With the growing complexity and scale of data sets in computational biology and chemoin- formatics, there is a need for novel knowledge processing tools and platforms. This thesis describes a newly developed knowledge processing platform that is different in its emphasis on architecture, flexibility, builtin facilities for datamining and easy cross platform usage. There exist thousands of bioinformatics and chemoinformatics databases, that are stored in many different forms with different access methods, this is a reflection of the range of data structures that make up complex biological and chemical data. Starting from a theoretical ba- sis, FCA (Formal Concept Analysis) an applied branch of lattice theory, is used in this thesis to develop a file system that automatically structures itself by it’s contents. The procedure of extracting concepts from data sets is examined. The system also finds appropriate labels for the discovered concepts by extracting data from ontological databases. A novel method for scaling non-binary data for use with the system is developed. Finally the future of integrative systems biology is discussed in the context of efficiently closed causal systems. Contents 1 Motivations and goals of the thesis 11 1.1 Conceptual frameworks . 11 1.2 Biological foundations . 12 1.2.1 Gene expression data . 13 1.2.2 Ontology . 14 1.3 Knowledge based computational environments . 15 1.3.1 Interfaces . 16 1.3.2 Databases and the character of biological data .
    [Show full text]
  • Plan 9 from Bell Labs
    Plan 9 from Bell Labs “UNIX++ Anyone?” Anant Narayanan Malaviya National Institute of Technology FOSS.IN 2007 What is it? Advanced technology transferred via mind-control from aliens in outer space Humans are not expected to understand it (Due apologies to lisperati.com) Yeah Right • More realistically, a distributed operating system • Designed by the creators of C, UNIX, AWK, UTF-8, TROFF etc. etc. • Widely acknowledged as UNIX’s true successor • Distributed under terms of the Lucent Public License, which appears on the OSI’s list of approved licenses, also considered free software by the FSF What For? “Not only is UNIX dead, it’s starting to smell really bad.” -- Rob Pike (circa 1991) • UNIX was a fantastic idea... • ...in it’s time - 1970’s • Designed primarily as a “time-sharing” system, before the PC era A closer look at Unix TODAY It Works! But that doesn’t mean we don’t develop superior alternates GNU/Linux • GNU’s not UNIX, but it is! • Linux was inspired by Minix, which was in turn inspired by UNIX • GNU/Linux (mostly) conforms to ANSI and POSIX requirements • GNU/Linux, on the desktop, is playing “catch-up” with Windows or Mac OS X, offering little in terms of technological innovation Ok, and... • Most of the “modern ideas” we use today were “bolted” on an ancient underlying system • Don’t believe me? A “modern” UNIX Terminal Where did it go wrong? • Early UNIX, “everything is a file” • Brilliant! • Only until people started adding “features” to the system... Why you shouldn’t be working with GNU/Linux • The Socket API • POSIX • X11 • The Bindings “rat-race” • 300 system calls and counting..
    [Show full text]
  • Computerized Patient Record System (CPRS) Setup Guide
    Computerized Patient Record System (CPRS) Setup Guide June 2021 Department of Veterans Affairs Health Data Systems Computerized Patient Record System Product Line Revision History Project Technical Date Patch Page Change Manager Writer 6/17/2021 OR*3*0*547 30 Added row to GUI Parameters SHRPE SHRPE Menu Options for OTH: GUI Add/Edit Local Message for OTH Button. Added Subsection for GUI 37-38 Add/Edit Local Message for OTH Button 10/16/2019 OR*3.0*397 All Added Revision dated REDACTED REDACTED 3/25/2019 (see below). Checked for 508 Compliance. Removed extra space between some pages. Removed extra Table of Contents from Pharmacy Packages section (G). 07/31/2019 OR*3.0*510 88 Added two NOTE: REDACTED REDACTED 3/25/2019 OR*3.0*397 21 Added ORSUPPLY Key REDACTED REDACTED 08/20/2018 XU*8.0*679 28 Added note regarding Electronic REDACTED REDACTED Signature Block restrictions. 03/30/2011 OR*3.0*272 5, 77, Changed references from REDACTED REDACTED 79, Duplicate Drug Class to 81, Duplicate Drug Therapy. 82, 93, 01/25/2007 OR*3.0*245 123 – Added information about the REDACTED REDACTED 125 new option, ORCM QUICK ORDERS BY USER 11/27/06 OR*3.0*242 182 Added information about the REDACTED REDACTED new way to edit items for the Nature of Order file. 12/30/04 36 Added new information about REDACTED REDACTED document templates. Computerized Patient Record System (CPRS) ii June 2021 Setup Guide Project Technical Date Patch Page Change Manager Writer 10/14/98 138 Added information about ORMTIME 10/15/98 14 Added explanation of global journaling 10/20/98
    [Show full text]
  • Acme As an Interactive Translation Environment
    Acme as an Interactive Translation Environment Eric Nichols and Yuji Matsumoto {eric-n,matsu} ߞatߞ is.naist.jp Computational Linguistics Laboratory Nara Institute of Science and Technology ABSTRACT Translation is challenging and repetitive work. Computer-aided transla­ tion environments attempt to ease the monotony by automating many tasks for human translators, however, it is difficult to design user inter­ faces that are easy to use but that can also be adapted to a dynamic workflow. This is often a result of a lack of connection between the inter­ face and the tasks that the user wants to carry out. A better correspon­ dence between task and interface can be achieved by simplifying how software tools are named. One way of accomplishing this to embrace text as the interface. By providing a simple and consistent semantics for interpreting text as commands, the Acme text editor [1] makes it possible to build a system with a text-centered interface. In this paper we explore the implications this has for translation aid software. 1. Motivation Translation is an essential and important part of human communication. However, it is a very challenging task, requiring the translator to have a complete understanding of and a deep familiarity with the source and target languages. This difficulty is not eased by the fact that fundamentally it is an inherently repetitive task, consisting of looking up unfamiliar words and doing large amounts of editing to produce a good translation. Given these demands, computers provide a good way to ease this repetitiveness by automating lookup and editing; by converting resources like dictionaries, other transla­ tions, and collections of example sentences to a computer-readable format, lookups can be performed much faster.
    [Show full text]
  • Regent: a High-Productivity Programming Language for Implicit Parallelism with Logical Regions
    REGENT: A HIGH-PRODUCTIVITY PROGRAMMING LANGUAGE FOR IMPLICIT PARALLELISM WITH LOGICAL REGIONS A DISSERTATION SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE AND THE COMMITTEE ON GRADUATE STUDIES OF STANFORD UNIVERSITY IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY Elliott Slaughter August 2017 © 2017 by Elliott David Slaughter. All Rights Reserved. Re-distributed by Stanford University under license with the author. This work is licensed under a Creative Commons Attribution- Noncommercial 3.0 United States License. http://creativecommons.org/licenses/by-nc/3.0/us/ This dissertation is online at: http://purl.stanford.edu/mw768zz0480 ii I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Alex Aiken, Primary Adviser I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Philip Levis I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Oyekunle Olukotun Approved for the Stanford University Committee on Graduate Studies. Patricia J. Gumport, Vice Provost for Graduate Education This signature page was generated electronically upon submission of this dissertation in electronic format. An original signed hard copy of the signature page is on file in University Archives. iii Abstract Modern supercomputers are dominated by distributed-memory machines. State of the art high-performance scientific applications targeting these machines are typically written in low-level, explicitly parallel programming models that enable maximal performance but expose the user to programming hazards such as data races and deadlocks.
    [Show full text]
  • (Brief) 2. an Extensible Compiler for Systems Programming
    Show and Tell 1. Plan 9 Things (brief) 2. An Extensible Compiler for Systems Programming Russ Cox rsc@plan9 1127 Show and Tell April 19, 2005 who am i ................................................................................................................. ‘‘Neighborhood kid’’ 1995 summer hacking Excel (jlb) 1995-1997 cable modems (nls, tom) 1997-1999 annoying Plan 9 user 1999 summer doing Plan 9 graphics (rob, jmk) 1999-present assorted Plan 9 hacking Plan 9 Things ........................................................................................................ VBE ߝ use BIOS to set up VGA modes ߝ requires switching into real mode and back Venti ߝ reworked significantly ߝ aggressive caching, prefetching, batching, delayed writes ߝ Bloom filter to avoid index misses Plan 9 from User Space (plan9port) ߝ port bulk of Plan 9 software to Unix systems ߝ Linux, FreeBSD, NetBSD, SunOS, Mac OS X .................................................................................................................................... An Extensible Compiler for Systems Programming Russ Cox Frans Kaashoek Eddie Kohler [email protected] Outline ..................................................................................................................... Why bother? What could it do? How could it work? Ground rules: ߝ interrupt with questions ߝ work in progress ߝ show and tell, not a job talk Man vs. Machine ߝ Linguistic Tensions ................................................... The most important readers of a program are people.
    [Show full text]