%0 Journal Article
%A SHUANG Kai
%A SU Sen
%A WAN Neng
%A ZHAN Shu-bo
%A ZHANG Wen-tao
%T Parallel Routing Algorithm for Call Centers Based on Local Mutual Exclusion
%D 2017
%R 10.13190/j.jbupt.2017.s.011
%J Journal of Beijing University of Posts and Telecommunications
%P 48-52
%V 40
%N s1
%X A parallel routing method named parallel call center routing method(PCCRM) was proposed to promote the multiprocessing performance of call center system with multi-skill model. Through refinement of resource, PCCRM reduced the general mutual exclusion to local mutual exclusion, which can markedly reduce the waiting of process synchronization. Meanwhile an orderly competition model was introduced to guarantee the algorithm to meet the requirement of general principle of call center's agents. The experimental results showed that the PCCRM could increase system performance and scalability of routing algorithm.
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2017.s.011