distributed operating systems research paper

In Search of an Understandable Consensus Algorithm (Raft)

Paxos Made Simple

ZooKeeper: Wait-free coordination for Internet-scale systems

Using Paxos to Build a Scalable, Consistent, and Highly Available Datastore

Impossibility of Distributed Consensus With One Faulty Process

Consensus in the presence of partial synchrony

Viewstamped Replication Revisited

Replication

Don’t be lazy, be consistent: Postgres-R, a new way to implement Database Replication

PacificA: Replication in Log-Based Distributed Storage Systems

Chain Replication for Supporting High Throughput and Availability

Byzantine Chain Replication

A Comprehensive Study of Convergent and Commutative Replicated Data Types

Optimistic Replication

Causality/Transactions

Stronger Semantics for Low-Latency Geo-Replicated Storage (Eiger)

Calvin: Fast Distributed Transactions for Partitioned Database Systems

Sinfonia: a new paradigm for building scalable distributed systems

Understanding the Limitations of Causally and Totally Ordered Communication

A Response to Cheriton and Skeen’s Criticism of Causal and Totally Ordered Communication

MDCC: Multi-Datacenter Consistency

Spanner: Google’s globally distributed database

Concurrency

Transactional Memory: Architectural Support for Lock-Free Data Structures

Software Transactional Memory

Sharing Memory Robustly in Message-Passing Systems

Wait-free Synchronization

ZooKeeper’s atomic broadcast protocol: Theory and practice

Kafka (LinkedIn)

Omega: flexible, scalable schedulers for large compute clusters

Thialfi: A Client Notification Service for Internet-Scale Applications

Large-scale Incremental Processing Using Distributed Transactions and Notifications

Note: We haven’t included anything already covered in 6.824 , but you should read those papers too.

Paxos Made Live: An Engineering Perspective

Viewstamped Replication: A new primary copy method to support highly-available distributed systems

Time, Clocks, and the Ordering of Events in a Distributed System

The Part-Time Parliament

Paxos Made Practical

The papers from SOSP 2013

CS 261: Research Topics in Operating Systems (2021)

Some links to papers are links to the ACM’s site. You may need to use the Harvard VPN to get access to the papers via those links. Alternate links will be provided.

Meeting 1 (1/26): Overview

Operating system architectures, meeting 2 (1/28): multics and unix.

“Multics—The first seven years” , Corbató FJ, Saltzer JH, and Clingen CT (1972)

“Protection in an information processing utility” , Graham RM (1968)

“The evolution of the Unix time-sharing system” , Ritchie DM (1984)

Additional resources

The Multicians web site for additional information on Multics, including extensive stories and Multics source code.

Technical: The Multics input/output system , Feiertag RJ and Organick EI, for a description of Multics I/O to contrast with Unix I/O.

Unix and Multics , Tom Van Vleck.

… I remarked to Dennis that easily half the code I was writing in Multics was error recovery code. He said, "We left all that stuff out. If there's an error, we have this routine called panic() , and when it is called, the machine crashes, and you holler down the hall, 'Hey, reboot it.'"

The Louisiana State Trooper Story

The IBM 7094 and CTSS

This describes the history of the system that preceded Multics, CTSS (the Compatible Time Sharing System). It also contains one of my favorite stories about the early computing days: “IBM had been very generous to MIT in the fifties and sixties, donating or discounting its biggest scientific computers. When a new top of the line 36-bit scientific machine came out, MIT expected to get one. In the early sixties, the deal was that MIT got one 8-hour shift, all the other New England colleges and universities got a shift, and the third shift was available to IBM for its own use. One use IBM made of its share was yacht handicapping: the President of IBM raced big yachts on Long Island Sound, and these boats were assigned handicap points by a complicated formula. There was a special job deck kept at the MIT Computation Center, and if a request came in to run it, operators were to stop whatever was running on the machine and do the yacht handicapping job immediately.”

Using Ring 5 , Randy Saunders.

"All Multics User functions work in Ring 5." I have that EMail (from Dave Bergum) framed on my wall to this date. … All the documentation clearly states that system software has ring brackets of [1,5,5] so that it runs equally in both rings 4 and 5. However, the PL/I compiler creates segments with ring brackets of [4,4,4] by default. … I found each and every place CNO had fixed a program without resetting the ring brackets correctly. It started out 5 a day, and in 3 months it was down to one a week.”

