公开(公告)号：US20080189785A1

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

申请号：US12098256

申请日：2008-04-04

申请人： Bulent Abali ,  Mohammad Banikazemi ,  Dan Edward Poff

发明人： Bulent Abali ,  Mohammad Banikazemi ,  Dan Edward Poff

IPC分类号： G06F11/00

CPC分类号： G06F21/64 ,  G06F21/566 ,  G06F2221/2101 ,  G06F2221/2115

摘要： A method (and system) for detecting intrusions to stored data includes creating a point-time-copy of a logical unit, and comparing at least a portion of the point-time-copy with a previous copy of the logical unit. The method (and system) monitors access to a data storage system and detects an intrusion or any other intentional or unintentional, unwanted modification to data stored in the data storage system. The method (and system) also recovers data once an intrusion or other unwanted modification is detected.

摘要翻译： 用于检测对存储数据的入侵的方法（和系统）包括创建逻辑单元的点对位副本，以及将点 - 时 - 副本的至少一部分与逻辑单元的先前副本进行比较。 方法（和系统）监视对数据存储系统的访问，并检测对数据存储系统中存储的数据的入侵或任何其他有意或无意的不需要的修改。 一旦检测到入侵或其他不需要的修改，方法（和系统）也会恢复数据。

公开(公告)号：US08954683B2

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

申请号：US13587246

申请日：2012-08-16

申请人： Bulent Abali ,  James A. Marcella ,  Michael Mi Tsao ,  Steven M. Wheeler

发明人： Bulent Abali ,  James A. Marcella ,  Michael Mi Tsao ,  Steven M. Wheeler

IPC分类号： G06F12/00

CPC分类号： G06F12/10 ,  G06F12/0292 ,  G06F2212/1044 ,  G06F2212/656

摘要： A translation table has entries that each include a share bit and a delta bit, with pointers that point to a memory block that includes reuse bits. When two translation table entries reference identical fragments in a memory block, one of the translation table entries is changed to refer to the same memory block referenced in the other translation table entry, which frees up a memory block. The share bit is set to indicate a translation table entry is sharing its memory block with another translation table entry. In addition, a translation table entry may include a private delta in the form of a pointer that references a memory fragment in the memory block that is not shared with other translation table entries. When a translation table has a private delta, its delta bit is set.

摘要翻译： 转换表具有各自包括共享位和增量位的条目，指针指向包括重用位的存储器块。 当两个转换表条目引用存储器块中的相同片段时，转换表条目中的一个被改变以引用在另一个转换表条目中引用的相同的存储器块，这释放了存储器块。 共享位被设置为指示转换表条目与另一个转换表条目共享其存储器块。 此外，转换表条目可以包括引用存储器块中不与其他转换表条目共享的存储器片段的指针形式的专用增量。 当转换表具有专用增量时，其增量位被设置。

公开(公告)号：US20140047175A1

公开(公告)日：2014-02-13

申请号：US13570778

申请日：2012-08-09

申请人： Bulent Abali ,  Bruce L. Beukema ,  James A. Marcella ,  Paul G. Reuland ,  Michael M. Tsao

发明人： Bulent Abali ,  Bruce L. Beukema ,  James A. Marcella ,  Paul G. Reuland ,  Michael M. Tsao

IPC分类号： G06F12/00

CPC分类号： G06F12/0895 ,  G06F12/0802 ,  G06F12/0897 ,  G06F12/123 ,  G06F2212/304

摘要： A method and circuit for implementing a cache directory and efficient cache tag lookup in very large cache systems, and a design structure on which the subject circuit resides are provided. A tag cache includes a fast partial large (LX) cache directory maintained separately on chip apart from a main LX cache directory (LXDIR) stored off chip in dynamic random access memory (DRAM) with large cache data (LXDATA). The tag cache stores most frequently accessed LXDIR tags. The tag cache contains predefined information enabling access to LXDATA directly on tag cache hit with matching address and data present in the LX cache. Only on tag cache misses the LXDIR is accessed to reach LXDATA.

