Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Background
Related Work
Conclusions and Future Work
References
All Topics
Computer Science
Distributed Systems

Replication-Based Fault Tolerance for MPI Applications

Profile image of Vipin ChaudharyVipin Chaudhary

2000, IEEE Transactions on Parallel and Distributed Systems

https://doi.org/10.1109/TPDS.2008.172
visibility

…

description

14 pages

link

1 file

Abstract

As computational clusters increase in size, their mean-time-to-failure reduces drastically. Typically, checkpointing is used to minimize the loss of computation. Most checkpointing techniques, however, require central storage for storing checkpoints. This results in a bottleneck and severely limits the scalability of checkpointing, while also proving to be too expensive for dedicated checkpointing networks and storage systems. We propose a scalable replication-based MPI checkpointing facility. Our reference implementation is based on LAM/MPI, however, it is directly applicable to any MPI implementation. We extend the existing state of fault-tolerant MPI with asynchronous replication, eliminating the need for central or network storage. We evaluate centralized storage, a Sun X4500-based solution, an EMC SAN, and the Ibrix commercial parallel file system and show that they are not scalable, particularly after 64 CPUs. We demonstrate the low overhead of our checkpointing and replication scheme with the NAS Parallel Benchmarks and the High Performance LINPACK benchmark with tests up to 256 nodes while demonstrating that checkpointing and replication can be achieved with much lower overhead than that provided by current techniques. Finally, we show that the monetary cost of our solution is as low as 25% of that of a typical SAN/parallel file system-equipped storage system.

Related papers

A Checkpoint-on-Failure Protocol for Algorithm-Based Recovery in Standard MPI
Wesley Bland, George Bosilca

Lecture Notes in Computer Science, 2012

Most predictions of Exascale machines picture billion way parallelism, encompassing not only millions of cores, but also tens of thousands of nodes. Even considering extremely optimistic advances in hardware reliability, probabilistic amplification entails that failures will be unavoidable. Consequently, software fault tolerance is paramount to maintain future scientific productivity. Two major problems hinder ubiquitous adoption of fault tolerance techniques: 1) traditional checkpoint based approaches incur a steep overhead on failure free operations and 2) the dominant programming paradigm for parallel applications (the MPI standard) offers extremely limited support of software-level fault tolerance approaches. In this paper, we present an approach that relies exclusively on the features of a high quality implementation, as defined by the current MPI standard, to enable algorithmic based recovery, without incurring the overhead of customary periodic checkpointing. The validity and performance of this approach are evaluated on large scale systems, using the QR factorization as an example.

View PDFchevron_right
Collective Operations in an Application-level Fault Tolerant MPI System
daniel marques

2003

The running times of many computational science programs are now significantly greater than the mean-time-betweenfailures (MTBF) of the hardware they run on. Therefore, fault-tolerance is becoming a critical issue on highperformance platforms.

View PDFchevron_right
Collective operations in application-level fault-tolerant MPI
daniel marques

2003

The running times of many computational science programs are now significantly greater than the mean-time-betweenfailures (MTBF) of the hardware they run on. Therefore, fault-tolerance is becoming a critical issue on highperformance platforms.

View PDFchevron_right
Coordinated checkpoint versus message log for fault tolerant MPI
Geraud Krawezik

International Journal of High Performance Computing and Networking, 2004

MPI is one of the most adopted programming models for Large Clusters and Grid deployments. However, these systems often suffer from network or node failures. This raises the issue of selecting a fault tolerance approach for MPI. Automatic and transparent ones are based on either coordinated checkpointing or message logging associated with uncoordinated checkpoint. They are many protocols, implementations and optimizations for these approaches but few results about their comparison. Coordinated checkpoint has the advantage of a very low overhead on fault free executions. In contrary a message logging protocol systematically adds a significant message transfer penalty. The drawbacks of coordinated checkpoint come from its synchronization cost at checkpoint and restart times. In this paper we implement, evaluate and compare the two kinds of protocols with a special emphasis on their respective performance according to fault frequency. The main conclusion (under our experimental conditions) is that message logging becomes relevant for a large scale cluster from one fault every hour for applications with large dataset.

View PDFchevron_right
Uncoordinated Checkpointing Without Domino Effect for Send-Deterministic MPI Applications
Franck Cappello

2011 IEEE International Parallel & Distributed Processing Symposium, 2011

