Entangled links, transactions and trees for distributed computing systems
View Patent ↗An entangled links mechanism to establish and maintain bipartite temporal intimacy between pairs of computers, using an idempotent, reversible token method which presents no observable external “change” until a communication of information needs to occur between the computers, and which maintains the potential for “bounded (or unbounded) reversibility” in case the intended information dispatched by a source computational entity is not captured or properly accepted by a destination computational entity. The mechanism enables distributed computers in a network to remain continuously aware of each other's presence; to communicate on a logically nearest neighbor basis in a secure and reliable manner in which packets passed over these links do not conflict with normal traffic or cause the available resources of the link to be exceeded; and that atomicity, consistency, isolation, and “reversible durability” may be maintained for transactions when perturbations occur.
1. A computer-implemented method in a first computing entity within a data center for creating an entangled link with a second computing entity within the data center, comprising:
discovering, using one or more processors, the second computing entity by the first computing entity with a beacon;
connecting, using the one or more processors, the first computing entity to the second computing entity over a medium to establish an entanglement between the first computing entity and the second computing entity in forming the entangled link as a single abstract computational entity as a deep asynchronous domain that is an independent timing domain shared between a MAC and a PHY layer of the first computing entity and a MAC and a PHY layer of the second computing entity, the deep asynchronous domain being independent of an upper layer timing domain of the one or more processors at the first computing entity;
continually sending and receiving a token over the medium which is dedicated to circulation of the token between the first and second computing entities;
maintaining bipartite temporal intimacy between the first and second computing entities, as an independent timing domain, with a transformation matrix that tracks states for exchange of a token between the first and second computing entities, wherein the states are complementary between the first and second computing entities as a single symmetrical state machine, without a master and slave relationship.