公开(公告)号：US4986706A

公开(公告)日：1991-01-22

申请号：US851808

申请日：1986-04-14

申请人： John J. Williams, Jr.

发明人： John J. Williams, Jr.

IPC分类号： B60P7/14 ,  B61D45/00

CPC分类号： B61D45/006 ,  B60P7/14

摘要： A lightweight, portable, cargo-retaining header wall is provided which serves to vertically, transversely, and securely span the interior space between opposed walls of a polygonal cargo-receiving container such as a truck trailer or railroad boxcar to prevent cargo shifting beyond the header wall. The header wall preferably includes: a bottom rollered lattice structure composed of a plurality of interconnected bars spaced just closely enough to prevent cargo movement therethrough; a jacking member; and a driving assembly mounted to the lattice structure and receiving the jacking member for incrementally moving the jacking member, the assembly having an operating lever. To use the header wall, a person rolls or lifts it into a transverse, vertical, interior position between two parallel container walls and then moves the lever back and forth to advance the outboard end of the jacking member into tight-fitting engagement with the adjacent container wall; continued operation of the lever causes the opposed side of the lattice structure to also tightly engage its adjacent container wall to thereby secure the header wall between two opposed container walls.

摘要翻译： 提供了轻便，便携的货物保持头壁，其用于垂直，横向和可靠地跨越多边形货物接收容器（例如卡车拖车或铁路箱式货车）的相对的墙壁之间的内部空间，以防止货物偏移超过头部 壁。 集管壁优选包括：底部滚压网格结构，由多个相互间隔开紧密连接的互连条组成，以防止货物通过其移动; 顶尖会员 以及驱动组件，其安装到所述格子结构并且接收所述顶起构件用于递增地移动所述顶起构件，所述组件具有操作杆。 为了使用头壁，人们将其卷起或提升到两个平行的容器壁之间的横向，垂直的内部位置，然后来回移动杆以将顶起构件的外侧端部与相邻的 集装箱墙; 杆的继续操作导致格子结构的相对侧也紧密地接合其相邻的容器壁，从而将集管壁固定在两个相对的容器壁之间。

公开(公告)号：US09503396B2

公开(公告)日：2016-11-22

申请号：US14662131

申请日：2015-03-18

申请人： Doron Shoham ,  John J. Williams, Jr.

发明人： Doron Shoham ,  John J. Williams, Jr.

IPC分类号： H04L12/28 ,  H04L12/935 ,  H04L12/741 ,  H04L12/861

CPC分类号： H04L49/3072 ,  H04L45/745 ,  H04L49/9057

摘要： In one embodiment, packets are sent a packet switching mechanism of a packet switching device, which includes partitioning each particular packet into a plurality of cells with each particular packet and cell derived therefrom associated with a same particular timestamp and a same particular ingress point identifier representing an ingress point of a plurality of ingress points of the packet switching mechanism. These cells are sent through the packet switching mechanism by selecting and forwarding, at each of a plurality of points within the packet switching mechanism. A tie-breaking value is determined based on a manipulation of ingress point identifier associated with said identifiable cell in a manner to vary the tie-breaking selection ordering of ingress point identifiers for different timestamp values. The tie-breaking value is used in selecting a next cell to forward when cells are associated with a same timestamp.

摘要翻译： 在一个实施例中，分组被发送到分组交换设备的分组交换机制，其包括将每个特定分组划分成多个小区，每个特定分组和从其导出的每个特定分组和相应的特定分组相关联的特定时间戳和相同的特定入口点标识符 分组交换机构的多个入口点的入口点。 这些小区通过分组交换机制通过在分组交换机构内的多个点的每一个点选择和转发来发送。 基于对与所述可识别小区相关联的入口点标识符的操纵以改变针对不同时间戳值的入口点标识符的切断选择顺序的方式来确定破产值。 当细胞与相同的时间戳相关联时，使用打破值来选择要转发的下一个单元格。

公开(公告)号：US08112584B1

公开(公告)日：2012-02-07

申请号：US10878891

申请日：2004-06-28

申请人： John J. Williams, Jr. ,  John Andrew Fingerhut ,  Man Kit Tang ,  Barry Scott Burns

发明人： John J. Williams, Jr. ,  John Andrew Fingerhut ,  Man Kit Tang ,  Barry Scott Burns

IPC分类号： G06F12/00 ,  G06F12/12

CPC分类号： G06F12/0802 ,  G06F12/0866 ,  G06F12/0888 ,  G06F2212/1021

