Abstract
The paper brie.y presents the architecture of a multi-agent computing system with an emphasis on di.usion scheduling. Two binding energy formulas used by the di.usion scheduling algorithm are introduced: one respecting only requirements for the CPU and memory, and a second also utilizing the requirement for inter-agent communication. Two pairs of experiments with irregular parallel computations are presented with comparative results showing the e.ciency in respect to inter-agent communication in both local and wide area networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