Bell Systems Technical Journal 57(6) Part 2: Unix Time-sharing System (July–August 1978)

This volume contains some of the first broadly-accessible descriptions of Unix. Individual articles are available on archive.org . As of late January 2021, you can buy a physical copy on Amazon for $2,996. Interesting articles include Thompson on Unix implementation, Ritchie’s retrospective, and several articles on actual applications, especially document preparation.

Meeting 3 (2/2): Microkernels

“The nucleus of a multiprogramming system” , Brinch Hansen P (1970).

“Toward real microkernels” , Liedtke J (1996).

“Are virtual machine monitors microkernels done right?” , Hand S, Warfield A, Fraser K, Kotsovinos E, Magenheimer DJ (2005).

Supplemental reading

“Improving IPC by kernel design” , Liedtke J (1993). Article introducing the first microbenchmark-performant microkernel.

“Are virtual machine monitors microkernels done right?” , Heiser G, Uhlig V, LeVasseur J (2006).

“From L3 to seL4: What have we learnt in 20 years of L4 microkernels?” , Elphinstone K, Heiser G (2013).

Retained: Minimality as key design principle. Replaced: Synchronous IPC augmented with (seL4, NOVA, Fiasco.OC) or replaced by (OKL4) asynchronous notification. Replaced: Physical by virtual message registers. Abandoned: Long IPC. Replaced: Thread IDs by port-like IPC endpoints as message destinations. Abandoned: IPC timeouts in seL4, OKL4. Abandoned: Clans and chiefs. Retained: User-level drivers as a core feature. Abandoned: Hierarchical process management. Multiple approaches: Some L4 kernels retain the model of recursive address-space construc- tion, while seL4 and OKL4 originate mappings from frames. Added: User-level control over kernel memory in seL4, kernel memory quota in Fiasco.OC. Unresolved: Principled, policy-free control of CPU time. Unresolved: Handling of multicore processors in the age of verification. Replaced: Process kernel by event kernel in seL4, OKL4 and NOVA. Abandoned: Virtual TCB addressing. … Abandoned: C++ for seL4 and OKL4.

Meeting 4 (2/4): Exokernels

“Exterminate all operating systems abstractions” , Engler DE, Kaashoek MF (1995).

“Exokernel: an operating system architecture for application-level resource management” , Engler DE, Kaashoek MF, O’Toole J (1995).

“The nonkernel: a kernel designed for the cloud” , Ben-Yehuda M, Peleg O, Ben-Yehuda OA, Smolyar I, Tsafrir D (2013).

“Application performance and flexibility on exokernel systems” , Kaashoek MF, Engler DR, Ganger GR, Briceño HM, Hunt R, Mazières D, Pinckney T, Grimm R, Jannotti J, Mackenzie K (1997).

Particularly worth reading is section 4, Multiplexing Stable Storage, which contains one of the most overcomplicated designs for stable storage imaginable. It’s instructive: if your principles end up here, might there be something wrong with your principles?

“Fast and flexible application-level networking on exokernel systems” , Ganger GR, Engler DE, Kaashoek MF, Briceño HM, Hunt R, Pinckney T (2002).

Particularly worth reading is section 8, Discussion: “The construction and revision of the Xok/ExOS networking support came with several lessons and controversial design decisions.”

Meeting 5 (2/9): Security

“EROS: A fast capability system” , Shapiro JS, Smith JM, Farber DJ (1999).

“Labels and event processes in the Asbestos operating system” , Vandebogart S, Efstathopoulos P, Kohler E, Krohn M, Frey C, Ziegler D, Kaashoek MF, Morris R, Mazières D (2007).

This paper covers too much ground. On the first read, skip sections 4–6.

Meeting 6 (2/11): I/O

“Arrakis: The operating system is the control plane” (PDF) , Peter S, Li J, Zhang I, Ports DRK, Woos D, Krishnamurthy A, Anderson T, Roscoe T (2014)

