Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Membrane Systems and Distributed Computing
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Fast quantum byzantine agreement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fault-scalable Byzantine fault-tolerant services
Proceedings of the twentieth ACM symposium on Operating systems principles
IEEE Transactions on Dependable and Secure Computing
CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part II
Parallel and distributed algorithms in p systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
New solutions for disjoint paths in P systems
Natural Computing: an international journal
Fast distributed DFS solutions for edge-disjoint paths in digraphs
CMC'12 Proceedings of the 13th international conference on Membrane Computing
P System Implementation of Dynamic Programming Stereo
Journal of Mathematical Imaging and Vision
| Hi-index | 0.00 |
We propose an improved generic version of P modules, an extensible framework for recursive composition of P systems. We further provide a revised P solution for the Byzantine agreement problem, based on Exponential Information Gathering (EIG) trees, for N processes connected in a complete graph. Each process is modelled by the combination of N + 1 modules: one "main" module, plus one "firewall" communication module for each process (including one for itself). The EIG tree evaluation functionality is localized into a "main" single cell P module. The messaging functionality is localized into a three cells communication P module. This revised P solution improves overall running time from 9L+6 to 6L+1, where L is the number of messaging rounds. Most of the running time, 5L steps, is spent on the communication overhead. We briefly discuss if single cells can solve the Byzantine agreement without support and protection from additional communication cells; we conjecture that this is not possible, within the currently accepted definitions.