System and method for dynamic rescheduling of multiple varying resources with user social mapping

Patent metadata

Field	Value
Publication number	US-10025629-B2
Application number	US-201514825882-A
Country	US
Kind code	B2
Filing date	Aug 13, 2015
Priority date	Aug 13, 2010
Publication date	Jul 17, 2018
Grant date	Jul 17, 2018

Abstract

A system and method for scheduling resources includes a memory storage device having a resource data structure stored therein which is configured to store a collection of available resources, time slots for employing the resources, dependencies between the available resources and social map information. A processing system is configured to set up a communication channel between users, between a resource owner and a user or between resource owners to schedule users in the time slots for the available resources. The processing system employs social mapping information of the users or owners to assist in filtering the users and owners and initiating negotiations for the available resources.

First claim

What is claimed is:

1. A method for scheduling computing resources, comprising:
determining relationships, using social maps, of resource users and resource owners, among the resource users and resource owners to filter catalog entries from a catalog of available computing resources and time slots for accessing the available computing resources, the filtered catalog entries indicating computing resources and time slots available for negotiations and collaborations among the resource users and resource owners;
scheduling the available computing resources and time slots, using a channel for communication based on the social maps for the negotiations and collaborations, in accordance with results of the negotiations and collaborations; and
updating the catalog in accordance with the results, wherein the scheduled computing resources are used by the resource users in accordance with the results.

2. The method as recited in claim 1 , wherein the catalog is stored in computer storage memory and employs a resource data structure that includes a hierarchy of the available computing resources including a plurality of node records arranged by type.

3. The method as recited in claim 2 , wherein the resource data structure is updated by a resolution process that computes usage of the available computing resources and time slots.

4. The method as recited in claim 1 , wherein determining relationships using social maps includes comparing at least one of resource user participation in one or more social networks, resource user preferences, and resource user equipment identification.

5. The method as recited in claim 1 , wherein the catalog includes a listing for pricing of tasks.

6. The method as recited in claim 1 , wherein the communication channel permits trading of time slots, exchanging of computing resources and negotiating price.

7. The method as recited in claim 1 , wherein updating the catalog in accordance with the results includes displaying updated computing resource allocations and time slots by entity.

8. The method as recited in claim 1 , wherein the catalog includes social map information identifying participation of a resource user or resource owner in one or more social networks.

9. The method as recited in claim 1 , wherein one of participation of a resource user or resource owner in a social network and a preference in a social map is employed to initiate the negotiations and collaborations.

Assignees

• IBM

Inventors

• Jamjoom Hani T
• Podlaseck Mark E
• Qu Huiming
• Ruan Yaoping
• Shae Zon-Yin
• Sheopuri Anshul

Classifications

• G06F9/50 Primary

  Allocation of resources, e.g. of the central processing unit [CPU] · CPC title