Parallel maximum weight bipartite matching algorithms for scheduling in input-queued switches

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 49-56

  Fayyazi, Morteza ^a   Kaeli, David ^a   Meleis, Waleed ^a  

^a Northeastern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION MAKING MACHINE (DMM); INPUT-QUEUED SWITCHES; PARALLEL MAXIMUM WEIGHT BIPARTITE MATCHING ALGORITHMS (MWBM); VIRTUAL OUTPUT QUEUING;

ALGORITHMS; BANDWIDTH; COMPUTATIONAL COMPLEXITY; DECISION MAKING; GRAPH THEORY; PACKET SWITCHING; POLYNOMIALS; PROBLEM SOLVING; QUALITY OF SERVICE; QUEUEING NETWORKS; SCHEDULING; SWITCHING SYSTEMS;

PARALLEL PROCESSING SYSTEMS;

EID: 12444263316     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. M. J. Karol, M. Hluchyj, and S. Morgan, "Input vs. output queuing on a space-division packet switch," in Proc. GLOBECOM 1986, pp. 659-665.
2. M. J. Karol, M. Hluchyj, "Queuing in high performance packet switching," IEEE JSAC vol. 6, no. 9, Dec. 1988, pp. 1587-1597.
3. M. Nabeshima, "Performance evaluation of a combined input- and crosspoint-queued switch," IEICE Trans. Communications, vol. E83-B, no. 3, Mar. 2000, pp. 737-741.
4. H. Ahmadi, W. E. Denzel, "A survey of modern high-performance switching techniques," IEEE JSAC, vol. 7, no. 7, pp. 1091-1103, Sep. 1989.
5. R. Y. Awdeh, H. T. Moftah, "Survey of ATM switch architectures," Computer networks and ISDN systems, vol. 27, pp. 1567-1613, 1995.
6. S. Iyer, N. McKeown, "Making parallel packet switches practical," IEEE INFOCOM'01, Alaska, USA, pp. 1680-1687, Mar. 2001.
7. S. Lyer, R. Zhang, N. McKeown, "Routers with a single stage of buffering," ACM SigCOMM, pp. 251-264, Aug. 2002.
8. F. Abel, C. Minkenberg et al., "A four-terabit packet switch supporting long round-trip times," IEEE Micro magazine, pp. 10-23, Jan./Feb. 2003.
9. C. Minkenberg et al., "Current issues in packet switch design," ACM SigCOMM Computer Comm. Rev., vol. 33, no. 1, pp. 199-124, Jan. 2003.
10. Y. Tamir, G. Frazier, "High performance multi-queue buffers for VLSI communication switches," in Proc. 15th Ann. Symp. Computer Architecture, pp. 343-354, June 1988.
11. H. Obara, "Optimum architecture for input queuing ATM switches," IEE Electron. Lett., pp. 555-557, Mar. 28, 1991.
12. N. McKeown, V. Anantharam, J. Walrand, "Achieving 100% throughput in an input-queued switch," IEEE INFOCOM'96, pp. 296-302, 1996.
13. J. G. Dai, B. Prabhakar, "The throughput of data switches with and without speedup," IEEE INFOCOM 2000, vol. 2, pp. 556-564, Mar. 2000.
14. B. Prabhakar, N. McKeown, "On the speedup required for combined input and output queued switching," Automatica, vol. 35, pp. 1909-1920, 1999.
15. R. E. Tarjan, Data structures and network algorithms, Bell laboratories, 1983.
16. C. H. Papadimitriou, K. Steiglitz, Combinatorial optimization, algorithms and complexity, Prentice Hall 1982.
17. K. Mulmuley, U. V. Vazirani, V. V. Vazirani, "Matching is as easy as matrix inversion," Combinatorica, pp. 105-131, 1987.
18. C. H. Papadimitriou, Computational complexity, Addison-Wesley Publishing, 1994.
19. A. V. Goldberg, S. A. Plotkin, P. M. Vaidya, "Sublinear-time parallel algorithms for matching and related problems," IEEE symposium on foundations of computer science, pp. 174-185, 1993.
20. R. M. Karp, E. Upfal, A. Wigderson, "Constructing a maximum matching is in random NC," Combinatorica, 6:35-48, 1986.
21. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," IEEE INFOCOM'98, vol. 2, pp. 533-539, 1998.
22. D. Shah, P. Giaccone, B. Prabhakar, "An efficient randomized algorithm for input-queued switch scheduling," Hot Interconnects 9, pp. 3-8, Aug. 2001.
23. P. Giaccone, B. Prabhakar, D. Shah, "Towards simple, high-performance schedulers for high-aggregate bandwidth switches," IEEE INFOCOM'02, pp. 3:1160-1169, June 2002.
24. V. Tabatabaee, L. Tassiulas, "MNCM a new class of efficient scheduling algorithms for input-buffered switches with no speedup," IEEE INFOCOM'03, April 2003.
25. M. Fayyazi, D. Kaeli, Z. Navabi, "Dynamic input buffer allocation (DIBA) for fault tolerant Ethernet packet switching," International conference on parallel and distributed processing techniques and applications (PDPTA'03), vol. 2, pp. 819-823, June 2003.
26. N. McKeown, "Scheduling algorithms for input-queued cell switches," PhD Thesis, University of California at Berkeley, May 1995.
27. W. E. Leland, W. Willinger, M. S. Taqqu, D, V. Willson, "On the self-similar nature of ethernet traffic," IEEE/ACM Trans. on Networking, vol. 2, no. 1, pp. 1-15, Feb. 1994.
28. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to algorithms, The MIT press, 1999.