DOCSLIB.ORG

Redundant Disk Arrays: Reliable, Parallel Secondary Storage Garth Alan Gibson

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Redundant Disk Arrays: Reliable, Parallel Secondary Storage Garth Alan Gibson https://ntrs.nasa.gov/search.jsp?R=19920010046 2020-03-17T12:45:44+00:00Z Redundant Disk Arrays: Reliable, Parallel Secondary Storage Garth Alan Gibson (NASA-CR-189962) REDUNDANT DISK ARRAYS: N92-19288 RELIABLE, PARALLEL SECONDARY STORAGE Ph.D. Thesis (California Univ.) 267 p CSCL 09B Unclas G3/&0 0073849 Report No. UCB/CSD 91/613 December 1990 Computer Science Division (EECS) University of California, Berkeley Berkeley, California 94720 Redundant Disk Arrays: Reliable, Parallel Secondary Storage By Garth Alan Gibson B.Math.(Hons.) (University of Waterloo) 1983 M.S. (University of California) 1987 DISSERTATION Submitted in partial satisfaction of the requirements for the degree of DOCTOR OF PHILOSOPHY in COMPUTER SCIENCE in the GRADUATE DIVISION of the UNIVERSITY OF CALIFORNIA at BERKELEY ********************************** Redundant Disk Arrays: Reliable, Parallel Secondary Storage by Garth Alan Gibson Abstract During the past decade, advances in processor and memory technology have given rise to increases in computational performance that far outstrip increases in the performance of secon- dary storage technology. Coupled with emerging small-disk technology, disk arrays provide the cost, volume, and capacity of current disk subsystems but, by leveraging parallelism, many times their performance. Unfortunately, arrays of small disks may have much higher failure rates than the single large disks they replace. Redundant Arrays of Inexpensive Disks (RAID) use simple redundancy schemes to provide high data reliability. This dissertation investigates the data encoding, performance, and reliability of redundant disk arrays. Organizing redundant data into a disk array is treated as a coding problem in this disserta- tion. Among alternatives examined, codes as simple as parity are shown to effectively correct single, self-identifying disk failures. David A. Patterson The performance advantages of striping data across multiple disks are reviewed in this dissertation. For large transfers this parallelism reduces response time. Striping data also automatically distributes independent, small accesses across disks to increase throughput This dissertation evaluates the performance lost to the maintenance of redundant data. This loss is negligible for large transfers but can be significant for small writes because of increases in aggregate disk service time. Because disk arrays include redundancy to protect against the high failure rates caused by large numbers of disk components, it is crucial that disk failures be characterized. This disser- tation provides evidence that disk lifetimes can be modeled as exponential random variables. Building on an exponential model for disk lifetimes, this dissertation presents analytic models for disk-array lifetime, evaluates these against event-driven simulation, and applies them to an example redundant disk array. These models incorporate the effects of independent and dependent disk failures (shared support hardware) as well as the effects of on-line spare disks. For the example redundant disk array, these models show mat a 10% overhead for an N+l -parity encoding plus a 10% overhead for on-line spares can provide higher reliability than the 100% overhead of conventional mirrored disks. Redundant Disk Arrays: Reliable, Parallel Secondary Storage Copyright © 1991 by Garth Alan Gibson Dedicated to my grandparents Ida Maud (Babcock) Stocks You are my Mnemosyne, my goddess of memory. Your reminiscences have given me a family mythology: ' 'candies down the pea belt'' ' 'Billy Bounce'' and' 'United Empire Loyalists'' So much of my identity is based on your retrospections. Herbert Samuel Albert Stocks Although I never knew you, I am forever influenced by your presence in the warm waters of my favourite place, the Madawaska. Ruth Eliza (Warren) Gibson You left me pearls in these words from your poem, Time: ' 'There is nothing so precious as time It is neither yours nor mine To use it well, we have to learn For yesterday's time will never return." Henry Walker Gibson Always a smile, always a tease, always a kind and wise word, it was always so comfortable to be with you, even if you did always win at horseshoes. li Acknowledgements The time I have spent at Berkeley has been richly rewarding primarily because of the efforts of David Patterson. He has given me guidance, enthusiasm, and wisdom as well as countless hours of time. The challenges that he laid out for me first attracted me to Berkeley, his patient council brought me through the darkest days of the development of SPUR, and his keen intuition provoked my research into I/O systems. I have benefited immeasurably from his tutelage. All three members of my committee, David Patterson, John Ousterhout, and Ronald Wolff, have contributed generously to the research reported in this dissertation. Although Dave propelled me through this research, all might have been in vain without John's insights into sys- tems and Ron's patient coaching on modeling. Of course, all three deserve a special note of thanks for wading through drafts of this dissertation. This dissertation also benefited substantially from the efforts of two others, Tom Philippi and Barbara Beach. Their careful proofreading, extensive editorial suggestions, and gentle humour made my task much more bearable. Contributing to the contents of Chapter 3 in mis dissertation have been many gracious col- leagues. The basic ideas for arrays of small-diameter disks grew out of work I did with David Patterson and Randy Katz. The extensions to binary, double-erasure correcting codes is from collaborative work with Richard Karp, Lisa Hellerstein, David Patterson, and Randy Katz. David Patterson, Randy Katz, and I also contributed to the RAID measurement experiment car- ried out by Peter Chen with the assistance of Amdahl Corporation. Peter Chen and Ed Lee also iii contributed insight into their woric on data striping-unit selection and parity placement stra- tegies, respectively. Thanks go to Thinking Machines Corporation for making available to me the disk failure data reported in Chapter 4. Rick Epstein, Sue Maxwell, and Raymond Mak were instrumental in making this possible. Thanks also go to Sue Maxwell and Joseph Yarmus for reading and improving a draft of this chapter. The contents of Chapter 5 grew out of research from Martin Schulze's Masters report and his subsequent work with David Patterson, Randy Katz, and myself. In developing the models in this chapter, I relied heavily on the experience and insight of Ronald Wolff. On a broader note, there have been many people who contributed to my understanding of the material in this dissertation. Early in my research I was fortunate to encounter the vision of Michael Stonebraker, Dieter Gawlick (then with Amdahl, now with DEC), and Jim Gray (then with Tandem, now with DEC). As you will see in Chapter 3, Jim has made a significant and provocative contribution to my understanding of disk array performance. I have also greatly benefited from the expert advice of Mike Mitoma, Jim Brady, and Jai Menon of IBM Almaden Research Center, Dave Gordon of Array Technology, Dave Anderson of Imprimis (now Seagate), and David Tweten of NAS A/NAS at Ames. Here at Berkeley, my research developed in parallel with the RAID project Many of its members, notably Randy Katz, David Patterson, Ken Lutz, Peter Chen, Ed Lee, Ann Cher- venak, Rich Drewes, Ethan Miller, and Martin Schulze, contributed to my understanding of disk arrays. Their efforts in the construction of a prototype, called RAID-I, were important to our collective education. Together with the RAID group, Berkeley's POSTGRES and Sprite research groups formed the XPRS research environment which combined database, operating systems, and I/O systems research into a wide learning experience for me. Michael Stonebraker, Margo Seltzer, and Mark Sullivan, members of POSTGRES, had a great influence on my thinking. iv I have been involved and enriched by the Sprite project since it began. Sprite, as an experimental operating system, has provided me with an powerful simulation engine though its transparent process migration and its large number of high-performance workstations. Sprite is the result of the efforts of John Ousterhout, Brent Welch, Mike Nelson, Fred Douglas. Andrew Cherenson, Mendel Rosenblum, Mary Baker, John Hartman, Ken Sniniff, Mike Kupfer, Bob Bruce, and Adam de Boor. Fred and Adam, in particular, are responsible for the massive amount of simulation Sprite transparently provided for me. Although this research does not include any material directly pertaining to my earlier involvement with the SPUR multiprocessor workstation project, this project and its members were instrumental to my approach to systems research. Thanks to David Patterson, Randy Katz, David Hodges, George Taylor, Mark Hill, David Wood, Susan Eggers, Deog-Kyoon Jeong, Shing Kong, Corinna Lee, Joan Pendleton, Scott Ritchie, Walter Beach, Daebum Lee, Douglas Johnson, and Ken Lutz. I think that an important, and often overlooked source of education in graduate school is the interaction between junior and senior students. For me, Mark Hill, Tony DeRose, George Taylor, Susan Eggers, David Wood, Gregg Foster, and Prabhakar Ragde were notable peer mentors. As I have tried to pass on this fine tradition to Peter Chen, Ed Lee, and Ann Cher- venak, I have learned anew how educating collaboration with bright new minds can be. Special thanks go to those who have helped me enjoy life during the preparation of this dissertation. Henry Moreton and the Mystery! gang gave me a weekly excuse for diversion, and Ania and Tina Upstill and their parents Steve and Krys were my family away from home. Although distant, my family at home are the root of the strength and conviction that gets me through trying times. Their love for me and confidence in me shield me from all dangers. My final thanks go to Barbara Beach. Barbara was the one who, many years ago, sug- gested that I pursue a PhD degree. It was she, more than most, who suffered as I followed through on this suggestion.
Load more

