Asynchronous linked data structure traversal

Details Asynchronous linked data structure traversal Asynchronous linked data structure traversal

2011-07-19

2011-07-19

Channavajjala, Srirama (Department: 2157)

Data processing: database and file management or data structures

Database design

Database and data structure management

C707S797000, C707S800000, C707S803000, C707S807000

Reexamination Certificate

active

07984075

ABSTRACT:
Asynchronously traversing a disjoint linked data structure is presented. A synergistic processing unit (SPU) includes a handler that works in conjunction with a memory flow controller (MFC) to traverse a disjoint linked data structure. The handler compares a search value with a node value, and provides the MFC with an effective address of the next node to traverse based upon the comparison. In turn, the MFC retrieves the corresponding node data from system memory and stores the node data in the SPU's local storage area. The MFC stalls processing and sends an asynchronous event interrupt to the SPU which, as a result, instructs the handler to retrieve and compare the latest node data in the local storage area with the search value. The traversal continues until the handler matches the search value with a node value or until the handler determines a failed search.

REFERENCES:
patent: 4794528 (1988-12-01), Hirose et al.
patent: 5557786 (1996-09-01), Johnson, Jr.
patent: 5561786 (1996-10-01), Morse
patent: 5805860 (1998-09-01), Parham
patent: 6380947 (2002-04-01), Stead
patent: 6907414 (2005-06-01), Parnell
patent: 6978271 (2005-12-01), Hoffman et al.
patent: 7650460 (2010-01-01), Cheriton
patent: 2004/0024729 (2004-02-01), Worley
patent: 2004/0103086 (2004-05-01), Vinnakota et al.
patent: 2005/0060460 (2005-03-01), Karamatas et al.
patent: 2005/0131867 (2005-06-01), Wilson
patent: 2008/0133841 (2008-06-01), Finkler
patent: WO 2004006067 (2004-01-01), None
patent: WO 2004097673 (2004-11-01), None
J. Morris Chang, “An e• cient data structure for dynamic memory management”, The Journal of Systems and Software 54 (2000) 219±226.
Sih et al., “A Compile-Time Scheduling Heuristic for Interconnection-Constrained Hetergeneous Processor Architectures,” Feb. 2, 1993, IEEE, pp. 175-186.

Affiliated with

Also associated with

Rating

Asynchronous linked data structure traversal does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Asynchronous linked data structure traversal, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asynchronous linked data structure traversal will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2692604