公开(公告)号：US08037391B1

公开(公告)日：2011-10-11

申请号：US12471289

申请日：2009-05-22

申请人： Cyndi Jung ,  Nirmal Raj Saxena ,  Mark A. Overby ,  Andrew Currid

发明人： Cyndi Jung ,  Nirmal Raj Saxena ,  Mark A. Overby ,  Andrew Currid

IPC分类号： H03M13/00

CPC分类号： G06F11/1076 ,  G06F2211/1052 ,  G06F2211/1057

摘要： One embodiment of the present invention sets forth a technique for performing RAID-6 computations using simple arithmetic functions and two-dimensional table lookup operations. Four lookup tables are computed and saved prior to normal operation of a RAID-6 disk array. During normal operation of the RAID-6 disk array, all RAID-6 related computations may be performed using a small set of simple arithmetic operations and a set of lookup operations to three of the four previously saved lookup tables. Greater computational efficiency is gained by reducing the RAID-6 computations to simple operations that are performed efficiently on a typical central processing unit or graphics processing unit.

摘要翻译： 本发明的一个实施例提出了一种使用简单算术函数和二维表查找操作执行RAID-6计算的技术。 在RAID-6磁盘阵列正常运行之前，计算并保存四个查找表。 在RAID-6磁盘阵列的正常操作期间，可以使用一组简单的算术运算和一组查找操作来执行所有与RAID-6相关的计算，这四个以前保存的查找表中的三个。 通过将RAID-6计算减少到在典型中央处理单元或图形处理单元上有效执行的简单操作，可以获得更高的计算效率。

公开(公告)号：US08296515B1

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

申请号：US12639736

申请日：2009-12-16

申请人： Nirmal Raj Saxena ,  Mark A. Overby ,  Andrew Currid

发明人： Nirmal Raj Saxena ,  Mark A. Overby ,  Andrew Currid

IPC分类号： G06F11/10 ,  G06F12/16

CPC分类号： G06F11/1076 ,  G06F2211/1052 ,  G06F2211/1057 ,  H03M13/1575 ,  H03M13/2906 ,  H03M13/293

摘要： One embodiment of the present invention sets forth a technique for performing RAID-6 computations using simple arithmetic functions and two-dimensional table lookup operations. A set of threads within a multi-threaded processor are assigned to perform RAID-6 computations in parallel on a stripe of RAID-6 data. A set of lookup tables are stored within the multi-threaded processor for access by the threads in performing the RAID-6 computations. During normal operation of a related RAID-6 disk array, RAID-6 computations may be performed by the threads using a small set of simple arithmetic operations and a set of lookup operations to the lookup tables. Greater computational efficiency is gained by reducing the RAID-6 computations to simple operations that are performed efficiently on a multi-threaded processor, such as a graphics processing unit.

摘要翻译： 本发明的一个实施例提出了一种使用简单算术函数和二维表查找操作执行RAID-6计算的技术。 多线程处理器中的一组线程被分配以在RAID-6数据条上并行执行RAID-6计算。 一组查找表存储在多线程处理器中，用于在执行RAID-6计算时由线程访问。 在相关的RAID-6磁盘阵列的正常操作期间，线程可以使用一小组简单的算术运算和一组查找表的查找操作来执行RAID-6计算。 通过将RAID-6计算减少到在诸如图形处理单元的多线程处理器上有效执行的简单操作，可以获得更高的计算效率。

公开(公告)号：US07286550B2

公开(公告)日：2007-10-23

申请号：US10318769

申请日：2002-12-13

申请人： Prasad Modali ,  Nirmal Raj Saxena

发明人： Prasad Modali ,  Nirmal Raj Saxena

IPC分类号： H04L12/28

CPC分类号： H04L47/24 ,  H04L47/10 ,  H04L47/20 ,  H04L47/29 ,  H04L47/30 ,  H04L47/326

摘要： A system and method is provided for traffic management and regulation in a packet-based communication network, the system and method facilitating proactive, discriminating congestion control on a per flow basis of packets traversing the Internet via use of a Weighted Random Early Detection (WRED) algorithm that monitors the incoming packet queue and optimizes enqueuing or discard of incoming packets to stabilize queue length and promote efficient packet processing. During optimized discard conditions, the system and method discern a relative priority among incoming packets, distribute packets with a relatively high priority and discard packets with a relatively low priority. Additionally, packet traffic are policed and discarded according to packet type, quantity or other predetermined criteria. The present invention performs in periodic mode, demand mode or both, and can be implemented as a hardware solution, a software solution, or a combination thereof.

摘要翻译： 提供了一种用于基于分组的通信网络中的流量管理和调节的系统和方法，所述系统和方法通过使用加权随机早期检测（WRED）来促进主动地识别跨越因特网的分组的每流的拥塞控制， 该算法监视传入的数据包队列，并优化进入数据包的入队或丢弃，以稳定队列长度并促进高效的数据包处理。 在优化的丢弃条件下，系统和方法识别输入报文的相对优先级，分配具有较高优先级的报文，丢弃具有较低优先级的报文。 此外，根据分组类型，数量或其他预定标准对分组业务进行监管和丢弃。 本发明以周期模式，需求模式或两者都执行，并且可以被实现为硬件解决方案，软件解决方案或其组合。

公开(公告)号：US06687256B2

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

申请号：US10325104

申请日：2002-12-19

申请人： Prasad Modali ,  Anil Babu Nangunoori ,  Nirmal Raj Saxena

发明人： Prasad Modali ,  Anil Babu Nangunoori ,  Nirmal Raj Saxena

IPC分类号： H04L1228

CPC分类号： H04L47/10 ,  H04L47/28 ,  H04L47/36 ,  H04L49/90 ,  H04L49/901 ,  H04L49/9078 ,  H04L49/9084

摘要： The present invention provides a unique system and method for optimizing packet processing flow in a communications network by minimizing latency associated with packet-forwarding eligibility determinations. The present invention employs a speculative scheme with automatic recovery, including a two-way multithreaded implementation designed to overcome the aforementioned latency issue, including the functionality of enqueuing an incoming packet in both packet memory and a cut through buffer; determining the packet's eligibility for cutting through the buffer; and based on the determination, rolling back the unsuccessful process.

摘要翻译： 本发明提供了一种独特的系统和方法，用于通过最小化与分组转发资格确定相关联的延迟来优化通信网络中的分组处理流程。 本发明采用具有自动恢复的推测方案，包括旨在克服上述等待时间问题的双向多线程实现，包括在分组存储器和切入缓冲器中对输入分组进行排队的功能; 确定数据包是否有资格切入缓冲区; 并根据决定，回滚不成功的过程。