Sciweavers

1855 search results - page 27 / 371
» A coding theorem for distributed computation
Sort
View
PPOPP
2005
ACM
14 years 4 months ago
Fault tolerant high performance computing by a coding approach
As the number of processors in today’s high performance computers continues to grow, the mean-time-to-failure of these computers are becoming significantly shorter than the exe...
Zizhong Chen, Graham E. Fagg, Edgar Gabriel, Julie...
POPL
2009
ACM
14 years 11 months ago
Verifying distributed systems: the operational approach
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...
Tom Ridge
FCCM
2006
IEEE
108views VLSI» more  FCCM 2006»
14 years 5 months ago
A Reconfigurable Distributed Computing Fabric Exploiting Multilevel Parallelism
This paper presents a novel reconfigurable data flow processing architecture that promises high performance by explicitly targeting both fine- and course-grained parallelism. This...
Charles L. Cathey, Jason D. Bakos, Duncan A. Buell
ACSC
2006
IEEE
14 years 5 months ago
Manufacturing opaque predicates in distributed systems for code obfuscation
Code obfuscation is a relatively new technique of software protection and it works by deterring reverse engineering attempts by malicious users of software. The objective of obfus...
Anirban Majumdar, Clark D. Thomborson
CONCUR
2003
Springer
14 years 4 months ago
Synthesis of Distributed Algorithms Using Asynchronous Automata
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
Alin Stefanescu, Javier Esparza, Anca Muscholl