<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-13T04:10:35Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:10459.1/57200" metadataPrefix="qdc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:10459.1/57200</identifier><datestamp>2024-12-05T22:09:12Z</datestamp><setSpec>com_2072_3622</setSpec><setSpec>col_2072_479130</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>DisCoP2P: an efficient P2P computing overlay</dc:title>
   <dc:creator>Sentís, Josep M.</dc:creator>
   <dc:creator>Solsona Tehàs, Francesc</dc:creator>
   <dc:creator>Castellà Martínez, Damià</dc:creator>
   <dc:creator>Rius Torrentó, Josep Maria</dc:creator>
   <dc:subject>Peer-to-Peer</dc:subject>
   <dc:subject>CodiP2P</dc:subject>
   <dc:subject>DisCoP</dc:subject>
   <dc:subject>P2P searching</dc:subject>
   <dcterms:abstract>CodiP2P and DisCoP are two peer-to-peer (P2P) computing overlays&#xd;
aimed at sharing computing resources (CPU, Memory, etc.) to execute parallel applications.&#xd;
Their component nodes are basically PC’s and a wide range of computer servers,&#xd;
desktops or laptops. This paper joins these two platforms into a new one, DisCoP2P,&#xd;
to combine the features from both overlays. CodiP2P is highly scalable, and DisCoP&#xd;
has an efficient searching mechanism and the ability to classify computing resources.&#xd;
The new platform takes advantage of these features and uses them to offer new facilities&#xd;
to schedule and execute parallel applications efficiently. This is accomplished&#xd;
at null cost because the platform is made up of nodes that share resources for free.&#xd;
This research field can also be classified in desktop computing. The success of this&#xd;
platform depends greatly on the added overhead. This overhead is produced mainly in&#xd;
searching for resources and system administration. The obtained results in a preliminary&#xd;
prototype, although not sufficiently conclusive, demonstrate the applicability of&#xd;
DisCoP2P in the real world, i.e. Internet.</dcterms:abstract>
   <dcterms:abstract>This work was supported by the MEyC under contract TIN2011-28689-C02-02. Authors are members of the research group 2009 SGR145, funded by the Generalitat de Catalunya.</dcterms:abstract>
   <dcterms:dateAccepted>2024-12-05T22:09:12Z</dcterms:dateAccepted>
   <dcterms:available>2024-12-05T22:09:12Z</dcterms:available>
   <dcterms:created>2024-12-05T22:09:12Z</dcterms:created>
   <dcterms:issued>2016-06-14T11:09:43Z</dcterms:issued>
   <dcterms:issued>2025-01-01</dcterms:issued>
   <dcterms:issued>2014</dcterms:issued>
   <dc:type>article</dc:type>
   <dc:type>publishedVersion</dc:type>
   <dc:identifier>http://hdl.handle.net/10459.1/57200</dc:identifier>
   <dc:relation>MICINN/PN2008-2011/TIN2011-28689-C02-02</dc:relation>
   <dc:relation>Reproducció del document publicat a https://doi.org/10.1007/s11227-013-1052-2</dc:relation>
   <dc:relation>Journal of Supercomputing, 2014, vol. 68, núm. 2, p. 557-573</dc:relation>
   <dc:rights>(c) Springer Science, 2014</dc:rights>
   <dc:rights>info:eu-repo/semantics/restrictedAccess</dc:rights>
   <dc:publisher>Springer Verlag</dc:publisher>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>