dc.contributor.author |
Nicolescu, R. |
en |
dc.date.accessioned |
2012-01-16T03:19:45Z |
en |
dc.date.available |
2012-01-16T03:19:45Z |
en |
dc.date.issued |
2011 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-415 (2011) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/10568 |
en |
dc.description.abstract |
Our group’s recent quest has been to use P systems to model parallel and
distributed algorithms. Several framework extensions are recalled or detailed, in
particular, modular composition with information hiding, complex symbols, generic
rules, reified cell IDs, asynchronous operational modes, asynchronous complexity.
We motivate our proposals via P system models of several well-known distributed
algorithms, such as leader election and distributed echo. As another type of application,
we mention a dynamic programming algorithm for stereo matching in
image processing. We suggest criteria to assess the merits of this modelling approach
and offer preliminary evaluations of our proposed additional ingredients,
which have been useful in refactoring existing systems and could be useful to the
larger P systems community. |
en |
dc.publisher |
Department of Computer Science, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
CDMTCS Research Report Series |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial |
en |
dc.title |
Parallel and Distributed Algorithms in P Systems |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |
dc.rights.holder |
The author(s) |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |