US2011320233A1PendingUtilityA1

Method and system for arbitraging computing resources in a cloud computing environment

Individually held — no corporate assignee on recordPriority: May 30, 2010Filed: May 31, 2011Published: Dec 29, 2011
Est. expiryMay 30, 2030(~3.8 yrs left)· nominal 20-yr term from priority
G06F 9/4881G06Q 10/06311G06Q 10/063114H04L 47/83
30
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

Disclosed is are methods and systems for processing a workload among a plurality of computing resources that optimizes the processing price per workload. The method includes breaking the workload into two or more tasks each having a size optimized based on (i) a price history of one or more of the plurality of computing resources and (ii) a predicted duration to complete processing of each of the respective tasks; and sending one of the two or more tasks to a computing resources for which the size of the tasks is optimized.

Claims

exact text as granted — not AI-modified
1 . A method for processing a workload among a plurality of computing resources, the method comprising:
 breaking the workload into two or more tasks each having a size optimized based on (i) a price history of one or more of the plurality of computing resources and (ii) a predicted duration to complete processing of each of the respective tasks; and   sending one of the two or more tasks to a computing resources for which the size of the tasks is optimized.   
     
     
         2 . The method of  claim 1 , further comprising purchasing compute time from the computing resource to which the task is sent. 
     
     
         3 . The method of  claim 1 , further comprising selecting a price history based on a stored profile associated with a user. 
     
     
         4 . The method of  claim 3 , wherein the stored profile is also associated with one of the plurality of computing resources. 
     
     
         5 . The method of  claim 1 , further comprising selecting a price history based on a stored profile associated with a second user different from a first user that requests processing of the workload. 
     
     
         6 . The method of  claim 5 , further comprising:
 collecting information related to processing of the workload; and   modifying the stored profile based on the collected information.   
     
     
         7 . The method of  claim 5 , wherein the stored profile has associated with it attributes, the attributes comprising one or more of: average work load size, average historical processing time, price fluctuations, type of information processed, and combinations thereof. 
     
     
         8 . The method of  claim 1 , further comprising:
 receiving a bid and a designated duration; and   providing the user an indication of the probability that the workload will be processed at the bid price and within the designated duration.   
     
     
         9 . The method of  claim 8 , further comprising calculating the probability according to the function: 
       
         
           
             
               
                 
                   P 
                    
                   
                     ( 
                     A 
                     ) 
                   
                 
                 = 
                 
                   
                     n 
                      
                     
                       ( 
                       A 
                       ) 
                     
                   
                   
                     n 
                      
                     
                       ( 
                       S 
                       ) 
                     
                   
                 
               
               , 
             
           
         
       
       where n(A) is occurrences of workloads completing during the designated duration, and n(S) is the sum of the occurrences of workloads completing during the designated duration and the occurrences of workloads failing to complete during the designated duration. 
     
     
         10 . A system for processing a workload among a plurality of computing resources, the system comprising:
 a workload packaging module that breaks the workload into two or more tasks each having a size optimized based on (i) a price history of one or more of the plurality of computing resources and (ii) a predicted duration to complete processing of each of the respective tasks; and   a workload scheduling module that queues the tasks having the optimized size for the computing resources.   
     
     
         11 . The system of  claim 10 , further comprising a workload buying module that purchases compute time from the computing resources for which a task is queued. 
     
     
         12 . the system of  claim 10 , wherein the workload packaging module selects a price history based on a stored profile associated with a user. 
     
     
         13 . The system of  claim 12 , wherein the stored profile is also associated with one of the plurality of computing resources. 
     
     
         14 . The system of  claim 10 , wherein the workload packaging module selecting a price history based on a stored profile associated with another user different from the user. 
     
     
         15 . The system of  claim 14 , wherein the workload packaging module,
 collects information related to processing of the workload; and   modifies the stored profile based on the collected information.   
     
     
         16 . The system of  claim 14 , wherein the stored profile has associated with it attributes, the attributes comprising one or more of: average work load size, average historical processing time, price fluctuations, type of information processed, and combinations thereof. 
     
     
         17 . The system of  claim 10 , further comprising a probability calculator that receives a bid and a designated duration, and provides a user an indication of the probability that the workload will be processed at the bid price and within the designated duration. 
     
     
         18 . The system of  claim 17 , wherein the probability calculator calculates the probability according to the function: 
       
         
           
             
               
                 
                   P 
                    
                   
                     ( 
                     A 
                     ) 
                   
                 
                 = 
                 
                   
                     n 
                      
                     
                       ( 
                       A 
                       ) 
                     
                   
                   
                     n 
                      
                     
                       ( 
                       S 
                       ) 
                     
                   
                 
               
               , 
             
           
         
       
       where n(A) is occurrences of workloads completing during the designated duration, and n(S) is the sum of the occurrences of workloads completing during the designated duration and the occurrences of workloads failing to complete during the designated duration. 
     
     
         19 . The system of  claim 10 , further comprising a workload status monitoring module that monitors the status of tasks executing at the plurality of computing resources. 
     
     
         20 . The system of  claim 19 , further comprising the workload status monitoring module stopping the execution of a task, and moving the task to a different computing resource. 
     
     
         21 . The system of  claim 15 , wherein modifying the stored profile based on the collected information comprises updating the stored profile with data gathered during processing of the user's workload.

Join the waitlist — get patent alerts

Track US2011320233A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.