Peer-to-Peer Based Grid Workflow Runtime Environment of SwinDeW-G

Chen

2008 IEEE Fourth International Conference on eScience

et al. 2008

Self Cite

Section: Introductionmentioning

confidence: 77%

Forecasting Duration Intervals of Scientific Workflow Activities Based on Time-Series Patterns

Chen

2008 IEEE Fourth International Conference on eScience

et al. 2008

Self Cite

“…The simulations were conduced on a cloud computing simulation environment built on the computing facilitates at Cloud Computing Research Laboratory, Shandong University of Finance and Economics (SDUFE), China, which is constructed based on SwinDeW [36] and SwinDeW-G [37]. The cloud system contains 8 servers (data centers) and 50 high-end PCs (clients), where we install VMWare (http://ww.vmware.com), so that it can offer unified computing and storage resources.…”

Section: Simulations Setupmentioning

confidence: 99%

Combination Replicas Placements Strategy for Data sets from Cost-effective View in the Cloud

Wu¹

2017

IJCIS

In the cloud storage system, data sets replicas technology can efficiently enhance data availability and thereby increase the system reliability by replicating commonly used data sets in geographically different data centers. Most current approaches largely focus on system performance improvement by placing replicas for an independent data set, omitting the generation relationship among data sets. Furthermore, cost is an important element in deciding replicas number and their stored places, which can cause great financial burden for cloud clients because the cost for replicas storage and consistency maintenance may lead to high overhead with the number of new replicas increased in a pay-as-you-go paradigm. In this paper, we propose a combination strategy of real-replicas and pseudo-replicas (by computation from its provenance) from cost-effective view in order to achieve the minimum data set management cost, not only for the independent data sets but also for related data sets with generation relationships. We first define cost models that fit into the cloud computing paradigm, including data sets storage, computation and transfer costs, and then develop a new data set management cost model, helping to achieve a multi-criteria optimization of data set management. After that, a minimum cost benchmarking approach for the best trade-off between real-replicas and pseudo-replicas is proposed once decision to add a replica has been made. Then, a more practical and reasonable genetic algorithm as an alternative procedure for generating optimal or nearoptimal solution is given in order to identify the suitable replicas storage places. Finally, we present simulations setups and results that provide a first validation of our strategy. Both the theoretical analysis and simulations conducted on general (random) data sets as well as specific real world applications have shown efficiency and effectiveness of the improved system brought by the proposed strategy in cloud computing environment.

IEICE Trans. Inf. & Syst.

“…A failure detector is a necessary component in building a reliable P2P-Grid system. In such a system with unreliable networks, accurate understanding of churn requires precise information about the arrival and departure of peers, which is a challenging task in practice [21], [22].…”

Section: Background and Related Workmentioning

confidence: 99%

Failure Detection in P2P-Grid System

Wang

Nakazato

2015

SUMMARYPeer-to-peer (P2P)-Grid systems are being investigated as a platform for converging the Grid and P2P network in the construction of large-scale distributed applications. The highly dynamic nature of P2P-Grid systems greatly affects the execution of the distributed program. Uncertainty caused by arbitrary node failure and departure significantly affects the availability of computing resources and system performance. Checkpoint-and-restart is the most common scheme for fault tolerance because it periodically saves the execution progress onto stable storage. In this paper, we suggest a checkpoint-and-restart mechanism as a fault-tolerant method for applications on P2P-Grid systems. Failure detection mechanism is a necessary prerequisite to fault tolerance and fault recovery in general. Given the highly dynamic nature of nodes within P2P-Grid systems, any failure should be detected to ensure effective task execution. Therefore, failure detection mechanism as an integral part of P2P-Grid systems was studied. We discussed how the design of various failure detection algorithms affects their performance in average failure detection time of nodes. Numerical analysis results and implementation evaluation are also provided to show different average failure detection times in real systems for various failure detection algorithms. The comparison shows the shortest average failure detection time by 8.8s on basis of the WP failure detector. Our lowest mean time to recovery (MTTR) is also proven to have a distinct advantage with a time consumption reduction of about 5.5s over its counterparts.