Congressos -
La notícia va ser escrita per Fernando Guirado, a la data 2008-11-07
 |
CoDiP2P: A Peer-to-Peer Architecture for Sharing Computing Resources
D. Castellà, I. Barri, J. Rius, F. Giné, F. Solsona, F. Guirado
International Symposium on Distributed Computing and Artificial Intelligence 2008 (DCAI 2008)
|
 |
Abstract:Peer-to-Peer (P2P) computing, the harnessing of idle compute cycles through the Internet, offers new research challenges in the domain of distributed computing.
This paper presents CoDiP2P, a Computing Distributed architecture using the P2P paradigm. CoDiP2P allows computing resources from ordinary users to be shared in an open access by means of creating dynamic areas of computing resources in a completely distributed, scalable and fault tolerant way. This paper discusses its system architecture and evaluates its functionality by means of simulation.
|
| |
Dades de l'article.
Transparències de la presentació.
Vídeo de l'obtenció de recursos.
Congressos -
La notícia va ser escrita per Fernando Guirado, a la data 2008-09-26
Jornadas Paralelismo 2008 |
CoDiP2P: A Distributed Computing Architecture Oriented to P2P Environments
|
 |
Abstract:Peer-to-Peer (P2P) computing, the harnessing of idle compute cycles through the Internet, offers new research challenges in the domain of distributed computing. This paper presents CoDiP2P, a Computing Distributed architecture using the P2P paradigm. CoDiP2P allows computing resources from ordinary users to be shared in an open access by means of creating dynamic areas of computing resources in a completely distributed, scalable and fault tolerant way. This paper discusses its system architecture and evaluates its functionality by means of simulation.
This work was supported by the MITyC-Spain under contract FIT-340000-2007-44
|
L'article el podeu descarregar des d'aquí
Les transparències de la presentació les podeu descarregar des d'aquí
Congressos -
La notícia va ser escrita per Fernando Guirado, a la data 2007-11-13
Jornadas Paralelismo 2007 |
CompP2P: A P2P Computing System
|
 |
Abstract: We present CompP2P, a new distributed computing framework which works as an asynchronous collaborative peer-to-peer system. CompP2P allows the building of non-dedicated and large scale systems composed of a set of heterogeneous processing nodes con- nected to Internet at low cost. The main goal of CompP2P is to make use of the idle CPU idle cycles of the component nodes for computing distributed applications.
The main feature of this platform is its pure P2P decentralized topology. That is, every CompP2P node is able to collaborate in the control and managing of the system, and to compute distributed tasks. CompP2P is a prototype based on the JXTA technology. JXTA improves the CompP2P benefits by providing it with services for control, managing and communication exchanging through Internet.
We compared the CompP2P performance with regard to the MPI parallel programming approach in order to evaluate its efficiency and overhead. The results show that CompP2P is well positioned as a promising low-cost and efficient high throughput computing system. |
L'article el podeu descarregar des d'aquí
Les transparències de la presentació les podeu descarregar des d'aquí
Congressos -
La notícia va ser escrita per J.Lluís Lérida , a la data 2007-10-26
 |
MetaLoRaS a Rescheduling and Prediction MetaScheduler for Non-Dedicated Multiclusters
|
 |
Abstract:Recently, Multicluster environments have become more important in the high-performance computing world. However, less attention has been paid to non-dedicated Multiclusters. We are developing MetaLoRaS, an efficient twolevel MetaScheduler for non-dedicated environments, which assigns PVM and MPI applications according to an estimation of the turnaround time in each particular cluster.
The main MetaScheduler goal is to minimize the average job turnaround time in a non-dedicated environment. The efficiency of MetaLoRaS depends on the prediction accuracy of the system and its ability to take decisions according to changes in local workload.
In this paper we present different Metascheduling techniques that take the dynamics of the local workload into account and compare their effects on system performance. We evaluate the prediction accuracy in relation to the low-level queues sizes. Finally, we analyze the relationship between prediction accuracy and system performance. |
Les transparències de la presentació les podeu descarregar des d'aquí
Congressos -
La notícia va ser escrita per Fernando Cores, a la data 2007-10-25
 |
DynaPeer: A Dynamic Peer-to-Peer Based Delivery Scheme for VoD Systems
|
 |
Abstract: Supporting Video-on-Demand (VoD) services in Internet is still a challenging issue due to high bandwidth requirement of multimedia contents and additional constraints imposed by such environment: higher delays and jitter, network congestion, non-symmetrical clients’ bandwidth and inadequate support for multicast communications. This paper presents DynaPeer, a peer-to-peer VoD delivery policy designed for Internet environment. Our design defines a Virtual Server, which is responsible for establishing a group of peers, enabling service for new client requests by aggregating the necessary clients’ resources. Virtual Server operates in both unicast and multicast environments, thereby improving system performance. To demonstrate the effectiveness of DynaPeer, we have developed an analytical model to evaluate its performance, understood as the server-load reduction due to request service distributed among peers. We conducted a performance comparison study of our proposal with classic unicast, multicast (Patching) and other P2P delivery schemes, such as Pn2Pm, Chaining and Promise, improving their performance by 45%, 59%, 74% respectively, even when taking into account Internet constraints. |
Les transparències de la presentació les podeu descarregar des d'aquí
Veure totes les notícies | Categoríes
|
