Packet routing in optimal time on a butterfly
暂无分享,去创建一个
[1] Bruce E. Hajek,et al. Performance of shuffle-like switching networks with deflection , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.
[2] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.
[3] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[4] Abhiram G. Ranade,et al. How to emulate shared memory (Preliminary Version) , 1987, FOCS.
[5] Bruce M. Maggs,et al. Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[6] Alan Weiss,et al. The Distribution of Waiting Times in Clocked Multistage Interconnection Networks , 1988, IEEE Trans. Computers.
[7] Alan Huang,et al. Starlite: a wideband digital switch , 1991 .
[8] János Komlós,et al. An 0(n log n) sorting network , 1983, STOC.
[9] Eli Upfal,et al. An O(log N) deterministic packet-routing scheme , 1992, JACM.
[10] Nicholas Pippenger,et al. Parallel Communication with Limited Buffers (Preliminary Version) , 1984, FOCS.
[11] Debasis Mitra,et al. Randomized parallel communications on an extension of the omega network , 1987, JACM.
[12] Allan Borodin,et al. Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..
[13] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.
[14] Debasis Mitra,et al. Randomized Parallel Communications , 1986, ICPP.
[15] Romas Aleliunas,et al. Randomized parallel communication (Preliminary Version) , 1982, PODC '82.