专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US06850969B2 Lock-free file system 失效
标题翻译：无锁文件系统
公开(公告)号：US06850969B2
公开(公告)日：2005-02-01
申请号：US10106486
申请日：2002-03-27
申请人： Edya Ladan-Mozes , Dan Touitou , Ohad Rodeh
发明人： Edya Ladan-Mozes , Dan Touitou , Ohad Rodeh
IPC分类号： G06F17/30 , G06F13/00
CPC分类号： G06F17/30168
摘要： A method for storage and retrieval of information includes coupling a plurality of clients to communicate with a storage device via a network, and reading out data from a selected location on the storage device to a memory of one of the clients. After the client has modified the data in the memory, the storage device determines whether the modified data can be written back to the selected location as part of an atomic operation together with the reading out and modifying of the data. The modified data is stored in the selected location only after verifying that the modified data can be written back to the selected location as part of the atomic operation.
摘要翻译：用于存储和检索信息的方法包括将多个客户端耦合以经由网络与存储设备进行通信，以及从存储设备上的选定位置读出数据到客户端之一的存储器。在客户端修改了存储器中的数据之后，存储设备确定修改的数据是否可以作为原子操作的一部分写回所选择的位置以及数据的读出和修改。修改的数据仅在验证修改的数据可以作为原子操作的一部分被写回到所选择的位置之后才被存储在所选择的位置。

2. 发明授权

US07389291B1 Implementing optimistic concurrent data structures 有权
标题翻译：实现乐观的并发数据结构
公开(公告)号：US07389291B1
公开(公告)日：2008-06-17
申请号：US10867843
申请日：2004-06-15
申请人： Nir N. Shavit , Edya Ladan-Mozes
发明人： Nir N. Shavit , Edya Ladan-Mozes
IPC分类号： G06F17/30
CPC分类号： G06F9/526 , Y10S707/99938 , Y10S707/99944
摘要： A concurrent FIFO queue is implemented as an “optimistic” doubly-linked list. Nodes of the optimistic doubly-linked list are allocated dynamically and links between the nodes are updated optimistically, i.e., assuming that threads concurrently accessing the FIFO queue will not interfere with each other, using a simple store operation. Concurrent, linearizable, and non-blocking enqueue and dequeue operations on the two ends of the doubly-linked list proceed independently, i.e., disjointly. These operations require only one successful single-word synchronization operation on the tail pointer and the head pointer of the doubly-linked list. If a bad ordering of operations on the optimistic FIFO queue by concurrently executing threads creates inconsistencies in the links between the nodes of the doubly-linked list, a fix-up process is invoked to correct the inconsistencies.
摘要翻译：并发FIFO队列被实现为“乐观”双向链表。动态地分配乐观双向链表的节点，并且乐观地更新节点之间的链接，即假设并发访问FIFO队列的线程将不会使用简单的存储操作相互干扰。双向链表的两端的并发，线性化和非阻塞入队和出队操作独立进行，即不相交。这些操作只需要在双向链表的尾指针和头指针上进行一次成功的单字同步操作。如果通过并发执行线程对乐观FIFO队列的操作的不良排序在双向链表的节点之间的链接中创建不一致，则调用修补过程来更正不一致。

3. 发明申请

US20060215564A1 Root-cause analysis of network performance problems 失效
公开(公告)号：US20060215564A1
公开(公告)日：2006-09-28
申请号：US11088054
申请日：2005-03-23
申请人： David Breitgand , Ealan Henis , Edya Ladan-Mozes , Onn Shehory , Elena Yerushalmi
发明人： David Breitgand , Ealan Henis , Edya Ladan-Mozes , Onn Shehory , Elena Yerushalmi
IPC分类号： H04L12/26 , H04J1/16
CPC分类号： H04L41/12 , H04L41/0631 , H04L41/18 , H04L43/0811
摘要： A method for diagnosing network performance problems includes providing a graph representing a topology of a network including first nodes that are classified as providers of a resource, second nodes that are classified as consumers of the resource, and third nodes that are classified as mediators intervening between the providers and the consumers. Responsively to a report of a performance problem encountered by a given consumer in the network, at least one input/output (I/O) path is traced through the graph connecting the given consumer to one or more of the providers. One or more problematic nodes are identified along the at least one I/O path as possible causes of the performance problem.

4. 发明授权

US07489639B2 Root-cause analysis of network performance problems 失效
标题翻译：网络性能问题的根本原因分析
公开(公告)号：US07489639B2
公开(公告)日：2009-02-10
申请号：US11088054
申请日：2005-03-23
申请人： David Breitgand , Ealan Henis , Edya Ladan-Mozes , Onn Shehory , Elena Yerushalmi
发明人： David Breitgand , Ealan Henis , Edya Ladan-Mozes , Onn Shehory , Elena Yerushalmi
IPC分类号： G01R31/08 , H04J1/16 , H04L12/16 , G06F15/173
CPC分类号： H04L41/12 , H04L41/0631 , H04L41/18 , H04L43/0811
摘要： A method for diagnosing network performance problems includes providing a graph representing a topology of a network including first nodes that are classified as providers of a resource, second nodes that are classified as consumers of the resource, and third nodes that are classified as mediators intervening between the providers and the consumers. Responsively to a report of a performance problem encountered by a given consumer in the network, at least one input/output (I/O) path is traced through the graph connecting the given consumer to one or more of the providers. One or more problematic nodes are identified along the at least one I/O path as possible causes of the performance problem.
摘要翻译：用于诊断网络性能问题的方法包括提供表示网络的拓扑的图，包括被分类为资源的提供者的第一节点，被分类为资源的消费者的第二节点以及被分类为介于供应商和消费者。响应于网络中给定消费者遇到的性能问题的报告，通过将给定消费者连接到一个或多个提供商的图来追踪至少一个输入/输出（I / O）路径。沿着至少一个I / O路径识别一个或多个有问题的节点作为性能问题的可能原因。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式