公开(公告)号：US07355980B2

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

申请号：US10432453

申请日：2001-11-12

申请人： Daniel Bauer ,  John N. Daigle ,  Ilias Iliadis ,  Paolo Scotton

发明人： Daniel Bauer ,  John N. Daigle ,  Ilias Iliadis ,  Paolo Scotton

IPC分类号： H04L12/28

CPC分类号： H04Q11/0478 ,  H04L45/124

摘要： A method for deriving a set of efficient path costs for a group of nodes comprising a source node and a plurality of destination nodes in a data communications networks, wherein the path costs for paths between nodes in the group are defined in the network and each path cost comprises a restrictive cost and an additive cost, comprises iteratively identifying the paths of higher bandwidth first and, when two or more paths of equal bandwidth are encountered, selecting the path having a lower transit delay associated therewith.

摘要翻译： 一种用于导出包括数据通信网络中的源节点和多个目的地节点的节点组的一组有效路径成本的方法，其中，所述组中的节点之间的路径的路径开销在网络中定义，并且每个路径 成本包括限制性成本和附加成本，包括首先迭代地识别较高带宽的路径，并且当遇到两个或更多个相等带宽的路径时，选择具有与之相关联的较低传输延迟的路径。

公开(公告)号：US06744734B1

公开(公告)日：2004-06-01

申请号：US09385951

申请日：1999-08-30

申请人： Ilias Iliadis ,  Paolo Scotton

发明人： Ilias Iliadis ,  Paolo Scotton

IPC分类号： H04J314

CPC分类号： H04L45/10 ,  H04L2012/562 ,  H04L2012/5621 ,  H04Q11/0478

摘要： A method for constructing the set of optimal complex node representations of a PNNI peer group based on a restrictive cost database (e.g. a cost matrix) associated with the border nodes. The resulting set of complex node representations is the optimal in that it contains all the possible complex node representations that use the minimum possible number of exception bypasses.

摘要翻译： 一种用于基于与边界节点相关联的限制性成本数据库（例如，成本矩阵）来构造PNNI对等体组的最优复合节点集合的方法。 所得到的复杂节点表示集是最优的，因为它包含使用最小可能数量的异常绕过的所有可能的复杂节点表示。

公开(公告)号：US07120681B2

公开(公告)日：2006-10-10

申请号：US10059638

申请日：2002-01-29

申请人： Laurent Frelechoux ,  Michael Osborne ,  Paolo Scotton ,  Ilias Iliadis

发明人： Laurent Frelechoux ,  Michael Osborne ,  Paolo Scotton ,  Ilias Iliadis

IPC分类号： G06F15/177 ,  H04Q7/00

CPC分类号： H04W40/246 ,  H04L45/04 ,  H04L45/46 ,  H04W4/06 ,  H04W8/24 ,  H04W40/32 ,  H04W84/18

摘要： Methods and apparatus are provided for controlling the clustering of nodes which implement a cluster-based routing protocol in a data communications network system where the system comprises a plurality of such nodes which are interconnectable to form a plurality of ad hoc networks. For each node which is a member of a cluster, cluster control information (CCMs) is maintained, this cluster control information being dependent on the size of at least the cluster of which that node is a member. On connection of two nodes which are members of two respective clusters, each of the two nodes transmits its cluster control information to the other node, and then determines whether a clustering condition is satisfied. In each node, the clustering condition is dependent on the cluster control information maintained for that node and the cluster control information received from the other node. In each node, if the clustering condition is satisfied, the node then communicates a clustering agreement to the other node. If the clustering conditions of both nodes are satisfied for the two clusters, the two nodes exchange routing information to merge the two clusters.

公开(公告)号：US09170933B2

公开(公告)日：2015-10-27

申请号：US13700545

申请日：2011-06-06

申请人： Roy D. Cideciyan ,  Evangelos S. Eleftheriou ,  Robert Haas ,  Xiao-Yu Hu ,  Ilias Iliadis ,  Roman Pletka

发明人： Roy D. Cideciyan ,  Evangelos S. Eleftheriou ,  Robert Haas ,  Xiao-Yu Hu ,  Ilias Iliadis ,  Roman Pletka

IPC分类号： G06F9/312 ,  G06F12/02 ,  G11C16/34

CPC分类号： G06F12/0246 ,  G06F2212/7211 ,  G11C16/3495

摘要： A method for wear-leveling cells, pages, sub-pages or blocks of a memory such as a flash memory includes receiving (S10) a chunk of data to be written on the cell, page, sub-page or block of the memory; counting (S40), in the received chunk of data, a number of times a given type of binary data ‘0’ or ‘1’ is to be written; and distributing (S50) the writing of the received chunk of data among cells, pages, sub-pages or blocks of the memory such as to wear-level the memory with respect to the number of the given type of binary data ‘0’ or ‘1’ counted in the chunk of data to be written.

