In this paper, we present a multi-agent system (MAS) approach to allocate objects over different servers in distributed computing environment (DCE). We show that distributed object allocation problem in DCE with an objective to allocate objects over different servers so that the number of inter-server communications can be minimized is similar to the graph bisection problem. We test the performance of the MAS approach against other heuristic approaches and semidefinite programming (SDP) based lower bounds, and show that the MAS approach fares well when compared to other competing heuristic approaches.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science
- Modeling and Simulation