SHARDING OVER MULTI-LINK DATA CHANNELS
Sharding a data unit across storage locations (e.g., data centers, clusters, accounts, and so forth). For each locations, the multi-link traffic constraints in data channeling with the storage location are identified. For instance, for a given data channel leading to and/or from a storage location,...
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| 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 | GAGNE, Joseph M SRIDHARAN, Baskar RAMAKRISHNAN, Raghunath KUMAR KASTURI, Sri Sai Kameswara Pavan TELIDEVARA, Aditya MICHAYLOV, Spiro |
| description | Sharding a data unit across storage locations (e.g., data centers, clusters, accounts, and so forth). For each locations, the multi-link traffic constraints in data channeling with the storage location are identified. For instance, for a given data channel leading to and/or from a storage location, there may be multiple links. Each link may have their own constraints (e.g., in throughput and/or storage). Policy may consider the sharding of files in a manner that honors the constraints. The policy may also be set so that all portions of the shards may be timely accessed in parallel. When sharding, the policy is applied in order to identify initial placement of the computing data unit across the multiple storage locations. Furthermore, the policy may be consulted to determine which storage location to access the shard from and/or which channel to use to access the shard from a given location. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2018337993A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2018337993A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2018337993A13</originalsourceid><addsrcrecordid>eNrjZFAL9nAMcvH0c1fwD3MNUvAN9Qnx1PXx9PNWcHEMcVRw9nD083P1CeZhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGhhbGxuaWlsaOhsbEqQIARikkcw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>SHARDING OVER MULTI-LINK DATA CHANNELS</title><source>esp@cenet</source><creator>GAGNE, Joseph M ; SRIDHARAN, Baskar ; RAMAKRISHNAN, Raghunath ; KUMAR KASTURI, Sri Sai Kameswara Pavan ; TELIDEVARA, Aditya ; MICHAYLOV, Spiro</creator><creatorcontrib>GAGNE, Joseph M ; SRIDHARAN, Baskar ; RAMAKRISHNAN, Raghunath ; KUMAR KASTURI, Sri Sai Kameswara Pavan ; TELIDEVARA, Aditya ; MICHAYLOV, Spiro</creatorcontrib><description>Sharding a data unit across storage locations (e.g., data centers, clusters, accounts, and so forth). For each locations, the multi-link traffic constraints in data channeling with the storage location are identified. For instance, for a given data channel leading to and/or from a storage location, there may be multiple links. Each link may have their own constraints (e.g., in throughput and/or storage). Policy may consider the sharding of files in a manner that honors the constraints. The policy may also be set so that all portions of the shards may be timely accessed in parallel. When sharding, the policy is applied in order to identify initial placement of the computing data unit across the multiple storage locations. Furthermore, the policy may be consulted to determine which storage location to access the shard from and/or which channel to use to access the shard from a given location.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRIC DIGITAL DATA PROCESSING ; ELECTRICITY ; PHYSICS ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2018</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&date=20181122&DB=EPODOC&CC=US&NR=2018337993A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20181122&DB=EPODOC&CC=US&NR=2018337993A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>GAGNE, Joseph M</creatorcontrib><creatorcontrib>SRIDHARAN, Baskar</creatorcontrib><creatorcontrib>RAMAKRISHNAN, Raghunath</creatorcontrib><creatorcontrib>KUMAR KASTURI, Sri Sai Kameswara Pavan</creatorcontrib><creatorcontrib>TELIDEVARA, Aditya</creatorcontrib><creatorcontrib>MICHAYLOV, Spiro</creatorcontrib><title>SHARDING OVER MULTI-LINK DATA CHANNELS</title><description>Sharding a data unit across storage locations (e.g., data centers, clusters, accounts, and so forth). For each locations, the multi-link traffic constraints in data channeling with the storage location are identified. For instance, for a given data channel leading to and/or from a storage location, there may be multiple links. Each link may have their own constraints (e.g., in throughput and/or storage). Policy may consider the sharding of files in a manner that honors the constraints. The policy may also be set so that all portions of the shards may be timely accessed in parallel. When sharding, the policy is applied in order to identify initial placement of the computing data unit across the multiple storage locations. Furthermore, the policy may be consulted to determine which storage location to access the shard from and/or which channel to use to access the shard from a given location.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>ELECTRICITY</subject><subject>PHYSICS</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2018</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZFAL9nAMcvH0c1fwD3MNUvAN9Qnx1PXx9PNWcHEMcVRw9nD083P1CeZhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGhhbGxuaWlsaOhsbEqQIARikkcw</recordid><startdate>20181122</startdate><enddate>20181122</enddate><creator>GAGNE, Joseph M</creator><creator>SRIDHARAN, Baskar</creator><creator>RAMAKRISHNAN, Raghunath</creator><creator>KUMAR KASTURI, Sri Sai Kameswara Pavan</creator><creator>TELIDEVARA, Aditya</creator><creator>MICHAYLOV, Spiro</creator><scope>EVB</scope></search><sort><creationdate>20181122</creationdate><title>SHARDING OVER MULTI-LINK DATA CHANNELS</title><author>GAGNE, Joseph M ; SRIDHARAN, Baskar ; RAMAKRISHNAN, Raghunath ; KUMAR KASTURI, Sri Sai Kameswara Pavan ; TELIDEVARA, Aditya ; MICHAYLOV, Spiro</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2018337993A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2018</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>ELECTRICITY</topic><topic>PHYSICS</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>GAGNE, Joseph M</creatorcontrib><creatorcontrib>SRIDHARAN, Baskar</creatorcontrib><creatorcontrib>RAMAKRISHNAN, Raghunath</creatorcontrib><creatorcontrib>KUMAR KASTURI, Sri Sai Kameswara Pavan</creatorcontrib><creatorcontrib>TELIDEVARA, Aditya</creatorcontrib><creatorcontrib>MICHAYLOV, Spiro</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>GAGNE, Joseph M</au><au>SRIDHARAN, Baskar</au><au>RAMAKRISHNAN, Raghunath</au><au>KUMAR KASTURI, Sri Sai Kameswara Pavan</au><au>TELIDEVARA, Aditya</au><au>MICHAYLOV, Spiro</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>SHARDING OVER MULTI-LINK DATA CHANNELS</title><date>2018-11-22</date><risdate>2018</risdate><abstract>Sharding a data unit across storage locations (e.g., data centers, clusters, accounts, and so forth). For each locations, the multi-link traffic constraints in data channeling with the storage location are identified. For instance, for a given data channel leading to and/or from a storage location, there may be multiple links. Each link may have their own constraints (e.g., in throughput and/or storage). Policy may consider the sharding of files in a manner that honors the constraints. The policy may also be set so that all portions of the shards may be timely accessed in parallel. When sharding, the policy is applied in order to identify initial placement of the computing data unit across the multiple storage locations. Furthermore, the policy may be consulted to determine which storage location to access the shard from and/or which channel to use to access the shard from a given location.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US2018337993A1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC COMMUNICATION TECHNIQUE ELECTRIC DIGITAL DATA PROCESSING ELECTRICITY PHYSICS TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION |
| title | SHARDING OVER MULTI-LINK DATA CHANNELS |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T02%3A46%3A10IST&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=GAGNE,%20Joseph%20M&rft.date=2018-11-22&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2018337993A1%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 |