Article

A taxonomy of peer-to-peer desktop grid paradigms.

Cluster Computing (Impact Factor: 0.78). 01/2011; 14:129-144. DOI: 10.1007/s10586-010-0138-3
Source: DBLP

ABSTRACT Desktop grid systems and applications have generated significant impacts on science and engineering. The emerging convergence
of grid and peer-to-peer (P2P) computing technologies further opens new opportunities for enabling P2P Desktop Grid systems.
This paper presents a taxonomy for classifying P2P desktop grid implementation paradigms, aiming to summarize the state-of-the-art
technologies and explore the current and potential solution space. To have a comprehensive taxonomy for P2P desktop grid paradigms,
we investigate both computational and data grid systems. Moreover, to ease the understanding, the taxonomy is applied to selected
case studies of P2P desktop grid systems. The taxonomy is expected to be used as a survey of the state-of-the-art, a design
map, a guideline for novice researchers, a common vocabulary, or a design space for simulation and benchmark, and to be extended
as the technologies rapidly evolve.

0 Bookmarks
 · 
138 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Grades computacionais entre-pares são infraestruturas de computação amplamente utilizadas para executar aplicações científicas. Este trabalho apresenta evidências de que o consumo de energia dessas grades pode ser reduzido e propõe estratégias para atingir esse objetivo. Resultados obtidos por simulação dirigida por rastros mostram que as estratégias propostas permitem reduzir o uso de energia nessas grades em até 68,53%, com um impacto no tempo de resposta das aplicações de no máximo 3,8% e sem impacto significativo no tempo de vida útil dos recursos.
    CSBC 2012 - CTD; 01/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: We discuss some numerical aspects in control theory. Using as the particular example the problem of computing the controllable subspace of a linear time invariant linear system, we show how some classical methods can lead to numerical problems and give some recent results giving bounds on the errors in terms of results obtainable from classical methods.
    American Control Conference, 1984; 07/1984
  • [Show abstract] [Hide abstract]
    ABSTRACT: High performance computing can be well supported by the Grid or cloud computing systems. However, these systems have to overcome the failure risks, where data is stored in the “unreliable” storage nodes that can leave the system at any moment and the nodes’ network bandwidth is limited. In this case, the basic way to assure data reliability is to add redundancy using either replication or erasure codes. As compared to replication, erasure codes are more space efficient. Erasure codes break data into blocks, encode these blocks and distribute them into different storage nodes. When storage nodes permanently or temporarily abandon the system, new redundant blocks must be created to guarantee the data reliability, which is referred to as repair. Later when the churn nodes rejoin the system, the blocks stored in these nodes can reintegrate the data group to enhance the data reliability. For “classical” erasure codes, generating a new block requires to transmit a number of k blocks over the network, which brings lots of repair traffic, high computation complexity and high failure probability for the repair process. Then a near-optimal erasure code named Hierarchical Codes, has been proposed that can significantly reduce the repair traffic by reducing the number of nodes participating in the repair process, which is referred to as the repair degree d. To overcome the complexity of reintegration and provide an adaptive reliability for Hierarchical Codes, we refine two concepts called location and relocation, and then propose an integrated maintenance scheme for the repair process. Our experiments show that Hierarchical Code is the most robust redundancy scheme for the repair process as compared to other famous coding schemes.
    Journal of Grid Computing 09/2012; 10(3). · 1.60 Impact Factor

Full-text

View
5 Downloads
Available from