A Performance Comparison of Monile Agents and RPC

Authors:
David Rutter
Affiliations:
-
Venue:
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Year:
1999

Citing 7
Cited 0

How to soup up Java, part I

BYTE
Distributed Operating Systems and Algorithms

Distributed Operating Systems and Algorithms
The Architecture of the Ara Platform for Mobile Agents

MA '97 Proceedings of the First International Workshop on Mobile Agents
Mobile Agent Applicability

MA '98 Proceedings of the Second International Workshop on Mobile Agents
Is it an Agent, or Just a Program?: A Taxonomy for Autonomous Agents

ECAI '96 Proceedings of the Workshop on Intelligent Agents III, Agent Theories, Architectures, and Languages
Strategically Mobile Agents

MA '97 Proceedings of the First International Workshop on Mobile Agents
Agent tcl: a flexible and secure mobile-agent system

Agent tcl: a flexible and secure mobile-agent system

Quantified Score

Hi-index	0.00

Visualization

Abstract

The issue of Mobile Agent performance, and in particular, scalability is one that, while receiving attention in a speculative sense, has not been addressed to any great extent in empirical studies. This paper provides an insight into the requirements that an MA system has on a server's resources, comparing them to the requirements for an equivalent RPC solution. The basis of the study is an experiment that measures timing and system load information (CPU, memory, network and disk IO) as an MA and RPC solution performs a simple task.