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

1. 发明申请

US20100241654A1 VIRTUALIZED DATA STORAGE SYSTEM OPTIMIZATIONS 有权
标题翻译：虚拟化数据存储系统优化
公开(公告)号：US20100241654A1
公开(公告)日：2010-09-23
申请号：US12730198
申请日：2010-03-23
申请人： David Tze-Si Wu , Huy Nguyen , Adityashankar Kini , Dilip Kumar Uppugandla , Chinmaya Manjunath
发明人： David Tze-Si Wu , Huy Nguyen , Adityashankar Kini , Dilip Kumar Uppugandla , Chinmaya Manjunath
IPC分类号： G06F17/30
CPC分类号： G06F17/30233 , G06F3/0643 , G06F3/0653 , G06F3/067 , G06F12/0862 , G06F17/30132 , G06F2212/6024
摘要： Virtual storage arrays consolidate branch data storage at data centers connected via wide area networks. Virtual storage arrays appear to storage clients as local data storage; however, virtual storage arrays actually store data at the data center. Virtual storage arrays overcome bandwidth and latency limitations of the wide area network by predicting and prefetching storage blocks, which are then cached at the branch location. Virtual storage arrays leverage an understanding of the semantics and structure of high-level data structures associated with storage blocks to predict which storage blocks are likely to be requested by a storage client. Virtual storage arrays may use proximity-based, heuristic-based, and access time-based prefetching to predict high-level data structure entities that are likely to be accessed by the storage client. Virtual storage arrays then identify and prefetch storage blocks corresponding with the predicted high-level data structure entities.
摘要翻译：虚拟存储阵列将通过广域网连接的数据中心的分支数据存储整合。虚拟存储阵列对存储客户端显示为本地数据存储; 然而，虚拟存储阵列实际上将数据存储在数据中心。虚拟存储阵列通过预测和预取存储块来克服广域网的带宽和延迟限制，然后将存储块缓存在分支位置。虚拟存储阵列利用对与存储块相关联的高级数据结构的语义和结构的理解，以预测存储客户端可能请求哪些存储块。虚拟存储阵列可以使用基于邻近的，基于启发式的和基于时间的访问预取来预测存储客户机可能访问的高级数据结构实体。然后，虚拟存储阵列识别并预取与预测的高级数据结构实体相对应的存储块。

2. 发明授权

US09348842B2 Virtualized data storage system optimizations 有权
标题翻译：虚拟化数据存储系统优化
公开(公告)号：US09348842B2
公开(公告)日：2016-05-24
申请号：US12730198
申请日：2010-03-23
申请人： David Tze-Si Wu , Huy Nguyen , Adityashankar Kini , Dilip Kumar Uppugandla , Chinmaya Manjunath
发明人： David Tze-Si Wu , Huy Nguyen , Adityashankar Kini , Dilip Kumar Uppugandla , Chinmaya Manjunath
IPC分类号： G06F17/30 , G06F12/08 , G06F15/16 , G06F3/06
CPC分类号： G06F17/30233 , G06F3/0643 , G06F3/0653 , G06F3/067 , G06F12/0862 , G06F17/30132 , G06F2212/6024
摘要： Virtual storage arrays consolidate branch data storage at data centers connected via wide area networks. Virtual storage arrays appear to storage clients as local data storage; however, virtual storage arrays actually store data at the data center. Virtual storage arrays overcome bandwidth and latency limitations of the wide area network by predicting and prefetching storage blocks, which are then cached at the branch location. Virtual storage arrays leverage an understanding of the semantics and structure of high-level data structures associated with storage blocks to predict which storage blocks are likely to be requested by a storage client. Virtual storage arrays may use proximity-based, heuristic-based, and access time-based prefetching to predict high-level data structure entities that are likely to be accessed by the storage client. Virtual storage arrays then identify and prefetch storage blocks corresponding with the predicted high-level data structure entities.
摘要翻译：虚拟存储阵列将通过广域网连接的数据中心的分支数据存储整合。虚拟存储阵列对存储客户端显示为本地数据存储; 然而，虚拟存储阵列实际上将数据存储在数据中心。虚拟存储阵列通过预测和预取存储块来克服广域网的带宽和延迟限制，然后将存储块缓存在分支位置。虚拟存储阵列利用对与存储块相关联的高级数据结构的语义和结构的理解，以预测存储客户端可能请求哪些存储块。虚拟存储阵列可以使用基于邻近的，基于启发式的和基于时间的访问预取来预测存储客户机可能访问的高级数据结构实体。然后，虚拟存储阵列识别并预取与预测的高级数据结构实体相对应的存储块。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式