Task Allocation for Computer Service Provider by Optimal CPU Usage Consideration
Article Sidebar
Keywords:
Task allocation algorithm Distributed system Lagrangetransformation
Main Article Content
Abstract
Task allocation algorithm in distributed computing system, such as cloud computing, are now critical issue. Service manager: SM has to consider which Service provider: SP is suitable to service data processing or even data storage from Service request: SR. Normally, SP has to handle its own tasks thus new allocated task should not consume more CPU’s work load status which could make SP decrease its base performance. This research objective is to invent the allocation algorithm by study status of SP’s CPU usages. The less CPU performance usages: LCU of each SP were specified. The status of each SP’s LCU should be used to represent its status which will be a criteria for making a decision by SM whether this SP is suitable to service request from SR or not. The start time and finish time of SR’s task was defined by maximized Lagrange transformation function. The experiment is presented in practical calculation. It could point out that some request of SR is more suitable sending to which SP.
Article Details
Section
ACTIS Article
It is the policy of ACTISNU to own the copyright to the published contributions on behalf of the interests of ACTISNU, its authors, and their employers, and to facilitate the appropriate reuse of this material by others. To comply with the Copyright Law, authors are required to sign an ACTISNU copyright transfer form before publication. This form, a copy of which appears in this journal (or website), returns to authors and their employers full rights to reuse their material for their own purposes.