Abstract
This work presents compiler-based scheduling strategies for Java Mobile Agents. We analyze the program using annotations and data sizes. For the different strategies, the compiler produces the best schedule, taking dependence information into account.
This work was partially supported by NSF grant #EIA 987135
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Iqbal A, Baumann J, and Straβer M. Efficient Algorithms to Find Optimal Agent Migration Strategies. Technical report, IPVR, University of Stuttgart, 1998.
Jaspal Subhlok, Peter Lieu, and Bruce Lowekamp. Automatic Node Selection for High Performance Applications on Networks. In Principles and Practice of Parallel Programming (PPoPP), pages 163–172, 1999.
Brian Wims and Cheng-Zhong Xu. Traveler: A Mobile Agent Infrastructure for Wide Area Parallel Computing. In Proceedings of the IEEE Joint Symposium ASA/MA’99: First Int. Symp. on Agent Systems and Applications (ASA’99) and Third Int. Symp. on Mobile Agents (MA’99), 1999.
Daniel Wu, Divyakant Agrawal, and Amr El Abbadi. Stratosphere:Mobile Processing of Distributed Objects in Java. In ACM/IEEE international conference on Mobile Computing and Networking (MOBICOM), pages 121–132, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Narasimhan, S., Pande, S. (2001). Compiler Based Scheduling of Java Mobile Agents. In: Midkiff, S.P., et al. Languages and Compilers for Parallel Computing. LCPC 2000. Lecture Notes in Computer Science, vol 2017. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45574-4_27
Download citation
DOI: https://doi.org/10.1007/3-540-45574-4_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42862-6
Online ISBN: 978-3-540-45574-5
eBook Packages: Springer Book Archive