As reported by many recent studies, the mean time between failures of future post-petascale supercomputers is likely to reduce, compared to the current situation. The most popular fault tolerance approach for MPI applications on HPC Platforms relies on coordinated checkpointing which raises two major issues: a) global restart wastes energy since all processes are forced to rollback even in the case of a single failure; b) checkpoint coordination may slow down the application execution because of congestions on I/O resources. Alternative approaches based on uncoordinated checkpointing and message logging require logging all messages, imposing a high memory/storage occupation and a significant overhead on communications. It has recently been observed that many MPI HPC applications are send-deterministic, allowing to design new fault tolerance protocols. In this paper, we propose an uncoordinated checkpointing protocol for senddeterministic MPI HPC applications that (i) logs only a subset of the application messages and (ii) does not require to restart systematically all processes when a failure occurs. We first describe our protocol and prove its correctness. Through experimental evaluations, we show that its implementation in MPICH2 has a negligible overhead on application performance. Then we perform a quantitative evaluation of the properties of our protocol using the NAS Benchmarks. Using a clustering approach, we demonstrate that this protocol actually succeeds to combine the two expected properties: a) it logs only a small fraction of the messages and b) it reduces by a factor approaching 2 the average number of processes to rollback compared to coordinated checkpointing.

View PDFchevron_right
The Lam/Mpi Checkpoint/Restart Framework: System-Initiated Checkpointing
Andrew Lumsdaine

The International Journal of High Performance Computing Applications, 2005

As high performance clusters continue to grow in size and popularity, issues of fault tolerance and reliability are becoming limiting factors on application scalability. To address these issues, we present the design and implementation of a system for providing coordinated checkpointing and rollback recovery for MPI-based parallel applications. Our approach integrates the Berkeley Lab BLCR kernel-level process checkpoint system with the LAM implementation of MPI through a defined checkpoint/restart interface. Checkpointing is transparent to the application, allowing the system to be used for cluster maintenance and scheduling reasons as well as for fault tolerance. Experimental results show negligible communication performance impact due to the incorporation of the checkpoint support capabilities into LAM/MPI.

View PDFchevron_right
Parallel Checkpoint/Restart for MPI Applications
Andrew Lumsdaine

As high-performance clusters continue to grow in size and popularity, issues of fault tolerance and reliability are becoming limiting factors on application scalability. To ad- dress these issues, we present the design and implementa- tion of a system for providing coordinated checkpointing and rollback recovery for MPI-based parallel applications. Our approach integrates the Berkeley Lab BLCR kernel- level process checkpoint system with the LAM implemen- tation of MPI through a defined checkpoint/restart inter- face. Checkpointing is transparent to the application, al- lowing the system to be used for cluster maintenance and scheduling reasons as well as for fault tolerance. Exper- imental results show negligible performance impact due to the incorporation of the checkpoint support capabilities into LAM/MPI.

View PDFchevron_right
Improved message logging versus improved coordinated checkpointing for fault tolerant MPI
Geraud Krawezik

2004 IEEE International Conference on Cluster Computing (IEEE Cat. No.04EX935)

Fault tolerance is a very important concern for critical high performance applications using the MPI library. Several protocols provide automatic and transparent fault detection and recovery for message passing systems with different impact on application performance and the capacity to tolerate a high fault rate. In a recent paper, we have demonstrated that the main differences between pessimistic sender based message logging and coordinated checkpointing are 1) the communication latency and 2) the performance penalty in case of faults. Pessimistic message logging increases the latency, due to additional blocking control messages. When faults occur at a high rate, coordinated checkpointing implies a higher performance penalty than message logging due to a higher stress on the checkpoint server. In this paper we extend this study to improved versions of message logging and coordinated checkpoint protocols which respectively reduces the latency overhead of pessimistic message logging and the server stress of coordinated checkpoint. We detail the protocols and their implementation into the new MPICH-V fault tolerant framework. We compare their performance against the previous versions and we compare the novel message logging protocols against the improved coordinated checkpointing one using the NAS benchmark on a typical high performance cluster equipped with a high speed network. The contribution of this paper is two folds: a) an original message logging protocol and an improved coordinated checkpointing protocol and b) the comparison between them.

View PDFchevron_right
SHIELD: a fault-tolerant MPI for an infiniband cluster
Shin Kim

