Equitable resource sharing in grid-based computing environments

• US 20050273511A1
• Filed: 06/08/2004
• Published: 12/08/2005
• Est. Priority Date: 06/08/2004
• Status: Abandoned Application

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Vilar Brasileiro, Franscisco, Ferreira de Andrade, Nazareno, Roisenberg, Paulo, Filho, Walfredo Cirne
• Application Number:
  US10/862,444
• Publication Number:
  US 20050273511A1
• Time in Patent Office: Days
• US Class Current: 709/227
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals
• CPC Class Codes: G06F 9/5072 Grid computing

Abstract

The invention relates to a method of allocating grid-based computer resources which is based on an exchange model that is predicated exclusively on a system of returned favours. A favour is defined as the act of offering a resource and the method is performed in respect of two or more grid resource providers/consumers which are alternatively known as participants. In one embodiment, the method includes the steps of establishing two or more participants in a grid-based computer system where at least one of said participants offers resources. Each participant expects resources to be offered in return in proportion to the level of resources which that participant offers. Primarily, the present invention may be applied in arbitration situations whereby a participant which is offering resources arbitrates conflicting requests for its resources by prioritizing requests from those other participants who have offered favours in the past. The invention may be applied most suitably in the context of applications which can be run in a fragmentary task fashion where each task may be executed independently of each other task comprising the whole application. Specific computational contexts to which the invention may be applied include large-scale computationally intensive calculations such as molecular modeling, analysis of large bodies of data and the like. The invention may be applied to similar evanescent grid-based computer resources such as network storage and similar.

Claims

1. A method of allocating grid-based computer resources based on an exchange model exclusively of returned favours.

2. A method as claimed in claim 1, wherein a favour is defined as the act of offering a resource.

3. A method as claimed in claim 1, wherein the method is performed in respect of two or more grid resource providers/consumers, alternatively known as participants.

4. A method as claimed in claim 1, wherein the method comprises the steps of:

establishing two or more participants in a grid-based computer system, at least one of said participants offering resources;

wherein, each participant expects resources to be offered in return in proportion to the level of resources which that participant offers.

5. A method as claimed in claim 1, wherein each participant benefits in proportion to the number of favours it provides to other participants.

6. A method as claimed in claim 1, wherein a participant offering resources arbitrates conflicting requests for that participants'"'"' resources by prioritizing requests from those other participants who have offered favours in the past.

9. A method as claimed in claims 6, wherein the process of requesting a resources comprises the steps of a consumer making a request for resources by broadcasting to a peer-to-peer network the characteristics of the desired resources which correspond to the task to be executed;

providers with matching and available resources replying to the requestor, potentially in accordance with local policies of the provider, wherein the set of replies from the providers constitute the grid which is thereby made available in response to the consumers request.

10. A method as claimed in claim 3, wherein a participant corresponds to a group of discrete participants logically aggregated for the purpose of offering specified resources.

11. A method as claimed in claim 10, wherein the aggregation is imposed by factors such as physical collocation, administrative control of the discrete participants, homogeneity in participant capability and the like.

12. A method as claimed in claim 3, wherein the participants correspond to peers in a peer-to-peer network.

13. A method as claimed in claim 12, wherein each peer maintains a record of the resources previously offered by each other known peer, thereby allowing each peer to prioritise other known peers when arbitrating conflicting requests for resources.

14. A method as claimed in claim 13, wherein each peer prioritizes peers who have provided favours in the past and marginalises peers who do not return favours.

15. A method as claimed in claim 1, wherein any available and idle resources are available to any user where there is no contention for those resources.

16. A method as claimed in claim 1, wherein the grid-based computer resource corresponds to computation cycles.

17. A method as claimed in claim 1, wherein the grid-based computer resource is network storage.

19. A network as claimed in claim 16, wherein each peer interacts with grid resources by means of a client wherein the client manages access to, and the execution of tasks on, the grid resources.

20. A computer configured to operate as a peer in accordance with the method as claimed in claim 1.

7. A method as claimed in 6, wherein the step of request prioritization is performed subject to local policies.

8. A method as claimed in claim 7, wherein the policies are governed by characteristics of the participant offering the resources.

18. A network comprising a plurality of peers, each peer configured to offer and/or consume grid-based computer resources based on an exchange model exclusively of returned favours.