摘要： Disclosed are, inter alia, methods, apparatus, data structures, computer-readable media, mechanisms, and means for a storage controller (e.g., memory controller, disk controller, etc.) performing a set of multiple operations on cached data with a no-miss guarantee until the multiple operations are complete, which may, for example, be used by a packet processor to quickly update multiple statistics values (e.g., byte, packet, error counts, etc.) based on processed packets. Operations to be performed on data at the same address and/or in a common data structure are grouped together and burst so that they arrive at the storage system in contiguous succession for the storage controller to perform. By not allowing the storage controller to flush the data from its cache until all of the operations are performed, even a tiny cache attached to the storage controller can reduce the bandwidth and latency of updating the data.

摘要翻译： 公开了尤其是对具有no的缓存数据执行一组多个操作的存储控制器（例如，存储器控制器，磁盘控制器等）的方法，装置，数据结构，计算机可读介质，机制和装置 - 直到多个操作完成为止，这可以例如被分组处理器用于基于处理的分组快速更新多个统计值（例如，字节，分组，错误计数等）。 对相同地址和/或公共数据结构中的数据执行的操作被分组在一起并突发，使得它们以连续的顺序到达存储系统以使存储控制器执行。 通过不允许存储控制器从其高速缓存中刷新数据，直到执行所有操作，即使连接到存储控制器的小型缓存也可以减少更新数据的带宽和延迟。

公开(公告)号：US07765183B2

公开(公告)日：2010-07-27

申请号：US11113248

申请日：2005-04-23

申请人： John J. Williams, Jr.

发明人： John J. Williams, Jr.

IPC分类号： G06F17/30

CPC分类号： G06F17/30985

摘要： A hierarchical tree of deterministic finite automata (DFA) is traversed and/or generated based on a set of regular expressions. The hierarchical DFA includes a root DFA linked together with a set of leaf DFAs, and possibly a set of branch DFAs. The root DFA is always active and is responsive to an input string, as are any currently active branch and leaf DFAs. When a final state or arc is reached or traversed in any active DFA, a regular expression has been matched. The branch and leaf DFAs are activated in response to the root DFA or a branch DFA reaching or traversing an activation state or arc corresponding to the branch or leaf DFA. Active branch and leaf DFAs will become inactive when a termination state or arc is reached or traversed within the branch or leaf DFA. State explosion in the hierarchical DFA can typically be avoided by selectively grouping similar portions of the regular expressions together in branch and leaf DFAs.

摘要翻译： 基于一组正则表达式遍历和/或生成确定性有限自动机（DFA）的层次树。 分层DFA包括与一组叶子DFA一起链接的根DFA，以及可能的一组分支DFA。 根DFA始终处于活动状态，并且响应于输入字符串，以及任何当前活动的分支和叶子DFA。 当在任何活动的DFA中达到或遍历最终状态或弧线时，正则表达式已匹配。 响应于根DFA或分支DFA到达或遍历对应于分支或叶DFA的激活状态或弧，激活分支和叶子DFA。 当在分支或叶子DFA中到达或遍历终止状态或弧时，活动分支和叶子DFA将变为无效。 通常可以通过在分支和叶子DFA中选择性地将正则表达式的相似部分组合在一起来避免分层DFA中的状态爆炸。

公开(公告)号：US07627573B2

公开(公告)日：2009-12-01

申请号：US10811044

申请日：2004-03-27

申请人： John J. Williams, Jr. ,  John Andrew Fingerhut ,  Jonathan Rosen

发明人： John J. Williams, Jr. ,  John Andrew Fingerhut ,  Jonathan Rosen

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

CPC分类号： G06F9/526 ,  G06F17/30362 ,  G06F2209/522 ,  Y10S707/99938 ,  Y10S707/99939

摘要： Data is protected using locks, with the protected data sometimes being included in the locking messages, which may reduce overall processing latency, and/or reduce a bandwidth requirement for and/or number of storage operations accessing the native storage of the protected data. For example, the lock manager receives lock requests from each of the requesters, and selectively grants the lock requests. The protected data is typically communicated in the locking messages when the lock is highly contested, or at least two request for access to the data are pending. The lock manager initiates the sequence by indicating in a grant message to a requester to include the protected data in its release message. The lock manager then copies this data received in the release message to its grant message to the next requestor. If no other requesters are waiting, the grant message includes an indication not to send the protected data, and thus the requestor typically stores this protected data to storage so it can be accessed in the future.

