Cluster fault-tolerant routing in pancake graphs

Authors:
Keiichi Kaneko;Naoki Sawada;Shietung Peng
Affiliations:
Tokyo University of Agriculture and Technology, Koganei-shi, Tokyo, Japan;Tokyo University of Agriculture and Technology, Koganei-shi, Tokyo, Japan;Hosei University, Koganei-shi, Tokyo, Japan
Venue:
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Year:
2007

Citing 5
Cited 1

The cosmic cube

Communications of the ACM - Special section on computer architecture
A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Node-to-node cluster fault tolerant routing in star graphs

Information Processing Letters
Computing the Diameters of 14- and 15-Pancake Graphs

ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Computing the diameter of 17-pancake graph using a PC cluster

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing

Cluster-fault-tolerant routing in burnt pancake graphs

ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces evaluations and communication framework for molecular orbital calculations. The total execution time of molecular orbital calculations is almost construction time of Fock matrix. In order to reduce the total execution time on the ...