The Redirect-On-Write File System and Characterization of I/O Overheads in a Virtualized Platform

Total Page:16

File Type:pdf, Size:1020Kb

The Redirect-On-Write File System and Characterization of I/O Overheads in a Virtualized Platform PROVISIONING WIDE-AREA VIRTUAL ENVIRONMENTS THROUGH I/O INTERPOSITION: THE REDIRECT-ON-WRITE FILE SYSTEM AND CHARACTERIZATION OF I/O OVERHEADS IN A VIRTUALIZED PLATFORM By VINEET CHADHA A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY UNIVERSITY OF FLORIDA 2008 1 °c 2008 Vineet Chadha 2 I dedicate this thesis to my parents 3 ACKNOWLEDGMENTS I would like to thank my advisor Dr. Renato Figueiredo for all the support he has provided me during last six years. He has been taking around the maze of systems research and shown me the right way whenever I felt lost. It has been a privilege to work with Dr. Figueiredo whose calmness, humble and polite demeanor is the one i would like to carry and apply further in my career. Thanks to Dr. Jose Fortes who provided me opportunity to work at Advanced Computing and Information System (ACIS) laboratory. He gave me encouragement and support whenever things were down. I would like to thank Dr. Oscar Boykin for serving in my committee and for all those fruitful discussions on Research, Linux, healthy food and Running. His passion to achieve perfection in every endeavors of life often eggs me to do better. Thanks to Dr. Alan George and Dr. Joseph Wilson for serving in my PhD program committee and motivating me through their courses and research work. I would like to thank my mentor, Ramesh Illikkal and manager, Donald Newell at Intel Corporation for the faith they have shown in me and egged me to work hard. It has been a privilege to work with Ramesh who taught me importance of teamwork, failure and success. Thanks to Dr. Padmashree Apparao and Dr. Ravishankar Iyer for guidance and encouragement to achieve my goals. Thanks is also due to Dr. Ivan krsul and Dr. Suma Adabala for guiding me not only during the development and research of In-VIGO project but also often sharing thoughts on a PhD program and expectations. Thanks is due to all the colleagues here at ACIS which made work environment fun to work in. I would like to thank Andrea and Mauricio for providing excellent research facilities and resources. Thanks to my officemates Arijit and Girish for all fruitful discussions. Thanks is due to Cathy for maintaining cordial environment in ACIS lab and extending support to me as a good friend whenever need arises. 4 Thanks further to rest of the team members in Many core architecture group at Intel Corporation. I am thankful to National Science Foundation and Intel Corporation for providing me financial assistance during my PhD program. Thanks is due to Department of Electrical Engineering and the Department of Computer Information Science and Engineering for maintaining all the paperwork related to my appointment, travel and PhD milestones that made my life easier in Gainesville. This dissertation would not have been possible without unwavering support from friends and family. I would like to thank my good friend, Hemang for support and encouragement he provided me in past six years. This dissertation is dedicated to my parents whose sacrifices can not be described in words. They have been source of strength all these years. The good values and importance of education they have imbibed in me has been a guiding light in my career. Thanks is due to my brother who often guided me the right way to achieve the goals in the life. Finally, I thank almighty for giving me strength to work hard. 5 TABLE OF CONTENTS page ACKNOWLEDGMENTS ................................. 4 LIST OF TABLES ..................................... 9 LIST OF FIGURES .................................... 10 ABSTRACT ........................................ 13 CHAPTER 1 INTRODUCTION .................................. 16 1.1 Introduction ................................... 16 1.1.1 Virtual Network File System I/O Redirection ............. 16 1.1.2 Characterization of I/O Overheads in a Virtualized Environments . 18 1.1.2.1 Simulation ........................... 19 1.1.2.2 I/O Mechanisms ....................... 19 1.2 Dissertation Contributions ........................... 20 1.3 Dissertation Relevance ............................. 22 1.4 Dissertation Overview ............................. 23 1.5 Dissertation Organization ........................... 26 2 I/O VIRTUALIZATION: RELATED TERMS AND TECHNOLOGIES ..... 28 2.1 Introduction ................................... 28 2.2 Virtualization Technologies ........................... 29 2.3 Virtual Machine Architectures ......................... 32 2.3.1 I/O mechanisms in Virtual Machines ................. 32 2.3.2 Virtual Machines and CMP architectures ............... 34 2.4 Grid Computing ................................ 35 2.5 File System Virtualization ........................... 35 2.5.1 Network File System .......................... 36 2.5.2 Grid Virtual File System ........................ 38 3 REDIRECT-ON-WRITE DISTRIBUTED FILE SYSTEM ............ 41 3.1 Introduction ................................... 41 3.1.1 File System Abstraction ........................ 41 3.1.2 Redirect-on-Write File System ..................... 42 3.2 Motivation and Background .......................... 42 3.2.1 Use-Case Scenario: File System Sessions for Grid Computing .... 44 3.2.2 Use-Case Scenario: NFS-Mounted Virtual Machine Images and O/S File Systems ............................... 44 6 3.2.3 Use-Case Scenario: Fault Tolerant Distributed Computing with Virtual Machines ................................. 45 3.3 ROW-FS Architecture ............................. 47 3.3.1 Hash Table ................................ 48 3.3.2 Bitmap .................................. 49 3.4 ROW-FS Implementation ........................... 51 3.4.1 MOUNT ................................. 51 3.4.2 LOOKUP ................................ 53 3.4.3 GETATTR/SETATTR ......................... 54 3.4.4 READ .................................. 54 3.4.5 WRITE ................................. 55 3.4.6 READDIR ................................ 55 3.4.7 REMOVE/RMDIR/RENAME ..................... 58 3.4.8 LINK/READLINK ........................... 58 3.4.9 SYMLINK ................................ 60 3.4.10 CREATE/MKDIR ........................... 60 3.4.11 STATFS ................................. 60 3.5 Experimental Results .............................. 60 3.5.1 Microbenchmark ............................. 61 3.5.2 Application Benchmark ......................... 63 3.5.3 Virtual Machine Instantiation ..................... 66 3.5.4 File System Comparison ........................ 67 3.6 Related Work .................................. 68 3.7 Conclusion .................................... 68 4 PROVISIONING OF VIRTUAL ENVIRONMENTS FOR WIDE AREA DESKTOP GRIDS ......................................... 70 4.1 Introduction ................................... 70 4.2 Data Provisioning Architecture ........................ 71 4.3 ROW-FS Consistency and Replication Approach ............... 78 4.3.1 ROW-FS Consistency in Image Provisioning ............. 79 4.3.2 ROW-FS Replication in Image Provisioning .............. 80 4.4 Security Implications .............................. 81 4.5 Experiments and Results ............................ 84 4.5.1 Proxy VM Resource Consumption ................... 84 4.5.2 RPC Call Profile ............................ 86 4.5.3 Data Transfer Size ............................ 87 4.5.4 Wide-area Experiment ......................... 87 4.5.5 Distributed Hash Table State Evaluation and Analysis ........ 88 4.6 Related Work .................................. 88 4.7 Conclusion .................................... 90 7 5 I/O WORKLOAD PERFORMANCE CHARACTERIZATION .......... 91 5.1 Introduction ................................... 92 5.2 Motivation and Background .......................... 93 5.2.1 Full System Simulator .......................... 94 5.2.2 I/O Virtualization in Xen ........................ 94 5.3 Analysis Methodology ............................. 96 5.3.1 Full System Simulation: Xen VMM as Workload ........... 96 5.3.2 Instruction Trace ............................ 97 5.3.3 Symbol Annotation ........................... 98 5.3.4 Performance Statistics ......................... 98 5.3.5 Environmental Setup for Virtualized Workload ............ 100 5.4 Experiments and Simulation Results ..................... 102 5.4.1 Life Cycle of an I/O packet ....................... 102 5.4.1.1 Unprivileged Domain ..................... 103 5.4.1.2 Grant Table Mechanism ................... 105 5.4.1.3 Timer Interrupts ....................... 105 5.4.1.4 Privileged Domain ...................... 106 5.4.2 Cache and TLB Characteristics .................... 108 5.5 Cache and TLB Scaling ............................ 110 5.6 Related Work .................................. 114 5.7 Conclusion .................................... 115 6 HARDWARE SUPPORT FOR I/O WORKLOADS: AN ANALYSIS ...... 116 6.1 Introduction ................................... 116 6.2 Translation Lookaside Buffer .......................... 117 6.2.1 Introduction ............................... 117 6.2.2 TLB Invalidation in Multiprocessors .................. 118 6.3 Interprocessor Interrupts ............................ 120 6.4 Grant Table Mechanism: I/O Analysis .................... 121 6.5 Experiments and Results ............................ 123 6.5.1 Grant Table Performance ........................ 123 6.5.2 Hypervisor Global Bit .......................... 124 6.5.3 TLB Coherence Evaluation ....................... 125 6.6 Related Work .................................
Recommended publications
  • A Stackable File System for Large Article Directories
    Usenetfs: A Stackable File System for Large Article Directories Erez Zadok and Ion Badulescu Computer Science Department, Columbia University {ezk,ion}@cs.columbia.edu CUCS-022-98 Abstract rectories are visible. Usenetfs is small and is transparent to the user. It re- The Internet has grown much in popularity in the past quires no change to News software, to other file systems, few years. Numerous users read USENET newsgroups or to the rest of the operating system. Usenetfs is more daily for entertainment, work, study, and more. USENET portable than other native kernel-based file systems be- News servers have seen a gradual increase in the traffic cause it interacts with the Vnode interface which is similar exchanged between them, to a point where the hardware on many different platforms. and software supporting the servers is no longer capable of meeting demand, at which point the servers begin “drop- ping” articles they could not process. The rate of this in- 1 Introduction crease has been faster than software or hardware improve- ments were able to keep up, resulting in much time and ef- USENET is a popular world-wide network consisting of fort spent by administrators upgrading their news systems. thousands of discussion and informational “news groups.” One of the primary reasons for the slowness of news Many of these are very popular and receive thousands of servers has been the need to process many articles in very articles each day. In addition, many control messages are large flat directories representing newsgroups such as con- exchanged between news servers around the world, a large trol.cancel and misc.jobs.offered.
    [Show full text]
  • Extendable Storage Framework for Reliable Clustered Storage Systems by Sumit Narayan B.E., University of Madras, 2002 M.S., University of Connecticut, 2004
    Extendable Storage Framework for Reliable Clustered Storage Systems Sumit Narayan, Ph.D. University of Connecticut, 2010 The total amount of information stored on disks has increased tremendously in re­ cent years with data storage, sharing and backup becoming more important than ever. The demand for storage has not only changed in size, but also in speed, reli­ ability and security. These requirements not only create a big challenge for storage administrators who must decide on several aspects of storage policy with respect to provisioning backups, retention, redundancy, security, performance, etc. but also for storage system architects who must aim for a one system fits all design. Storage poli­ cies like backup and security are typically set by system administrators for an entire file system, logical volume or storage pool. However, this granularity is too large and can sacrifice storage efficiency and performance - particularly since different files have different storage requirements. In the same context, clustered storage systems that are typically used for data storage or as file servers, provide very high performance and maximum scalability by striping data across multiple nodes. However, high num­ ber of storage nodes in such large systems also raises concerns for reliability in terms of loss of data due to failed nodes, or corrupt blocks on disk drives. Redundancy techniques similar to RAID across these nodes are not common because of the high overhead incurred owing to the parity calculations for all the files present on the file system. In the same way, data integrity checks are often omitted or disabled in file systems to guarantee high throughput from the storage system.
    [Show full text]
  • 1999 CERT Advisories
    1999 CERT Advisories CERT Division [DISTRIBUTION STATEMENT A] Approved for public release and unlimited distribution. http://www.sei.cmu.edu REV-03.18.2016.0 [DISTRIBUTION STATEMENT A] Approved for public release and unlimited distribution. Copyright 2017 Carnegie Mellon University. All Rights Reserved. This material is based upon work funded and supported by the Department of Defense under Contract No. FA8702-15-D-0002 with Carnegie Mellon University for the operation of the Software Engineering Institute, a federally funded research and development center. The view, opinions, and/or findings contained in this material are those of the author(s) and should not be con- strued as an official Government position, policy, or decision, unless designated by other documentation. References herein to any specific commercial product, process, or service by trade name, trade mark, manu- facturer, or otherwise, does not necessarily constitute or imply its endorsement, recommendation, or favoring by Carnegie Mellon University or its Software Engineering Institute. This report was prepared for the SEI Administrative Agent AFLCMC/AZS 5 Eglin Street Hanscom AFB, MA 01731-2100 NO WARRANTY. THIS CARNEGIE MELLON UNIVERSITY AND SOFTWARE ENGINEERING INSTITUTE MATERIAL IS FURNISHED ON AN "AS-IS" BASIS. CARNEGIE MELLON UNIVERSITY MAKES NO WARRANTIES OF ANY KIND, EITHER EXPRESSED OR IMPLIED, AS TO ANY MATTER INCLUDING, BUT NOT LIMITED TO, WARRANTY OF FITNESS FOR PURPOSE OR MERCHANTABILITY, EXCLUSIVITY, OR RESULTS OBTAINED FROM USE OF THE MATERIAL. CARNEGIE MELLON UNIVERSITY DOES NOT MAKE ANY WARRANTY OF ANY KIND WITH RESPECT TO FREEDOM FROM PATENT, TRADEMARK, OR COPYRIGHT INFRINGEMENT. [DISTRIBUTION STATEMENT A] This material has been approved for public release and unlimited distribu- tion.
    [Show full text]
  • Enforcement of Usage Control Model in Linux NFS Server
    INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VO`LUME 10, ISSUE 04, APRIL 2021 ISSN 2277-8616 Enforcement Of Usage Control Model In Linux NFS Server H. Aboelseoud M. Abstract: Servers in distributed environments are the main targets of malicious attacks. As a consequence, the need for securing and protecting resources residing on such servers is considered a major and continuous challenge. However, traditional access control models are not suitable for regulating access in today’s highly dynamic, distributed, network-connected, and open computing environments as they are usually not expressive enough to capture important security requirements such as continuity of decisions (ongoing controls) and mutability of attributes, besides lacking of important decision factors like obligations and conditions. Hence, the usage control (UCON) comes as a novel and promising approach to overcome the inadequacies of traditional access control models [1]. However, applying UCON in modern distributed environments is usually introducing complex usage scenarios and new challenging issues as discussed by Grompanopoulos et al. [2]. This paper, taking into account Grompanopoulos’s UCON challenges, studies usage control enforcement in distributed file systems, and take Linux Network File System (NFS) as a case-study. This work follows the approach proposed in [3] to present UCON based on the schema of the OM-AM [4] (Objectives, Models, Architectures, Mechanisms) engineering design philosophy by focusing on the architectures and mechanisms layers. An enforcement architecture design following the Sandhu’s UCONABC model [5] is proposed and a prototype implementation in the Linux NFS server, on top of the existing DAC mechanism, is also proposed as a proof of concept.
    [Show full text]
  • A File System Component Compiler
    A File System Component Compiler Erez Zadok [email protected] Computer Science Department Columbia University New York, NY 10027 CUCS-033-97 April 28, 1997 THESIS PROPOSAL File System development is a difficult and time consuming task, the results of which are rarely portable across operating systems. Several proposals to improve the vnode interface to allow for more flexible file system design and implementation have been made in recent years, but none is used in practice because they require costly fundamental changes to kernel interfaces, only operating systems vendors can make those changes, are still non-portable, tend to degrade performance, and do not appear to provide immediate return on such an investment. This proposal advocates a language for describing file systems, called FiST. The associated translator can generate portable C code — kernel resident or not — that implements the described file system. No kernel source code is needed and no existing vnode interface must change. The performance of the file systems automatically generated by FiST can be within a few percent of comparable hand-written file systems. The main benefits to automation are that development and maintenance costs are greatly reduced, and that it becomes practical to prototype, implement, test, debug, and compose a vastly larger set of such file systems with different properties. The proposed thesis will describe the language and its translator, use it to implement a few file systems on more than one platform, and evaluate the performance of the automatically generated code. i Contents 1 Introduction 1 1.1TheProblem.......................................... 2 1.2MySolution........................................... 2 1.3AdvantagesofMySolution.................................
    [Show full text]
  • Automount NFS
    Automount NFS lwhsu (2019-2020, CC BY) ? (?-2018) 交大資工系資訊中心 Computer Center of Department of Computer Science, NCTU 1 Automatic mounting ● Problems of /etc/fstab ○ Maintenance of /etc/fstab in a large network ○ Crashed NFS server will make operation blocked ○ Removable media support ● automounter (autofs) daemon ○ Mount filesystems when they are referenced and unmount them when they are no longer needed ○ Supply a list of replicated filesystems as backup of important resource ○ Transparent to users 2 Automounter ● Products ○ 1988, automount (from Sun), simple and concise (Solaris & other Unix-like) ○ 1989, amd (from Jan-Simon Pendry), a.k.a. Berkeley Automounter, complicated but more powerful (*BSD and Linux, Obsoleted now) ○ 2014, autofs, starting with FreeBSD 10.1-RELEASE it has a new automounter very similar to the Solaris/Linux one 3 autofs (1) ● autofs ○ Kernel component: autofs(5) ○ Userspace applications ■ automount(8): Update autofs mounts ■ automountd(8): Daemon handling autofs mount requests ■ autounmountd(8): Daemon unmounting automounted filesystems ● Three kinds of configuration files (map) ○ Direct map ○ Indirect map Provide information about filesystems that are to be automounted ○ Master map ■ List which direct and indirect maps that automount should pay attention to ○ Difference between direct and indirect ■ All mount points in indirect map has common directory defined in master map ● https://www.freebsd.org/doc/handbook/network-nfs.html#network-autofs 4 autofs (2) ● Example of auto_master and map file (auto_master(5))
    [Show full text]
  • Overhauling Amd for the '00S: a Case Study of GNU Autotools
    Overhauling Amd for the '00s: A Case Study of GNU Autotools Erez Zadok Stony Brook University [email protected] Abstract suring that software can build cleanly and run identically on many systems include the following: The GNU automatic software configuration tools, Au- toconf, Automake, and Libtool, were designed to help ¢ Asking users to manually configure a package prior the portability of software to multiple platforms. Such to compilation by editing a header file to turn on autotools also help improve the readability of code and or off package features or to specify services avail- speed up the development cycle of software packages. able from the platform on which the package will In this paper we quantify how helpful such autotools are be run. This process required intimate knowledge to the open-source software development process. We of the system on which the package (e.g., C-News) study several large packages that use these autotools and was to be built. measure the complexity of their code. We show that total ¢ Trying to achieve portability using CPP macros code size is not an accurate measure of code complex- and nested #ifdef statements. Such code results ity for portability; two better metrics are the distribution in complex, system-specific, deeply-nested CPP of CPP conditionals in that code and the number of new macros which are hard to maintain. special-purpose Autoconf macros that are written for the ¢ Using Imake [2], a system designed specifically package. for building X11 applications. Imake defines We studied one package in detail—Am-utils, the frozen configurations for various systems.
    [Show full text]
  • Performance of Size-Changing Algorithms in Stackable File Systems
    Performance of Size-Changing Algorithms in Stackable File Systems Erez Zadok, Johan M. Andersen, Ion Badulescu, and Jason Nieh Computer Science Department, Columbia University g fezk,johan,ion,nieh @cs.columbia.edu Abstract and ASCII, and size-changing encryption algorithms which Stackable file systems can provide extensible file system can provide added security. Some ideas have been previously functionality with minimal performance overhead and devel- suggested for supporting SCAs in stackable file systems by opment cost. However, previous approaches are limited in using cache coherency mechanisms[11, 15], but no complete the functionality they provide. In particular, they do not sup- solution has ever been developed or implemented, much less port size-changing algorithms, which are important and use- demonstrated. ful for many applications, such as compression and security. The challenge with supporting SCAs in stackable file sys- We propose fast index files, a technique for efficient support tems is that the file data layout and page offsets can change of size-changing algorithms in stackable file systems. Fast from layer to layer. Consider the case of an upper-level com- index files provide a page mapping between file system lay- pression file system stacked on top of a lower-level native file ers in a way that can be used with any size-changing algo- system. When an application writes a file through the com- rithm. Index files are designed to be recoverable if lost and pression file system, the file system will compress the file add less than 0.1% disk space overhead. We have imple- data, then pass the compressed data to the native file system, mented fast indexing using portable stackable templates, and which will then store it on disk.
    [Show full text]
  • Proceedings of the FREENIX Track: 2002 USENIX Annual Technical Conference
    USENIX Association Proceedings of the FREENIX Track: 2002 USENIX Annual Technical Conference Monterey, California, USA June 10-15, 2002 THE ADVANCED COMPUTING SYSTEMS ASSOCIATION © 2002 by The USENIX Association All Rights Reserved For more information about the USENIX Association: Phone: 1 510 528 8649 FAX: 1 510 548 5738 Email: [email protected] WWW: http://www.usenix.org Rights to individual papers remain with the author or the author's employer. Permission is granted for noncommercial reproduction of the work for educational or research purposes. This copyright notice must be included in the reproduced paper. USENIX acknowledges all trademarks herein. Overhauling Amd for the '00s: A Case Study of GNU Autotools Erez Zadok Stony Brook University [email protected] Abstract Asking users to manually configure a package prior to compilation by editing a header file to turn on The GNU automatic software configuration tools, Au- or off package features or to specify services avail- toconf, Automake, and Libtool, were designed to help able from the platform on which the package will the portability of software to multiple platforms. Such be run. This process required intimate knowledge autotools also help improve the readability of code and of the system on which the package (e.g., C-News) speed up the development cycle of software packages. was to be built. In this paper we quantify how helpful such autotools are Trying to achieve portability using CPP macros to the open-source software development process. We and nested #ifdef statements. Such code results study several large packages that use these autotools and in complex, system-specific, deeply-nested CPP measure the complexity of their code.
    [Show full text]
  • Fist: a System for Stackable File-System Code Generation Erez
    FiST: A System for Stackable File-System Code Generation Erez Zadok Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Graduate School of Arts and Sciences COLUMBIA UNIVERSITY May, 2001 c 2001 Erez Zadok All Rights Reserved ABSTRACT FiST: A System for Stackable File-System Code Generation Erez Zadok File systems often need to evolve and require many changes to support new features. Traditional file-system development is difficult because most of the work is done in the kernel—a hostile development environment where progress is slow, debugging is difficult, and simple mistakes can crash systems. Kernel work also requires deep understanding of system internals, resulting in developers spending a lot of time becoming familiar with the system’s details. Furthermore, any file system written for one system requires significant effort to port to another system. Stackable file systems promise to ease the development of file systems by offering a mechanism for incremental development building on existing file systems. Unfortunately, existing stacking methods often require writing complex low-level kernel code that is specific to a single operating system platform and also difficult to port. We propose a new language, FiST, to describe stackable file systems. FiST uses operations common to file-system interfaces and familiar to user-level developers: creating a directory, reading a file, removing a file, listing the contents of a directory, etc. From a single description, FiST’s compiler produces file-system modules for multiple platforms. FiST does that with the assistance of platform-specific stackable templates. The templates handle many of the internal details of operating systems, and free developers from dealing with these internals.
    [Show full text]
  • Linux NFS and Automounter Administration (Craig Hunt Linux
    Linux NFS And Automounter Administration (Craig Hunt Linux Library) Ebooks Free The Network File System (NFS) is the most popular distributed file system for Linux and Unix clients, enabling users to access files located on servers with the same ease as files located on the desktop. The Automounter Daemon (Amd) automatically mounts remote servers and local resources on an as-needed basic, improving a network's reliability and scalability. This text is aimed at professional Linux adminstrators showing how to effectively install and configure Amd and NFS for optimum speed and reliability. Series: Craig Hunt Linux Library Paperback: 700 pages Publisher: Sybex Inc; 1st edition (May 25, 2001) Language: English ISBN-10: 0782127398 ISBN-13: 978-0782127393 Product Dimensions: 9 x 7.6 x 1.6 inches Shipping Weight: 2.6 pounds Average Customer Review: 4.6 out of 5 stars  See all reviews (5 customer reviews) Best Sellers Rank: #3,270,377 in Books (See Top 100 in Books) #52 in Books > Computers & Technology > Operating Systems > Unix > Administration #74 in Books > Computers & Technology > Operating Systems > Linux > Servers #505 in Books > Computers & Technology > Operating Systems > Linux > Programming This book is the most complete guide to NFS and to amd. If you administer NFS, you will find answers to questions here that are answered nowhere else.The book is in three sections: (1) NFS, (2) amd, and (3) Appendices.The first section speaks on NFS. It details all of the different daemons used by NFS, what they are for, and how they work. Configuring NFS is discussed at length, and from both sides (client and server).
    [Show full text]
  • Studying the Evolution of Build Systems
    Studying the Evolution of Build Systems by Shane McIntosh A thesis submitted to the School of Computing in conformity with the requirements for the degree of Master of Science Queen's University Kingston, Ontario, Canada January 2011 Copyright c Shane McIntosh, 2011 Library and Archives Bibliothèque et Canada Archives Canada Published Heritage Direction du Branch Patrimoine de l'édition 395 Wellington Street 395, rue Wellington Ottawa ON K1A 0N4 Ottawa ON K1A 0N4 Canada Canada Your file Votre référence ISBN: 978-0-494-77033-7 Our file Notre référence ISBN: 978-0-494-77033-7 NOTICE: AVIS: The author has granted a non- L'auteur a accordé une licence non exclusive exclusive license allowing Library and permettant à la Bibliothèque et Archives Archives Canada to reproduce, Canada de reproduire, publier, archiver, publish, archive, preserve, conserve, sauvegarder, conserver, transmettre au public communicate to the public by par télécommunication ou par l'Internet, prêter, telecommunication or on the Internet, distribuer et vendre des thèses partout dans le loan, distrbute and sell theses monde, à des fins commerciales ou autres, sur worldwide, for commercial or non- support microforme, papier, électronique et/ou commercial purposes, in microform, autres formats. paper, electronic and/or any other formats. The author retains copyright L'auteur conserve la propriété du droit d'auteur ownership and moral rights in this et des droits moraux qui protege cette thèse. Ni thesis. Neither the thesis nor la thèse ni des extraits substantiels de celle-ci substantial extracts from it may be ne doivent être imprimés ou autrement printed or otherwise reproduced reproduits sans son autorisation.
    [Show full text]