摘要翻译： 一种用于对诸如闪速存储器的存储器的单元，页，子页或块进行磨损均衡的方法包括：接收（S10）要写入存储器的单元，页，子页或块的数据块; 在接收到的数据块中计数（S40）多少次给定类型的二进制数据“0”或“1”被写入; 并且分配（S50）在所述存储器的单元，页面，子页面或块之间写入所接收的数据块，以便相对于给定类型的二进制数据“0”的数量对存储器进行磨损级别 “1”计入要写入的数据块中。

公开(公告)号：US08799561B2

公开(公告)日：2014-08-05

申请号：US13560065

申请日：2012-07-27

申请人： Werner Bux ,  Robert Haas ,  Xiao-Yu Hu ,  Ilias Iliadis

发明人： Werner Bux ,  Robert Haas ,  Xiao-Yu Hu ,  Ilias Iliadis

IPC分类号： G06F12/02

CPC分类号： G06F12/0246 ,  G06F12/0253 ,  G06F12/0261 ,  G06F2212/7205

摘要： A method for garbage collection in a solid state drive (SSD) includes determining whether the SSD is idle by a garbage collection module of the SSD; based on determining that the SSD is idle, determining a victim block from a plurality of memory blocks of the SSD; determining a number of valid pages in the victim block; comparing the determined number of valid pages in the victim block to a valid page threshold; and based on the number of valid pages in the victim block being less than the valid page threshold, issuing a garbage collection request for the victim block.

摘要翻译： 一种在固态硬盘（SSD）中进行垃圾收集的方法，包括：通过SSD的垃圾收集模块确定SSD是否空闲; 基于确定所述SSD是空闲的，从所述SSD的多个存储块中确定受害者块; 确定受害者块中的有效页数; 将确定的受害者块中的有效页面数量与有效页面阈值进行比较; 并且基于受害者块中的有效页面的数量小于有效页面阈值，向受害者块发布垃圾回收请求。

公开(公告)号：US08495471B2

公开(公告)日：2013-07-23

申请号：US12627364

申请日：2009-11-30

申请人： Theodore A. Antonakopoulos ,  Roy D. Cideciyan ,  Evangelos S. Eleftheriou ,  Robert Haas ,  Xiao-Yu Hu ,  Ilias Iliadis

发明人： Theodore A. Antonakopoulos ,  Roy D. Cideciyan ,  Evangelos S. Eleftheriou ,  Robert Haas ,  Xiao-Yu Hu ,  Ilias Iliadis

IPC分类号： G11C29/00

CPC分类号： G06F11/1028 ,  G11C29/765

摘要： Systems and methods are provided that confront the problem of failed storage integrated circuits (ICs) in a solid state drive (SSD) by using a fault-tolerant architecture along with one error correction code (ECC) mechanism for random/burst error corrections and an L-fold interleaving mechanism. The systems and methods described herein keep the SSD operational when one or more integrated circuits fail and allow the recovery of previously stored data from failed integrated circuits and allow random/burst errors to be corrected in other operational integrated circuits. These systems and methods replace the failed integrated circuits with fully functional/operational integrated circuits treated herein as spare integrated circuits. Furthermore, these systems and methods improve I/O performance in terms of maximum achievable read/write data rate.

摘要翻译： 提供了通过使用容错架构以及用于随机/突发错误校正的一个纠错码（ECC）机制来解决固态驱动器（SSD）中的故障存储集成电路（IC）的问题的系统和方法，以及 L折叠交织机制。 当一个或多个集成电路出现故障并且允许从故障集成电路恢复先前存储的数据并且允许在其他操作集成电路中校正随机/突发错误时，本文描述的系统和方法保持SSD的可操作性。 这些系统和方法用作为备用集成电路处理的全功能/可操作集成电路来代替故障集成电路。 此外，这些系统和方法在最大可实现的读/写数据速率方面提高了I / O性能。

公开(公告)号：US08495281B2

公开(公告)日：2013-07-23

申请号：US12630991

申请日：2009-12-04

申请人： Ilias Iliadis ,  Theodoros A. Antonakopoulos ,  Roman Pletka ,  Xiao-Yu Hu ,  Roy D. Cideciyan

发明人： Ilias Iliadis ,  Theodoros A. Antonakopoulos ,  Roman Pletka ,  Xiao-Yu Hu ,  Roy D. Cideciyan

IPC分类号： G06F12/00

CPC分类号： G06F12/0246 ,  G06F3/0616 ,  G06F3/064 ,  G06F3/0679 ,  G06F2212/7211

摘要： A method for intra-block wear leveling within solid-state memory subjected to wear, having a plurality of memory cells includes the step of writing to at least certain ones of the plurality of memory cells, in a non-uniform manner, such as to balance the wear of the at least certain ones of the plurality of memory cells within the solid-state memory, at intra-block level. For example, if a behavior of at least some of the plurality of memory cells is not characterized, then the method may comprise characterizing a behavior of at least some of the plurality of memory cells and writing to at least certain ones of the plurality of memory cells, based on the characterized behavior, and in a non-uniform manner.

