Distributed operating systems
As distributed computer systems become more pervasive, so does the need for understanding how their operating systems are designed and implemented. Andrew S. Tanenbaum's Distributed Operating Systems fulfills this need. Representing a revised and greatly expanded Part II of the best-selling Modern Operating Systems, it covers the material from the original book, including communication, synchronization, processes, and file systems, and adds new material on distributed shared memory, real-time distributed systems, fault-tolerant distributed systems, and ATM networks. It also contains four detailed case studies: Amoeba, Mach, Chorus, and OSF/DCE. Tanenbaum's trademark writing provides readers with a thorough, concise treatment of distributed systems.
What people are saying - Write a review
We haven't found any reviews in the usual places.
COMMUNICATION IN DISTRIBUTED SYSTEMS
SYNCHRONIZATION IN DISTRIBUTED SYSTEMS
PROCESSES AND PROCESSORS IN DISTRIBUTED SYSTEMS
8 other sections not shown
Other editions - View all
address space algorithm allocated allow Amoeba binary binary name block broadcast buffer bytes cache capability cell Chorus clock contains copy crashes created critical region deadlock directory server disk distributed file system distributed shared memory distributed systems entry example file server file system fileset FLIP global group communication handle hardware header implementation interface kernel layer located lock Mach machine mapped memory manager microkernel msec multiple multiprocessor mutex needed object operating system packet page fault parameters performance port possible problem procedure processor protocol queue real-time receiver remote remote procedure call reply request runtime system scheduling segment semantics sender sends a message sent sequence sequentially consistent shared variables shown in Fig single switch synchronization system calls timer timestamp tion transaction tuple tuple space UNIX update user processes waiting workstation write