Abstract: The present invention extends to methods, systems, and computer program products for allocating and reclaiming resources within a rendezvous federation. Embodiments of the invention include formulating and routing messages in accordance with cached two-way agreements between adjacent nodes on a ring of nodes. Cached two-way agreements divide responsibility for at least unoccupied identifiers between the adjacent nodes on a ring. When a message is received at a node, the node can refer to a cached two-way agreement to determine if it or an adjacent node is responsible for the message. The node then sends the message to the next appropriate component in accordance with the cached two-way agreement.

Abstract: A process marked graph describing a dataflow is received. The graph may comprise one or more processes connected by various edges of the graph. The edges between the processes may include tokens that represent data dependency or other interrelationships between the processes. Each process may be associated with a piece of executable code. Each process in the process marked graph may be translated into a piece of executable code according to the dependencies described by the graph. The generated code for each process includes the received executable code associated with the particular process. These processes may then be executed simultaneously on one or more processors or threads, while maintaining the dataflow described by the process marked graph. In this way, synchronized dataflow is desirably achieved between processes given a process marked graph describing the dataflow, and the code associated with each process.

Abstract: The present invention extends to methods, systems, and computer program products for appropriately detecting node failures in a rendezvous federation. A monitor node monitors a subject node. The subject node intermittently renews a time-to-live duration value with the monitor node to indicate the monitor node that the subject node has not failed. In some embodiments, each node in a pair of nodes monitors the other nodes in the pair of nodes. Thus, each node is a subject node and a monitor node. In further embodiments, an arbitration facility arbitrates failure reports.

Abstract: A system for and method of implementing a backoff protocol and a computer network incorporating the system or the method. In one embodiment, the system includes: (1) a client subsystem that generates a request for access to a shared resource and (2) a server subsystem that receives the request, returns a LOCKED indicator upon an expectation that the shared resource is unavailable and otherwise returns a FREE indicator, the client subsystem responding to the LOCKED indicator by waiting before regenerating the request for the access.

Abstract: A compact metering scheme meters visits to a web site. A proxy module intercepts traffic between a client and a server. The proxy module appends a metering module to the body of information sent from the server to the client. The metering module measures the duration of each visit using a timing function F and a unique seed generated for each visit. The metering module returns an auditable result when the client ends the visit. A log keeper module is used to store each result.