Hierarchical in-memory sort engine

US9424308B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9424308-B2
Application numberUS-201615063315-A
CountryUS
Kind codeB2
Filing dateMar 7, 2016
Priority dateJun 3, 2014
Publication dateAug 23, 2016
Grant dateAug 23, 2016

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A local sorting module includes a set of storage elements storing binary vectors configured in a one-dimensional (1D) or two-dimensional (2D) array structure and separated by respective comparators configured to conditionally compare and sort the binary vectors. The comparators may perform a sort using a compare-and-flip or a compare-and-swap operation. Local sorting modules may be coupled with a global sorting module for enabling a tournament sort algorithm to output values stored in storage elements one at a time until all data is outputted in a predetermined sorting order.

First claim

Opening claim text (preview).

What is claimed is: 1. A hardware implemented method for sorting a plurality of data words, comprising: loading, by a processor, first and second data words into first and second data storage elements; and comparing, by a comparator, the first data word to the second data word, the comparator comprising: a first priority decoder for comparing a first data word stored in the first data storage element with the second data word stored in the second data storage element, the first priority decoder comprising a first AND gate generating a first output based on receiving both a first bit of the first data word and an output of a first XOR gate, the first XOR gate receiving both the first bit of the first data word and a first bit of the second data word, and a first OR gate generating a second output based on receiving the first output, and a grounded input; a second priority decoder, comprising a second AND gate generating a third output based on receiving a second bit of the first data word, an inverted value of the second output, and an output of a second XOR gate, the second XOR gate receiving the second bit of the first data word and a second bit of the second data word; wherein for each bit in the first data word, the first storage element comprises a first storage device receiving an input from a multiplexer (MUX), the MUX comprising: a first MUX input corresponding to a first bit of the first data word; a second MUX input corresponding to a first bit of an external input data word; a third MUX input corresponding to a first output generated by a first XOR gate receiving both a second output of a first AND gate and the first bit of the first data word, the first AND gate receiving both a third output of the comparator and a fourth output of a second XOR gate, the second XOR gate receiving both the first bit of the first data word and a first bit of the second data word stored in the second data storage element; and a plurality of control signals for selecting the first, second, or third MUX input, wherein at least one of the plurality of control signals corresponds to the third output.

Assignees

Inventors

Classifications

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9424308B2 cover?
A local sorting module includes a set of storage elements storing binary vectors configured in a one-dimensional (1D) or two-dimensional (2D) array structure and separated by respective comparators configured to conditionally compare and sort the binary vectors. The comparators may perform a sort using a compare-and-flip or a compare-and-swap operation. Local sorting modules may be coupled with…
Who is the assignee on this patent?
IBM
What technology area does this patent fall under?
Primary CPC classification G06F13/1626. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Aug 23 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 4 related publications on this page (citations in our corpus or others sharing the same primary CPC).