By Topic

A Scalable Memory-Efficient Architecture for Parallel Shared Memory 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
$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

2 Author(s)
Brad Matthews ; Student Member, IEEE, Networking Research Group, Electrical and Computer Engineering Dept., University of Tennessee, Knoxville, TN 37996 ; Itamar Elhanany

Parallel shared memory (PSM) switch architectures were initially introduced as means of resolving the high memory bandwidth requirements imposed by output-queued switches. At the core of the PSM architecture is a memory management algorithm that determines, for each arriving packet, the memory unit in which it will be placed. Recent work has indicated that in order to achieve high throughput, the number of parallel memories needed is O (N1.5), thereby significantly limiting scalability. This paper introduces a novel pipelined memory management algorithm which maintains a computational complexity of O(1) while reducing the number of required parallel memories to O (N). Our goal is to extend existing shared-memory architecture results in the context of fabric on a chip (FoC) - a paradigm that advocates the consolidation of core packet switching functions on a single chip. A detailed discussion is provided pertaining to the fundamental properties of the proposed scheme, along with hardware implementation considerations that illustrate its scalability and performance attributes.

Published in:

2007 Workshop on High Performance Switching and Routing

Date of Conference:

May 30 2007-June 1 2007