WorldCat Identities

Cheriton, David R.

Works: 43 works in 141 publications in 1 language and 509 library holdings
Genres: History  Documentary films 
Roles: Author, Thesis advisor
Classifications: QA76.6, 001.64
Publication Timeline
Most widely held works by David R Cheriton
The Thoth system : multi-process structuring and portability by David R Cheriton( Book )

8 editions published between 1982 and 1983 in English and held by 186 WorldCat member libraries worldwide

Should we be afraid of Google?( Visual )

1 edition published in 2008 in English and held by 43 WorldCat member libraries worldwide

Tells the history of Google along with the pros and cons of some of Google's other initiatives
A decentralized naming facility by David R Cheriton( Book )

6 editions published in 1986 in English and Undetermined and held by 15 WorldCat member libraries worldwide

A key component in distributed computer systems is the naming facility: the means by which high-level names are bound to objects and by which objects are located given only their names. This document describes the design, implementation, and performance of a decentalized naming facility, in which the global name space and name mapping mechanism are implemented by a set of cooperating peers, with no central authority. Decentalization is shown to lend increased extensibility and reliability to the design. Efficiency in name mapping is achieved through specialized caching techniques. (Author)
The unified management of memory in the V distributed system by David R Cheriton( Book )

6 editions published between 1988 and 1991 in English and Undetermined and held by 15 WorldCat member libraries worldwide

Application-controlled physical memory using external page-cache management by Kieran Harty( Book )

4 editions published in 1991 in English and held by 14 WorldCat member libraries worldwide

In this approach, a sophisticated application is able to monitor and control the amount of physical memory it has available for execution, the exact contents of this memory, and the scheduling and nature of page-in and page-out using the abstraction of a physical page cache provided by the kernel. We claim that this approach can significantly improve performance for many memory-bound applications while reducing kernel complexity, yet does not complicate other applications or reduce their performance."
Blazenet : a phototonic implementable wide-area network by Zygmunt J Haas( Book )

6 editions published in 1987 in English and held by 14 WorldCat member libraries worldwide

High-performance wide-area networks are required to interconnect clusters of computers connected by local and metropolitan area networks. Optical fiber technology provides long distance channel in the multi-gigabit per second range. The challenge is to provide switching nodes that handle these data rates with minimum delay, and at a reasonable cost. In this paper, we describe a packet switching network, christened 'Blazenet, ' that provides low delay and has minimal memory requirements. It can be extended to support multicast and priority delivery. Such a network can revolutionize the opportunities for distributed command and control, information and resources sharing, real-time conferencing, to mention but a few applications. (rh)
Leases : an efficient fault-tolerant mechanism for distributed file cache consistency by C. G Gray( Book )

5 editions published between 1989 and 1990 in English and held by 14 WorldCat member libraries worldwide

Leases are proposed as a time-based mechanism that provides efficient consistent access to cached data in distributed systems. Non-Byzantine failures affect performance, not correctness, with their effect minimized by short leases. An analytic model and an evaluation for file access in the V system show that leases of short duration provide good performance. The impact of leases on performance grows more significant in systems of larger scale and higher processor performance
UIO : a uniform I/O system interface for distributed systems by David R Cheriton( Book )

6 editions published in 1986 in English and held by 14 WorldCat member libraries worldwide

A uniform I/O interface allows programs to be written relatively independent of specific I/O services and yet work with a wide variety of the I/O services available in a distributed environment. Ideally, the interface provides this uniform access without excessive complexity in the interface or loss of performance. However, a uniform interface does not arise from careful design of individual system interfaces alone; it requires explicit definition. In this paper, we describe the UIO (uniform I/O) system interface that has been used for the past five years in the V distributed operating system, focusing on the key design issues. This interface provides several extensions beyond the I/O interface of UNIX, including support for record I/O, locking, atomic transactions and replication as well as attributes that indicate whether optional semantics and operations are available. We also describe our experience in using and implementing this interface with a variety of different I/O services plus the performance of both local and network I/O. We conclude that the UIO interface provides a uniform I/O system interface with significant functionality, wide applicability and no significant performance penalty. (KR)
Multi-level shared caching techniques for scalability in VMP-MC by David R Cheriton( Book )

4 editions published in 1989 in English and held by 14 WorldCat member libraries worldwide

