A Parallel Iterative Improvement Stable Matching Algorithm
- 332 Downloads
In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem as an optimization problem with all possible matchings forming its solution space. Since a stable matching always exists for any stable matching problem instance, finding a stable matching is equivalent to finding a matching with the minimum number (which is always zero) of unstable pairs. A particular PII algorithm is presented to show the effectiveness of this approach by constructing a new matching from an existing matching and using techniques such as randomization and greedy selection to speedup the convergence process. Simulation results show that the PII algorithm has better average performance compared with the classical stable matching algorithms and converges in n iterations with high probability. The proposed algorithm is also useful for some real-time applications with stringent time constraint.
KeywordsParallel Algorithm Initiation Phase Stable Match Ranking List Ranking Matrix
Unable to display preview. Download preview PDF.
- 2.Anderson, R.: Parallel algorithms for generating random permutations on a shared memory machine. In: Proc. of the 2nd ACM Symposium on Parallel Algorithms and Architectures, pp. 95–102 (1990)Google Scholar
- 9.Hagerup, T.: Fast parallel generation of random permutations. In: Proc. of the 18th Annual International Colloquium on Automata, Languages and Programming, pp. 405–416 (1991)Google Scholar
- 10.Hattori, T., Yamasaki, T., Kumano, M.: New fast iteration algorithm for the solution of generalized stable marriage problem. In: Proc. of IEEE International Conference on Systems, Man, and Cybernetics, vol. 6, pp. 1051–1056 (1999)Google Scholar
- 15.McKeown, N.: Scheduling algorithms for input-buffered cell switches. Ph.D. Thesis, University of California, Berkeley (1995)Google Scholar
- 20.Stoica, I., Zhang, H.: Exact emulation of an output queuing switch by a combined input output queuing switch. In: Proc. of the 6th IEEE/IFIP IWQoS 1998, Napa Valley, CA, pp. 218–224 (1998)Google Scholar