By Topic

Randomized Parallel Scheduling Algorithm for Input Queued Crossbar Switches

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yanfeng Zheng ; Inst. of Comput. Technol., Chinese Acad. of Sci., Beijing ; Wen Gao

A significant research effort has been devoted in recent years to the design of simple and efficient scheduling algorithms for input-queued packet switches. Among these algorithms, scheduling policies based on maximum weight matching (MWM) were proved to achieve 100% throughput under any admissible traffic load. However, MWM is impractical for its high computational complexity O(N3). In this paper, we propose a new approximate algorithm to MWM using local search technique. Notably we observe that: (a) Local search is well suitable for parallel computation, (b) Currently each line card of high performance router has at least one processor. Based on the two important observations, a randomized parallel scheduling algorithm is proposed. It is proved to be rate stable and simulation results show that the proposed algorithm outperforms other randomized approximations to MWM

Published in:

Computer and Information Technology, 2005. CIT 2005. The Fifth International Conference on

Date of Conference:

21-23 Sept. 2005