摘要翻译： 一种用于在非常大的缓存系统中实现高速缓存目录和高效缓存标签查找的方法和电路，以及提供了主题电路所在的设计结构。 标签高速缓存包括除了存储在具有大缓存数据（LXDATA）的动态随机存取存储器（DRAM）中的芯片外的主LX高速缓存目录（LXDIR）之外分开保存的快速部分大（LX）高速缓存目录。 标签缓存存储最常访问的LXDIR标签。 标签缓存包含预定义信息，可以直接在标签缓存命中上访问LXDATA，匹配地址和LX缓存中存在的数据。 只有在标签缓存未命中时才能访问LXDIR以达到LXDATA。

公开(公告)号：US07558248B2

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

申请号：US11353429

申请日：2006-02-14

申请人： Aruna V. Ramanan ,  Bulent Abali

发明人： Aruna V. Ramanan ,  Bulent Abali

IPC分类号： H04L12/28

CPC分类号： H04L45/00 ,  H04L45/12 ,  H04L45/24

摘要： A fanning route generation technique is provided for multi-path networks having a shared communications fabric. The technique includes selecting a source node—destination node (S-D) group having common starting and ending sets of links from the network of interconnected nodes. Within this group, selecting the shortest routes between the S-D nodes of the group so that: selected routes substantially uniformly fan out from the source node to a center of the network and fan in from the center of the network to the destination node, thereby achieving local balance; and global balance of routes passing through links that are at a same level of the network is achieved.

摘要翻译： 为具有共享通信结构的多路径网络提供扇区路由生成技术。 该技术包括从互连节点的网络中选择具有共同起始和结束的链路集合的源节点 - 目的地节点（S-D）组。 在该组内，选择组中SD节点之间的最短路由，使得所选路由从源节点大量均匀地从网络中心扇出到网络中心，并从网络中心到目的节点，从而实现 当地平衡; 实现通过网络同级链路的路由的全局平衡。

公开(公告)号：US20050235007A1

公开(公告)日：2005-10-20

申请号：US10826455

申请日：2004-04-16

申请人： Bulent Abali ,  Robert Saccone

发明人： Bulent Abali ,  Robert Saccone

IPC分类号： G06F17/30

CPC分类号： G06F11/1482 ,  G06F11/0712 ,  G06F11/0748 ,  G06F11/079

摘要： A diagnostic system and method for repairing computing devices comprises a diagnostic application running on a same computing system having a failed operating system (O/S). The diagnostic application is provided with access to the file system of the failed O/S image. The diagnostic software application collects relevant configuration information from the file system of the failed O/S image, and transports this information to a proxy system running the same operating system as the computing device being diagnosed. The proxy system utilizes the collected data to diagnose the subject failed O/S system. Once the proxy makes a determination it synthesizes repair information comprising new or modified files and instructions to be transported back to the diagnostic software system to apply. A network connection is provided between the computer running the diagnostic application and the proxy system that enables data to be easily transported between the two systems without human intervention.

摘要翻译： 用于修复计算设备的诊断系统和方法包括在具有故障操作系统（O / S）的同一计算系统上运行的诊断应用。 诊断应用程序可以访问失败的O / S映像的文件系统。 诊断软件应用程序从故障O / S映像的文件系统收集相关配置信息，并将该信息传输到运行与被诊断的计算设备相同的操作系统的代理系统。 代理系统利用收集的数据来诊断主体失败的O / S系统。 一旦代理确定，它将包括新的或修改的文件的修复信息和要被运送回诊断软件系统的指令进行合成。 在运行诊断应用的计算机和代理系统之间提供网络连接，使得能够在没有人为干预的情况下在两个系统之间容易地传输数据。

公开(公告)号：US06065063A

公开(公告)日：2000-05-16

申请号：US15593

申请日：1998-01-29

申请人： Bulent Abali

发明人： Bulent Abali

IPC分类号： G06F11/00

CPC分类号： G06F15/17375 ,  G06F11/1423

