Latency reduction in distributed computing systems

摘要

Aspects of the disclosure relate generally to reducing latency for consensus in geographically distributed disaster-safe persistent data-store systems. These distributed systems may include registry system having redundant storage for maintaining the system status. Each registry system may include a server and a storage component. Consensus may be achieved by querying all of other servers of the registry system. In one example, the consensus data may be sharded into independent small groups. This may allow for multiple consensus transactions to be generated and run in parallel, which, in turn may reduce the latency. In addition, or alternatively, requests to a server to write or otherwise change the data-store may be batched at the server side. Thus, for the consensus, the server need only communicate with the other servers only once per batch. This may also reduce the latency of the distributed system.

主权项

1. A method comprising:
generating, by one or more processors of a key registry system, a key registry server shard identifier based on a key and a number of shards q for the registry system by comparing a timestamp associated with the key to a time t to determine the number of shards q; sending, to a key registry server shard identified by the key registry server shard identifier, a remote procedure call for the key; and receiving confirmation that the remote procedure call was successful.