Browse Prior Art Database

Method for Providing a Schedule for Accessing a Resource by Multiple Competing Agents

IP.com Disclosure Number: IPCOM000243056D
Publication Date: 2015-Sep-10
Document File: 1 page(s) / 25K

Publishing Venue

The IP.com Prior Art Database

Abstract

A method is disclosed for providing a schedule for accessing a resource by multiple competing agents.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 94% of the total text.

Page 01 of 1

Method for Providing a Schedule for Accessing a Resource by Multiple Competing Agents

Disclosed is a method for providing a schedule for accessing a resource by multiple competing agents. The resource may be one or more of, but not limited to, a Central Processing Unit (CPU) and a server.

In accordance with the method, a schedule S(R) is created for accessing a resource R by one or more competing agents. In an exemplary scenario, there are n agents such as A = (a1, a2, a3 ... an), that are competing for a resource R. Each agent of the one or more competing agents is assigned a unique equivalence class C. Here, C = 0 to n-1. The equivalence class C is shared with each of the one or more competing agents. Thereafter, each agent selects a value V = 1 to n for creating an n-tuple of order n with values of all the one or more competing agents. Here, two or more agents may select same value.

The values selected by the one or more agents are shared with other agents using a protocol so that all agents are aware of the equivalence class and the chosen value pairs (Cr, Vr). A sum of the chosen values V of all the agents is computed and a modulo n of the sum is obtained. An agent whose equivalence class matches with obtained modulo n value is determined to be a winner of an iteration process.

The winning agent is removed from the iteration process and n is decremented by one. Thereafter, the iteration process is continued until a full sequence S(R) is created.

Thus, the d...