Online Algorithms to Minimize Resource Reallocations and Network Communication

Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the other. Both problems involve a control trying to minimize the number of changes that need to be made in maintaining a state that satisfies each of many users' requirements. Our algorithms have the property that the control only needs to be informed of a change in users needs when the current state no longer satisfies the user. This is particularly important when the application is one of trying to minimize communication between the users and the control. urce Allocation Problem (RAP) is an abstraction of scheduling malleable and evolving jobs on multiprocessor machines. A scheduler has a fixed pool of resources of total size T. There are n users, and each user j has a resource requirement for rj,t resources. The scheduler must allocate resources j,t to user j at time t such that each allocation satisfie...

• Type: Conference
• Year: 2006
• Where: APPROX
• Authors: Sashka Davis, Jeff Edmonds, Russell Impagliazzo
• Keywords: Algorithms, APPROX 2006, Online Algorithms, Resources, Similar Online Algorithms