Journal Article10.1145/1067627.806587
A NonStop kernel
Joel F. Bartlett
- 01 Dec 1981
- Vol. 15, Iss: 5, pp 22-29
TL;DR: Using these primitives, a mechanism that allows fault-tolerant resource access, the process-pair, is described, and some observations are made on this type of system structure and on actual use of the system.
read more
Abstract: The Tandem NonStop System is a fault-tolerant [1], expandable, and distributed computer system designed expressly for online transaction processing. This paper describes the key primitives of the kernel of the operating system. The first section describes the basic hardware building blocks and introduces their software analogs: processes and messages. Using these primitives, a mechanism that allows fault-tolerant resource access, the process-pair, is described. The paper concludes with some observations on this type of system structure and on actual use of the system.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey of rollback-recovery protocols in message-passing systems
TL;DR: This survey covers rollback-recovery techniques that do not require special language constructs and distinguishes between checkpoint-based and log-based protocols, which rely solely on checkpointing for system state restoration.
Why do computers stop and what can be done about it
Jim Gray
- 01 Jan 1985
TL;DR: It is pointed out that faults in production software are often soft (transient) and that a ransaction mechanism combined with persistent processpairs provides fault-tolerant execution -- the key to software fault -tolerance.
Cluster-based scalable network services
Armando Fox,Steven D. Gribble,Yatin Chawathe,Eric Brewer,Paul Gauthier +4 more
- 01 Oct 1997
TL;DR: A general, layered architecture for building cluster-based scalable network services that encapsulates the above requirements for reuse, and a service-programming model based on composable workers that perform transformation, aggregation, caching, and customization (TACC) of Internet content is proposed.
686
•Book
Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery
Marc H. Scholl
- 30 May 2001
TL;DR: The authors begin with a broad look at the role of transactional technology in today's economic and scientific endeavors, then delve into critical issues faced by all practitioners, presenting today's most effective techniques for controlling concurrent access by multiple clients, recovering from system failures, and coordinating distributed transactions.
672
Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems
Brian M. Oki,Barbara Liskov +1 more
- 01 Jan 1988
TL;DR: This paper presents a new replication algorithm that has desirable performance properties, based on the primary copy technique, and uses a special kind of timestamp called a viewstamp to detect lost information.
502
References
The structure of the “THE”-multiprogramming system
TL;DR: A multiprogramming system is described in which all activities are divided over a number of sequential processes, in each of which one or more independent abstractions have been implemented.
1.2K
Multiprocessor Organization—a Survey
TL;DR: The three basic interconnection systems discussed are: 1) time-shared buses; 2) crossbar switch matrix; and 3) multibus, multiport memories.
187
Tailor: A simple model that works
Russ Blake
- 13 Aug 1979
TL;DR: Tailor, an atomic model of the Tandem/16 multiple-computer system, was able to predict the equipment needed to handle the workloads to within 5 percent and was tested under two very different workloads.
11
XRAY: Instrumentation for multiple computers
Russ Blake
- 28 May 1980
TL;DR: XRAY presents a global view of the performance of hardware and software components on multiple, distributed computers, and focuses on detecting the distributed sources of excessive activity.
7