“The IX Operating System: Combining Low Latency, High Throughput, and Efficiency in a Protected Dataplane” , Belay A, Prekas G, Primorac M, Klimovic A, Grossman S, Kozyrakis C, Bugnion E (2016) — read Sections 1–4 first (return to the rest if you have time)

“I'm Not Dead Yet!: The Role of the Operating System in a Kernel-Bypass Era” , Zhang I, Liu J, Austin A, Roberts ML, Badam A (2019)

• “The multikernel: A new OS architecture for scalable multicore systems” , Baumann A, Barham P, Dagand PE, Harris T, Isaacs R, Peter S, Roscoe T, Schüpach A, Singhana A (2009); this describes the Barrelfish system on which Arrakis is based

Meeting 7 (2/16): Speculative designs

From least to most speculative:

“Unified high-performance I/O: One Stack to Rule Them All” (PDF) , Trivedi A, Stuedi P, Metzler B, Pletka R, Fitch BG, Gross TR (2013)

“The Case for Less Predictable Operating System Behavior” (PDF) , Sun R, Porter DE, Oliveira D, Bishop M (2015)

“Quantum operating systems” , Corrigan-Gibbs H, Wu DJ, Boneh D (2017)

“Pursue robust indefinite scalability” , Ackley DH, Cannon DC (2013)

Meeting 8 (2/18): Log-structured file system

“The Design and Implementation of a Log-Structured File System” , Rosenblum M, Ousterhout J (1992)

“Logging versus Clustering: A Performance Evaluation”

• Read the abstract of the paper ; scan further if you’d like
• Then poke around the linked critiques

Meeting 9 (2/23): Consistency

“Generalized file system dependencies” , Frost C, Mammarella M, Kohler E, de los Reyes A, Hovsepian S, Matsuoka A, Zhang L (2007)

“Application crash consistency and performance with CCFS” , Sankaranarayana Pillai T, Alagappan R, Lu L, Chidambaram V, Arpaci-Dusseau AC, Arpaci-Dusseau RH (2017)

Meeting 10 (2/25): Transactions and speculation

“Rethink the sync” , Nightingale EB, Veeraraghavzn K, Chen PM, Flinn J (2006)

“Operating system transactions” , Porter DE, Hofmann OS, Rossbach CJ, Benn E, Witchel E (2009)

Meeting 11 (3/2): Speculative designs

“Can We Store the Whole World's Data in DNA Storage?”

“A tale of two abstractions: The case for object space”

“File systems as processes”

“Preserving hidden data with an ever-changing disk”

More, if you’re hungry for it

• “Breaking Apart the VFS for Managing File Systems”

Virtualization

Meeting 14 (3/11): virtual machines and containers.

“Xen and the Art of Virtualization” , Barham P, Dragovic B, Fraser K, Hand S, Harris T, Ho A, Neugebauer R, Pratt I, Warfield A (2003)

“Blending containers and virtual machines: A study of Firecracker and gVisor” , Anjali, Caraz-Harter T, Swift MM (2020)

Meeting 15 (3/18): Virtual memory and virtual devices

“Memory resource management in VMware ESX Server” , Waldspurger CA (2002)

“Opportunistic flooding to improve TCP transmit performance in virtualized clouds” , Gamage S, Kangarlou A, Kompella RR, Xu D (2011)

Meeting 16 (3/23): Speculative designs

“The Best of Both Worlds with On-Demand Virtualization” , Kooburat T, Swift M (2011)

“The NIC is the Hypervisor: Bare-Metal Guests in IaaS Clouds” , Mogul JC, Mudigonda J, Santos JR, Turner Y (2013)

“vPipe: One Pipe to Connect Them All!” , Gamage S, Kompella R, Xu D (2013)

“Scalable Cloud Security via Asynchronous Virtual Machine Introspection” , Rajasekaran S, Ni Z, Chawla HS, Shah N, Wood T (2016)

Distributed systems

Meeting 17 (3/25): distributed systems history.

“Grapevine: an exercise in distributed computing” , Birrell AD, Levin R, Schroeder MD, Needham RM (1982)

“Implementing remote procedure calls” , Birrell AD, Nelson BJ (1984)

