The aim of this work is to develop a competition driven solution approach for load distribution in distributed computing system (DCS) environments. The subject DCS is composed of a set of workstation clusters. The study deals with concurrent applications, but assumes the existence of the independent tasks executing on individual workstations as well. Akin to conventional load balancing algorithms, the approach considers two phases; the partitioning phase and the mapping phase. Each phase is based on the application and the DCS data which is translated into market data, mainly price. The price is governed by the demand and supply of the traded commodities ( processing and communication capacities) and the competition created between the buyers (tasks) and the sellers (workstations), respectively. The work provides a basis for an elaborate study on realistic concurrent applications and workstation networks. It underlines the development of simple, faster, and flexible solutions to load d...
Proceedings of the Ninth International Symposium on Computer and Information Sciences
City or Country
Shum, Kam Hong and Bozyigit, M..
A Load Distribution through Competition for Workstation Clusters. (1994). Proceedings of the Ninth International Symposium on Computer and Information Sciences. 810-817. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1059
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.