摘要翻译： 使用锁保护数据，受保护的数据有时被包括在锁定消息中，这可以减少整体处理延迟，和/或减少访问受保护数据的本机存储的存储操作的带宽需求和/或数量。 例如，锁管理器从每个请求者接收锁请求，并且选择性地授予锁请求。 当锁被高度争议时，或者至少两个访问数据的请求正在等待时，受保护的数据通常在锁定消息中传达。 锁管理器通过在请求者的授权消息中指示将受保护数据包括在其释放消息中来发起序列。 然后，锁管理器将释放消息中收到的数据复制到其授权消息到下一个请求者。 如果没有其他请求者正在等待，则授权消息包括不发送受保护数据的指示，因此请求者通常将该受保护数据存储到存储器中，以便将来可以访问它。

公开(公告)号：US07565496B2

公开(公告)日：2009-07-21

申请号：US11040797

申请日：2005-01-22

申请人： Doron Shoham ,  Rami Zemach ,  John J. Williams, Jr.

发明人： Doron Shoham ,  Rami Zemach ,  John J. Williams, Jr.

IPC分类号： G06F13/00 ,  G06F13/28 ,  G06F15/173

CPC分类号： H04L49/90 ,  H04L47/50 ,  H04L47/6255 ,  H04L49/9047

摘要： Memory is shared among multiple information channels, which may be of particular use for storing streams of packets. Memory allocation information is maintained which can be used to identify the current number of memory segments (e.g., some definable amount of memory) allocated for each of the multiple channels as well as the available number of shared memory segments. Items, such as, but not limited to data, packets, etc., are received and stored in the memory according to the memory allocation information. After a first processing stage for an item, the memory allocation information is updated to reflect an expected number of available memory segments to become available for the respective channel after a subsequent second processing stage. After the second processing stage is completed for an item, its number of memory segments are de-allocated based on the expected available data. In one embodiment, these memory segments are de-allocated one at a time.

摘要翻译： 存储器在多个信息信道之间共享，这可能特别用于存储分组流。 维持存储器分配信息，其可以用于识别为多个通道中的每一个分配的存储器段的当前数量（例如，一些可定义的存储量）以及可用数量的共享存储器段。 诸如但不限于数据，分组等的项目根据存储器分配信息被接收并存储在存储器中。 在项目的第一处理阶段之后，更新存储器分配信息以反映在随后的第二处理阶段之后可用于相应通道的可用存储器段的预期数量。 在项目的第二处理阶段完成之后，基于预期的可用数据，其存储器段的数量被去分配。 在一个实施例中，这些存储器段被一次一个地分配。

公开(公告)号：US07362762B2

公开(公告)日：2008-04-22

申请号：US10892930

申请日：2004-07-16

申请人： John J. Williams, Jr. ,  John Andrew Fingerhut ,  Doron Shoham ,  Shimon Listman

发明人： John J. Williams, Jr. ,  John Andrew Fingerhut ,  Doron Shoham ,  Shimon Listman

IPC分类号： H04L12/56

CPC分类号： H04L47/10 ,  H04L45/10 ,  H04L47/34 ,  H04L47/50 ,  H04L47/624 ,  H04L49/9094 ,  Y10S707/99938

摘要： Sequences of items may be maintained using ordered locks. These items may correspond to anything, but using ordered locks to maintain sequences of packets, especially for maintaining requisite packet orderings when distributing packets to be processed to different packet processing engines, may be particularly useful. For example, in response to a particular packet processing engine completing processing of a particular packet, a gather instruction is attached to the particular identifier of a particular ordered lock associated with the particular packet. If no longer needed for further processing, the packet processing engine is immediately released to be able to process another packet or perform another function. The gather instruction is performed in response to the particular ordered lock being acquired by the particular identifier, with the gather instruction causing the processed particular packet to be sent.

摘要翻译： 可以使用有序锁来维护物品的顺序。 这些项目可以对应于任何东西，但是使用有序锁来维护分组的序列，特别是当将待处理的分组分发到不同的分组处理引擎时，特别是用于维持必需的分组顺序可能是特别有用的。 例如，响应于特定分组处理引擎完成特定分组的处理，收集指令附加到与特定分组相关联的特定有序锁定的特定标识符。 如果不再需要进一步处理，则分组处理引擎立即被释放以能够处理另一个分组或执行另一个功能。 响应于由特定标识符获取的特定有序锁定执行收集指令，其中收集指令导致处理的特定分组被发送。

公开(公告)号：US20160277323A1

公开(公告)日：2016-09-22

申请号：US14662131

申请日：2015-03-18

申请人： Doron Shoham ,  John J. Williams, JR.

发明人： Doron Shoham ,  John J. Williams, JR.

IPC分类号： H04L12/935 ,  H04L12/861 ,  H04L12/741

CPC分类号： H04L49/3072 ,  H04L45/745 ,  H04L49/9057