Skim : “Time, clocks, and the ordering of events in a distributed system” , Lamport L (1978)

Meeting 18 (3/30): Paxos

“Paxos made simple” , Lamport L (2001)

“Paxos made live: an engineering perspective” , Chanra T, Griesemer R, Redston J (2007)

“In search of an understandable consensus algorithm” , Ongaro D, Ousterhout J (2014)

• Adrian Colyer’s consensus series links to ten papers, especially:
• “Raft Refloated: Do we have consensus?” , Howard H, Schwarzkopf M, Madhavapeddy A, Crowcroft J (2015)
• A later update from overlapping authors: “Paxos vs. Raft: Have we reached consensus on distributed consensus?” , Howard H, Mortier R (2020)
• “Understanding Paxos” , notes by Paul Krzyzanowski (2018); includes some failure examples
• One-slide Paxos pseudocode , Robert Morris (2014)

Meeting 19 (4/1): Review of replication results

Meeting 20 (4/6): project discussion, meeting 21 (4/8): industrial consistency.

“Scaling Memcache at Facebook” , Nishtala R, Fugal H, Grimm S, Kwiatkowski M, Lee H, Li HC, McElroy R, Paleczny M, Peek D, Saab P, Stafford D, Tung T, Venkataramani V (2013)

“Millions of Tiny Databases” , Brooker M, Chen T, Ping F (2020)

Meeting 22 (4/13): Short papers and speculative designs

“Scalability! But at what COST?” , McSherry F, Isard M, Murray DG (2015)

“What bugs cause production cloud incidents?” , Liu H, Lu S, Musuvathi M, Nath S (2019)

“Escape Capsule: Explicit State Is Robust and Scalable” , Rajagopalan S, Williams D, Jamjoom H, Warfield A (2013)

“Music-defined networking” , Hogan M, Esposito F (2018)

• Too networking-centric for us, but fun: “Delay is Not an Option: Low Latency Routing in Space” , Handley M (2018)
• A useful taxonomy: “When Should The Network Be The Computer?” , Ports DRK, Nelson J (2019)

Meeting 23 (4/20): The M Group

“All File Systems Are Not Created Equal: On the Complexity of Crafting Crash-Consistent Applications” , Pillai TS, Chidambaram V, Alagappan R, Al-Kiswany S, Arpaci-Dusseau AC, Arpaci-Dusseau RH (2014)

“Crash Consistency Validation Made Easy” , Jiang Y, Chen H, Qin F, Xu C, Ma X, Lu J (2016)

Meeting 24 (4/22): NVM and Juice

“Persistent Memcached: Bringing Legacy Code to Byte-Addressable Persistent Memory” , Marathe VJ, Seltzer M, Byan S, Harris T

“NVMcached: An NVM-based Key-Value Cache” , Wu X, Ni F, Zhang L, Wang Y, Ren Y, Hack M, Shao Z, Jiang S (2016)

“Cloudburst: stateful functions-as-a-service” , Sreekanti V, Wu C, Lin XC, Schleier-Smith J, Gonzalez JE, Hellerstein JM, Tumanov A (2020)

• Adrian Colyer’s take

Meeting 25 (4/27): Scheduling

• “The Linux Scheduler: A Decade of Wasted Cores” , Lozi JP, Lepers B, Funston J, Gaud F, Quéma V, Fedorova A (2016)

> cs > cs.OS

Help | Advanced Search

Operating Systems

Authors and titles for recent submissions.

• Tue, 19 Mar 2024
• Thu, 14 Mar 2024
• Tue, 12 Mar 2024
• Fri, 8 Mar 2024
• Fri, 23 Feb 2024

Links to: arXiv , form interface , find , cs , new , 2403 , contact , h elp   ( Access key information)

A Systematic Literature Review on Operating System Security: Distribution and Issues

Ieee account.

• Change Username/Password
• Update Address

Purchase Details

• Payment Options
• Order History
• View Purchased Documents

Profile Information

• Communications Preferences
• Profession and Education
• Technical Interests
• US & Canada: +1 800 678 4333
• Worldwide: +1 732 981 0060
• Contact & Support
• About IEEE Xplore
• Accessibility
• Terms of Use
• Nondiscrimination Policy
• Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity. © Copyright 2024 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

