公开(公告)号：US09418093B2

公开(公告)日：2016-08-16

申请号：US13230732

申请日：2011-09-12

申请人： Paul Nadj ,  David Walter Carr ,  Edward D. Funnekotter

发明人： Paul Nadj ,  David Walter Carr ,  Edward D. Funnekotter

IPC分类号： G06F17/00 ,  G06F17/30 ,  G06F7/22 ,  G06F7/24

CPC分类号： G06F17/30336 ,  G06F7/22 ,  G06F7/24 ,  G06F17/30327 ,  G06F2207/222 ,  Y10S707/99942

摘要： A method for high-speed scheduling and arbitration of events for computing and networking is disclosed. The method includes the software and hardware implementation of a unique data structure, known as a pile, for scheduling and arbitration of events. According to the method, events are stored in loosely sorted order in piles, with the next event to be processed residing in the root node of the pile. The pipelining of the insertion and removal of events from the piles allows for simultaneous event removal and next event calculation. The method's inherent parallelisms thus allow for the automatic rescheduling of removed events for re-execution at a future time, also known as event swapping. The method executes in O(1) time.

摘要翻译： 公开了用于计算和联网的事件的高速调度和仲裁的方法。 该方法包括用于调度和仲裁事件的独特数据结构（称为堆栈）的软件和硬件实现。 根据该方法，事件以松散排列的顺序存储在桩中，下一个要处理的事件驻留在桩的根节点中。 从桩中插入和移除事件的流水线允许同时进行事件移除和下一个事件计算。 因此，该方法的固有并行性允许自动重新安排已移除的事件，以便将来再次执行，也称为事件交换。 该方法在O（1）时间内执行。

公开(公告)号：US06289349B1

公开(公告)日：2001-09-11

申请号：US08767042

申请日：1996-12-12

申请人： Luther J. Woodrum

发明人： Luther J. Woodrum

IPC分类号： G06F1730

CPC分类号： G06F7/24 ,  G06F2207/222 ,  Y10S707/99937

摘要： Arrangement of fields in binary tree nodes provides a minimal storage encoding storing fixed and variable length keys in factored form in a multilevel tree. A locating method, and apparatus embodying that method, directed by an argument key, which may or may not be stored in the tree, traces a path following arcs upward or downward between nodes in said binary tree, starting from the top node or any other node, until it finds either the argument key or the delta arc where said argument key would be inserted into said tree. The novel binary tree encoding also provides for path tracing starting at a data backpointer field, which allows accessing of neighboring data entries in collating sequence order.

摘要翻译： 二叉树节点中的字段的排列提供了一种最小的存储编码，在多级树中以因数形式存储固定和可变长度的密钥。 一种定位方法和体现该方法的装置，其可以或可以不存储在树中的参数键来引导在上述二叉树中的节点之间向上或向下的弧之后的路径，从顶部节点或任何其他 节点，直到找到参数键或增量弧，其中所述参数键将被插入到所述树中。 新颖的二叉树编码还提供从数据反向字段开始的路径跟踪，其允许以整理顺序顺序访问相邻数据条目。

公开(公告)号：US5175857A

公开(公告)日：1992-12-29

申请号：US458361

申请日：1989-12-28

申请人： Sakae Inoue

发明人： Sakae Inoue

IPC分类号： G06F7/24

CPC分类号： G06F7/24 ,  G06F2207/222 ,  Y10S707/99937

摘要： A method and apparatus for sorting object data, the object data having a data format of a next address and a record. The next address indicates the address of another object data, and the record includes information data which is the subject of the sort. The sorting method and apparatus perform two sorting processes. The first process performs a divisional sort which sorts the object data into blocks of object data; these blocks being sorted with respect to one another. In sorting the object data into these object data blocks, it is unnecessary to actually move the object data within the memory. Instead, only one address of an object data out of all the object data in a block needs to be stored. Use is made of the next address of the object data to link the remaining object data to the single object data stored in an object data block. Then the second sorting process performs a sort of the object data in each block; thus all the object data becomes sorted. By the combination of the two sorting processes, an overall sort of the object data is performed in less time.

