Figure 2 - uploaded by Mohammah-H Yaghmaee
Content may be subject to copyright.
Source publication
Volunteer computing which benefit from idle cycles of desktop PCs over the Internet can integrate power of hundreds to thousands desktop systems to achieve high computing power. Centralized volunteer computing system has dedicated servers to maintain information about the resources. However, in the decentralized system resource information is distr...
Context in source publication
Context 1
... Replica reporting nodes have a snapshot of resource information from primary node. When a primary node leaves the system one of the replica nodes can get the role of a primary node based on election procedure. The role of primary and replica nodes is discussed in detail in the next section. The organization of clusters in CycloidGrid is shown in Fig. ...
Similar publications
The OurGrid distributed environment is an open source grid middleware that enables the creation of P2P computational grids to speed up the execution of bag-of-tasks applications. Bag-of-tasks is an application model composed of several independent tasks not communicating with each other during their execution, tolerating network delays and faults....
Popularity of social networking and Peer to Peer (P2P) computing opens a new door for many computing solutions such as file sharing, multimedia broadcasting etc. Friend to Friend (F2F) is a desktop grid computing framework which uses instant messenger (IM) and P2P computing solutions
to provide lightweight grid computing. But the success of grid c...
A Grid is a computational system consisting of a large number of geographically distributed and heterogeneous resources. Job scheduling is the key component of a Grid, and plays an important role in the efficient and effective execution of various kinds of scientific and engineering applications. This paper presents a comparative performance analys...
Thanks to their power, the many sensors they embed, and their inherent connectivity to Internet, smartphones are certainly becoming the primary source of multimedia content and the main tool for content sharing. In this demo, we analyze the complexity of real-time video streaming among smartphone users. Firstly, we show that the traditional solutio...
Citations
... α = 5) [23]. The execution times of jobs are selected uniformly at random with 125 s on average [22]. ...
Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. At this scale, computer resources and network failures are no more exceptions, but belong to the normal system behavior. Therefore, one of the most valuable characteristics of grid tools, apart from the performance they can achieve, is fault tolerance, which is a significant and complex issue in grid computing systems. In this paper, we propose a fault tolerant model for grid computing systems namely DCFT. This model is based on dynamic colored graphs without replication of computer resources. The proposed faut tolerance model consists of two stages. In the first stage, each node is described by a state vector. We color each attribute of the state vector as three colors (green, blue and red) based on its level of performance. In the second stage, we classify the nodes of a grid into three categories: the identical computer resources in term of performance, the more efficient ones and the less efficient ones. We used the colors of the nodes to develop a new strategy for fault tolerance based on the level of performance. A simulation of the proposed model using SimGrid simulator and Graphstream is conducted. Experimental results show that the proposed model performs very well in a large grid environment.
Volunteer computing which benefits from idle cycles of volunteer resources over the Internet can integrate the power of hundreds to thousands of resources to achieve high computing power. In such an environment the resources are heterogeneous in terms of CPU speed, RAM, disk capacity, and network bandwidth. So finding a suitable resource to run a particular job becomes difficult. Resource discovery architecture is a key factor for overall performance of peer-to-peer based volunteer computing systems. The main contribution of this paper is to develop a proximity-aware resource discovery architecture for peer-to-peer based volunteer computing systems. The proposed resource discovery algorithm consists of two stages. In the first stage, it selects resources based on the requested quality of service and current load of peers. In the second stage, a resource with higher priority to communication delay is selected among the discovered resources. Communication delay between two peers is computed by a network model based on queuing theory, taking into account the background traffic of the Internet. Simulation results show that the proposed resource discovery algorithm improves the response time of user’s requests by a factor of 4.04 under a moderate load.
