Tom Leighton
- 1.F. Abolhassan, J. Keller, and W. Paul. On the cost-effectiveness and realization of the theoretical PRAM model. Technical Report 09/1991, FB Informatik, Universitgt des Saarlandes, 1991.]]Google Scholar
- 2.A. Aggarwal, A. Chandra, and M. Snir. On communication latency in PRAM computations. In Proceedings of the 1989 A CM Symposium on Parallel Algorithms and Architectures, June 1989. To appear in SIAM j. of Computing.]] Google ScholarDigital Library
- 3.A. Aggarwal, A. Chandra, and M. Snir. Communication complexity of PRAMs. In Theoretical Computer Science, volume 71, pages 3-28, 1990.]] Google ScholarDigital Library
- 4.M. Ajtai, j. Komlos, and E. Szemeredi. Sorting in e log n parallel steps. Combinatorica, 3:1-19, 1983.]] Google ScholarDigital Library
- 5.It. Aleliunas. Randomized parallel communication. in A CM SIGA CT-SIGOPS Symposium on Principles of Distributed Computing, pages 60-72, August 1982.]] Google ScholarDigital Library
- 6.G. Almasi and A. Gottlieb. Highly Parallel Computing. Benjamin Cummings, Redwood City, CA, 1989.]] Google ScholarDigital Library
- 7.B. Alpern, L. Carter, E. Feig, and T. Selker. A uniform memory hierarchy model of computation. Technical report, IBM Watson, December 1990.]]Google Scholar
- 8.S. Arora, T. Leighton, and B. Maggs. On-line algorithms for path selection in a nonblocking network. In Proceedings of the Twenty Second Annual A CM Symposium on Theory of Computing, pages 149- 158, 1990.]] Google ScholarDigital Library
- 9.Y. Aumann and A. Schuster. Deterministic PRAM simulation with constant memory blow-up and no time-stamps. In Third Symposium on the Frontiers of Massively Parallel Computation, pages 22- 29, 1990.]]Google ScholarCross Ref
- 10.L.A. Bassalygo and M.S. Pinsker. Complexity of an optimum non-blocking switching network without reconnections. Problems of information Transmission, 9:64-66, 1974.]]Google Scholar
- 11.V. Beneg. Permutation groups, complexes, and rearrangeable multistage connecting networks. Bell System Technical Journal, 43:1619-1640, July 1964.]]Google ScholarCross Ref
- 12.Guy E. Blelloch. Vector Models for Data-Parallel Computing. MIT Press, Cambridge, MA, 1990.]] Google ScholarDigital Library
- 13.A. Borodin and J. Hopcroft. Routing, merging, and sorting on parallel models of computation. Journal of Computer and System Sciences, 30(1):130-145, February 1985.]] Google ScholarDigital Library
- 14.A. Chin. Practical issues in parallel complezity. PhD thesis, U. Oxford, England, November 1991.]]Google Scholar
- 15.F. Chong, E. Egozy, and A. DeHon. Fault tolerance and performance of multipath multistage intereonneetion networks. In T.F. Knight, Jr. and j. Savage, editors, Advanced research in VLSI and Parallel Systems 1992. MIT Press, March 1992. To appear.]]Google Scholar
- 16.Frederic T. Chong and Thomas Knight, Jr. Design and performance of multipath MIN architectures. Technical Report 64, MIT Artificial intelligence Laboratory, February 1992.]]Google Scholar
- 17.R. Cole and O. Zajicek. The APRAM: incorporating asynehrony into the P RAM model. In Proceedings 1st A CM Symposium on Parallel Algorithms and Architecture, pages 169-178, 1989.]] Google ScholarDigital Library
- 18.R. Cole and O. Zajieek. The expected advantage of asynehrony. In #nd A CM SPAA, pages 85-94, 1990.]] Google ScholarDigital Library
- 19.W. Dally. Network and processor architecture for message-driven computers. In Robert Suaya and Graham Birtwhistle, editors, VLSI and Parallel Computation, chapter 3, pages 140-222. Morgan Kaufman Publishers, San Mateo, CA, 1990.]] Google ScholarDigital Library
- 20.W. Dally. Express cubes: improving the performance of k-ary n-cube intereonneetion networks. IEEE Transactions on Computers, 1991. To appear.]] Google ScholarDigital Library
- 21.W. Dally. Virtual-channel flow control. IEEE Transactions on Parallel and Distributed Systems, 1991. To appear.]] Google ScholarDigital Library
- 22.W. Dally and C. Seitz. Deadlock free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36(5):547- 553, May 1987.]] Google ScholarDigital Library
- 23.A. DeHon, T. Knight, Jr., and H. Minsky. Faulttolerant design for multistage routing networks. in Proceedings of the International Symposium on Shared Memory Multiprocessing. Information Processing Society of Japan, April 1991.]]Google Scholar
- 24.Andr# DeHon. Mbta: Modular bootstrapping transit architecture. Technical Report 17, MIT Artificial Intelligence Laboratory, April 1990.]]Google Scholar
- 25.F. Fich. The complexity of computing on a parallel random access machine. In John Reif, editor, Synthesis of Parallel Algorithms. Morgan Kaufman Publishers, San Mateo, CA, 1992. To Appear.]]Google Scholar
- 26.F. Fich, R. Impagliazzo, B. Kapron, V. King, and M. Kutylowski. Limits on the power of PRAMs with weak forms of write conflict resolution. Unpublished manuscript, 1992.]]Google Scholar
- 27.F. Fich, P. Ragde, and A. Wigderson. Relations between concurrent write models of parallel computation. SIAM J. Computation, 17(3):606-627, 1988.]] Google ScholarDigital Library
- 28.P. Gibbons. The Asynchronous PRAM: a Semisyuchronous Model for Shared Memory MIMD Machine. PhD thesis, U.C. Berkeley, 1989.]] Google ScholarDigital Library
- 29.A. Gottlieb. An overview of the NYU ultracomputer project. In J. Dongarra, editor, Experimental Computing Architecture, pages 25-95. Elsevier, Amsterdam, 1987.]]Google Scholar
- 30.Ronald I. Greenberg. E}ficient Interconnection Schemes for VLS1 and Parallel Computation. PhD thesis, MIT, September 1989.]]Google Scholar
- 31.Ronald i. Greenberg and Charles E. Leiserson. Randomized routing on fat-trees. Advances in Computing Research, 5:345-374, 1989.]]Google Scholar
- 32.T. Hagerup and T. Radzik. Every robust CRCW PRAM can efficiently simulate a priority PRAM. In Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures, pages 117-124, 1990.]] Google ScholarDigital Library
- 33.J. H~stad, T. Leighton, and M. Newman. Fast computation using faulty hypercubes. In Proceedings of the Twenty-First Annual A CM Symposium on Theory of Computing, pages 251-263, May 1989.]] Google ScholarDigital Library
- 34.J. Hennessy and D. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers, San Mateo, CA, 1990.]] Google ScholarDigital Library
- 35.A. Huang and S. Knauer. Starlite: a wideband digital switch. In Proc. GLOBECOMS#, pages 121- 125, December 1984.]]Google Scholar
- 36.N. Kahale. Better expansion for ramamujan graphs. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pages 398-404. IEEE, October 1991.]] Google ScholarDigital Library
- 37.C. Kaklamanis, D. Krizanc, and T. Tsantilas. Tight bounds for oblivious routing in the hypercube. In Proceedings of the Pad Annual A CM Symposium on Parallel Algorithms and Architectures, pages 31-36, July 1990.]] Google ScholarDigital Library
- 38.A. Karlin, M. Manasse, L. Rudolph, and D. Sleator. Competitive snoopy caching. Algorithmica, 3:79- 119, 1988.]]Google ScholarDigital Library
- 39.A. Karlin and E. UpfM. Parallel hashing#an efficient implementation of shared memory. In Proceedings of the Eighteenth Annual A CM Symposium on Theory of Computing, pages 160-168, May 1986.]] Google ScholarDigital Library
- 40.R. Karp. Parallel combinatorial computing. In Jill P. Mesirov, editor, Very Large Scale Computation in the 21st Century, pages 221-238, Philadelphia, PA, 1991. SIAM Press.]]Google Scholar
- 41.P. Klein, A. Agrawal, R. Ravi, and S. Rao. Approximation through multicommodity flow. In Proc. 31st FOCS, pages 726-737, 1990.]]Google ScholarDigital Library
- 42.R. Koch. Increasing the size of a network by a constant factor can increase performance by more than a constant factor. In P9th Annual Symposium on Foundations of Computer Science, pages 221- 230. IEEE, October 1988.]]Google ScholarDigital Library
- 43.R. Koch. An Analysis of the Performance of Interconnection Networks for Mnltiprocessor Systems. PhD thesis, MIT, May 1989.]]Google Scholar
- 44.S. Konstantinidou and E. Upfal. Experimental comparison of multistage networks. Technical report, IBM Almaden Research Center, 1991.]]Google Scholar
- 45.C. Kruskal and M. Snir. The performance of multistage interconnection networks for multiprocessors. IEEE Transactions on Computers, C-32(12):1091- 1098, December 1983.]]Google ScholarDigital Library
- 46.C. Kruskal and M. Snir. A unified theory of interconnection network structure. Theoretical Computer Science, 48(1):75-94, 1986.]] Google ScholarDigital Library
- 47.M. Kunde. Routing and sorting on mesh-connected arrays. In J. Reif, editor, Proceedings, 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, volume 319 of Lecture Notes in Computer Science, pages 423-433. Springer-Verlag, July 1988.]] Google ScholarDigital Library
- 48.F. Thomson Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufman Publishers, San Mateo, CA, 1992.]] Google ScholarDigital Library
- 49.T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE Transactions on Computers, C-34(4):344-354, April 1985.]] Google ScholarDigital Library
- 50.T. Leighton. Average case analysis of greedy routing algorithms on arrays. In Proceedings of the 2nd Annual A CM Symposium on Parallel Algorithms and Architectures, pages 2-10, July 1990.]] Google ScholarDigital Library
- 51.T. Leighton, C.L. Leiserson, and M. Klugerman. Theory of parallel and VLSI computation. Research Seminar Series Report MIT/LCS/RSS10, MIT Laboratory for Computer Science, May 1991.]]Google Scholar
- 52.T. Leighton, D. Lisinski, and B. Maggs. Empirical evaluation of randomly-wired multistage networks. In Proceedings of the 1990 IEEE International Conference on Computer Design, pages 380- 385. IEEE, September 1990.]]Google ScholarCross Ref
- 53.T. Leighton and B. Maggs. Expanders might be practical" Fast algorithms for routing around faults in multibutterflies. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 384-389. IEEE, October 1989.]]Google ScholarDigital Library
- 54.T. Leighton and B. Maggs. Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks. In IEEE Trans. on Computers, 1992. To Appear.]] Google ScholarDigital Library
- 55.T. Leighton and B. Maggs. Introduction to Parallel Algorithms and Architectures: Expanders, PRAMs and VLSI. Morgan Kaufman Publishers, San Mateo, CA, 1993. To appear.]] Google ScholarDigital Library
- 56.T. Leighton, B. Maggs, A. Ranade, and S. Rat). Randomized algorithms for routing and sorting in fixed-connection networks. J. Algorithms, 1992. To appear.]] Google ScholarDigital Library
- 57.T. Leighton, B. Maggs, and S. Rao. Universal packet routing algorithms. In 29th Annual Symposium on Foundations of Computer Science, pages 256-271. IEEE, October 1988.]]Google ScholarCross Ref
- 58.T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In 29 th Annual Symposium on Foundations of Computer Science, pages 422-431. IEEE, October 1988.]]Google Scholar
- 59.C. Leiserson and et.al. The network architecture of the connection machine CM-5. Unpublished manuscript, 1992.]] Google ScholarDigital Library
- 60.Charles E. Leiserson. Fat-trees: universal networks for hardware-efficient supereomputing. 1EEE Transactions on Computers, C-34(10):892-901, October 1985.]] Google ScholarDigital Library
- 61.Charles E. Leiserson. VLSI theory and parallel supercomputing, in Richard F. Rashid, editor, Carnegie Mellon University School of Computer Science 25th Anniversery Symposium, pages 29-44. Addison-Wesley, 1991.]]Google Scholar
- 62.Charles E. Leiserson and Bruce M. Maggs. Communication-efficient parallel algorithms for distributed random-access machines. Algorithmica, 3:53-77, 1988.]]Google ScholarDigital Library
- 63.H. Li and Q. Stout. Reconfigurable SIMD massively parallel computers. In Proc. 1EEE, volume 79, pages 429-443, 1991.]]Google ScholarCross Ref
- 64.A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988.]]Google ScholarCross Ref
- 65.Y.-D. Lyuu. Fast fault-tolerant parallel communication and on-line maintenance using information dispersal. In Proceedings of the 2nd Annual A CM Symposium on Parallel Algorithms and Architectures, pages 378-387, July 1990.]] Google ScholarDigital Library
- 66.Y.-D. Lyuu. An Information Dispersal Approach to Issues in Parallel Processing. PhD thesis, Harvard University, 1990.]] Google ScholarDigital Library
- 67.B. Maggs and R. Sitaraman. Simple algorithms for routing on butterfly networks with bounded queues. In Proc. 1992 ACM STOC, 1992. To appear.]] Google ScholarDigital Library
- 68.Henry Minsky, Andr# DeHon, and Thomas F. Knight, Jr. RNI" Low-latency, dilated, crossbar router. In Hot Chips Symposium 111, 1991.]]Google Scholar
- 69.D. Nassimi and S. Sahni. A self-routing Bene# network and parallel permutation algorithms. IEEE Transactions on Computers, C-30(5):332- 340, May 1981.]]Google ScholarDigital Library
- 70.J. Ngai and C. Seitz. A framework for adaptive routing in multicomputer networks. In Proceedings of the 1989 A CM Symposium on Parallel Algorithms and Architectures, pages 1-9, June 1989.]] Google ScholarDigital Library
- 71.N. Nishimura. Asynchronous shared memory parallel computation. In 2rid A CM SPAA, pages 76-84, 1990.]] Google ScholarDigital Library
- 72.N. Pippenger. Telephone switching networks. In Proc. of AMS Symposia in Applied Mathematics, volume 26, pages 101-133, 1982.]]Google ScholarCross Ref
- 73.N. Pippenger. Parallel communication with limited buffers. In #5th Annual Symposium on Foundations of Computer Science, pages 127-136. IEEE, October 1984.]]Google Scholar
- 74.N. Pippenger. Communication networks. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A: Algorithms, and Complexity, pages 805-834. MIT Press, Cambridge, 1990.]] Google ScholarDigital Library
- 75.D. Pountain. The Transputer strikes back. Byte Magazine, pages 265-275, August 1991.]] Google ScholarDigital Library
- 76.F. Preparata. Holographic dispersal and recovery of information. IEEE Trans. Information Theory, IT-35(5):1123-1124, September 1989.]]Google ScholarCross Ref
- 77.M. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the A CM, 36(2):335-348, April 1989.]] Google ScholarDigital Library
- 78.A. Ranade. How to emulate shared memory, in #8th Annual Symposium on Foundations of Computer Science, pages 185-194. IEEE, October 1987.]]Google Scholar
- 79.A. Ranade. Fluent Parallel Computation. PhD thesis, Yale University, New Haven, CT, 1988.]] Google ScholarDigital Library
- 80.A. Ranade, S. Bhatt, and L. johnsson. The fluent abstract machine. In Advanced Research in VLSI: Proceedings of the Fifth MIT Conference, pages '71- 94. MIT Press, Cambridge, MA, March 1988.]] Google ScholarDigital Library
- 81.R. Rettberg, W. Crowther, P. Carvey, and R. Tomlinson. The monarch parallel processor hardware design. Computer, 23(4)" 18-30, April 1990.]] Google ScholarDigital Library
- 82.B. Smith. A massively parallel shared memory machine. In 3rd ACM SPAA, 1991. Invited lecture.]]Google Scholar
- 83.G. Stamoulis and J. Tsitsiklis. The efficiency of greedy routing in hypercubes and butterflies. In Proceedings of the 3rd Annual A CM Symposium on Parallel Algorithms and Architectures, July 1991. To appear.]] Google ScholarDigital Library
- 84.F. Tobagi. Fast packet switch architectures for broadband integrated services digital networks. In Proc. IEEE, volume 78, pages 133-167, January 1990.]]Google Scholar
- 85.T. Tsantilas. A refined analysis of the Valiant- Brebner algorithm. Technical Report TR-22-89, Center for Research in Computing Technology, Harvard University, 1989.]]Google Scholar
- 86.E. Upfal. Efficient schemes for parallel commuhication. In A CM SIGA CT-SIGOPS Symposium on Principles of Distributed Computing, pages 55-59, August 1982.]] Google ScholarDigital Library
- 87.E. Upfal. An O(log N) deterministic packet routing scheme. In Proceedings of the 2lst Annual A CM Symposium on Theory of Computing, pages 241- 250, May 1989. Also to appear in JACM.]] Google ScholarDigital Library
- 88.L. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, August 1990.]] Google ScholarDigital Library
- 89.L. Valiant and G. Brebner. Universal schemes for parallel communication. In Proceedings of the Thirteenth Annual A CM Symposium on Theory of Computing, pages 263-277, May 1981.]] Google ScholarDigital Library
- 90.L.G. Valiant. General purpose parallel architectures. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A: Algorithms, and Complexity, pages 943-972. MIT Press, Cambridge, 1990.]] Google ScholarDigital Library
- 91.A. Waksman. A permutation network. Journal of the A CM, 15(1):159-163, January 1968.]] Google ScholarDigital Library
Index Terms
- Methods for message routing in parallel machines
Recommendations
Parallel simulation of message routing networks
PDP '95: Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed ProcessingAn implementation of a conservative parallel simulator with deadlock avoidance is presented. Its performance when working with a realistic model of a message routing network is evaluated and contrasted against a sequential simulator. Different factors ...
Look-Ahead Routing and Message Scheduling in Delay-Tolerant Networks
Routing is one of the most challenging development issues in Delay-Tolerant Networks (DTNs) because of lack of continuous connection. Existing routing schemes for DTNs provide best effort service, but are unable to optimize QoS and support message ...
Message routing on potential-fields in forwarding-based DTNs
ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and CommunicationIn delay (or disruption) tolerant networks(DTNs), the physical network is partitioned and the topology changes by node contacts. In most cases, there are no globally synchronized topology information available, which makes routing in DTNs challenging. ...
Comments