Dan Teodosiu  Home/Search
Context Related
| stanford.edu/~dant/paper...thesis.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu/~dant/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Current shared-memory multiprocessors suffer from an inherent fragility, since a single hardware or system software failure can cause the entire machine to crash. This dissertation describes a combination of hardware and software techniques that can be used to provide fault containment for large-scale shared memory machines. With fault containment, the impact of a fault remains limited to only a small portion of the system, while the remaining good parts can continue operating normally after... (Update)
Similar documents based on text: More All
1.3: An Efficient I/O and Clock Recovery Desgin for Terabit Integrated.. - Lee (2001) (Correct)
0.3: Complete Computer System Simulation: The SimOS Approach - Rosenblum, Herrod.. (1995) (Correct)
0.2: Integration of Message Passing and Shared Memory.. - Heinlein.. (1994) (Correct)
BibTeX entry: (Update)
Dan Teodosiu. End-to-end fault containment in scalable shared-memory multiprocessors. Ph.D. Thesis, Stanford University, 2000. http://citeseer.ist.psu.edu/teodosiu00endtoend.html More
@misc{ teodosiu00endtoend,
author = "D. Teodosiu",
title = "End-to-end fault containment in scalable shared-memory multiprocessors",
text = "Dan Teodosiu. End-to-end fault containment in scalable shared-memory multiprocessors.
Ph.D. Thesis, Stanford University, 2000.",
year = "2000",
url = "citeseer.ist.psu.edu/teodosiu00endtoend.html" }
Citations (may not include all citations):861 Tcl and the Tk Toolkit - Ousterhout - 1994
718 Distributed Algorithms (context) - Lynch - 1996
478 The Stanford Dash multiprocessor (context) - Lenoski, Laudon et al. - 1992
362 The Stanford FLASH multiprocessor (context) - Kuskin, Ofelt et al. - 1994
241 The Byzantine Generals Problems - Lamport, Shostak et al.
225 The Sprite network operating system - Ousterhout, Cherenson et al. - 1988
222 MIPS RISC Architecture (context) - Kane, Heinrich - 1992
198 Scheduling techniques for concurrent systems (context) - Ousterhout - 1982
154 Planar-Adaptive Routing: Low-cost Adaptive Networks for Mult.. - Chien, Kim - 1992
138 The Turn Model for Adaptive Routing - Glass, Ni - 1992
127 Implementing Global Memory Management in a Workstation Clust.. - Feeley, Morgan et al. - 1995
117 Libckpt: transparent checkpointing under Unix - Plank, Beck et al. - 1995
112 Efficient Synchronization Primitives for Large-Scale Cache-C.. (context) - Goodman, Vernon et al. - 1989
111 Machine-Independent Virtual Memory Management for Paged Unip.. - Rashid - 1988
106 Reliable computer systems: design and evaluation (context) - Siewiorek, Swarz - 1992
[Article contains additional citations not shown here]
Documents on the same site (http://www-flash.stanford.edu/~dant/papers.html):
HARE: An Optimizing Portable Compiler for Scheme - Teodosiu (Correct)
Discarding Unused Temporal Information in a Production System - Dan Teodosiu (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC