Expanders might be practical: fast algorithms for routing around faults on multibutterflies
暂无分享,去创建一个
[1] Michael O. Rabin,et al. Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.
[2] Charles E. Leiserson,et al. Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.
[3] Thomas F. Knight. Technologies for Low Latency Interconnection Switches , 1989, SPAA.
[4] Frank Thomson Leighton,et al. Fast computation using faulty hypercubes , 1989, STOC '89.
[5] R.R. Kock. Increasing the size of a network by a constant factor can increase performance by more than a constant factor , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[6] Prabhakar Raghavan. Robust algorithms for packet routing in a mesh , 1989, SPAA '89.
[7] Frank Thomson Leighton,et al. Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.