G - Physics – 06 – F
Patent
G - Physics
06
F
G06F 7/24 (2006.01)
Patent
CA 2237276
In order to sort data elements each including a sort key, storage means are organized according to a binary tree of 2"-1 nodes which are each able to contain an element and are distributed in n successive stages numbered from 0 to n-1, stage q containing nodes 2q to 2q+1-1. The elements are dispersed within the tree in such a way that each element contained in a node i has a smaller sort key than those of the elements contained in nodes 2i and 2i+1. The trees managed by m successive controllers (21q) each associated with a stage (20q) or with several consecutive stages of the tree (2~m~n), with n-1 interface registers (26q) between successive stages, among which those located between the controllers are pipeline registers allowing parallel working of the controllers so as to modify the contents of the tree upon exchange or insertion command propagated from stage 0 to stage n-1. Figure 2.
Ha-Duong Tuan
Soares Moreira Serafin
Ericsson Canada Patent Group
Fihem
Met S.a.
LandOfFree
Binary-tree data element sorting device and atm spacer... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Binary-tree data element sorting device and atm spacer..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binary-tree data element sorting device and atm spacer... will most certainly appreciate the feedback.
Profile ID: LFCA-PAI-O-1880107