Searching for authors named "Susanne Albers" – sorted by Relevance.
33 documents found, showing 1 through 10.
Next 10 →
-
Generalized connection caching
- …Abstract Cohen et al. [5] recently initiated the theoretical study of connection caching in the world-wideweb. They extensively studied uniform connection caching, where the establishment cost is uniform for all connections [5, 6]. They showed that ordinary paging algorithms can be used to derivealg…
- Cited by 1 (0 self) – Add To MetaCart
-
Online Algorithms: A Study of Graph-Theoretic Concepts
- …. In this paper we survey results on the design and analysis of online algorithms, focusing on problems where graphs and graphtheoretic concepts have proven particularly useful in the formulation or in the solution of the problem. For each of the problems addressed, we also present important ope…
- Cited by 1 (0 self) – Add To MetaCart
-
Competitive online algorithms
- …Over the past ten years, online algorithms have received considerable research interest. Online problems had been investigated already in the seventies and early eighties but an extensive, systematic study only started when Sleator and Tarjan (1985) suggested comparing an online algorithm to an opti…
- Cited by 19 (1 self) – Add To MetaCart
-
Better Bounds For Online Scheduling
- …. We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goal is to minimize the makespan. Bartal, Fiat, Karloff and Vohra [3] gave a deterministic online algorithm that is 1.986…
- Cited by 69 (3 self) – Add To MetaCart
-
Improved Randomized On-Line Algorithms for the List Update Problem
- …The best randomized on-line algorithms known so far for the list update problem achieve a competitiveness of p 3 1:73. In this paper we present a new family of randomized on-line algorithms that beat this competitive ratio. Our improved algorithms are called TIMESTAMP algorithms and achieve a com…
- Cited by 33 (7 self) – Add To MetaCart
-
A competitive analysis of the list update problem with lookahead
- …We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present request to be served but also some future requests? We introduce two different models of lookahead and study the list updat…
- Cited by 10 (0 self) – Add To MetaCart
-
On the Influence of Lookahead in Competitive Paging Algorithms
- …We introduce a new model of lookahead for on-line paging algorithms and study several algorithms using this model. A paging algorithm is on-line with strong lookahead l if it sees the present request and a sequence of future requests that contains l pairwise distinct pages. We show that strong look…
- Cited by 29 (1 self) – Add To MetaCart
-
On randomized online scheduling
- …ABSTRACT We study one of the most basic problems in online scheduling. A sequence of jobs has to be scheduled on m identical parallel machines so as to minimize the makespan. Whenever a new job arrives, its processing time is known in advance. The job has to be scheduled immediately on one of the ma…
- Cited by 14 (0 self) – Add To MetaCart
-
Energy-efficient algorithms for flow time minimization
- …We study scheduling problems in battery-operated computing devices, aiming at schedules with low total energy consumption. While most of the previous work has focused on finding feasible schedules in deadline-based settings, in this paper we are interested in schedules that guarantee good response t…
- Cited by 20 (1 self) – Add To MetaCart
-
Direct-mapped Constrained Migration Problem
- …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…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