摘要： In an apparatus having a network including successive stages of cross-point switches which collectively interconnect a plurality of nodes external to said network, wherein at least one message is carried between one of the nodes and one of the cross-point switches over a route through said network, a method for preventing routing deadlocks from occurring in the network which comprises the steps of: creating a graphical representation of the network; searching for the existence of cycles within the graphical representation; partitioning the graphical representation into at a first subgraph and a second subgraph if cycles exist in the graphical representation; searching for the existence of edges directed from the first subgraph to the second subgraph; and removing the edges directed from the first subgraph to the second subgraph. Preferably the step of partitioning the network into at a first subgraph and a second subgraph is performed such that the first subgraph and the second subgraph have an equal number of vertices, a number of directed edges from the first subgraph to the second subgraph is minimized so as to minimize the number of routes prohibited, and a set of partition constraints are satisfied. The method is recursively applied to the first subgraph and then the second subgraph, thereby removing all of the deadlock prone cycles in the network while minimizing the number of routes prohibited due to remove edges.

摘要翻译： 在具有网络的设备中，该网络包括将所述网络外部的多个节点共同互连的交叉点交换机的连续级，其中，在一个节点与一个交叉点交换机之间通过一条路由上携带至少一个消息 所述网络是防止网络中发生路由死锁的方法，包括以下步骤：创建网络的图形表示; 在图形表示中搜索循环的存在; 如果在图形表示中存在周期，则将图形表示分割成第一子图和第二子图; 搜索从第一子图指向的第二子图的边缘的存在; 以及将从第一子图指向的边缘移除到第二子图。 优选地，将网络划分成第一子图和第二子图的步骤被执行，使得第一子图和第二子图具有相等数量的顶点，从第一子图到第二子图的多个有向边被最小化 以最小化禁止的路由数量，并且满足一组分区约束。 该方法递归地应用于第一子图，然后递归地应用于第二子图，从而消除网络中的所有死锁倾向周期，同时最小化由于移除边缘而禁止的路由的数量。

公开(公告)号：US09424194B2

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

申请号：US13460873

申请日：2012-05-01

申请人： Bulent Abali ,  John Dodson ,  Moinuddin K. Qureshi ,  Balaram Sinharoy

发明人： Bulent Abali ,  John Dodson ,  Moinuddin K. Qureshi ,  Balaram Sinharoy

IPC分类号： G06F12/02 ,  G06F12/08 ,  G06F12/12

CPC分类号： G06F12/0864 ,  G06F12/0873 ,  G06F12/0895 ,  G06F12/121 ,  G06F12/128 ,  G06F2212/1016 ,  G06F2212/1056 ,  G06F2212/281 ,  G06F2212/305 ,  G06F2212/313 ,  G06F2212/6032 ,  G06F2212/6082

摘要： A computer cache memory organization called Probabilistic Set Associative Cache (PAC) has the hardware complexity and latency of a direct-mapped cache but functions as a set-associative cache for a fraction of the time, thus yielding better than direct mapped cache hit rates. The organization is considered a (1+P)—way set associative cache, where the chosen parameter called Override Probability P determines the average associativity, for example, for P=0.1, effectively it operates as if a 1.1-way set associative cache.

摘要翻译： 称为概率集关联缓存（PAC）的计算机高速缓冲存储器组织具有直接映射高速缓存的硬件复杂性和延迟，但在一小部分时间内用作集合关联高速缓存，从而比直接映射高速缓存命中率更好。 该组织被认为是（1 + P）组合关联高速缓存，其中所选择的参数“覆盖概率P”决定了平均关联性，例如，对于P = 0.1，其实际上它像1.1路组合关联高速缓存一样运行。

公开(公告)号：US08775776B2

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

申请号：US13352410

申请日：2012-01-18

申请人： Bulent Abali ,  John J. Reilly

发明人： Bulent Abali ,  John J. Reilly

IPC分类号： G06F12/00

CPC分类号： G06F17/30097

