Download now Free registration required
A P system is a computability model which is biochemically inspired, it is a general distributed model, highly parallel, nondeterministic, based on the notion of a membrane structure. Till this moment, there is no exact idea about the real implementation of P systems. P systems are used in solving NP-complete problems in polynomial time, but with building the whole exponential search space. Cloud computing assume infinite memory and infinite processing power. This paper proposes an algorithm that uses the cloud resources in a fully parallel manner as a step towards P systems implementation, the non-determinism property of P systems is certainly not maintained. The paper used the SAT problem as the case study.
- Format: PDF
- Size: 656.32 KB