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.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados