Static Task Cluster Size Determination in Homogeneous Distributed Systems

Kanemitsu, Hidehiro; Lee, Gilhyon; Nakazato, Hidenori; Hoshiai, Takashige; Urano, Yoshiyori

doi:10.1007/978-1-4419-6935-4_14

Cited by 2 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Selection criteria are presented for WP, WCP, and CPPs. Since multiple tasks is required to determine nodes and scheduling task graph, usually by Directed Acyclic Graph (DAG), which has been considered as an NP-complete problem [29]. One task per WP is assumed to reduce complexity in our model.…”

Section: System Modelmentioning

confidence: 99%

Failure Detection in P2P-Grid System

Wang

Nakazato

2015

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

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.

show abstract

Section: System Modelmentioning

confidence: 99%