Use of Priority Value(s) of the Resource Attributes to Find the Best Matching Resource for a Resource Request
Original Publication Date: 2004-Aug-31
Included in the Prior Art Database: 2004-Aug-31
In today's environments resources can be requested and allocated during provisioning, and other functions, but these are done using a mostly static model. In existing models a resource contains a set of capabilities, e.g. 3GB RAM, 2GHz processor, etc. When a resource is requested a check is made to determine if resource A, B, etc. meets the minimum requirements until no resource is found or until the first matched resource is located. This works OK but doesn't permit the user, application, etc. requesting the resource to necessarily meet their true application requirements. Let's take a program for instance such as some forecasting application that performs a high degree of mathematical computations. Let's also assume the forecasting application requires a minimum of a 2.5GHz machine to run with a minimum of 200KB free disk space. However, given the characteristics of the application and it's computational intensive nature, increases in the processor speed greatly increase the applications performance above just adding more disk space. Solving this problem with the existing model for resource matching isn't possible. This article discusses how to provide the necessary flexibility and levels of granularity expected within the dynamic, on demand environments today.