摘要： In one embodiment, packets are sent a packet switching mechanism of a packet switching device, which includes partitioning each particular packet into a plurality of cells with each particular packet and cell derived therefrom associated with a same particular timestamp and a same particular ingress point identifier representing an ingress point of a plurality of ingress points of the packet switching mechanism. These cells are sent through the packet switching mechanism by selecting and forwarding, at each of a plurality of points within the packet switching mechanism. A tie-breaking value is determined based on a manipulation of ingress point identifier associated with said identifiable cell in a manner to vary the tie-breaking selection ordering of ingress point identifiers for different timestamp values. The tie-breaking value is used in selecting a next cell to forward when cells are associated with a same timestamp.

摘要翻译： 在一个实施例中，分组被发送到分组交换设备的分组交换机制，其包括将每个特定分组划分成多个小区，每个特定分组和从其导出的每个特定分组和相应的特定分组相关联的特定时间戳和相同的特定入口点标识符 分组交换机构的多个入口点的入口点。 这些小区通过分组交换机制通过在分组交换机构内的多个点的每一个点选择和转发来发送。 基于对与所述可识别小区相关联的入口点标识符的操纵以改变针对不同时间戳值的入口点标识符的切断选择顺序的方式来确定破产值。 当细胞与相同的时间戳相关联时，使用打破值来选择要转发的下一个单元格。

公开(公告)号：US20090296580A1

公开(公告)日：2009-12-03

申请号：US12130936

申请日：2008-05-30

申请人： John J. Williams, Jr. ,  Eric John Chesters

发明人： John J. Williams, Jr. ,  Eric John Chesters

IPC分类号： G01R31/08

CPC分类号： H04L47/34 ,  H04L49/90

摘要： Disclosed are, inter alia, methods, apparatus, computer-storage media, mechanisms, and means associated with cooperative flow locks distributed among multiple components, such as on different application-specific integrated circuits in a packet switching device. Flow locks are typically used for maintaining the order of packets and operations performed thereon by the coordination of a context (e.g., the processing of a packet by a packet processor) with a corresponding flow lock interface, and by the manner of communication performed among the flow lock interface and the distributed flow locks.

摘要翻译： 公开了诸如在分组交换设备中的不同应用专用集成电路上的分布在多个组件之间的协作流锁相关联的方法，装置，计算机存储介质，机制和装置。 流锁通常用于通过协调上下文（例如，分组处理器对分组的处理）与对应的流锁定接口以及通过在相应的流锁定接口之间执行的通信的方式来维护分组和操作执行的顺序 流锁定界面和分布式流锁。

公开(公告)号：US07480308B1

公开(公告)日：2009-01-20

申请号：US10812207

申请日：2004-03-29

申请人： Earl T. Cohen ,  John Andrew Fingerhut ,  John J. Williams, Jr.

发明人： Earl T. Cohen ,  John Andrew Fingerhut ,  John J. Williams, Jr.

IPC分类号： H04L12/56

CPC分类号： H04L47/10 ,  H04L47/34 ,  H04L49/90 ,  H04L49/9094

摘要： Packets and packets fragments possibly received out of sequence are distributed into an expandable set of queues. For each particular packet or fragment, a queue within a set of queues is identified that does not contain a packet or packet fragment that is subsequent to the particular packet or fragment, and the particular packet or fragment is enqueued therein. If there is not such a queue available, a new queue is added to the set of queues. A data structure is typically updated for packet fragments to identify when all fragments have been received and the order of queues containing the packet fragments in order of their position within the reassembled packet. This ordered list of the queues is communicated to a reassembly mechanism to retrieve the packet fragments and to reassemble the packet. Resequencing of packets is similarly performed, and may be part of the reassembly process. The list of queues is not always used by the reassembly/resequencing mechanism as the enqueued fragments/packets typically contain sequence numbers.

摘要翻译： 可能从序列中接收到的数据包和数据包片段分布到一组可扩展的队列中。 对于每个特定的分组或片段，识别出一组队列内的队列不包含特定分组或片段之后的分组或分组片段，并且特定分组或片段入队。 如果没有这样的队列可用，则将新队列添加到队列集合中。 典型地，对于分组片段来更新数据结构以识别何时已经接收到所有片段，并且包含分组片段的队列的顺序依次是它们在重新组装的分组内的位置。 队列的有序列表被传送到重新组装机制以检索分组片段并重新组合分组。 类似地执行分组的重新排序，并且可以是重新组装过程的一部分。 队列列表并不总是被重新组装/重新排序机制使用，因为入队的片段/包通常包含序列号。