公开(公告)号：US20190278513A1

公开(公告)日：2019-09-12

申请号：US16422827

申请日：2019-05-24

申请人： Shrinivas Venkatraman ,  Eng Hun Ooi ,  Sahar Khalili ,  Dimpesh Patel ,  Kuan Hua Tan

发明人： Shrinivas Venkatraman ,  Eng Hun Ooi ,  Sahar Khalili ,  Dimpesh Patel ,  Kuan Hua Tan

IPC分类号： G06F3/06 ,  G06F13/42

摘要： Apparatuses, storage media and methods associated with data transfer, are disclosed herein. In some embodiments, an apparatus for computing comprises: a commit generator and a media write generator. The commit generator is arranged to generate commit indicators correspondingly associated with media slices of a storage media to respectively denote to a storage media controller of the storage media whether to proceed with writing the media slices into the storage media. The media write generator is arranged provide data chunks of the media slices to be written into the storage media, and the associated commit indicators to the storage media controller. A size of each data chunk is smaller than a size of each media slice. Other embodiments are also described and claimed.

公开(公告)号：US07958295B1

公开(公告)日：2011-06-07

申请号：US11389025

申请日：2006-03-27

申请人： Heng Liao ,  Kuan Hua Tan

发明人： Heng Liao ,  Kuan Hua Tan

IPC分类号： G06F12/00

CPC分类号： G06F13/4045 ,  G06F2213/0028

摘要： A method and apparatus are provided for finding the maxima and minima from a set of inputs data. Given a master set K[0 . . . N−1] of N keys, the current invention can pre-compute a comparison matrix, find the maximum key KMAX or minimum key KMIN from the master set K[0 . . . N−1] and indicate the key position index PMAX of the maximum key or PMIN of the minimum key. Given a subset S[0 . . . M−1] of M keys where the subset S[0 . . . M−1] belongs to the master set K[0 . . . N−1], the current invention can also find the maximum key SMAX or minimum key SMIN from the subset S[0 . . . M−1] and indicate the reference key position index PMAX of the maxima SMAX or PMIN of the minima SMIN in the master set K[0 . . . N−1]. The current invention can also find a specific rank of key (example 5th largest key or 6th smallest key) and return the reference key index position in the master set K[0 . . . N−1].

摘要翻译： 提供一种用于从一组输入数据中找到最大值和最小值的方法和装置。 给定一个主集K [0。 。 。 N-1]，本发明可以预先计算比较矩阵，从主集合K [0]找到最大密钥KMAX或最小密钥KMIN。 。 。 N-1]，并指示最小密钥的最大密钥或PMIN的密钥位置索引PMAX。 给定一个子集S [0。 。 。 M-1]，其中子集S [0。 。 。 M-1]属于主集K [0。 。 。 N-1]，本发明还可以从子集S [0]中找到最大密钥SMAX或最小密钥SMIN。 。 。 M-1]，并且指示主集合K [0]中最小SMIN的最大值SMAX或PMIN的参考键位置索引PMAX。 。 。 N-1]。 本发明还可以找到密钥（示例第五大密钥或第六小密钥）的特定等级，并返回主集合K [0]中的参考密钥索引位置。 。 。 N-1]。

公开(公告)号：US08559439B1

公开(公告)日：2013-10-15

申请号：US13288437

申请日：2011-11-03

申请人： Anil B. Dongare ,  Kuan Hua Tan

发明人： Anil B. Dongare ,  Kuan Hua Tan

IPC分类号： H04L12/28

CPC分类号： H04L47/621 ,  H04L47/34

摘要： A method and apparatus for queue-ordering commands in multi-engines, multi-queues and/or multi-flows environment is provided. Commands from single/multiple queues and multi-flows are processed by multi-engines with different processing time and/or out of order, which breaks sequential order of commands from same input queue and commands are distributed across multiple engines' output buffer after processing. Processed commands are stored in dedicated command output buffer associated with each engine temporarily. The processed commands are re-ordered while writing out. Also commands can be scheduled to idle engines to achieve maximum throughput, thus utilizing the engines in an optimal manner.

