Distributed Parallel Computing for Visual Cryptography Algorithms

e-Archivo Repository

Show simple item record

dc.contributor.author Ciegis, Raimondas
dc.contributor.author Starikovicius, Vadimas
dc.contributor.author Tumanova, Natalija
dc.contributor.author Ragulskis, Minvydas
dc.contributor.author Palivonaite, Rita
dc.contributor.editor Carretero Pérez, Jesús
dc.contributor.editor García Blas, Javier
dc.contributor.editor Wyrzykowski, Roman
dc.contributor.editor Jeannot, Emmanuel
dc.contributor.other Universidad Carlos III de Madrid. Computer Architecture, Communications and Systems Group (ARCOS)
dc.date.accessioned 2015-11-12T10:58:37Z
dc.date.available 2015-11-12T10:58:37Z
dc.date.issued 2015-10
dc.identifier.bibliographicCitation Carretero Pérez, Jesús; et.al. (eds.). (2015) Proceedings of the Second International Workshop on Sustainable Ultrascale Computing Systems (NESUS 2015): Krakow, Poland. Universidad Carlos III de Madrid, pp. 23-28.
dc.identifier.isbn 978-84-608-2581-4
dc.identifier.uri http://hdl.handle.net/10016/21991
dc.description Proceedings of: Second International Workshop on Sustainable Ultrascale Computing Systems (NESUS 2015). Krakow (Poland), September 10-11, 2015.
dc.description.abstract The recent activities to construct exascale and ultrascale distributed computational systems are opening a possibility to apply parallel and distributed computing techniques for applied problems which previously were considered as not solvable with the standard computational resources. In this paper we consider one global optimization problem where a set of feasible solutions is discrete and very large. There is no possibility to apply some apriori estimation techniques to exclude an essential part of these elements from the computational analysis, e.g. applying branch and bound type methods. Thus a full search is required in order to solve such global optimization problems. The considered problem describes visual cryptography algorithms. The main goal is to find optimal perfect gratings, which can guarantee high quality and security of the visual cryptography method. The full search parallel algorithm is based on master-slave paradigm. We present a library of C++ templates that allow the developer to implement parallel master-slave algorithms for his application without any parallel programming and knowledge of parallel programming API. These templates automatically give parallel solvers tailored for clusters of computers using MPI API and distributed computing applications using BOINC API. Results of some computational experiments are presented.
dc.description.sponsorship The work presented in this paper has been partially supported by EU under the COST programme Action IC1305, ’Network for Sustainable Ultrascale Computing (NESUS)’.
dc.format.extent 6
dc.format.mimetype application/pdf
dc.language.iso eng
dc.subject.other Visual cryptography
dc.subject.other Parallel algorithm
dc.subject.other BOINC
dc.subject.other Parallel templates
dc.title Distributed Parallel Computing for Visual Cryptography Algorithms
dc.type bookPart
dc.type conferenceObject
dc.subject.eciencia Informática
dc.rights.accessRights openAccess
dc.type.version publishedVersion
dc.relation.eventdate September 10-11, 2015
dc.relation.eventnumber 2
dc.relation.eventplace Krakow, Poland
dc.relation.eventtitle International Workshop on Sustainable Ultrascale Computing Systems (NESUS 2015)
dc.relation.eventtype proceeding
dc.identifier.publicationfirstpage 23
dc.identifier.publicationlastpage 28
dc.identifier.publicationtitle Proceedings of the Second International Workshop on Sustainable Ultrascale Computing Systems (NESUS 2015): Krakow, Poland
 Find Full text

Files in this item

*Click on file's image for preview. (Embargoed files's preview is not supported)

This item appears in the following Collection(s)

Show simple item record