Virtualized data storage system optimizations

Virtualized data storage system optimizations

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 laten...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: MANJUNATH CHINMAYA, UPPUGANDLA DILIP KUMAR, WU DAVID TZE-SI, KINI ADITYASHANKAR, NGUYEN HUY
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator MANJUNATH CHINMAYA
UPPUGANDLA DILIP KUMAR
WU DAVID TZE-SI
KINI ADITYASHANKAR
NGUYEN HUY
description 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.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US9348842B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US9348842B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US9348842B23</originalsourceid><addsrcrecordid>eNrjZNANyywqKU3MyaxKTVFISSxJVCguyS9KTE9VKK4sLknNVcgvKMnMzaxKLMnMzyvmYWBNS8wpTuWF0twMCm6uIc4euqkF-fGpxQWJyal5qSXxocGWxiYWFiZGTkbGRCgBANAsKtM</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Virtualized data storage system optimizations</title><source>esp@cenet</source><creator>MANJUNATH CHINMAYA ; UPPUGANDLA DILIP KUMAR ; WU DAVID TZE-SI ; KINI ADITYASHANKAR ; NGUYEN HUY</creator><creatorcontrib>MANJUNATH CHINMAYA ; UPPUGANDLA DILIP KUMAR ; WU DAVID TZE-SI ; KINI ADITYASHANKAR ; NGUYEN HUY</creatorcontrib><description>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.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2016</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20160524&amp;DB=EPODOC&amp;CC=US&amp;NR=9348842B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20160524&amp;DB=EPODOC&amp;CC=US&amp;NR=9348842B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>MANJUNATH CHINMAYA</creatorcontrib><creatorcontrib>UPPUGANDLA DILIP KUMAR</creatorcontrib><creatorcontrib>WU DAVID TZE-SI</creatorcontrib><creatorcontrib>KINI ADITYASHANKAR</creatorcontrib><creatorcontrib>NGUYEN HUY</creatorcontrib><title>Virtualized data storage system optimizations</title><description>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.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2016</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZNANyywqKU3MyaxKTVFISSxJVCguyS9KTE9VKK4sLknNVcgvKMnMzaxKLMnMzyvmYWBNS8wpTuWF0twMCm6uIc4euqkF-fGpxQWJyal5qSXxocGWxiYWFiZGTkbGRCgBANAsKtM</recordid><startdate>20160524</startdate><enddate>20160524</enddate><creator>MANJUNATH CHINMAYA</creator><creator>UPPUGANDLA DILIP KUMAR</creator><creator>WU DAVID TZE-SI</creator><creator>KINI ADITYASHANKAR</creator><creator>NGUYEN HUY</creator><scope>EVB</scope></search><sort><creationdate>20160524</creationdate><title>Virtualized data storage system optimizations</title><author>MANJUNATH CHINMAYA ; UPPUGANDLA DILIP KUMAR ; WU DAVID TZE-SI ; KINI ADITYASHANKAR ; NGUYEN HUY</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US9348842B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2016</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>MANJUNATH CHINMAYA</creatorcontrib><creatorcontrib>UPPUGANDLA DILIP KUMAR</creatorcontrib><creatorcontrib>WU DAVID TZE-SI</creatorcontrib><creatorcontrib>KINI ADITYASHANKAR</creatorcontrib><creatorcontrib>NGUYEN HUY</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>MANJUNATH CHINMAYA</au><au>UPPUGANDLA DILIP KUMAR</au><au>WU DAVID TZE-SI</au><au>KINI ADITYASHANKAR</au><au>NGUYEN HUY</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Virtualized data storage system optimizations</title><date>2016-05-24</date><risdate>2016</risdate><abstract>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.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US9348842B2
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Virtualized data storage system optimizations
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T01%3A44%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=MANJUNATH%20CHINMAYA&rft.date=2016-05-24&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS9348842B2%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true