Multi-agent distributed adaptive resource allocation (MADARA)
by James Edmondson, Douglas Schmidt
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 5, No. 3, 2010

Abstract: The component placement problem involves mapping a component to a particular location and maximising component utility in grid and cloud systems. It is also an NP hard resource allocation and deployment problem, so many common grid and cloud computing libraries, such as MPICH and Hadoop, do not address this problem, even though large performance gains can occur by optimising communications between nodes. This paper provides four contributions to research on the component placement problem for grid and cloud computing environments. First, we present the multi-agent distributed adaptive resource allocation (MADARA) toolkit, which is designed to address grid and cloud allocation and deployment needs. Second, we present a heuristic called the comparison-based iteration by degree (CID) heuristic, which we use to approximate optimal deployments in MADARA. Third, we analyse the performance of applying the CID heuristic to approximate common grid and cloud operations, such as broadcast, gather and reduce. Fourth, we evaluate the results of applying genetic programming mutation to improve our CID heuristic.

Online publication date: Tue, 31-Aug-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email