Computer Science
Computer Science
bullet A community of giving: First-ever #RowanGIVESDay raises $65K+ for University programs and scholarships | More

bullet Rowan researcher targets stem cell-based therapy for rare childhood disease | More

bullet Rowan Radio wins prestigious BEA awards | More

bullet Interreligious dialogue at center of Rowan talk by religion scholar | More

bullet Considering chopsticks: Professor’s book documents historical, cultural significance of eating tools | More

Technical Report Number TR1995-3

On Space Bounded Server Algorithms

Ganesh Baliga
Department of Computer Science
Rowan College of New Jersey
Glassboro, NJ 08028

Steven Hughes
Department of Computer Science
Indiana University
Bloomington, IN

Anil M. Shende
Dept. of Mathematics, Computer Science & Physics
Roanoke College
Salem, VA 24153


This paper studies space bounded algorithms, i.e., algorithms that use
a constant amount of scratch space, for the k-server problem. The
paper first shows a characterization of the set of space bounded
algorithms that are competitive in finite metric spaces. The result
yields a method for (1) effectively deciding if a given space bounded
algorithm is competitive in a given finite metric space, and (2) for
designing competitive space bounded algorithms in finite metric

The above results are then refined, in particular using the geometry
of metric spaces, to develop two methods for obtaining an upper bound
on competitive factors of arbitrary space bounded algorithms. One of
these methods is then used to show that any algorithm, employing the
Least Recently Used strategy, is linearly competitive on a uniform
metric space.