The problem of building a scalable shared memory multiprocessor can be reduced to that of building a scalable memory hierarchy, assuming interprocessor communication is handled by the memory system. In this paper, we describe the VMP-MC design, a distributed parallel multi-computer based on the VMP multiprocessor design, that is intended to provide a set of building blocks for configuring machines from one to several thousand processors. VMP-MC uses a memory hierarchy based on shared caches, ranging from on-chip caches to board-level caches connected by busses to, at the bottom, a high-speed fiber optic ring. In addition to describing the building block components of this architecture, we identify the key performance issues associated with the design and provide performance evaluation of these issues using trace-drive simulation and measurements from the VMP
Exploiting recursion to simplify RPC communication architectures by David R Cheriton( Book )

3 editions published in 1988 in English and held by 13 WorldCat member libraries worldwide

Current communication architectures suffer from a growing collection of protocols in the host operating systems, gateways and applications, resulting in increasing implementation and maintenance cost, unreliability and difficulties with interoperability. The remote procedure call (RPC) approach has been used in some distributed systems to contain the diversity of application layer protocols within the procedure call abstraction. However, the same technique cannot be applied to lower layer protocols without violating the strict notion of layers. In this paper, we show how the RPC approach can be used for lower layer protocols so that the resulting 'layer violations' generate a simple recursive structure. The benefits of exploiting recursion in a communication architecture are similar to those realized from its use as a programming technique; the resulting protocol architecture minimizes the complexity and duplication of protocols and mechanism, thereby reducing the cost of implementation and verification. We also sketch a redesigned DoD Internet architecture that illustrates the potential benefits of this approach. (rh)
Sirpent : a high-performance internetworking approach by David R Cheriton( Book )

5 editions published in 1989 in English and held by 12 WorldCat member libraries worldwide

A clear target for computer communication technology is to support a high-performance global internetwork. Current internetworking approaches use either concatenated virtual circuits, as in X.75, or a "universal" internetwork datagram, as in the DoD Internet IP protocol and the IS0 connectionless network protocol (CLNP). Both approaches have significant disadvantages
A log file service exploiting write-once storage by Stanford University( Book )

4 editions published in 1987 in English and held by 12 WorldCat member libraries worldwide

A log service provides efficient storage and retrieval of data that is written sequentially (append-only) and not subsequently modified. Application programs and subsystems use long services for recovery, to record security audit trails, and for performance monitoring. Ideally, a long service should accommodate very large, long-lived logs, and provide efficient retrieval and low space overhead. This paper describes the design and implementation of the Clio log service. Clio provides the abstraction of log files: readable, append-only to be append-only; more general types of write access are not necessary. The authors show how log files can be implemented efficiently and robustly on top of such storage media-in particular, write-once optical disk. In addition, described a general application software storage architecture that makes use of log files. Keywords: Computer files. (KR)
The distributed V kernel and its performance for diskless workstations by David R Cheriton( Book )

6 editions published in 1983 in English and Undetermined and held by 11 WorldCat member libraries worldwide

The distributed V kernel is a message-oriented kernel that provides uniform local and network interprocess communication. It is primarily being used in an environment of diskless workstations connected by a high-speed local network to a set of file servers. The authors describe a performance evaluation of the kernel, with particular emphasis on the cost of network file access. Results show that over a local network: 1. Diskless workstations can access remote files with minimal performance penalty; and 2. The V message facility can be used to access remote files at comparable cost to any well-tuned specialized file access protocol. It is concluded that it is feasible to build a distributed system with all network communication using the V message facility even when most of the network nodes have no secondary storage
Network measurement of the VMTP request-response protocol in the V distributed system by David R Cheriton( Book )

5 editions published in 1987 in English and held by 11 WorldCat member libraries worldwide

Preemptable remote execution facilities for the V-system by Marvin Theimer( Book )

6 editions published in 1985 in English and Undetermined and held by 11 WorldCat member libraries worldwide

