Analysis of Dependencies of Checkpoint Cost and Checkpoint Interval of Fault Tolerant MPI Applications
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 8
Abstract
In this paper, we have analysed i) the relationship between the checkpoint cost and the optimal checkpoint interval and ii) the relationship between the checkpoint cost and the number of processors (processes) and we have also determined the optimal number of processors (processes) required for executing the fault tolerant MPI applications. We have presented an experimental study in which, we have used an ptimal checkpoint restart model [1] with Weibull’s and xponential distributions to determine the optimal checkpoint interval. We have observed that, the optimal checkpoint ntervals obtained using Weibull’s distribution, produce minimal average completion time; as compared with the optimal checkpoint intervals obtained using Exponential distribution. The optimal checkpoint interval is approximately directly proportional to the checkpoint cost and inversely proportional to shape parameter. The study indicates that, the checkpoint cost of MPI applications increases with the number of processors (processes) used for execution. We have etermined the optimal number of processes (processors) required to execute the MPI applications considered in this paper, as 4.
Authors and Affiliations
Mallikarjuna Shastry P. M. , K. Venkatesh
Keywords
Related Articles
- EP ID EP139746
- DOI -
- Views 105
- Downloads 0
Prediction of Protein Secondary Structure using Artificial Neural Network
Structural information can provide insight into protein function, and therefore, high- accuracy prediction of protein structure from its sequence is highly desirable. We predicted the econdary structure of query protein...
Upgraded Selection Sort
Sorting is a technique which is frequently used in our day to day life. It has a direct implication on searching. If the data is sorted on any key attribute, finding data based on that key attribute becomes very fast. Th...
Simultaneous Pattern and Data Clustering Using Modified K-Means Algorithm
In data mining and knowledge discovery, for finding the ignificant correlation among events Pattern discovery (PD) is used. PD typically produces an overwhelming number of patterns. Since there are too many patterns, it...
PERFORMANCE OF MULTI SERVER AUTHENTICATION AND KEY AGREEMENT WITH USER PROTECTION IN NETWORK SECURITY
Using smart cards, remote user authentication and key greement can be simplified, flexible, and efficient for creating a secure distributed computers environment. Addition to user authentication and key distribution, it...
The Efficient Ant Routing Protocol for MANET
In recent years, mobile computing and wireless networks have witnessed a tremendous rise in popularity and technological advancement. The basic routing problem in MANET deals with methods to transport a packet across a n...