摘要翻译： 提供了一种用于在多引擎，多队列和/或多流环境中排队命令的方法和装置。 来自单/多队列和多流的命令由具有不同处理时间和/或无序的多引擎处理，这些命令从相同的输入队列中分离出命令的顺序，并且命令在处理之后分布在多个引擎的输出缓冲区中。 处理的命令被暂时存储在与每个引擎相关联的专用命令输出缓冲器中。 处理后的命令在写出时重新排序。 还可以将命令调度到空闲发动机以实现最大吞吐量，从而以最佳方式利用发动机。

公开(公告)号：US08099655B1

公开(公告)日：2012-01-17

申请号：US11961494

申请日：2007-12-20

申请人： Kuan Hua Tan ,  Amr Wassal

发明人： Kuan Hua Tan ,  Amr Wassal

IPC分类号： H03M13/00

CPC分类号： H03M13/158 ,  H03M13/1515

摘要： A Galois Field multiplier circuit for multiplying two polynomials (multiplicands). The multiplier circuit can use any arbitrary primitive polynomial to preserve the Galois Field. The multiplier circuit includes at least one logic unit that receives as a first input one of the multiplicands and shift the multiplicand in question by 1 bit to the left. The logic unit receives as a second input a pre-determined primitive polynomial and multiplies the primitive polynomial by the highest bit of the multiplicand received at the other input of the logic unit. The bit-shifted multiplicand is XOR-ed with the primitive polynomial multiplied the highest bit of the multiplicand and the result of the XOR operation is provided to a second logic circuit that completes the multiplication of the two polynomials.

摘要翻译： 用于乘以两个多项式（被乘数）的伽罗瓦域乘法器电路。 乘法器电路可以使用任意任意的原始多项式来保存伽罗瓦域。 乘法器电路包括至少一个逻辑单元，其接收作为被乘数的第一输入端，并将所讨论的被乘数向左移位1位。 逻辑单元作为第二输入接收预定的原始多项式，并将原始多项式乘以在逻辑单元的另一输入处接收的被乘数的最高位。 位移的被乘数是XOR编辑的，原始多项式与被乘数的最高位相乘，XOR运算的结果提供给完成两个多项式相乘的第二逻辑电路。

公开(公告)号：US08601169B1

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

申请号：US13288619

申请日：2011-11-03

申请人： Chetan Paragaonkar ,  Kuan Hua Tan

发明人： Chetan Paragaonkar ,  Kuan Hua Tan

IPC分类号： G06F13/00 ,  G06F9/46

CPC分类号： G06F3/0659 ,  G06F3/0613 ,  G06F3/0673 ,  G06F9/5038 ,  G06F13/385 ,  G06F2213/0026

摘要： A method and apparatus, such as multi-engine controller that can be used to control multiple data processing engines in a command based IO processing system, such as a storage controller, to solve to the problem of scaling the data processing rate to match the advances in the IO interface data rates, including a method of identifying dependencies among various tasks queued up in the system and scheduling tasks out-of-order to avoid head of line blocking, a method to buffer and reorder the completed tasks such that the task output order is the same as that in the input to the system.

摘要翻译： 一种方法和装置，例如可用于控制诸如存储控制器的基于命令的IO处理系统中的多个数据处理引擎的多引擎控制器，以解决缩放数据处理速率以匹配进展的问题 在IO接口数据速率中，包括识别在系统中排队的各种任务之间的依赖性的方法以及无序调度任务以避免线路阻塞的头部，缓冲并重新排列完成的任务的方法，使得任务输出 命令与系统输入中的顺序相同。

公开(公告)号：US08095722B1

公开(公告)日：2012-01-10

申请号：US12507859

申请日：2009-07-23

申请人： Heng Liao ,  Kuan Hua Tan ,  Calvin Leung

