C. Basile, Z. Kalbarczyk, and Iyer R. K. A preemptive deterministic scheduling algorithm for multithreaded replicas. In Proc. Intl. Conf. on Dependable Systems and Networks (DSN), pages 149--158, San Francisco, California, USA, June 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Hardware Support for High Performance, Intrusion-.. - Saggese, Basile.. (2004) Self-citation (Basile Kalbarczyk Iyer) (Correct)
No context found.
C. Basile, Z. Kalbarczyk, and R. Iyer, "Preemptive deterministic scheduling algorithm for multithreaded replicas," in Proc. of DSN, 2003.
Group Communication Protocols under Errors - Basile, Wang, Kalbarczyk, Iyer (2003) (1 citation) Self-citation (Basile Kalbarczyk Iyer) (Correct)
No context found.
C. Basile, Z. Kalbarczyk, and R. Iyer. Preemptive deterministic scheduling algorithm for multithreaded replicas. In Proc. of the Int'l Conf. on Dependable Systems and Networks, 2003.
A Preemptive Deterministic Scheduling Algorithm for.. - Basile, Kalbarczyk, Iyer (2003) (6 citations) Self-citation (Basile Kalbarczyk Iyer) (Correct)
....next mutex and proceed to step 1 before the higher id threads t 3 and t 4 have requested their first mutex for that round, i.e. have completed step 0. Due to space limitations, an extensive description of the pseudocode (Figure 4) and a correctness proof for the PDS 2 algorithm are relegated to [15]. Besides deriving a paper and pencil formal proof (based on modelling the algorithm as an I O automaton) we used the Spin model checker [16] to automatically verify the Internal Correctness Property of our pseudocode. We are currently investigating how to automatically verify the External ....
....(e.g. consider a call processing application where threads estabilish line connections for incoming calls) For these applications, new data connections are regularly available to all threads and the PDS algorithm performs well. Solutions to handle late data connection arrivals are discussed in [15]. 4.5. Using the PDS Algorithm with Majority Voting Because the PDS algorithm does not require inter replica communication, no additional failure modes are introduced by using the algorithm beyond what one would have in a typical replicated system. For example, in an active replication scheme ....
[Article contains additional citation context not shown here]
C. Basile, Z. Kalbarczyk, and R. Iyer. A preemptive deterministic scheduling algorithm for multithreaded replicas. Technical report, University of Illinois at Urbana-Champaign, 2003. http://www.uiuc.edu/cbasile/papers.
Group Communication Protocols under Errors - Basile (2003) (1 citation) Self-citation (Basile) (Correct)
....Subsystem Fifo Atomic SEQ Atomic NSEQ Figure 1. Origin of fail silence violations. 5. Error Latency Despite its vast acceptance, experimental studies have shown that assuming a benign failure model for the underlying communication layer is an impediment to achieving high dependability [9]. Understanding the error propagation patterns between These failures are detected by dedicated assertions we added to the benchmark code. the location of an error and that of a process failure is vital to maintaining system integrity. Figure 2 shows the error location distribution, with ....
C. Basile, Z. Kalbarczyk, and R. Iyer. Preemptive deterministic scheduling algorithm for multithreaded replicas. In Proc. Int'l Conf. on Dependable Systems and Networks, 2003.
Practical and low-overhead masking of failures of.. - Zagorodnov.. (2005) (Correct)
No context found.
C. Basile, Z. Kalbarczyk, and Iyer R. K. A preemptive deterministic scheduling algorithm for multithreaded replicas. In Proc. Intl. Conf. on Dependable Systems and Networks (DSN), pages 149--158, San Francisco, California, USA, June 2003.
A Multi-Level Meta-Object Protocol for Fault-Tolerance in .. - Taiani, Fabre, Kilijan (2005) (Correct)
No context found.
C. Basile, Z. Kalbarczyk, and R. Iyer. A preemptive deterministic scheduling algorithm for multithreaded replicas. In Networks (DSN-2003.
Using Program Analysis to Identify and Compensate for.. - In Fault-Tolerant.. (2004) (Correct)
No context found.
C. Basile, Z. Kalbarczyk, and R. Iyer. A preemptive deterministic scheduling algorithm for multithreaded replicas. In International Conference on Dependable Systems and Networks, pages 149--158, San Francisco, CA, June 2003.
Performance and Effectiveness Trade-Off for.. - Katsaros, Angelis, Lazos (2006) (Correct)
No context found.
Basile C., Kalbarczyk, Z., Iyer R. A preemptive deterministic scheduling algorithm for multithreaded replicas. Proceedings of the IEEE/IFIP Int. Conference on Dependable Systems and Networks (DSN 03), San Francisco, 2003; 149-158.
Unification of Transactions and Replication in Three-Tier.. - Zhao, Melliar-Smith (2005) (Correct)
No context found.
C. Basile, K. Whisnant, and R. Iyer. A preemptive deterministic scheduling algorithm for multithreaded replicas. In Proceedings of the IEEE International Conference on Dependable Systems and Networks, pages 149--158, San Francisco, CA, June 2003.
Deterministic Scheduling for Multithreaded Replicas - Zhao, Moser, Melliar-Smith (2005) (Correct)
No context found.
C. Basile, K. Whisnant, and R. Iyer. A preemptive deterministic scheduling algorithm for multithreaded replicas. In Proceedings of the IEEE International Conference on Dependable Systems and Networks, pages 149--158, San Francisco, CA, June 2003.
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