TechRepublic

Research paper on distributed operating systems.

In this paper, the authors aim at providing a complete survey of distributed operating systems. This paper also explains in detail about various key design issues involved in the building of such system. A distributed operating system is an software over a collection of independent, networked, communicating and physically separate computational nodes. Each individual node holds a specific software subset of the global aggregate operating system. Each subset is a composite of two distinct service provisioners.

Resource Details

Create a techrepublic account.

Get the web's best business technology news, tutorials, reviews, trends, and analysis—in your inbox. Let's start with the basics.

* - indicates required fields

Sign in to TechRepublic

Lost your password? Request a new password

Reset Password

Please enter your email adress. You will receive an email message with instructions on how to reset your password.

Check your email for a password reset link. If you didn't receive an email don't forgot to check your spam folder, otherwise contact support .

Welcome. Tell us a little bit about you.

This will help us provide you with customized content.

Want to receive more TechRepublic news?

You're all set.

Thanks for signing up! Keep an eye out for a confirmation email from our team. To ensure any newsletters you subscribed to hit your inbox, make sure to add [email protected] to your contacts list.

• Conference proceedings
• © 1987

Distributed Operating Systems

Theory and Practice

• Yakup Paker 0 ,
• Jean-Pierre Banatre 1 ,
• Müslim Bozyiğit 2

Polytechnic of Central London, London, UK

You can also search for this editor in PubMed   Google Scholar

IRISA, Campus Universitaire de Beaulieu, Rennes Cedex, France

Middle east technical university, ankara, turkey.

Part of the book series: NATO ASI Subseries F: (NATO ASI F, volume 28)

1592 Accesses

44 Citations

1 Altmetric

• Table of contents

About this book

Editors and affiliations, bibliographic information.

• Publish with us

Buying options

• Available as PDF
• Read on any device
• Instant download
• Own it forever
• Compact, lightweight edition
• Dispatched in 3 to 5 business days
• Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (14 papers)

Front matter, formal aspects of concurrent systems, a formal basis for the specification of concurrent systems.

• Leslie Lamport

On the Construction of Distributed Programs

• G. Roucairol

Derivation of Distributed Algorithms

• J. P. Verjus

Design Issues for Distributed Operating Systems

Design of highly decentralized operating systems.

• Fabrizio Baiardi, Marco Vanneschi

Communication Models for Distributed Computation

• David K. Gifford

New Concepts for Distributed System Structuring

Jean-Pierre Banatre

Hardware Support for Distributed Computing Systems

Distributed computing system architectures : hardware.

• M. Bozyigit

Hardware Support for the Distributed Operating System of the Heidelberg Polyp Processor

Case studies, the apollo domain distributed file system.

• Paul H. Levine

The CHORUS Distributed Operating System: Some Design Issues

• Marc Rozier, José Legatheaux Martins

The Conic Support Environment for Distributed Systems

• Jeff Magee, Jeff Kramer, Morris Sloman

An Experience in Solving a Transaction Ordering Problem in a Distributed System

• Michel Banatre

Distributed Transaction Processing and The Camelot System

• Alfred Z. Spector

Worm Programs

• T. Kindberg, A. V. Sahiner, Y. Paker

Back Matter

• communication
• distributed computing
• distributed file system
• distributed systems
• file system
• operating system

Yakup Paker

Müslim Bozyiğit

Book Title : Distributed Operating Systems

Book Subtitle : Theory and Practice

Editors : Yakup Paker, Jean-Pierre Banatre, Müslim Bozyiğit

Series Title : NATO ASI Subseries F:

DOI : https://doi.org/10.1007/978-3-642-46604-5

Publisher : Springer Berlin, Heidelberg

eBook Packages : Springer Book Archive

Copyright Information : Springer-Verlag Berlin Heidelberg 1987

Softcover ISBN : 978-3-642-46606-9 Published: 03 April 2012

eBook ISBN : 978-3-642-46604-5 Published: 06 December 2012

Series ISSN : 0258-1248

Edition Number : 1

Number of Pages : X, 379

Topics : Operating Systems

Policies and ethics

• Find a journal
• Track your research