A Scheduling Scheme for Controlling Allocation of CPU Resources for Mobile Programs

  • Authors:

  • Manoj Lal;Raju Pandey

  • Affiliations:

  • Parallel and Distributed Computing Laboratory, Computer Science Department, University of California, Davis, CA 95616 lal@cs.ucdavis.edu;Parallel and Distributed Computing Laboratory, Computer Science Department, University of California, Davis, CA 95616 pandey@cs.ucdavis.edu

  • Venue:
  • Autonomous Agents and Multi-Agent Systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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. In this paper, we present 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 implements 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.