摘要翻译： 在具有多个存储单元的固态存储器内部进行具有多个存储单元的固态存储器内的块内损耗均衡的方法包括以非均匀方式写入多个存储单元中的至少某些存储单元的步骤， 在块内级别平衡固态存储器内的多个存储单元中的至少某些存储器单元的磨损。 例如，如果多个存储器单元中的至少一些存储器单元的行为没有被表征，则该方法可以包括表征多个存储器单元中的至少一些的行为，并写入多个存储器中的至少某些存储器 基于表征的行为，并且以不均匀的方式。

公开(公告)号：US20130166827A1

公开(公告)日：2013-06-27

申请号：US13700545

申请日：2011-06-06

申请人： Roy D. Cideciyan ,  Evangelos S. Eleftheriou ,  Robert Haas ,  Xiao-Yu Hu ,  Ilias Iliadis ,  Roman Pletka

发明人： Roy D. Cideciyan ,  Evangelos S. Eleftheriou ,  Robert Haas ,  Xiao-Yu Hu ,  Ilias Iliadis ,  Roman Pletka

IPC分类号： G06F12/02

CPC分类号： G06F12/0246 ,  G06F2212/7211 ,  G11C16/3495

摘要： The invention is directed to a method for wear-leveling cells or pages or sub-pages or blocks of a memory such as a flash memory, the method comprising:—receiving (S10) a chunk of data to be written on a cell or page or sub-page or block of the memory;—counting (S40) in the received chunk of data the number of times a given type of binary data ‘0’ or ‘I’ is to be written; and—distributing (S50) the writing of the received chunk of data amongst cells or pages or sub-pages or blocks of the memory such as to wear-level the memory with respect to the number of the given type of binary data ‘0’ or ‘I’ counted in the chunk of data to be written.

摘要翻译： 本发明涉及一种用于对诸如闪速存储器的存储器的单元格或页面或子页面或块进行磨损均衡的方法，所述方法包括： - 接收（S10）要写入单元或页面的数据块 或存储器的子页面或块; - 在接收的数据块中记录给定类型的二进制数据“0”或“I”的次数（S40）; （S50）在存储器的单元格或页面或子页面或块之间写入所接收的数据块，以便相对于给定类型的二进制数据“0”的数量对存储器进行磨损级别 或者“我”在要写入的数据块中计数。

公开(公告)号：US20120297123A1

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

申请号：US13469148

申请日：2012-05-11

申请人： Giovanni Cherubini ,  Ilias Iliadis

发明人： Giovanni Cherubini ,  Ilias Iliadis

IPC分类号： G06F12/00

CPC分类号： G06F12/0246 ,  G06F2212/7211

摘要： A method for operating a computer memory. The memory is organized to store data in units of such memory. For each unit of a set of units a wear level of the unit is determined. A maximum wear level among the wear levels is determined. A suggestion of a subset of one or more units for being selected for data erasure is received and at least one unit in the subset is identified for subsequent data erasure, a wear level (c(i)) of which units (i) is less than the maximum wear level (c_max).

摘要翻译： 一种用于操作计算机存储器的方法。 存储器被组织以以这种存储器的单元存储数据。 对于一组单元的每个单元，确定单元的磨损水平。 确定磨损水平之间的最大磨损水平。 接收用于被选择用于数据擦除的一个或多个单元的子集的建议，并且识别子集中的至少一个单元用于随后的数据擦除，其中单元（i）的磨损水平（c（i））较小 超过最大磨损水平（c_max）。

公开(公告)号：US08135024B2

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

申请号：US11402091

申请日：2006-04-10

申请人： Francois G Abel ,  Alan F Benner ,  Richard R Grzybowski ,  Brewster Roe Hemenway, Jr. ,  Ilias Iliadis ,  Rajaram Krishnamurthy ,  Ronald P Luijten ,  Cyriel Minkenberg

发明人： Francois G Abel ,  Alan F Benner ,  Richard R Grzybowski ,  Brewster Roe Hemenway, Jr. ,  Ilias Iliadis ,  Rajaram Krishnamurthy ,  Ronald P Luijten ,  Cyriel Minkenberg

IPC分类号： H04L12/56

CPC分类号： H04L45/00 ,  H04L12/417 ,  H04L43/087 ,  H04L45/62 ,  H04L47/50 ,  H04L47/58 ,  H04L49/254 ,  H04L49/3027 ,  H04L49/508

摘要： A method and system for reducing arbitration latency employs speculative transmission (STX) without prior arbitration in combination with routing fabric scheduled arbitration. Packets are sent from source locations to a routing fabric through scheduled arbitration, and also through speculative arbitration, to non-contentiously allocate outputs that were not previously reserved in the routing fabric to the speculatively transmitted packets.

摘要翻译： 用于减少仲裁延迟的方法和系统使用推测传输（STX）而没有预先仲裁并结合路由结构调度仲裁。 数据包通过调度仲裁从源位置发送到路由结构，并通过推测性仲裁，将非先前在路由结构中保留的输出非争用地分配给推测性传输的数据包。