Results 1  10
of
272,507
Randomized Algorithms For Multiprocessor Page Migration
 SIAM Journal on Computing
"... . The page migration problem is to manage a globally addressed shared memory in a multiprocessor system. Each physical page of memory is located at a given processor, and memory references to that page by other processors incur a cost proportional to the network distance. At times the page may migra ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
and Sleator gave 3competitive deterministic online algorithms for uniform networks (complete graphs with unit edge lengths) and for trees with arbitrary edge lengths. No good deterministic algorithm is known for general networks with arbitrary edge lengths. We present randomized algorithms for the migration
A scheduling model for reduced CPU energy
 ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract

Cited by 547 (3 self)
 Add to MetaCart
an offline algorithm that computes, for any set of jobs, a minimumenergy schedule. We then consider some online algorithms and their competitive performance for the power function P(s) = sp where p 3 2. It is shown that one natural heuristic, called the Average Rate heuristic, uses at most a constant
On the Power of Randomization for Job Shop Scheduling with kUnits Length Tasks (Extended Abstract)
"... In the job shop scheduling problem k–units–Jm there are m machines and each machine has an integer processing time of at most k time units. Each job consists of a permutation of m tasks corresponding to all machines and thus all jobs have an identical dilation D. The contribution of this paper are t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
ratio against an oblivious adversary for d = o ( √ D) and k> 1. (iii) Different processing times yield harder instances than identical processing times. There is no 5/3 competitive deterministic on–line algorithm for k–units–Jm whereas the competitive ratio of the randomized on–line algorithm of (ii
Directmapped Constrained Migration Problem
, 1994
"... The constrained migration problem arises in the memory management of large multiprocessor systems. Given a network of processors, each of which has its own local memory, the purpose of this problem is to find an efficient migration strategy which locates each writable page at an appropriate processo ..."
Abstract
 Add to MetaCart
an optimal 3competitive deterministic online algorithm when the network consists of only 2 n...
Online Choice of Online Algorithms
, 1993
"... Let fA1 ; A2 ; : : : ; Amg be a set of online algorithms for a problem P with input set I. We assume that P can be represented as a metrical task system. Each A i has a competitive ratio a i with respect to the optimum offline algorithm, but only for a subset of the possible inputs such that the un ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
such that the union of these subsets covers I. Given this setup, we construct a generic deterministic online algorithm and a generic randomized online algorithm for P that are competitive over all possible inputs. We show that their competitive ratios are optimal up to constant factors. Our analysis proceeds via
The Competitiveness of OnLine Assignments
, 1992
"... Consider the online problem where a number of servers are ready to provide service to a set of customers. Each customer's job can be handled by any of a subset of the servers. Customers arrive onebyone and the problem is to assign each customer to an appropriate server in a manner that will ..."
Abstract

Cited by 110 (19 self)
 Add to MetaCart
and randomized cases. Let n denote the number of servers. In the deterministic case we provide an online algorithm that achieves a competitive ratio of k = dlog 2 ne (up to an additive 1) and prove that this is the best competitive ratio that can be achieved by any deterministic online algorithm. In a similar
Advanced Algorithms: OnLine Algorithms
, 1994
"... Introduction The first topic we will cover in this course is online algorithms. The concept of online algorithms has been around for quite some time (it was for example present in the seventies in the bin packing literature, see [13, 20]), but it has been a fairly hot research area since the publi ..."
Abstract
 Add to MetaCart
Introduction The first topic we will cover in this course is online algorithms. The concept of online algorithms has been around for quite some time (it was for example present in the seventies in the bin packing literature, see [13, 20]), but it has been a fairly hot research area since
New OnLine Algorithms for the Page Replication Problem
, 1994
"... We present improved competitive online algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitive ratio can be given. We develop an optimal randomized online replication algorithm for trees and uniform networks; its ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
and present general techniques that transform ccompetitive algorithms for trees into 2ccompetitive algorithms for rings. As a result we obtain a randomized online algorithm for rings that is 3.16competitive. We also derive two 4competitive online algorithms for rings which are either deterministic
Results 1  10
of
272,507