A remote execution facility allows a user of a workstation-based distributed computer system to offload programs onto idle workstations, thereby providing the user with access to computational resources beyond that provided by his personal workstation. This paper, describes the design and performance of the remote execution facility in the V distributed system, as well as several implementation issues of interest. In particular, the authors focus on network transparency of the execution environment, preemption and migration of remotely executed programs, and avoidance of residual dependencies on the original host. It is agreed that preemptable remote execution allows idle workstations to be used as a pool of processors without interfering with use by their owners and without significant overhead for the normal execution of programs. In general, it is concluded that the cost of providing preemption is modest compared to providing a similar amount of computation service by dedicated computation engines. (Author)
Host groups : a multicast extension for datagram internetworks by David R Cheriton( Book )

6 editions published in 1985 in English and Undetermined and held by 10 WorldCat member libraries worldwide

The extensive use of local networks is beginning to drive requirements for internetwork facilities that connect these local networks. In particular, the availability of multicast addressing in many local networks and its use by sophisticated distributed applications motivates providing multicast across internetworks. This paper proposes a model of service for multicast in an internetwork, describe how this service can be used, and describe aspects of its implementation including how it would fit into one existing internetwork architecture, namely the US DoD internet Architecture. (Author)
Software-controlled caches in the VMP multiprocessor by David R Cheriton( Book )

5 editions published in 1986 in English and Undetermined and held by 9 WorldCat member libraries worldwide

VMP is an experimental multiprocessor that follows the familiar basic design of multiple processors, each with a cache, connected by a shared bus to global memory. Each processor has a synchronous, virtually addressed, single master connection to its cache, providing very high memory bandwidth. An unusually large cache page size and fast sequential memory copy hardware make it feasible for cache misses to be handled in software, analogously to the handling of virtual memory page faults. Hardware support for cache consistency is limited to a simple state machine that monitors the bus and interrupts the processor when a cache consistency action is required. In this paper, we show how the VMP design provides the high memory bandwidth required by modern high-performance processors with a minimum of hardware complexity and cost. We also describe simple solutions to the consistency problems associated with virtually addressed caches. Simulation results indicate that the design achieves good performance providing data contention is not excessive. (kr)
Using a position history-based protocol for distributed object visualization by S. K Singhal( Book )

3 editions published in 1994 in English and held by 9 WorldCat member libraries worldwide

Abstract: "Users of distributed virtual reality applications interact with users located across the network. Similarly, distributed object visualization systems store dynamic data at one host and render it in real-time at other hosts. Because data in both systems is animated and exhibits unpredictable behavior, providing up-to-date information about remote objects is expensive. Remote hosts must instead apply extrapolation between successive update packets to render the object's true animated behavior. This paper describes and analyzes a 'position history-based' protocol in which hosts apply several recent position updates to track the position of remote objects. The history-based approach offers smooth, accurate visualizations of remote objects while providing a scalable solution."
Optimized memory-based messaging : leveraging the memory system for high-performance communication by David R Cheriton( Book )

3 editions published in 1994 in English and held by 9 WorldCat member libraries worldwide

Abstract: "Memory-based messaging, passing messages between programs using shared memory, is a recognized technique for efficient communication that takes advantage of memory system performance. However, the conventional operating system support for this approach is inefficient, especially for large-scale multiprocessor interconnects, and is too complex to effectively support in hardware. This paper describes hardware and software optimizations for memory-based messaging that efficiently exploit the mechanisms of the memory system to provide superior communication performance. We describe the overall model of optimized memory-based messaging, its implementation in an operating system kernel and hardware support for this approach in a scalable multiprocessor architecture. The optimizations include address-valued signals, message- oriented memory consistency and automatic signaling on write. Performance evaluations show these extensions provide a three-to-five-fold improvement in communication performance over a comparable software-only implementation."
ParaDiGM : a highly scalable shared-memory multi-computer architecture by David R Cheriton( Book )

4 editions published in 1990 in English and held by 8 WorldCat member libraries worldwide

Abstract: "ParaDiGM is a highly scalable shared-memory multi- computer architecture. It is being developed to demonstrate the feasibility of building a relatively low-cost shared-memory parallel computer that scales to large configurations, and yet provides sequential programs with performance comparable to a high-end microprocessor. A key problem is building a scalable memory hierarchy. In this paper we describe the ParaDiGM architecture, highlighting the innovations of our approach and presenting results of our evaluation of the design
moreShow More Titles
fewerShow Fewer Titles
Audience Level
Audience Level
  Kids General Special  
Audience level: 0.66 (from 0.24 for Should we ... to 0.84 for Preemptabl ...)

English (90)