Effective graph representation for agent-based distributed computing

  • Authors:
  • Adam Sędziwy

  • Affiliations:
  • Department of Automatics, AGH University of Science and Technology, Kraków, Poland

  • Venue:
  • KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

A model decomposition allows transforming a graph-based problem into a set of subproblems to be processed in parallel. Prepared model should guarantee good efficiency of communication and synchronization among agents managing a distributed representation of a system. In this article we present the new approach to such a decomposition, reducing required cooperation among agents. The comparison with replicated complementary graphs approach is also presented.