Recommended publications
  • RAMA: a Filesystem for Massively Parallel Computers
    RAMA: A FILESYSTEM FOR MASSIVELY the advantages of the system, and some possible draw- PARALLEL COMPUTERS backs. We conclude with future directions for research. Ethan L. Miller and Randy H. Katz PREVIOUS WORK University of California, Berkeley Berkeley, California There have been few file systems truly designed for parallel machines. While there have been many mas- sively parallel processors, most of them have used uni- ABSTRACT processor-based file systems. These computers generally perform file I/O through special I/O interfac- es and employ a front-end CPU to manage the file sys- This paper describes a file system design for massively tem. This method has the major advantage that it uses parallel computers which makes very efficient use of a well-understood uniprocessor file systems; little addi- few disks per processor. This overcomes the traditional tional effort is needed to support a parallel processor. I/O bottleneck of massively parallel machines by stor- The disadvantage, however, is that bandwidth to the ing the data on disks within the high-speed interconnec- parallel processor is generally low, as there is only a tion network. In addition, the file system, called single CPU managing the file system. Bandwidth is RAMA, requires little inter-node synchronization, re- limited by this CPU’s ability to handle requests and by moving another common bottleneck in parallel proces- the single channel into the parallel processor. Nonethe- sor file systems. Support for a large tertiary storage less, systems such as the CM-2 use this method. system can easily be integrated into the file system; in fact, RAMA runs most efficiently when tertiary storage is used.
    [Show full text]
  • Curriculum Vitae Ethan L
    Curriculum Vitae Ethan L. Miller June 2021 Computer Science & Engineering Department MOBILE: +1 (831) 295-8432 University of California, Santa Cruz 1156 High Street, MS SOE3 EMAIL: [email protected] Santa Cruz, CA 95064 https://www.soe.ucsc.edu/~elm/ EMPLOYMENT HISTORY 2018–present Professor, Computer Science and Engineering Department, University of California, Santa Cruz 2017–2018 Professor, Computer Engineering Department, University of California, Santa Cruz 2014–2019 Veritas Presidential Chair in Storage [formerly Symantec Presidential Chair in Storage & Security], Jack Baskin School of Engineering, University of California, Santa Cruz 2013–2019 Director, NSF IUCRC Center for Research in Storage Systems, University of California, Santa Cruz 2012–2013 Pure Storage (on 80% leave from the University of California, Santa Cruz) 2009–2013 Site Director, NSF IUCRC Center for Research in Intelligent Storage, University of California, Santa Cruz 2008–2017 Professor, Computer Science Department, University of California, Santa Cruz 2007–present Associate Director, Storage Systems Research Center, University of California, Santa Cruz 2002–2008 Associate Professor, Computer Science Department, University of California, Santa Cruz 2000–2002 Assistant Professor, Computer Science Department, University of California, Santa Cruz 1999 System Architect, Endeca, Cambridge, MA 1994–2000 Assistant Professor, Computer Science and Electrical Engineering Department, University of Mary- land Baltimore County 1988–1994 Research Assistant, Computer Science Division, University of California at Berkeley 1988–1990 Teaching Associate, Computer Science Division, University of California at Berkeley 1987–1988 Software Engineer, BBN Laboratories, Cambridge, MA 1986 Summer intern, GTE Government Systems, Rockville, MD EDUCATION 1995 Ph. D., University of California at Berkeley, Computer Science (advisor: Randy Katz) Thesis: Storage Hierarchy Management for Scientific Computing 1990 M.
    [Show full text]
  • Improving Mapreduce Performance in Heterogeneous Environments
    Improving MapReduce Performance in Heterogeneous Environments Matei Zaharia, Andy Konwinski, Anthony D. Joseph, Randy Katz, Ion Stoica University of California, Berkeley {matei,andyk,adj,randy,stoica}@cs.berkeley.edu Abstract The MapReduce model popularized by Google is very MapReduce is emerging as an important programming attractive for ad-hoc parallel processing of arbitrary data. model for large-scale data-parallel applications such as MapReduce breaks a computation into small tasks that web indexing, data mining, and scientific simulation. run in parallel on multiple machines, and scales easily to Hadoop is an open-source implementation of MapRe- very large clusters of inexpensive commodity comput- duce enjoying wide adoption and is often used for short ers. Its popular open-source implementation, Hadoop jobs where low response time is critical. Hadoop’s per- [2], was developed primarily by Yahoo, where it runs formance is closely tied to its task scheduler, which im- jobs that produce hundreds of terabytes of data on at least plicitly assumes that cluster nodes are homogeneous and 10,000 cores [4]. Hadoop is also used at Facebook, Ama- tasks make progress linearly, and uses these assumptions zon, and Last.fm [5]. In addition, researchers at Cornell, to decide when to speculatively re-execute tasks that ap- Carnegie Mellon, University of Maryland and PARC are pear to be stragglers. In practice, the homogeneity as- starting to use Hadoop for seismic simulation, natural sumptions do not always hold. An especially compelling language processing, and mining web data [5, 6]. setting where this occurs is a virtualized data center, such A key benefit of MapReduce is that it automatically as Amazon’s Elastic Compute Cloud (EC2).
    [Show full text]
  • Ieee-Level Awards
    IEEE-LEVEL AWARDS The IEEE currently bestows a Medal of Honor, fifteen Medals, thirty-three Technical Field Awards, two IEEE Service Awards, two Corporate Recognitions, two Prize Paper Awards, Honorary Memberships, one Scholarship, one Fellowship, and a Staff Award. The awards and their past recipients are listed below. Citations are available via the “Award Recipients with Citations” links within the information below. Nomination information for each award can be found by visiting the IEEE Awards Web page www.ieee.org/awards or by clicking on the award names below. Links are also available via the Recipient/Citation documents. MEDAL OF HONOR Ernst A. Guillemin 1961 Edward V. Appleton 1962 Award Recipients with Citations (PDF, 26 KB) John H. Hammond, Jr. 1963 George C. Southworth 1963 The IEEE Medal of Honor is the highest IEEE Harold A. Wheeler 1964 award. The Medal was established in 1917 and Claude E. Shannon 1966 Charles H. Townes 1967 is awarded for an exceptional contribution or an Gordon K. Teal 1968 extraordinary career in the IEEE fields of Edward L. Ginzton 1969 interest. The IEEE Medal of Honor is the highest Dennis Gabor 1970 IEEE award. The candidate need not be a John Bardeen 1971 Jay W. Forrester 1972 member of the IEEE. The IEEE Medal of Honor Rudolf Kompfner 1973 is sponsored by the IEEE Foundation. Rudolf E. Kalman 1974 John R. Pierce 1975 E. H. Armstrong 1917 H. Earle Vaughan 1977 E. F. W. Alexanderson 1919 Robert N. Noyce 1978 Guglielmo Marconi 1920 Richard Bellman 1979 R. A. Fessenden 1921 William Shockley 1980 Lee deforest 1922 Sidney Darlington 1981 John Stone-Stone 1923 John Wilder Tukey 1982 M.
    [Show full text]
  • Federated Computing Research Conference, FCRC’96, Which Is David Wise, Steering Being Held May 20 - 28, 1996 at the Philadelphia Downtown Marriott
    CRA Workshop on Academic Careers Federated for Women in Computing Science 23rd Annual ACM/IEEE International Symposium on Computing Computer Architecture FCRC ‘96 ACM International Conference on Research Supercomputing ACM SIGMETRICS International Conference Conference on Measurement and Modeling of Computer Systems 28th Annual ACM Symposium on Theory of Computing 11th Annual IEEE Conference on Computational Complexity 15th Annual ACM Symposium on Principles of Distributed Computing 12th Annual ACM Symposium on Computational Geometry First ACM Workshop on Applied Computational Geometry ACM/UMIACS Workshop on Parallel Algorithms ACM SIGPLAN ‘96 Conference on Programming Language Design and Implementation ACM Workshop of Functional Languages in Introductory Computing Philadelphia Skyline SIGPLAN International Conference on Functional Programming 10th ACM Workshop on Parallel and Distributed Simulation Invited Speakers Wm. A. Wulf ACM SIGMETRICS Symposium on Burton Smith Parallel and Distributed Tools Cynthia Dwork 4th Annual ACM/IEEE Workshop on Robin Milner I/O in Parallel and Distributed Systems Randy Katz SIAM Symposium on Networks and Information Management Sponsors ACM CRA IEEE NSF May 20-28, 1996 SIAM Philadelphia, PA FCRC WELCOME Organizing Committee Mary Jane Irwin, Chair Penn State University Steve Mahaney, Vice Chair Rutgers University Alan Berenbaum, Treasurer AT&T Bell Laboratories Frank Friedman, Exhibits Temple University Sampath Kannan, Student Coordinator Univ. of Pennsylvania Welcome to the second Federated Computing Research Conference, FCRC’96, which is David Wise, Steering being held May 20 - 28, 1996 at the Philadelphia downtown Marriott. This second Indiana University FCRC follows the same model of the highly successful first conference, FCRC’93, in Janice Cuny, Careers which nine constituent conferences participated.
    [Show full text]
  • Download and Use Untrusted Code Without Fear
    2 KELEY COMPUTER SCIENC CONTENTS INTRODUCTION1 CITRIS AND2 MOTES 30 YEARS OF INNOVATION GENE MYERS4 Q&A 1973–20 0 3 6GRAPHICS INTELLIGENT SYSTEMS 1RESEARCH0 DEPARTMENT STATISTICS14 ROC-SOLID SYSTEMS16 USER INTERFACE DESIGN AND DEVELOPMENT20 INTERDISCIPLINARY THEOR22Y 30PROOF-CARRYING CODE 28 COMPLEXITY 30THEORY FACULTY32 THE COMPUTER SCIENCE DIVISION OF THE DEPARTMENT OF EECS AT UC BERKELEY WAS CREATED IN 1973. THIRTY YEARS OF INNOVATION IS A CELEBRATION OF THE ACHIEVEMENTS OF THE FACULTY, STAFF, STUDENTS AND ALUMNI DURING A PERIOD OF TRULY BREATHTAKING ADVANCES IN COMPUTER SCIENCE AND ENGINEERING. THE FIRST CHAIR OF COMPUTER research in theoretical computer science received a Turing Award in 1989 for this work. learning is bringing us ever closer to the dream SCIENCE AT BERKELEY was Richard Karp, at Berkeley. In the area of programming languages and of truly intelligent machines. who had just shown that the hardness of well- software engineering, Berkeley research has The impact of Berkeley research on the practi- Berkeley’s was the one of the first top comput- known algorithmic problems, such as finding been noted for its flair for combining theory cal end of computer science has been no less er science programs to invest seriously in com- the minimum cost tour for a travelling sales- and practice, as exemplified in these pages significant. The development of Reduced puter graphics, and our illustrious alumni in person, could be related to NP-completeness— by George Necula’s research on proof- Instruction Set computers by David Patterson that area have done us proud. We were not so a concept proposed earlier by former Berkeley carrying code.
    [Show full text]
  • Instructor Course Web Page Purpose Prerequisites Text Book
    CS 535 Advanced Operating Systems WPI, Fall 2013 Craig E. Wills Course Syllabus Monday, September 9, 2013 Instructor Craig E. Wills, FL-234, [email protected]. Office hours: as needed by students. Any time for short questions. Electronic mail is an effective method to contact me. Course Web Page Copies of all handouts, assignments and notes will be posted as appropriate on the course Web page. The address for it is http://www.cs.wpi.edu/~cs535/f13/. Purpose This is a graduate-level course in the design of advanced systems. It focuses on the issues of advanced operating systems and distributed systems, which have evolved from general- purpose multiprogramming systems covered in previous courses. The goals are 1) to famil- iarize the student with current literature in the area, 2) for students to be able to place work in its context in terms of its relative importance and relationship with other work, 3) to give students experience in making public presentations of technical work, and 4) to develop students’ ability for critical thinking and discussions concerning design choices, tradeoffs, and their consequences. Prerequisites A first course in operating systems, such as CS502. Background in architecture, networking, compilers and programming languages would also be helpful for issues related to these topics. An interest in reading, thinking about and discussing issues in advanced system design. Text Book There is no required text book for the course. Relevant text books are: 1. Distributed Systems Principles and Paradigms. Andrew S. Tanenbaum and Maarten van Steen, Prentice Hall, 2nd edition, 2007. 1 2.
    [Show full text]
  • Scalable Network Forensics
    Scalable Network Forensics Matthias Vallentin Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report No. UCB/EECS-2016-55 http://www.eecs.berkeley.edu/Pubs/TechRpts/2016/EECS-2016-55.html May 12, 2016 Copyright © 2016, by the author(s). All rights reserved. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission. Scalable Network Forensics by Matthias Vallentin A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate Division of the University of California, Berkeley Committee in charge: Professor Vern Paxson, Chair Professor Michael Franklin Professor David Brillinger Spring 2016 Scalable Network Forensics Copyright 2016 by Matthias Vallentin 1 Abstract Scalable Network Forensics by Matthias Vallentin Doctor of Philosophy in Computer Science University of California, Berkeley Professor Vern Paxson, Chair Network forensics and incident response play a vital role in site operations, but for large networks can pose daunting difficulties to cope with the ever-growing volume of activity and resulting logs. On the one hand, logging sources can generate tens of thousands of events
    [Show full text]
  • Contents U U U
    Contents u u u ACM Awards Reception and Banquet, June 2018 .................................................. 2 Introduction ......................................................................................................................... 3 A.M. Turing Award .............................................................................................................. 4 ACM Prize in Computing ................................................................................................. 5 ACM Charles P. “Chuck” Thacker Breakthrough in Computing Award ............. 6 ACM – AAAI Allen Newell Award .................................................................................. 7 Software System Award ................................................................................................... 8 Grace Murray Hopper Award ......................................................................................... 9 Paris Kanellakis Theory and Practice Award ...........................................................10 Karl V. Karlstrom Outstanding Educator Award .....................................................11 Eugene L. Lawler Award for Humanitarian Contributions within Computer Science and Informatics ..........................................................12 Distinguished Service Award .......................................................................................13 ACM Athena Lecturer Award ........................................................................................14 Outstanding Contribution
    [Show full text]
  • Cloud Computing and Its Applications: a Comprehensive Survey
    IJCA, Vol. 28, No. 1, March 2021 3 Cloud Computing and Its Applications: A Comprehensive Survey Jalal H. Kiswani*, Sergiu M. Dascalu*, and Frederick C. Harris, Jr.* University of Nevada, Reno, USA. * Abstract Organizations would buy computers, install them locally on their premises, and use them for their computational needs. Cloud computing is one of the most significant trends in Even with the rise of personal computers in the 1980’s, the the information technology evolution, as it has created new same behavior continued, so that organizations and individuals opportunities that were never possible before. It is utilized followed the same approach. During those eras, some people and adopted by individuals and businesses on all scales, from a and organizations thought about a different approach: why not cloud-storage service such as Google Drive for normal users, to offer computation hardware and/or software as utility services, large scale integrated servers for online social media platforms same as electricity or telephone landlines? Thus, users could such as Facebook. In cloud computing, services are offered use these services on a subscription-based approach (e.g., such mainly on three levels: infrastructure, platform, and software. as monthly or yearly), and pay-as-they-use (i.e., usage-based In this article, an extensive and detailed literature review about costing) [88]. cloud computing and its applications is presented, including John McCarthy was the first to present the idea of offering history and evolution. Moreover, to measure the adoption of computing as utility in 1961 [25]. Five years later, “The cloud applications in industry and academia, we conducted a Challenge of the Computer Utility” book written by Parkhill user-study survey that included professionals and academics discussed many aspects of computing as a utility [70] .
    [Show full text]
  • THE DESIGN of XPRS Michael Stonebraker, Randy Katz, David
    THE DESIGN OF XPRS Michael Stonebraker, Randy Katz, David Patterson, and John Ousterhout EECS Dept. University of California, Berkeley Abstract This paper presents an overview of the techniques we are using to build a DBMS at Berkeley that will simultaneously provide high performance and high availability in transaction processing environments, in applications with complex ad-hoc queries and in applications with large objects such as images or CAD layouts. We plan to achieve these goals using a general purpose DBMS and operating system and a shared memory multiprocessor. The hardware and software tactics which we are using to accomplish these goals are described in this paper and include a novel “fast path” feature, a special purpose concurrency control scheme, a two-dimensional file system, exploitation of parallelism and a novel method to efficiently mirror disks. 1. INTRODUCTION At Berkeley we are constructing a high performance data base system with novel software and hard- ware assists. The basic goals of XPRS (eXtended Postgres on Raid and Sprite) are very high performance from a general purpose DBMS running on a conventional operating system and very high availability. Moreover, we plan to optimize for either a single CPU in a computer system (e.g. a Sun 4) or a shared memory multiprocessor (e.g a SEQUENT Symmetry system). We discuss each goal in turn in the remain- der of this introduction and then discuss why we hav echosen to exploit shared memory over shared nothing or shared disk. 1.1. High Performance We strive for high performance in three different application areas: 1) transaction processing 2) complex ad-hoc queries 3) management of large objects Previous high transaction rate systems have been built on top of low-level, hard-to-program, underlying data managers such as TPF [BAMB87] and IMS/Fast Path [DATE84].
    [Show full text]
  • The Role of Universities in Economic Competitiveness in California
    REPORT The Role of Universities in REPORT Economic Competitiveness in California amb la col·laboració de: The Role of Universities in Economic Competitiveness in California [email protected] www.acup.cat THE ROLE OF UNIVERSITIES IN ECONOMIC COMPETITIVENESS IN CALIFORNIA © 2018, AUTHORS and EDITORS EDITED AND COORDINATED BY ASSOCIACIÓ CATALANA D’UNIVERSITATS PÚBLIQUES (ACUP): Josep M. Vilalta Josep Alías Alicia Betts AUTHORS: John Aubrey Douglass and C. Judson King GRAPHIC DESIGN AND PRODUCTION Nexe Impressions SL LINGUISTIC REVISION Dosbé Publishers, S.L. The Role of Universities in Economic Competitiveness in California A Case Study for the Catalan Association of Public Universities By John Aubrey Douglass and C. Judson King January 2018 Table of contents Executive Summary ................................................................................................................. 9 1. Introduction – The Goals of the Report ............................................................................. 15 2. The Dynamics of Robust Knowledge Based Economic Areas ......................................... 19 2.1. Robust KBEAs – seven contextual variables ............................................................... 20 3. UC’S Research Portfolio and Economic Impact on California ....................................... 38 3.1. UC’s Research Funding Portfolio ................................................................................ 38 3.2. Geographic Presence and Public Service ..................................................................
    [Show full text]