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

1. 发明授权

US07730222B2 Processing storage-related I/O requests using binary tree data structures 有权
标题翻译：使用二叉树数据结构处理与存储有关的I / O请求
公开(公告)号：US07730222B2
公开(公告)日：2010-06-01
申请号：US10924582
申请日：2004-08-24
申请人： Ron Passerini
发明人： Ron Passerini
IPC分类号： G06F3/00 , G06F9/00 , G06F9/44
CPC分类号： G06F3/0659 , G06F3/0611 , G06F3/0613 , G06F3/0656 , G06F3/0689 , G06F11/1456 , G06F11/1464 , G06F11/1469
摘要： The disclosed technology can be used to develop systems and perform methods that receive and process I/O requests directed to at least a part of a logical unit of storage. The I/O requests can be associated with different times corresponding to when such I/O requests were received. Nodes that include non-overlapping address ranges associated with the logical unit of storage can be formed in response to receiving the I/O requests and such nodes can be subsequently organized into a tree data structure. The tree data structure can serve as a basis for determining address overlap, for example to enable processing a first operation associated with a first one of the I/O requests in accordance with the first I/O request's receipt time, while one or more other operations associated with a different I/O request may be processed irrespective of that different I/O request's receipt time. This can be useful in a system in system operations are improved by easy access to information about whether pending I/O requests are directed to overlapping units of storage.
摘要翻译：所公开的技术可用于开发系统并执行接收和处理针对至少一部分逻辑存储单元的I / O请求的方法。 I / O请求可以与在接收到这种I / O请求时对应的不同时间相关联。可以响应于接收到I / O请求而形成包括与存储的逻辑单元相关联的非重叠地址范围的节点，并且这些节点可以随后被组织成树状数据结构。树数据结构可以用作确定地址重叠的基础，例如，以便能够根据第一I / O请求的接收时间处理与第一个I / O请求相关联的第一操作，而一个或多个其他可以处理与不同的I / O请求相关联的操作，而不管I / O请求的接收时间如何。这在系统中的系统操作可能是有用的，通过容易地访问关于挂起的I / O请求是否被定向到重叠的存储单元的信息来改进。

IPRDB

热门服务

关于我们

友情链接

联系方式