DocumentCode
3325999
Title
CPU resource control for mobile programs
Author
Lal, Manoj ; Pandey, Raju
Author_Institution
Dept. of Comput. Sci., California Univ., Davis, CA, USA
fYear
1999
fDate
1999
Firstpage
74
Lastpage
88
Abstract
There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support efficient utilization of network resources and extensibility of information servers. This paper presents a scheduling scheme for allocating resources to a mix of real-time and non real-time mobile programs. Within this framework, both mobile programs and hosts can specify constraints on how CPU should be allocated. On the basis of the constraints, the scheme constructs a scheduling graph on which it applies several scheduling algorithms. In case of conflicts between mobile program and host specified constraints, the schemes implement a policy that resolves the conflicts in favor of the host. The resulting scheduling scheme is adaptive, flexible, and enforces both program and host specified constraints
Keywords
distributed programming; graph theory; real-time systems; resource allocation; scheduling; software agents; CPU resource control; information servers; mobile programs; network resources; real-time; resource allocation; runtime infrastructures; scheduling; scheduling graph; software agents; Computer science; Concurrent computing; Government; Java; Laboratories; Resource management; Runtime; Scheduling algorithm; Security; Web pages;
fLanguage
English
Publisher
ieee
Conference_Titel
Agent Systems and Applications, 1999 and Third International Symposium on Mobile Agents. Proceedings. First International Symposium on
Conference_Location
Palm Springs, CA
Print_ISBN
0-7695-0340-3
Type
conf
DOI
10.1109/ASAMA.1999.805395
Filename
805395
Link To Document