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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: GAGNE, Joseph M, SRIDHARAN, Baskar, RAMAKRISHNAN, Raghunath, KUMAR KASTURI, Sri Sai Kameswara Pavan, TELIDEVARA, Aditya, MICHAYLOV, Spiro
Format: Patent
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.