Fault diameter of interconnection networks
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
Topological Properties of Hypercubes
IEEE Transactions on Computers
A Study of Odd Graphs as Fault-Tolerant Interconnection Networks
IEEE Transactions on Computers
On the all-pairs-shortest-path problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
IEEE Transactions on Parallel and Distributed Systems
MPI-2: Extending the Message-Passing Interface
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
MPI: A Message-Passing Interface Standard
MPI: A Message-Passing Interface Standard
Comments on "A Study of Odd Graphs as Fault-Tolerant Interconnection Networks"
IEEE Transactions on Computers
Witnesses for Boolean matrix multiplication and for shortest paths
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Fast computation of empirically tight bounds for the diameter of massive graphs
Journal of Experimental Algorithmics (JEA)
Self-healing network for scalable fault-tolerant runtime environments
Future Generation Computer Systems
Reliability challenges in large systems
Future Generation Computer Systems
PEGASUS: mining peta-scale graphs
Knowledge and Information Systems - Special Issue: Best Papers of the Fifth International Conference on Advanced Data Mining and Applications (ADMA 2009)
SlapOS: A Multi-Purpose Distributed Cloud Operating System Based on an ERP Billing Model
SCC '11 Proceedings of the 2011 IEEE International Conference on Services Computing
Computing Properties of Large Scalable and Fault-Tolerant Logical Networks
SBAC-PAD '11 Proceedings of the 2011 23rd International Symposium on Computer Architecture and High Performance Computing
Scalable fault tolerant protocol for parallel runtime environments
EuroPVM/MPI'06 Proceedings of the 13th European PVM/MPI User's Group conference on Recent advances in parallel virtual machine and message passing interface
Binomial graph: a scalable and fault-tolerant logical network topology
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
Assume a desktop grid middleware or a deployed cloud infrastructure that are both based on a large number of volunteers for computational-intensive applications or business applications. In this case, the Internet is the communication layer; hence, the communication graph is not regular. Scalability and fault tolerance issues are implicitly present on any platform. For instance, the overlay network that must be built to control the application as part of the run-time support system needs to be scalable and fault tolerant. In this paper, we compute fault tolerance properties of large, irregular graphs that may be used as models for the Internet. In a previous work, we presented algorithms and a framework for computing fault tolerance properties of different variants of randomly-generated binomial regular graphs (BMG). In the present paper we compute the metrics of the Node and Link connectivities and the fault diameter for four benchmarks. We also compare our implementation of the diameter computation with the work of Magnien et al.