A scheduling scheme for controlling allocation of CPU resources for mobile programs

Autonomous Agents and Multi-Agent Systems

Volumn 5, Issue 1, 2002, Pages 7-43

  Lal, Manoj ^a   Pandey, Raju ^a  

^a University of California   (United States)

Author keywords

Denial of resource attacks; Distributed systems; Mobile agents; Mobile programs; Real time systems; Resource allocation

Indexed keywords

MOBILE AGENTS;

ALGORITHMS; CONSTRAINT THEORY; HIERARCHICAL SYSTEMS; JAVA PROGRAMMING LANGUAGE; PROGRAM PROCESSORS; REAL TIME SYSTEMS; RESOURCE ALLOCATION; SCHEDULING; SOFTWARE AGENTS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036117258     PISSN: 13872532     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013440831802     Document Type: Article

References (26)

1. K. Arnold and J. Gosling, The Java Progmmming Language, Addison-Wesley: Reading, MA, 1996.
2. K. M. Baumgartner and B. W. Wah, "Computer scheduling algorithms: Past, present, and future," Information Sci. vol. 57 & 58, pp. 319-345, 1991.
3. J. Bredin, D. Katz, and D. Rus, "Market-based resource control for mobile agents," in AGENTS '98, Proc. Second Int. Conf. Autonomous Agents, pp. 197-204, May 1998, available at http://www.acm.org/pubs/articles/proceedings/ai/280765/pl97-bredin.pdf.
4. J. Bredin, D. Katz, and D. Rus, "Economic markets as a means of open mobile-agent systems," in Proc. Workshop "Mobile Agents in the Context of Competition and Cooperation (MAC3) at Autonomous Agents '99", May 1999, available at http://agent.cs.dartmouth.edu/papers/index.html.
5. T. Casevant and J. Kuhl, "A taxonomy of scheduling in general-purpose distributed computing systems," IEEE Trans. Software Eng. vol. 14, no. 2, pp. 141-154, 1988.
6. D. Chess, C. Harrison, and A. Kershenbaum, "Mobile agents: are they a good idea?" in Second Int. Workshop on Mobile Object Systems, Springer-Verlag: Berlin 1997, pp. 25-47.
7. G. Czajkowski and T. von Eicken, "JRes: A resource accounting interface for Java," in Conf. Object-Oriented Programming, Systems, Languages and Applications (OOPSLA'98), October 1998, pp. 21-35.
8. B. Ford and S. Susarala, "CPU inheritance scheduling," in Proc. USENIX 2nd Symp. on Operating Systems Design and Implementation, Seattle, Washington, October 1996, pp. 91-105.
9. B. Goodheart and J. Cox, The Magic Garden Explained, The Internals of Unix System V Release 4: An Open Systems Design, Prentice Hall: Englewood Cliffs, NJ, 1994.
10. P. Goyal, X. Guo, and H. M. Vin, "A hierarchical cpu scheduler for multimedia operating systems," in Proc. USENIX 2nd Symp. Operating Systems Design and Implementation, Seattle, Washington, October 1996, pp. 107-121.
11. G. J. Henry, "Fair share scheduler," AT&T Bell Laboratories Tech. J. October 1984.
12. M. B. Jones, D. Rosu, and M-C. Rosu, "CPU reservations and time constraints: Efficient, predictable scheduling of independent activities," in 16th ACM Symp. Operating Systems Principles, St. Malo, France, December 1997, pp. 198-211.
13. S. Keshav, Congestion Control in Computer Networks. Phd thesis, U.C. Berkeley, 1991.
14. T. Lindholm and F. Yellin, The Java Virtual Machine Specification, Addison-Wesley: Reading, MA, September 1996.
15. C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard real-time environment," J. ACM vol. 20, no. 1, 1973.
16. J. Meyer and T. Downing, Java Virtual Machine, O'Reilly, 1997.
17. N. Nagaratnam and S. B. Byrne, "Resource access control for an internet user agent," in Proc. USENIX 3rd Conference on Object-Oriented Technologies, June 1997, pp. 199-208.
18. J. Nieh and M. Lam, "The design, implementation and evaluation of SMART: A scheduler for multimedia applications," in 16th ACM Symp. Operating Systems Principles, October 1997, pp. 184-197.
19. K. Schwan and H. Zhou, "Dynamic scheduling of hard real-time tasks and real-time threads," IEEE Trans. Software Eng. vol. 18, no. 8, pp. 736-748, 1992.
20. M. I. Seltzer, Y. Endo, C. Small, and K. A. Smith, "Dealing with disaster: Surviving misbehaved kernel extensions," in Proc. 1996 Symp. Operating System Design and Implementation, 1996, pp. 213-227.
21. J. W. Stamos and D. K. Gifford, "Remote evaluation," ACM Trans. Programming Languages and Systems vol. 12, no. 4, pp. 537-565, 1990.
22. R. Thorn, "Programming languages for mobile code," ACM Computing Surveys vol. 29, no. 3, pp. 213-239, 1997.
23. C. F. Tschudin, "Open resource allocation for mobile code," Computer Science Department, University of Zurich, Switzerland.
24. U. Vahalia, UNIX Internals, The New Frontiers, Prentice Hall: Englewood Cliffs, NJ, 1996.
25. C. A. Waldspurger and W. E. Weihl, "Lottery scheduling: Flexible proportional share resource management," in Proc. USENIX 1st Symp. Operating Systems Design and Implementation, Monterey, CA, November 1994, pp. 1-11.
26. C. A. Waldspurger and W. E. Weihl, "Stride scheduling: Deterministic proportional share resource management," Technical report, MIT Laboratory for Computer Science, June 1995.