09.09.2014 Views

13th International Conference on Membrane Computing - MTA Sztaki

13th International Conference on Membrane Computing - MTA Sztaki

13th International Conference on Membrane Computing - MTA Sztaki

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

DCBA: Simulating populati<strong>on</strong> dynamics P systems with proporti<strong>on</strong>al object<br />

distributi<strong>on</strong><br />

for the same objects. In the model, the behaviour of the ungulates are modelled<br />

by using rule blocks that do not compete for objects. So, the simulator provides<br />

similar results for both DCBA and DNDP algorithms. In the case of the Bearded<br />

Vulture, there is a set of rules r 22,i,j that compete for B objects because k 1,14 is<br />

not 0 (the Bearded Vulture needs to feed <strong>on</strong> b<strong>on</strong>es to survive). The k i,14 c<strong>on</strong>stants<br />

are 0 for ungulates (2 ≤ i ≤ 7), because they do not need to feed <strong>on</strong> b<strong>on</strong>es to<br />

survive. The initial amount of b<strong>on</strong>es and the amount of b<strong>on</strong>es generated during<br />

the simulati<strong>on</strong> is enough to support the Bearded Vulture populati<strong>on</strong> regardless<br />

the way the simulati<strong>on</strong> algorithm distributes the b<strong>on</strong>es between vultures of<br />

different ages (rules r 22,1,j ). Since there is a small initial populati<strong>on</strong> of bearded<br />

vultures (20 pairs), some differences can be noticed between the results from<br />

DCBA, DNDP, C++ simulator and the actual ecosystem data for the Bearded<br />

Vulture (39 bearded vultures with DCBA for year 2008, 36 with DNDP, 38 with<br />

the C++ simulator and 37 <strong>on</strong> the actual ecosystem).<br />

In Figure 8 it is shown the comparis<strong>on</strong> between the actual data for the year<br />

2008 and the simulati<strong>on</strong> results obtained by using the C++ ad hoc simulator,<br />

the DNDP algorithm and the DCBA algorithm implemented in pLinguaCore.<br />

In the case of the Pyrenean Chamois, there is a difference between the actual<br />

populati<strong>on</strong> data <strong>on</strong> the ecosystem (12000 animals) and the results provided by<br />

the other simulators (above 20000 animals), this is because the populati<strong>on</strong> of<br />

Pyrenean Chamois was restarted <strong>on</strong> year 2004 [4]. Taking this into account, <strong>on</strong>e<br />

can notice that all the simulators behave in a similar way for the above model<br />

and they can reproduce the actual data after 14 simulated years. So, the DCBA<br />

algorithm is able to reproduce the semantics of PDP systems and it can be used<br />

to simulate the behaviour of actual ecosystems by means of PDP systems.<br />

5 C<strong>on</strong>clusi<strong>on</strong>s and Future Work<br />

In this paper we have introduced a novel algorithm for Populati<strong>on</strong> Dynamics P<br />

systems (PDP systems), called Direct distributi<strong>on</strong> based <strong>on</strong> C<strong>on</strong>sistent Blocks<br />

Algorithm (DCBA). This new algorithm performs an object distributi<strong>on</strong> al<strong>on</strong>g<br />

the rules that eventually compete for objects. The main procedure is divided<br />

into two stages: selecti<strong>on</strong> and executi<strong>on</strong>. Selecti<strong>on</strong> stage is also divided into three<br />

micro-phases: phase 1 (distributi<strong>on</strong>), where by using a table and the c<strong>on</strong>structi<strong>on</strong><br />

of rule blocks, the distributi<strong>on</strong> process takes place; phase 2 (maximality), where<br />

a random order is applied to the remaining rule blocks in order to assure<br />

the maximality c<strong>on</strong>diti<strong>on</strong>; and phase 3 (probability), where the number of<br />

applicati<strong>on</strong> of rule blocks is translated to applicati<strong>on</strong> of rules by using random<br />

numbers respecting the probabilities. The algorithm is validated towards a real<br />

ecosystem model, showing that they reproduce the same results as the original<br />

simulator written in C++.<br />

The accelerators in High Performance <strong>Computing</strong> offers new approaches to<br />

accelerate the simulati<strong>on</strong> of P systems and Populati<strong>on</strong> Dynamics. An initial<br />

parallelizati<strong>on</strong> work of the DCBA by using multi-core processors is described in<br />

[9]. The analysis of the two parallel levels (simulati<strong>on</strong>s and envir<strong>on</strong>ments), and<br />

307

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!