A near-optimal real-time hardware scheduler for large cardinality crossbar switches

Proceedings of the 2006 ACM/IEEE Conference on Supercomputing, SC'06

Volumn , Issue , 2006, Pages

  Hoare, Raymond R ^a   Ding, Zhu ^b   Jones, Alex K ^c  

^a Concurrent EDA LLC ^*

^b Union Switch and Signal ^*

^c UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN OPERATIONS; CUSTOM HARDWARE DESIGN; MAXIMUM MATCHING ALGORITHMS; OPTIMAL SCHEDULING;

BOOLEAN FUNCTIONS; COMPUTER HARDWARE; GRAPH THEORY; INTERCONNECTION NETWORKS; REAL TIME SYSTEMS; VECTORS;

ALGORITHMS;

EID: 34548293030     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1188455.1188554     Document Type: Conference Paper

References (14)

1. F. Glover, "Maximum matching in a convex bipartite graph," Na val research Logistics Quarterly, 1967.
2. A. L. Dulmag and N. S. Mendelsohn, "Actrices associated with the hitchcock problem," Journal of the ACM, 1962.
3. Z. Galil, "Efficient algorithms for finding maximum matching in graphs," ACM Computing Surveys (CSUR), vol. 18, no. 1, pp. 23-38, 1986.
4. K. Mulmuley, U. V. Vazirani, and V. V. Vazirani, "Matching is as easy as matrix inversion," in STOC '87: Proceedings of the nineteenth annual ACM conference on Theory of computing, (New York, New York, United States), pp. 345-354, 1987.
5. The BlueGene/L Team, "An overview of the BlueGene/L supercomputer," in Conf. on High Performance Networking and Computing, 2002.
6. S.Habata, M. Yokokawa, and S.Kitawaki, "The Earth simulator system," tech. rep., NEC Res. and Develop. http://www.owlnet.rice.edu/ elec526/handouts / papers/earth-sim-nec.pdf.
7. Z. Ding, R. Hoare, A. Jones, D. Li, S. Shao, S. Tung, J. Zheng, and R. Melhem, "Switch design to enable predictive multiplexed switching in multiprocessor networks," in Proc. of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2005), (Denver, CO), Apr. 2005.
8. N. Mckeown, "Crossbar switch scheduling," SNRC Talk, 2001.
9. T. Weiler and B. Hajek, "Scheduling nonuniform traffic in a packet-switching system with small propagation delay," IEEE/ACM Trans. Netw., vol. 5, no. 6, pp. 813-823, 1997.
10. K. L. Yeung, "Efficent time slot assignment algorithms for TDM hierarchical and nonhierarchical switch systems," IEEE Trans. on Communications, vol. 49, pp. 351-359, Feb. 2001.
11. L.Lovasz and M.Plummer, Matching Theory. Academic Press, 1986.
12. H. N. Gabow, "An efficient implementation of edmonds' algorithm for maximum matching on graphs," Journal of the ACM (JACM), vol. 23, no. 2, pp. 221 - 234, 1976.
13. A. Czygrinow, M.Hanckowiak, and E.Szymanska, "Dis tributed algorithm for approximating the maximum matching," Elservier Science, 2003.
14. M. Hanckowiak and M. K. A. Panconesi, "On the distributed complexity of computing maximal matchings," in SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (San Francisco, California, United States), pp. 219-225, 1998.