Routing techniques for massively parallel communication
暂无分享,去创建一个
Luis Gravano | Jorge L. C. Sanz | Sergio A. Felperin | G. D. Pifarre | L. Gravano | J. Sanz | G. Pifarré | S. A. Felperin
[1] Eli Upfal,et al. Efficient schemes for parallel communication , 1982, PODC '82.
[2] Sandeep N. Bhatt,et al. The fluent abstract machine , 1988 .
[3] Charles L. Seitz,et al. Multicomputers: message-passing concurrent computers , 1988, Computer.
[4] Sartaj Sahni,et al. Parallel permutation and sorting algorithms and a new generalized connection network , 1982, JACM.
[5] Bruce M. Maggs,et al. Empirical Evaluation of Randomly-Wired Multistage Networks (Extended Abstract) , 1990 .
[6] Smaragda Konstantinidou,et al. Adaptive, minimal routing in hypercubes , 1990 .
[7] Sartaj Sahni,et al. Parallel Algorithms to Set Up the Benes Permutation Network , 1982, IEEE Transactions on Computers.
[8] Leslie G. Valiant,et al. General Purpose Parallel Architectures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[9] Luis Gravano,et al. Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks , 1991, SPAA '91.
[10] Michael L. Scott,et al. Large-Scale Parallel Programming: Experience with the BBN Butterfly Parallel Processor , 1988, PPOPP/PPEALS.
[11] Sartaj Sahni,et al. Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.
[12] Allan Borodin,et al. Routing, merging and sorting on parallel models of computation , 1982, STOC '82.
[13] DAVID GELERNTER. A DAG-Based Algorithm for Prevention of Store-and-Forward Deadlock in Packet Networks , 1981, IEEE Transactions on Computers.
[14] W. Daniel Hillis,et al. The connection machine , 1985 .
[15] Abhiram G. Ranade,et al. How to emulate shared memory (Preliminary Version) , 1987, FOCS.
[16] C. Greg Plaxton,et al. Deterministic sorting in nearly logarithmic time on the hypercube and related computers , 1990, STOC '90.
[17] Charles L. Seitz,et al. The cosmic cube , 1985, CACM.
[18] K. Gunther,et al. Prevention of Deadlocks in Packet-Switched Data Transport Systems , 1981 .
[19] Bruce M. Maggs,et al. Empirical evaluation of randomly-wire multistage networks , 1990, Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors.
[20] P. Merlin,et al. Deadlock Avoidance in Store-and-Forward Networks - I: Store-and-Forward Deadlock , 1980, IEEE Transactions on Communications.
[21] Eli Upfal,et al. An O(log N) deterministic packet-routing scheme , 1992, JACM.
[22] Nicholas Pippenger,et al. Parallel Communication with Limited Buffers (Preliminary Version) , 1984, FOCS.
[23] S. Konstantinidou,et al. The chaos router: a practical application of randomization in network routing , 1991, SIGARCH Comput. Archit. News.
[24] Leslie G. Valiant,et al. A logarithmic time sort for linear size networks , 1982, STOC.
[25] Jorge L. C. Sanz,et al. A Comparison of SIMD Hypercube Routing Strategies , 1991, ICPP.
[26] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.
[27] Bruce M. Maggs,et al. Expanders might be practical: fast algorithms for routing around faults on multibutterflies , 1989, 30th Annual Symposium on Foundations of Computer Science.
[28] Charles L. Seitz,et al. A Framework for Adaptive Routing , 1987 .
[29] D J Kuck,et al. Parallel Supercomputing Today and the Cedar Approach , 1986, Science.
[30] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.
[31] Sartaj Sahni,et al. Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.