Method and apparatus for storing tree data structures among...

Multiplex communications – Network configuration determination – Using a particular learning algorithm or technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S408000

Reexamination Certificate

active

07613134

ABSTRACT:
Methods and apparatus are disclosed for storing tree data structures among and within multiple memory channels, which may be of particular use with, but not limited to tree bitmap data structures. A subtree (or entire tree) typically includes one or more leaf arrays and multiple tree arrays. One or more leaf arrays are typically stored in a first set of memory channels of N+1 sets of memory channels, the N+1 sets of memory channels including N sets of memory channels plus the first set of memory channels. Each of N contiguous levels of the multiple tree arrays are stored in a different one of said N sets of memory channels, wherein each of the multiple tree arrays at a same level of said N contiguous levels is stored in the same memory channel set of said N sets of memory channels. A memory channel for storing a particular level is typically assigned based on one or more current occupancy levels of the memory channels.

REFERENCES:
patent: 5528701 (1996-06-01), Aref
patent: 5651099 (1997-07-01), Konsella
patent: 5721899 (1998-02-01), Namba
patent: 5781772 (1998-07-01), Wilkinson, III et al.
patent: 5787430 (1998-07-01), Doeringer et al.
patent: 5809501 (1998-09-01), Noven
patent: 5829004 (1998-10-01), Au
patent: 5848416 (1998-12-01), Tikkanen
patent: 5884297 (1999-03-01), Noven
patent: 6018524 (2000-01-01), Turner et al.
patent: 6067574 (2000-05-01), Tzeng
patent: 6115716 (2000-09-01), Tikkanen et al.
patent: 6188694 (2001-02-01), Fine et al.
patent: 6298339 (2001-10-01), Bjornson
patent: 6724734 (2004-04-01), Shabtay et al.
patent: 6891834 (2005-05-01), Dally et al.
patent: 6917954 (2005-07-01), Ahmad et al.
patent: 2002/0039350 (2002-04-01), Wang et al.
patent: 2002/0159398 (2002-10-01), Yamada et al.
patent: 2003/0031167 (2003-02-01), Singh et al.
patent: 2003/0123397 (2003-07-01), Lee et al.
patent: 2003/0152092 (2003-08-01), Lu
patent: 2003/0156590 (2003-08-01), Paul et al.
patent: 2005/0026603 (2005-02-01), Rajaram
patent: 1168723 (2002-01-01), None
patent: 1168723 (2002-10-01), None
Waldvogel et al., “Scalable High Speed IP Routing Lookups,” Computer Communications Review, ACM, Sep. 14, 1997, pp. 25-36.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for storing tree data structures among... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for storing tree data structures among..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for storing tree data structures among... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4082515

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.