Name
Abstract | ||
|---|---|---|
In this paper, we have addressed the complex problem of determining a recovery line for cluster federation and have proposed a fast recovery algorithm to handle failures in cluster federations. The main feature of the proposed algorithm is that it can be executed simultaneously by all clusters in the cluster federation. Besides, the number of trips to the stable storage necessary for executing the algorithm is much less compared to the same in some existing works. Also the proposed algorithm does not suffer from any message storm unlike some noted work in this area. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-72360-8_44 | GPC |
Keywords | Field | DocType |
stable storage,main feature,noted work,existing work,novel recovery approach,recovery line,proposed algorithm,fast recovery algorithm,message storm,complex problem,cluster federation | Cluster (physics),Computer science,Computer network,Recovery approach,TRIPS architecture,Stable storage,Distributed computing | Conference |
Volume | ISSN | Citations |
4459 | 0302-9743 | 2 |
PageRank | References | Authors |
0.39 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. Gupta | 1 | 152 | 51.48 |
| Shahram Rahimi | 2 | 172 | 40.74 |
| Raheel Ahmad | 3 | 270 | 47.49 |
| Raja Chirra | 4 | 10 | 2.05 |