发明人： Heng Liao ,  Kuan Hua Tan ,  Calvin Leung

IPC分类号： G06F13/00

CPC分类号： G06F13/4022 ,  G06F13/4031

摘要： A method and apparatus are provided for implementing connection management in SAS expander devices. SAS expanders are commonly used within a SAS network topology to allow multiple disk drives to connect to multiple host devices. The method and apparatus provides arbitration of connection requests to be setup or removed among multiple end devices and expander devices so as to increase system performance and reduce hardware cost in a standard compliant manner.

摘要翻译： 提供了一种用于在SAS扩展器装置中实现连接管理的方法和装置。 SAS扩展器通常用于SAS网络拓扑中，以允许多个磁盘驱动器连接到多个主机设备。 所述方法和装置提供在多个终端设备和扩展器设备之间建立或移除的连接请求的仲裁，以便以标准兼容的方式提高系统性能并降低硬件成本。

公开(公告)号：US08089902B1

公开(公告)日：2012-01-03

申请号：US11326508

申请日：2006-01-06

申请人： Heng Liao ,  Kuan Hua Tan ,  Larrie Simon Carr

发明人： Heng Liao ,  Kuan Hua Tan ,  Larrie Simon Carr

IPC分类号： H04L12/28

CPC分类号： H04L49/35 ,  H04L49/55

摘要： A method and system are provided for broadcast message filtering in SAS expanders. Common SAS topology defined by ANSI T10 specification only supports spanning tree topology (without loops) interconnection among multiple end devices and expander devices. Broadcast message filtering provides a mechanism to selectively discard broadcast messages, or primitives, in the SAS expanders to break the infinite loop path that broadcast primitives can traverse. This enables new SAS physical topologies with loops that are otherwise difficult or impossible to realize using SAS expanders that handle primitive broadcasts according to the definition of the SAS standard. By allowing redundant paths in a SAS topology, the problem of infinite broadcast flooding in SAS topology is reduced. Selectively forwarding broadcast messages can be based on whether the broadcast was originated at the source phy, or received by the source phy, or based on whether the source phy is a filtered phy.

摘要翻译： 提供了一种方法和系统，用于SAS扩展器中的广播消息过滤。 ANSI T10规范定义的常规SAS拓扑仅支持多个终端设备和扩展器设备之间的生成树拓扑（无环路）互连。 广播消息过滤提供了选择性地丢弃SAS扩展器中的广播消息或原语以破坏广播原语可以遍历的无限循环路径的机制。 这使得新的SAS物理拓扑具有循环，否则难以或不可能根据SAS标准的定义处理原始广播的SAS扩展器来实现。 通过在SAS拓扑中允许冗余路径，减少了SAS拓扑中无限广播洪泛的问题。 选择性地转发广播消息可以基于广播是源自源phy还是由源phy接收，或者基于源phy是否是过滤的phy。

公开(公告)号：US07584319B1

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

申请号：US11390182

申请日：2006-03-28

申请人： Heng Liao ,  Kuan Hua Tan ,  Calvin Leung

发明人： Heng Liao ,  Kuan Hua Tan ,  Calvin Leung

IPC分类号： G06F13/00

CPC分类号： G06F13/4022 ,  G06F13/4031

摘要： A method and apparatus are provided for implementing connection management in SAS expander devices. SAS expanders are commonly used within a SAS network topology to allow multiple disk drives to connect to multiple host devices. The method and apparatus provides arbitration of connection requests to be setup or removed among multiple end devices and expander devices so as to increase system performance and reduce hardware cost in a standard compliant manner.

摘要翻译： 提供了一种用于在SAS扩展器装置中实现连接管理的方法和装置。 SAS扩展器通常用于SAS网络拓扑中，以允许多个磁盘驱动器连接到多个主机设备。 所述方法和装置提供在多个终端设备和扩展器设备之间建立或移除的连接请求的仲裁，以便以标准兼容的方式提高系统性能并降低硬件成本。