2006

Today's high performance cluster computing technologies demand extreme robustness against unexpected failures to finish aggressively parallelized work in a given time constraint. Although there has been a steady effort in developing hardware and software tools to increase fault-resilience of cluster environments, a successful solution has yet to be delivered to commercial vendors. This paper presents SHIELD, a practical and easily-deployable fault-tolerant MPI and management system of MPI for an Infiniband cluster. SHIELD provides a novel framework that can be easily used in real cluster systems, and it has different design perspectives than those proposed by other fault-tolerant MPI. We show that SHIELD provides robust fault-resilience to fault-vulnerable cluster systems and that the design features of SHIELD are useful wherever fault-resilience is regarded as the matter of utmost importance.

View PDFchevron_right
MPICH-V: Toward a Scalable Fault Tolerant MPI for Volatile Nodes
O. Lodygensky, George Bosilca

ACM/IEEE SC 2002 Conference (SC'02), 2002

Global Computing platforms, large scale clusters and future TeraGRID systems gather thousands of nodes for computing parallel scientific applications. At this scale, node failures or disconnections are frequent events. This Volatility reduces the MTBF of the whole system in the range of hours or minutes. We present MPICH-V, an automatic Volatility tolerant MPI environment based on uncoordinated checkpoint/ rollback and distributed message logging. MPICH-V architecture relies on Channel Memories, Checkpoint servers and theoretically proven protocols to execute existing or new, SPMD and Master-Worker MPI applications on volatile nodes. To evaluate its capabilities, we run MPICH-V within a framework for which the number of nodes, Channels Memories and Checkpoint Servers can be completely configured as well as the node Volatility. We present a detailed performance evaluation of every component of MPICH-V and its global performance for non-trivial parallel applications. Experimental results demonstrate good scalability and high tolerance to node volatility. 0-7695-1524-X/02 $17.00 (C) 2002 IEEE

View PDFchevron_right

References (39)

  1. The MPI Forum, "MPI: A Message Passing Interface," in SC '93: Proceedings of the annual Supercomputing Conference. ACM Press, 1993, pp. 878-883.
  2. Q. Gao, W. Yu, W. Huang, and D. K. Panda, "Application- Transparent Checkpoint/Restart for MPI Programs over Infini- Band," in ICPP '06: Proceedings of the 35 th annual International Conference on Parallel Processing. IEEE Computer Society, 2006, pp. 471-478.
  3. G. Burns, R. Daoud, and J. Vaigl, "LAM: An Open Cluster Envi- ronment for MPI," in Proceedings of the Supercomputing Symposium. IEEE Computer Society, 1994, pp. 379-386.
  4. S. Sankaran, J. M. Squyres, B. Barrett, A. Lumsdaine, J. Duell, P. Hargrove, and E. Roman, "The LAM/MPI Checkpoint/Restart Framework: System-Initiated Checkpointing," International Jour- nal of High Performance Computing Applications, vol. 19, no. 4, pp. 479-493, 2005.
  5. J. P. Walters and V. Chaudhary, "A Scalable Asynchronous Replication-Based Strategy for Fault Tolerant MPI Applications," in HiPC '07: the International Conference on High Performance Com- puting, LNCS 4873. Springer-Verlag, 2007, pp. 257-268.
  6. D. H. Bailey, E. Barszcz, J. T. Barton, D. S. Browning, R. L. Carter, L. Dagum, R. A. Fatoohi, P. O. Frederickson, T. A. Lasinski, R. S. Schreiber, H. D. Simon, V. Venkatakrishnan, and S. K. Weeratunga, "The NAS Parallel Benchmarks," International Journal of High Performance Computing Applications, vol. 5, no. 3, pp. 63-73, 1991.
  7. J. M. Squyres and A. Lumsdaine, "A Component Architecture for LAM/MPI," in Proceedings of the 10 th European PVM/MPI Users' Group Meeting, LNCS 2840. Springer-Verlag, 2003, pp. 379-387.
  8. InfiniBand Trade Association, "InfiniBand," 2007, http://www. infinibandta.org/home.
  9. Myricom, "Myrinet," 2007, http://www.myricom.com/.
  10. J. Hursey, J. M. Squyres, T. I. Mattox, and A. Lumsdaine, "The Design and Implementation of Checkpoint/Restart Process Fault Tolerance for Open MPI," in IPDPS '07: Proceedings of the 21 st annual International Parallel and Distributed Processing Symposium. IEEE Computer Society, 2007.
  11. E. N. Elnozahy, L. Alvisi, Y. M. Wang, and D. B. Johnson, "A Survey of Rollback-Recovery Protocols in Message-Passing Systems," ACM Computing Surveys, vol. 34, no. 3, pp. 375-408, 2002.
  12. J. S. Plank, M. Beck, G. Kingsley, and K. Li, "Libckpt: Transparent Checkpointing under Unix," in In Proceedings of the USENIX Winter Technical Conference. USENIX Association, 1995, pp. 213- 223.
  13. J. Duell, "The Design and Implementation of Berkeley Lab's Linux Checkpoint/Restart," Lawrence Berkeley National Lab, Tech. Rep. LBNL-54941, 2002.
  14. R. Gioiosa, J. C. Sancho, S. Jiang, and F. Petrini, "Transparent, Incremental Checkpointing at Kernel Level: a Foundation for Fault Tolerance for Parallel Computers," in SC '05: Proceedings of the annual Supercomputing Conference. IEEE Computer Society, 2005, pp. 9-23.
  15. Y. Zhang, D. Wong, and W. Zheng, "User-Level Checkpoint and Recovery for LAM/MPI," SIGOPS Operating Systems Review, vol. 39, no. 3, pp. 72-81, 2005.
  16. C. Wang, F. Mueller, C. Engelmann, and S. L. Scott, "A Job Pause Service under LAM/MPI+BLCR for Transparent Fault Tolerance," in IPDPS '07: Proceedings of the 21 st International Parallel and Distributed Processing Symposium. IEEE Computer, 2007, pp. 116- 125.
  17. H. Jung, D. Shin, H. Han, J. W. Kim, H. Y. Yeom, and J. Lee, "Design and Implementation of Multiple Fault-Tolerant MPI over Myrinet (M 3 )," in SC '05: Proceedings of the annual Supercomputing Conference. IEEE Computer Society, 2005, pp. 32-46.
  18. L. Kalé and S. Krishnan, "CHARM++: A Portable Concurrent Object Oriented System Based on C++," in OOPSLA '93: Pro- ceedings of the conference on Object-Oriented Programming, Systems, Languages, and Applications. ACM Press, 1993, pp. 91-108.
  19. C. Huang, G. Zheng, S. Kumar, and L. V. Kalé, "Performance Evaluation of Adaptive MPI," in PPoPP '06: Proceedings of the 11 th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM Press, 2006, pp. 306-322.
  20. S. Chakravorty and C. Mendes and L. V. Kalé, "Proactive Fault Tolerance in MPI Applications via Task Migration," in HiPC '06: Proceedings of the 13 th International Conference on High Performance Computing, LNCS 4297, 2006, pp. 485-496.
  21. S. Chakravorty and L. V. Kalé, "A Fault Tolerance Protocol with Fast Fault Recovery," in IPDPS '07: Proceedings of the 21 st annual International Parallel and Distributed Processing Symposium. IEEE Computer Society, 2007, pp. 117-126.
  22. G. Zheng, L. Shi, and L. V. Kalé, "FTC-Charm++: An In-Memory Checkpoint-Based Fault Tolerant Runtime for Charm++ and MPI," in Cluster '04: Proceedings of the International Conference on Cluster Computing. IEEE Computer Society, 2004, pp. 93-103.
  23. J. S. Plank, "Improving the Performance of Coordinated Check- pointers on Networks of Workstations using RAID Techniques," in SRDS '96: Proceedings of the 15 th Symposium on Reliable Dis- tributed Systems. IEEE Computer Society, 1996, pp. 76-85.
  24. J. S. Plank and L. Kai, "Faster Checkpointing With N+1 Parity," in SFTC '94: Proceedings of the 24 th annual International Symposium on Fault-Tolerant Computing, 1994, pp. 288-297.
  25. R. Y. de Camargo, R. Cerqueira, and F. Kon, "Strategies for Storage of Checkpointing Data Using Non-Dedicated Repositories on Grid Systems," in Proceedings of the 3 rd International Workshop on Middleware for Grid Computing. ACM Press, 2005.
  26. X. Ren, R. Eigenmann, and S. Bagchi, "Failure-Aware Check- pointing in Fine-Grained Cycle Sharing Systems," in HPDC '07: Proceedings of the 16th International Symposium on High Performance Distributed Computing. ACM Press, 2007, pp. 33-42.
  27. Z. Chen, G. E. Fagg, E. Gabriel, J. Langou, T. Angskun, G. Bosilca, and J. Dongarra, "Fault Tolerant High Performance Computing by a Coding Approach," in PPoPP '05: Proceedings of the 10 th annual ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM Press, 2005, pp. 213-223.
  28. P. Nath, B. Urgaonkar, and A. Sivasubramaniam, "Evaluating the Usefulness of Content Addressable Storage for High-Performance Data Intensive Applications," in HPDC '08: Proceedings of the 17 th International Symposium on High Performance Distributed Computing. ACM Press, 2008, pp. 35-44.
  29. J. Cao, Y. Li, and M. Guo, "Process Migration for MPI Applications based on Coordinated Checkpoint," in ICPADS '05: Proceedings of the 11 th annual International Conference on Parallel and Distributed Systems. IEEE Computer Society, 2005, pp. 306-312.
  30. V. Zandy, "Ckpt: User-Level Checkpointing," 2005, http://www. cs.wisc.edu/ ∼ zandy/ckpt/.
  31. R. E. Bryant, "Data-Intensive Supercomputing: The Case for DISC," Carnegie Mellon University, School of Computer Science, Tech. Rep. CMU-CS-07-128, 2007.
  32. S. Gurumurthi, "Should Disks be Speed Demons or Brainiacs?" SIGOPS Operating Systems Review, vol. 41, no. 1, pp. 33-36, 2007.
  33. "Top500 list http://www.top500.org," 2008.
  34. J. J. Dongarra, P. Luszczek, and A. Petitet, "The LINPACK Bench- mark: Past, Present, and Future," Concurrency and Computation: Practice and Experience, vol. 15, pp. 1-18, 2003.
  35. C. Coti, T. Herault, P. Lemarinier, L. Pilard, A. Rezmerita, E. Ro- driguez, and F. Cappello, "MPI Tools and Performance Studies- Blocking vs. Non-Blocking Coordinated Checkpointing for Large- Scale Fault Tolerant MPI," in SC '06: Proceedings of the 18 th annual Supercomputing Conference. ACM Press, 2006, pp. 127-140.
  36. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, "Search and Replication in Unstructured Peer-to-Peer Networks," in ICS '02: Proceedings of the 16 th International Conference on Supercomputing. ACM Press, 2002, pp. 84-95.
  37. S. Hoory, N. Linial, and A. Wigderson, "Expander Graphs and their Applications," Bulletin of the American Mathematical Society, vol. 43, no. 4, pp. 439-561, 2006.
  38. "CiFTS: Coordinated infrastructure for Fault Tolerant Systems. http://www.mcs.anl.gov/research/cifts/," 2008.
  39. E. Pinheiro, W.-D. Weber, and L. A. Barroso, "Failure trends in a Large Disk Drive Population," in FAST '07: Proceedings of the 5th USENIX conference on File and Storage Technologies. USENIX 2007, pp. 17-28.

Related papers

A Scalable Asynchronous Replication-Based Strategy for Fault Tolerant MPI Applications
Vipin Chaudhary

Lecture Notes in Computer Science, 2007

As computational clusters increase in size, their mean-time-to-failure reduces. Typically checkpointing is used to minimize the loss of computation. Most checkpointing techniques, however, require a central storage for storing checkpoints. This severely limits the scalability of checkpointing. We propose a scalable replication-based MPI checkpointing facility that is based on LAM/MPI. We extend the existing state of fault-tolerant MPI with asynchronous replication, eliminating the need for central or network storage. We evaluate centralized storage, SAN-based solutions, and a commercial parallel file system, and show that they are not scalable, particularly beyond 64 CPUs. We demonstrate the low overhead of our replication scheme with the NAS Parallel Benchmarks and the High Performance LINPACK benchmark with tests up to 256 nodes while demonstrating that checkpointing and replication can be achieved with much lower overhead than that provided by current techniques.

View PDFchevron_right
Blocking vs. Non-Blocking Coordinated Checkpointing for Large-Scale Fault Tolerant MPI
Laurence Pilard

Proceedings of the …, 2006

A long-term trend in high-performance computing is the increasing number of nodes in parallel computing platforms, which entails a higher failure probability. Fault tolerant programming environments should be used to guarantee the safe execution of critical applications. Research in fault tolerant MPI has led to the development of several fault tolerant MPI environments. Different approaches are being proposed using a variety of fault tolerant message passing protocols based on coordinated checkpointing or message logging. The most popular approach is with coordinated checkpointing. In the literature, two different concepts of coordinated checkpointing have been proposed: blocking and non-blocking. However they have never been compared quantitatively and their respective scalability remains unknown. The contribution of this paper is to provide the first comparison between these two approaches and a study of their scalability. We have implemented the two approaches within the MPICH environments and evaluate their performance using the NAS parallel benchmarks.

View PDFchevron_right
Blocking vs. non-blocking coordinated checkpointing for large-scale fault tolerant MPI Protocols
Laurence Pilard

Future Generation …, 2008

A long-term trend in high-performance computing is the increasing number of nodes in parallel computing platforms, which entails a higher failure probability. Fault tolerant programming environments should be used to guarantee the safe execution of critical applications. Research in fault tolerant MPI has led to the development of several fault tolerant MPI environments. Different approaches are being proposed using a variety of fault tolerant message passing protocols based on coordinated checkpointing or message logging. The most popular approach is with coordinated checkpointing. In the literature, two different concepts of coordinated checkpointing have been proposed: blocking and non-blocking. However they have never been compared quantitatively and their respective scalability remains unknown. The contribution of this paper is to provide the first comparison between these two approaches and a study of their scalability. We have implemented the two approaches within the MPICH environments and evaluate their performance using the NAS parallel benchmarks.

View PDFchevron_right
New User-Guided and ckpt-Based Checkpointing Libraries for Parallel MPI Applications
Paweł Czarnul, Marcin Frączak

Lecture Notes in Computer Science, 2005

We present design and implementation details as well as performance results for two new parallel checkpointing libraries developed by us for parallel MPI applications. The first one, a user-guided library requires from the programmer to support packing and unpacking code with an easy-to-use API using MPI constants. It uses MPI-2 collective I/O calls or a dedicated master process for checkpointing. The other version is a technically advanced parallel implementation of checkpointing based on the user-level ckpt library. It uses wrappers for MPI calls in the user program which enables to run a shadow MPI application just for communication purposes. Communication between original processes and the shadow MPI code is done via shared memory segments to which communication buffers are mapped. We present checkpoint/restart times for the two approaches and subversions proposed by us compared to an available LAMMPI/BLCR checkpointing solution for MPI applications. The performance of all the versions and I/O optimizations are discussed for a 4-node, 16-processor cluster with NFS and specifically for single SMP nodes with a local file system. task WP.13 of 6 T11 2003 C/06098 "CLUSTERIX -The National Linux Cluster". Calculations

View PDFchevron_right
Implementation and Evaluation of a Scalable Application-Level Checkpoint-Recovery Scheme for MPI Programs
daniel marques

2004

The running times of many computational science applications are much longer than the mean-time-to-failure of current high-performance computing platforms. Therefore, to run to completion, these applications must tolerate hardware failures.

View PDFchevron_right

Related topics

  • Distributed Computing
  • File Systems
  • Mean Time To Failure
  • Storage Area Network
  • Parallel and Distributed Systems

    • Cited by

    Can Agent Intelligence Be Used to Achieve Fault Tolerant Parallel Computing Systems?
    Vassil Alexandrov

    Parallel Processing Letters, 2011

    The work reported in this paper is motivated towards validating an alternative approach for fault tolerance over traditional methods like checkpointing that constrain efficacious fault tolerance. Can agent intelligence be used to achieve fault tolerant parallel computing systems? If so, "What agent capabilities are required for fault tolerance?", "What parallel computational tasks can benefit from such agent capabilities?" and "How can agent capabilities be implemented for fault tolerance?" need to be addressed. Cognitive capabilities essential for achieving fault tolerance through agents are considered. Parallel reduction algorithms are identified as a class of algorithms that can benefit from cognitive agent capabilities. The Message Passing Interface is utilized for implementing an intelligent agent based approach. Preliminary results obtained from the experiments validate the feasibility of an agent based approach for achieving fault tolerance in pa...

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved