Dynamic allocation of packets to tasks

Details Dynamic allocation of packets to tasks Dynamic allocation of packets to tasks

2007-07-17

2007-07-17

Harper, Kevin C. (Department: 2616)

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

C370S392000, C370S412000

Reexamination Certificate

active

10103436

ABSTRACT:
Tasks are dynamically allocated to process packets. In particular, packets of data to be processed are assigned a packet identification. The packet identification includes a lane and a packet sequence number. The term “lane” as used herein refers to a port number and a direction (i.e. ingress or egress), such as Port 3 Egress. A set of resources (e.g., registers and memory buffers) are associated with each lane. The task is allowed to access resources associated with the lane. In some embodiments, a task may change the port that it services and use the resources associated with that port.

REFERENCES:
patent: 5418953 (1995-05-01), Hunt et al.
patent: 6246684 (2001-06-01), Chapman et al.
patent: 6389016 (2002-05-01), Sabaa et al.
patent: 6731652 (2004-05-01), Ramfelt et al.
patent: 6778548 (2004-08-01), Burton et al.
patent: 6853641 (2005-02-01), Lindhorst-Ko et al.
patent: 6862282 (2005-03-01), Oden
patent: 6947425 (2005-09-01), Hooper et al.
patent: 2003/0012200 (2003-01-01), Salamat
U.S. Appl. No. 10/103,393, filed Mar. 20, 2002, entitled “Reordering of Out-Of-Order Packets,” inventor: Nathan Elnathan, pp. 1-21 and 10 Sheets of drawings.

Affiliated with

Also associated with

Rating

Dynamic allocation of packets to tasks does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic allocation of packets to tasks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic allocation of packets to tasks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3742312