By Topic

A two-stage distributed shared memory architecture and its scheduling algorithms

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
$33 $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

4 Author(s)
Yi Peng ; Nat. Digital Switching Syst. Eng. & Technol. R&D Center, Zhengzhou, China ; Yuguo Dong ; Jinwu Wei ; Yunfei Guo

The performance of a high-speed router is limited by the random access rate of memories and the switching rate of the inner switch architecture. This paper proposes a two-stage distributed shared memory architecture (TSDSM) and its scheduling algorithms which can emulate the FCFS and the PIFO output-queued (OQ) scheduling algorithms. The lower bound of the memories of the TSDSM is analyzed. We also prove that our algorithms can emulate the QQ scheduling algorithms. The most advantage of the TSDSM over other switching architectures is that the access rate of the memories is commercially available and the switch can work without speedup.

Published in:

Communication Technology Proceedings, 2003. ICCT 2003. International Conference on  (Volume:1 )

Date of Conference:

9-11 April 2003