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.

Fast hardware implementati<strong>on</strong>s of P systems<br />

– System 4 (opposite), 1 ≤ i ≤ N<br />

r i :<br />

{<br />

o i−1 o i → o i o i+1 i mod 2 = 0<br />

o i o i+1 → o i o i−1 otherwise<br />

For each of four types a system with N equal to 10, 20 and 50 was c<strong>on</strong>sidered<br />

with the initial multiplicity of all objects equal to <strong>on</strong>e. Then for each obtained<br />

system 1024 executi<strong>on</strong>s of 8192 transiti<strong>on</strong>s have been carried out. Each executi<strong>on</strong><br />

differs from the others by the seed required by the random number generator in<br />

the initializati<strong>on</strong> stage. In c<strong>on</strong>sequence, different values are obtained during the<br />

assignment stage, which results in different executi<strong>on</strong>s. As results of experiments<br />

following values are collected: the cardinality of objects in the last c<strong>on</strong>figurati<strong>on</strong>,<br />

the seed of the random number generator and the number of steps to reach the<br />

halting c<strong>on</strong>figurati<strong>on</strong> if the system reached it.<br />

The target circuit for executi<strong>on</strong>s was the Xilinx Virtex-5 XC5VFX70T, code<br />

for different P systems were generated by a Java software and this code was synthesised,<br />

placed and routed using Xilinx tools. Since the input/output interface<br />

has not been developed yet, ChipScope, a Xilinx’s debug tool has been used.<br />

This tool let us, synchr<strong>on</strong>ously, change and capture the above values directly<br />

from the FPGA.<br />

Table 1 shows hardware resource c<strong>on</strong>sumpti<strong>on</strong> and clock rate in MHz of the<br />

system without the debug logic. The implementati<strong>on</strong> achieves high performance,<br />

with frequencies higher than 100 MHz, i.e., it permits to simulate around 2 ×<br />

10 7 computati<strong>on</strong>al steps per sec<strong>on</strong>d. On the other hand, the hardware resource<br />

c<strong>on</strong>sumpti<strong>on</strong> depends <strong>on</strong>ly <strong>on</strong> the number of rules. This is coherent with the fact<br />

that rules of all systems do not change the total number of objects and share<br />

the same dependency graph.<br />

Table 1. Hardware resource c<strong>on</strong>sumpti<strong>on</strong> and clock rate of hardware implementati<strong>on</strong>.<br />

Type Size (Nb. of rules) Slices LUTs BRAMs Clock rate<br />

Circular<br />

2-circular<br />

Linear<br />

Opposite<br />

10 2 % 2 % 1 % 120.02 MHz<br />

20 6 % 10 % 1 % 101.44 MHz<br />

50 41 % 31 % 1 % 100.68 MHz<br />

10 2 % 2 % 1 % 120.02 MHz<br />

20 7 % 6 % 1 % 110.77 MHz<br />

50 37 % 31 % 1 % 100.44 MHz<br />

10 2 % 2 % 1 % 120.02 MHz<br />

20 10 % 6 % 1 % 100.56 MHz<br />

50 40 % 31 % 1 % 100.85 MHz<br />

10 2 % 2 % 1 % 120.02 MHz<br />

20 7 % 6 % 1 % 105.73 MHz<br />

50 37 % 31 % 1 % 100.89 MHz<br />

447

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

Saved successfully!

Ooh no, something went wrong!