Reliably executing tasks in the presence of untrusted entities

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2006, Pages 39-48

  Fernández, Antonio ^a   López, Luis ^a   Santos, Agustín ^a   Georgiou, Chryssis ^b  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCKING PROBABILITY; DECISION THEORY; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANCE; PROGRAM PROCESSORS;

DECISION STRATEGY; FAULTY PROCESSORS; UNTRUSTED ENTITIES;

SOFTWARE RELIABILITY;

EID: 38949162207     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SRDS.2006.40     Document Type: Conference Paper

References (23)

1. N. Alon and J.H. Spencer. The Probabilistic Method. J. Wiley and Sons, Inc., Second Edition, 2000.
2. th IEEE/ACM International Workshop on Grid Computing (GRID 2004), pages 4-10, 2004.
3. st IEEE International Conference on e-Science and Grid Technologies (e-Science 2005), pages 196-203, 2005.
4. th Symposium on Reliable Distributed Systems (SRDS 1990), pages 136-145, 1990.
5. C. Dwork, J. Halpern, and O. Waarts. Performing work efficiently in the presence of faults. Siam Journal on Computing, 27(5):1457-1491, 1998.
6. W. S. Evans and N. Pippenger. Average-case lower bounds for noisy Boolean decision trees. SIAM Journal on Computing, 28(2):433-446, 1998.
7. U. Feige, P. Raghavan, D. Peleg, and E. Upfal. Computing with noisy information. SIAM Journal on Computing, 23(5):1001-1018, 1994.
8. A. Fernández, C. Georgiou, A. Russell, and A. Shvartsman. The Do-All problem with Byzantine processor failures. Theoretical Computer Science, 333(3):433-454, 2005.
9. th International Symposium on Distributed Computing (DISC 2005), pages 490-492, 2005.
10. P. Gács and A. Gal. Lower bounds for the complexity of reliable Boolean circuits with noisy gates. IEEE Transactions on Information Theory, 40(2):579-583, 1994.
11. R. G. Gallanger. Finding parity in simple broadcast networks. IEEE Transactions on Information Theory, 34:176-180, 1988.
12. Ch. Georgiou, A. Russell, and A.A. Shvartsman. Work-competitive scheduling for cooperative computing with dynamic groups. SIAM Journal on Computing, 34(4):848-862, 2005.
13. th IEEE Symposium on Foundations of Computer Science (FOCS 2005), pages 40-52, 2005.
14. P. Kanellakis and A. Shvartsman. Fault-Tolerant Parallel Computation. Kluwer, 1997.
15. rd ACM Symposium on Theory of Computing (STOC 1991), pages 381-390, 1991.
16. C. Kenyon and V. King. On Boolean decision trees with faulty nodes. Random Structures and Algorithms, 5(3):453-464, 1994.
17. E. Korpela, D. Werthimer, D. Anderson, J. Cobb, and M. Lebofsky. SETI@home: Massively distributed computing for SETI. Computing in Science and Engineering, 3(1):78-83, 2001.
18. A. Kumar and K. Malik. Voting mechanisms in distributed systems. IEEE Transactions on Reliability, 40(5):593-600, 1991.
19. E. Kushilevitz and Y. Mansour. Computation in noisy radio networks. SIAM Journal on Discrete Mathematics, 19(1):96-108, 2005
20. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, 1982.
21. th Colloquium on Structural Information and Communication Complexity (SIROCCO 2004), pages 245-254, 2004.
22. nd IEEE Symposium on Foundations of Computer Science (FOCS 1991), pages 602-611, 1991.
23. M. Szegedy and X. Chen. Computing Boolean functions from multiple faulty copies of input bits. Theoretical Computer Science, 321(1):149-170, 2004.