摘要翻译： 用于分类对象数据的方法和装置，对象数据具有下一地址和记录的数据格式。 下一个地址指示另一个对象数据的地址，并且记录包括作为排序对象的信息数据。 排序方法和装置执行两个排序处理。 第一个进程执行分割排序，将对象数据分成对象数据块; 这些块相对于彼此分类。 在将对象数据分类到这些对象数据块中时，实际上不需要在存储器内移动对象数据。 相反，需要存储块中所有对象数据中的对象数据的一个地址。 使用对象数据的下一个地址将剩余的对象数据链接到存储在对象数据块中的单个对象数据。 然后，第二分类处理在每个块中执行对象数据的排序; 因此所有对象数据都被分类。 通过两个排序处理的组合，在更短的时间内执行对象数据的整体排序。

公开(公告)号：US06385612B1

公开(公告)日：2002-05-07

申请号：US08730468

申请日：1996-10-11

申请人： James Henry Troisi

发明人： James Henry Troisi

IPC分类号： G06F1730

CPC分类号： G06F7/24 ,  G06F2207/222 ,  Y10S707/99937

摘要： In a computer system, data records stored in nonvolatile memory are read into a volatile memory and operated on in a sorting operation. A tournament-type sort is applied, with the tree size dynamically reconfigured within the volatile memory as a function of the number of data records to be sorted. The memory space occupied is reduced by the reconfigured tree and sort speed is augmented.

摘要翻译： 在计算机系统中，存储在非易失性存储器中的数据记录被读入易失性存储器中并在分类操作中进行操作。 应用比赛类型排序，根据要排序的数据记录的数量，将动态重新配置在易失性存储器内的树大小。 占用的存储空间由重新配置的树减少，排序速度得到增强。

公开(公告)号：US5619693A

公开(公告)日：1997-04-08

申请号：US236513

申请日：1994-05-02

申请人： James H. Troisi

发明人： James H. Troisi

IPC分类号： G06F7/24 ,  G06F17/30

CPC分类号： G06F7/24 ,  G06F2207/222 ,  Y10S707/99937

摘要： In a computer system, data records stored in nonvolatile memory are read into a volatile memory and operated on in a sorting operation. A tournament-type sort is applied, with the tree size dynamically reconfigured within the volatile memory as a function of the number of data records to be sorted. The memory space occupied is reduced by the reconfigured tree and sort speed is augmented.

摘要翻译： 在计算机系统中，存储在非易失性存储器中的数据记录被读入易失性存储器中并在分类操作中进行操作。 应用比赛类型排序，根据要排序的数据记录的数量，将动态重新配置在易失性存储器内的树大小。 占用的存储空间由重新配置的树减少，排序速度得到增强。

公开(公告)号：US5487166A

公开(公告)日：1996-01-23

申请号：US308751

申请日：1994-09-19

申请人： David Cossock

发明人： David Cossock

IPC分类号： G06F7/24

CPC分类号： G06F7/24 ,  G06F2207/222 ,  G06F2207/224 ,  Y10S707/956 ,  Y10S707/99937

摘要： To perform a sort of N records, a two-dimensional tree structure is formed with a tree of subtrees, where each subtree is formed by a plurality of nodes organized in a binary tree. For each leaf node in the tree, there is an ancestor chain of nodes (from child to parent, from parent to grand-parent, from grand-parent to great-grand-parent, . . . and so on) that connects each leaf node to the root node. To perform the sort, the processing unit stores codes representing keys into nodes in the two-dimensional tree and performs a tree sort of the keys using the codes. The codes are accessed in the subtrees and processed to determine the sort order of the keys and therefore the sort order of the corresponding records.

