Patent ID: 7509309
Filing Date: 2009-03-24
Classification: G06F,Y10S

Abstract:
1. A method, comprising executing an algorithm by a processor of a computer system, said executing said algorithm comprising sorting S sequences of binary bits in ascending or descending order of a value associated with each sequence and in a time period denoted as a sorting execution time, said S sequences being stored in a memory device of the computer system prior to said sorting, S being at least 2, each sequence of the S sequences comprising N bits, N being at least 2, said sorting comprising executing program code at nodes of a linked execution structure, said executing program code being performed in a sequential order with respect to said nodes, said executing program code including: specifying a constant mask width W which defines a mask of width W and further defines L contiguous fields in each sequence and L levels denoted as Level 1, Level 2, . . . , Level L, wherein the L contiguous fields of each sequence are denoted as F masking field F recursively traversing a sufficient number of paths through the linked execution structure to complete said sorting S sequences, wherein each path traversed comprises an ordered sequence of nodes passing through one and only one node in each level of Level 1, Level 2, . . . , Level T such that 1≦T≦L, wherein said recursively traversing comprises distributing into each node of Level i+1 all sequences in its parent node in Level i which match the unique value for field F outputting each sequence of the S sequences or a pointer thereto to an output array of the memory device whenever said recursively traversing terminates each path at its leaf node in Level T.