IP Library Granted Patent US 7,532,635
Granted Patent B2
US 7,532,635 · App. 11/213,626 · Granted May 12, 2009

Methods for memory assignment schemes and architecture for shareable parallel memory module based internet switches

Assignee: Board of Regents, The University of Texas System
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,532,635
App. No.
11/213,626
Granted
May 12, 2009
Kind
B2
Abstract

Systems and methods are described for high-speed memory assignment schemes for routing packets in a sharable parallel memory module based switch system. A method includes receiving a parameter, determining availability of memory location, determining if an available memory location is pre-assigned, and assigning a packet a parameter if the memory location is available. Systems of the present invention provides hardware and/or software based components for implementing the steps of receiving a parameter, determining available memory location, determining if available memory location is pre-assigned, and assigning a packet a parameter if the memory location is available.

Claims (21)

1. A method for assigning a memory module to an incoming packet, comprising the steps of:

(a) setting a first and second counter value to zero;

(b) modifying a parameter in a MOD m fashion to obtain a memory location of a memory module for the incoming packet, where m is the number of memory module;

(c) using a scan table to determine if the memory location is available, and where if the memory location is not available,

(d) incrementing the second counter;

(e) modifying the parameter in a MOD m fashion until a memory module is available;

(f) setting a value associated with the available memory module to the first counter; and

(g) assigning the memory module to the incoming packet.

2. The method of claim 1 , where the first counter determines a first available memory module if all memory modules are not available.

3. The method of claim 1 , further comprising determining if the available memory module is pre-assigned by previous incoming packets prior to step (e).

4. The method of claim 3 , where if the memory module is pre-assigned, determining if the value of the second counter is m.

5. The method of claim 4 , where if the value of the second counter is less than m, repeating step (e).

6. The method of claim 1 , where the MOD m operation comprises a counter counting up to m.

7. A computer readable medium encoded with instructions capable of being executed by a processor to perform the steps of:

(a) setting a first and second counter value to zero;

(b) modifying a parameter in a MOD m fashion to obtain a memory location of a memory module for the incoming packet, where m is the number of memory modules;

(c) using a scan table to determine if the memory location is available, and where if the memory location is not available,

(d) incrementing the second counter;

(e) modifying the parameter in a MOD m fashion until a memory module is available;

(f) setting a value associated with the available memory module to the first counter; and

(g) assigning the memory module to the incoming packet.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 6, 2005
From: KUMAR, SANJEEV
To: BOARD OF REGENTS, THE UNIVERSITY OF TEXAS SYSTEM
Reel/Frame 017321/0702 →
Continuity (2)
Provisional Application 6060492500 · Aug 27, 2004
Related Publication 20060062232A1 · Mar 23, 2006