摘要翻译： 为了执行一种N个记录，使用一棵子树形成二维树结构，其中每个子树由组织在二叉树中的多个节点形成。 对于树中的每个叶节点，连接每个叶子的节点的祖先链（从小到母，从父母到祖父，从祖父到祖父，...等等） 节点到根节点。 为了执行排序，处理单元将代表密钥的代码存储在二维树中的节点中，并使用代码执行树的分类。 代码在子树中进行访问，并被处理以确定密钥的排序顺序，因此确定相应记录的排序顺序。

公开(公告)号：US4131947A

公开(公告)日：1978-12-26

申请号：US859267

申请日：1977-12-09

申请人： Philip N. Armstrong

发明人： Philip N. Armstrong

IPC分类号： G06F7/24 ,  G06F7/06

CPC分类号： G06F7/24 ,  G06F2207/222 ,  Y10S707/959 ,  Y10S707/99937

摘要： A system is provided for sorting binary data records, which includes random access memory means for storing the data records and from which the data records may be retrieved in an ordered sequence. There is no sorting time mode within the system itself, and the system has but two modes of operation, an input mode and an output mode. The time required for sorting the data is dependent only on the rate at which the data records are fed into the system and the rate at which the data records are retrieved out of the system.

摘要翻译： 提供了一种用于分类二进制数据记录的系统，其包括用于存储数据记录的随机存取存储器装置，并且可以从其中以有序的顺序从中检索数据记录。 系统本身没有排序时间模式，系统只有两种操作模式，一种输入模式和一种输出模式。 数据排序所需的时间仅取决于将数据记录送入系统的速率以及将数据记录从系统中检索出的速率。

公开(公告)号：UST943006I4

公开(公告)日：1976-02-03

申请号：US49797574

申请日：1974-08-16

IPC分类号： G06F7/24 ,  G06F17/30

CPC分类号： G06F17/30961 ,  G06F7/24 ,  G06F2207/222

公开(公告)号：US3714634A

公开(公告)日：1973-01-30

申请号：US3714634D

申请日：1971-01-07

申请人： DIRKS ELECTRONICS CORP

发明人： DIRKS G ,  SCHENCK P

IPC分类号： G06F7/24 ,  G06F7/06

CPC分类号： G06F7/24 ,  G06F2207/222 ,  Y10S707/99937

摘要： Record unit addresses, providing access to corresponding record units having keyfields, are stored in a first storage, each under control of the corresponding least significant keyfield bit. Zero keyfield bits cause storage of record unit addresses in sequential locations following a ''''0'''' assigned storage location; ''''1'''' keyfield bits cause storage of record unit addresses in sequential locations following a ''''1'''' assigned storage location. Record unit addresses in the ''''0'''' assigned storage locations of the first storage are then transferred to a second storage in the same manner under control of the next significant keyfield bit. Next, the record unit addresses in the ''''1'''' assigned storage locations of the first storage are so transferred to the second storage. The transfers are repeated under control of all keyfield bits, read-out from ''''0'''' assigned storage locations always preceding read-out from ''''1'''' assigned storage locations.

公开(公告)号：US20060095444A1

公开(公告)日：2006-05-04

申请号：US11254156

申请日：2005-10-18

申请人： Paul Nadj ,  David Carr ,  Edward Funnekotter

发明人： Paul Nadj ,  David Carr ,  Edward Funnekotter

IPC分类号： G06F7/00

CPC分类号： G06F7/22 ,  G06F2207/222 ,  Y10S707/99937 ,  Y10S707/99945 ,  Y10S707/99952

摘要： An improved data structure is provided by modifying a public-domain data structure known as a “heap”. When these improvements are applied, the resultant data structure is known as a “pile.” This invention further describes a pipelined hardware implementation of a pile. Piles offer many advantages over heaps: they allow for fast, pipelined hardware implementations with increased throughput, making piles practical for a wide variety of new applications; they remove the requirement to track and update the last position in the heap; they reduce the number of memory reads accesses required during a delete operation; they require only ordinary, inexpensive RAM for storage in a fast, pipelined implementation; and they allow a random mixture of back-to-back insert, remove, and swap operations to be performed without stalling the pipeline.