Application of Hungary Algorithm to Simulation of Input-queued Scheduling
Wang Peng · Jisuanji gongcheng · 2003
Hungary algorithm is a classical one to solve bipartite graph matching problem. Inputqueued crossbar scheduling algorithms are designed to match input ports to output ports of a switch as many as possible. So,maximum size matching (MSM) and maximum weight matching (MWM),which are basing on bipartite graph matching,become the criteria of various scheduling algorithms theoretically. In this paper,Hungary algorithm is successfully applied to the simulation of scheduling algorithms,which produces accurate simulation results. It is the theoretical foundation to do further research on scheduling algorithms.