摘要： A hash table method and structure comprises a processor that receives a plurality of access requests for access to a storage device. The processor performs a plurality of hash processes on the access requests to generate a first number of addresses for each access request. Such addresses are within a full address range. Hash table banks are operatively connected to the processor. The hash table banks form the storage device. Each of the hash table banks has a plurality of input ports. Specifically, each of the hash table banks has less input ports than the first number of addresses for each access request. The processor provides the addresses to the hash table banks, and each of the hash table banks stores pointers corresponding to a different limited range of addresses within the full address range (each of the different limited range of addresses is less than the full address range).

摘要翻译： 哈希表方法和结构包括接收多个访问存储设备的访问请求的处理器。 处理器对访问请求执行多个哈希处理，以为每个访问请求生成第一数量的地址。 这样的地址在一个完整的地址范围内。 哈希表库可操作地连接到处理器。 哈希表库形成存储设备。 每个散列表组具有多个输入端口。 具体地说，每个哈希表组对于每个访问请求具有比第一数量的地址少的输入端口。 处理器向散列表组提供地址，并且每个散列表存储体存储对应于在完整地址范围内的不同有限范围的地址的指针（每个不同的有限的地址范围小于全地址范围） 。

公开(公告)号：US20130297879A1

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

申请号：US13460873

申请日：2012-05-01

申请人： Bulent Abali ,  John S. Dodson ,  Moinuddin K. Qureshi ,  Balaram Sinharoy

发明人： Bulent Abali ,  John S. Dodson ,  Moinuddin K. Qureshi ,  Balaram Sinharoy

IPC分类号： G06F12/08

CPC分类号： G06F12/0864 ,  G06F12/0873 ,  G06F12/0895 ,  G06F12/121 ,  G06F12/128 ,  G06F2212/1016 ,  G06F2212/1056 ,  G06F2212/281 ,  G06F2212/305 ,  G06F2212/313 ,  G06F2212/6032 ,  G06F2212/6082

摘要： A computer cache memory organization called Probabilistic Set Associative Cache (PAC) has the hardware complexity and latency of a direct-mapped cache but functions as a set-associative cache for a fraction of the time, thus yielding better than direct mapped cache hit rates. The organization is considered a (1+P)—way set associative cache, where the chosen parameter called Override Probability P determines the average associativity, for example, for P=0.1, effectively it operates as if a 1.1-way set associative cache.

摘要翻译： 称为概率集关联缓存（PAC）的计算机高速缓冲存储器组织具有直接映射高速缓存的硬件复杂性和延迟，但在一小部分时间内用作集合关联高速缓存，从而比直接映射高速缓存命中率更好。 该组织被认为是（1 + P）组合关联高速缓存，其中所选择的参数“覆盖概率P”决定了平均关联性，例如，对于P = 0.1，其实际上它像1.1路组合关联高速缓存一样运行。

公开(公告)号：US20080189432A1

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

申请号：US11670490

申请日：2007-02-02

申请人： Bulent Abali ,  Jiuxing Liu

发明人： Bulent Abali ,  Jiuxing Liu

IPC分类号： G06F15/173

CPC分类号： H04L67/34 ,  G06F9/4856 ,  H04L29/06

摘要： A virtual machine (VM) is migrated from a physical source node to a physical destination node in an InfiniBand network. A virtual host channel adapter (VHCA) is allocated on the source node for the VM to be migrated. The VHCA is suspended and put into the inactive state. The state information of the VM, including VHCA state information, is saved in a location-transparent manner. The state information is transferred from the source node to the destination node. A new VM is created, and a VHCA is allocated for the new VM on the destination node. The state information is transferred from the source node, including the VHCA state information. The routing and switching information is updated, operation of the VM is resumed, and the VHCA is put into an active state.

摘要翻译： 虚拟机（VM）从物理源节点迁移到InfiniBand网络中的物理目标节点。 在要迁移的VM的源节点上分配虚拟主机通道适配器（VHCA）。 VHCA暂停并处于非活动状态。 虚拟机的状态信息（包括VHCA状态信息）以位置透明的方式被保存。 状态信息从源节点传送到目标节点。 创建一个新的虚拟机，并为目标节点上的新虚拟机分配VHCA。 状态信息从源节点传送，包括VHCA状态信息。 更新路由和切换信息，恢复VM的操作，并使VHCA进入活动状态。