Scheduling issues in survivability applications using hybrid fault models

Parallel Processing Letters

Volumn 14, Issue 1, 2004, Pages 5-22

  Krings, Axel W ^a   Harrison, William S ^a   Azadmanesh, Azad ^b   McQueen, Miles ^c  

^a University of Idaho   (United States)

^b UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

^c IDAHO NATIONAL LABORATORY   (United States)

Author keywords

Modelization; Scheduling; Security and survivability applications

Indexed keywords

ALGORITHMS; COMPUTER CRIME; COMPUTER NETWORKS; FAULT TOLERANT COMPUTER SYSTEMS; GRAPHIC METHODS; INTERFACES (COMPUTER); PROBABILITY DISTRIBUTIONS; SECURITY SYSTEMS;

HYBRID VAULT MODELS; MODELIZATION; SECURITY AND SURVIVABILITY APPLICATIONS; SPATIAL REDUNDANCY;

SCHEDULING;

EID: 2442436865     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626404001672     Document Type: Conference Paper

References (29)

1. A. Avizienis, J.C. Laprie and B. Randell, Fundamental Concepts of Dependability, Information Survivability Workshop (ISW-2000), Boston, Massachusetts, Oct. 24-26, 2000.
2. M. H. Azadmanesh, and R. M. Kieckhafer, Exploiting Omissive Faults in Synchronous Approximate Agreement, IEEE Transactions on Computers, Vol. 49, No. 10, Oct. 2000, 1030-1042.
3. O. Babaoglu, and R. Drummond, Streets of Byzantium: Network Architectures for Fast Reliable Broadcasts, IEEE Transactions on Software Engineering, Vol. SE-11, No. 6, June 1985, 546-554.
4. P. Banerjee and J. A. Abraham, Fault-Secure Algorithms for Multiple Processor Systems, Proc. 11th International Symp. on Computer Architecture, Ann Arbor, MI, June 1984, 279-287.
5. P. Berman, J. A. Garay, and K. J. Perry, Optimal Early Stopping in Distributed Consensus, Proc. 6th International Workshop on Distributed Algorithms (WDAG '92), LNCS 647, Springer-Verlag, Nov. 1992, 221-237.
6. P. Cristian, and C. Fetzer, Fault-Tolerant Internal Clock Synchronization, Proc. Thirteenth Symposium on Reliable Distributed Systems, Dana Point, California, Oct. 1994, 22-31.
7. J. S. Deogun, R. M. Kieckhafer, and A. W. Krings, Stability and Performance of List Scheduling With External Process Delays, Real-Time Systems, Vol. 15, No. 1, July 1998, 5-39.
8. D. Dolev, R. Reischuk, and H. R. Strong, Eventual Is Earlier than Immediate, 23rd Annual Symposium on Foundations of Computer Science, Chicago, Nov. 1982, 196-203.
9. D. Dolev, R. Reischuk, and H. R. Strong, Early Stopping in Byzantine Agreement, Journal of the ACM, Vol. 37, No. 4, Mar. 1990, 720-741.
10. S. Dolev, Possible and Impossible Self-Stabilizing Digital Clock Synchronization in General Graphs, Journal of Real-Time Systems, Vol. 12, No. 1, 1997, 95-107.
11. B. Ellison, et.al., Survivable Network Systems: An Emerging Discipline, Carnegie Mellon University, Software Engineering Institute, Technical Report CMU/SEI-97-TR-013, 1997.
12. S. Ghosh, R. Melhem, and D. Mosse, Fault-Tolerance Through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems, IEEE Trans. Parallel and Distributed Systems, Vol. 8, No.3, Mar. 1997, 272-284.
13. D. W. Gillies, Algorithms To Schedule Tasks With And/Or Precedence Constraints, Ph. D. Thesis, University of Illinois at Urbana-Champaign, 1993.
14. A. Girault, C. Lavarenne, M. Sighireanu, and Y. Sorel, Generation of Fault-Tolerant Static Scheduling for Real-Time Distributed Embedded Systems with Multi-Point Links, IEEE Workshop on Fault-Tolerant Parallel and Distributed Systems, San Francisco, USA, April, 2001.
15. D. Gu, D. J. Rosenkrantz and S. S. Ravi, Construction and Analysis of Fault-Secure Multiprocessor Schedules, Proc. 21st Intl. Symp. on Fault Tolerant Computing (FTCS-21), Montreal, June 1991, 120-127.
16. D. Gu, D. J. Rosenkrantz and S. S. Ravi, Fault/Error Models and Their Impact on Reliable Multiprocessor Schedules, Proc. IEEE Workshop on Fault-Tolerant Parallel and Distributed Systems, 1992, 176-184.
17. K. Hashimoto, T. Tsuchiya, and T. Kikuno, Fault-Secure Scheduling of Arbitrary Task Graphs to Multiprocessor Systems, Proc. International Conference on Dependable Systems and Networks (DSN 2000), June 2000, 203-212.
18. W. B. Johnson, Design and Analysis of Fault-Tolerant Digital Systems (Addison-Wesley Publishing Company, New York, 1985).
19. A. W. Krings, and T. Feyer, The Byzantine Agreement Problem: Optimal Early Stopping, Proc. 32nd Hawaii International Conference on System Sciences, No. stdds03, January 5-8, 1999, 1-12.
20. L. Lamport, M. Pease, R. Shostak, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, Vol. 4, No. 3, July 1982, 382-401.
21. P. Lincoln, and J. Rushby, The Formal Verification of an Algorithm for Interactive Consistency under a Hybrid Fault Model, Computer Aided Verification, CAV'93, Lecture Notes in Computer Science, No. 697, Springer Verlag, 1993, 292-304.
22. L. V. Mancini, Modular Redundancy in a Message Passing Systems, IEEE Trans. Software Eng., Vol. 12, No. 1, Jan. 1986, 79-86.
23. G. Manimaran and C. Siva Ram Murthy, A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis, IEEE Trans. Parallel and Distributed Systems, Vol. 9, No. 11, Nov. 1998, 1137-1152.
24. F. J. Meyer, and D. K. Pradhan, "Consensus with Dual Failure Modes", IEEE Transactions on Parallel and Distributed Systems, Vol. 2, No. 2, April, 1991, 214-222.
25. P. G. Neumann, Practical Architectures for Survivable Systems and Networks, (Phase-Two Final Report), Computer Science Laboratory, SRI International, June 2000.
26. F. Schneider, Understanding Protocols for Byzantine Clock Synchronization, Department of Computer Science, Cornell University, Report 87-859, August 1987.
27. P. Thambidurai, and Y.-K. Park, Interactive Consistency with Multiple Failure Modes, Proc. 7th Symp. on Reliable Distributed Systems, Columbus, OH, Oct. 1988, 93-100.
28. G. Xiao, Early Stopping Byzantine Agreement in LAN based Network Environments, M. S. Thesis, Computer Science Department, University of Idaho, 2000.
29. Y.C. Yeh, Triple-Triple Redundant 777 Primary Flight Computer, IEEE Aerospace Applications Conference, 1996, 293-307.