Encyclopedia

Metrical task system

Wikipedia contributorsAdapted for Fathomly · View authors

2 min read
Source updated December 29, 2024

Task systems are mathematical objects used to model the set of possible configurations of online algorithms. They were introduced by Borodin, Linial and Saks (1992) to model a variety of online problems. A task system determines a set of states and costs to change states. Task systems obtain as input a sequence of requests such that each request assigns processing times to the states. The objective of an online algorithm for task systems is to create a schedule that minimizes the overall cost incurred due to processing the tasks with respect to the states and due to the cost to change states.

If the cost function to change states is a metric, the task system is a metrical task system (MTS). This is the most common type of task systems. Metrical task systems generalize online problems such as paging, list accessing, and the k-server problem (in finite spaces).

01Formal definition

A task system is a pair $(S,d)$ where $S=\{s_{1},s_{2},\dotsc ,s_{n}\}$ is a set of states and $d:S\times S\rightarrow \mathbb {R}$ is a distance function. If $d$ is a metric, $(S,d)$ is a metrical task system. An input to the task system is a sequence $\sigma =T_{1},T_{2},\dotsc ,T_{l}$ such that for each $i$ , $T_{i}$ is a vector of $n$ non-negative entries that determine the processing costs for the $n$ states when processing the $i$ th task.

An algorithm for the task system produces a schedule $\pi$ that determines the sequence of states. For instance, $\pi (i)=s_{j}$ means that the $i$ th task $T_{i}$ is run in state $s_{j}$ . The processing cost of a schedule is $\mathrm {cost} (\pi ,\sigma )=\sum _{i=1}^{l}d(\pi (i-1),\pi (i))+T_{i}(\pi (i)).$

The objective of the algorithm is to find a schedule such that the cost is minimized.

02Known results

As usual for online problems, the most common measure to analyze algorithms for metrical task systems is the competitive analysis, where the performance of an online algorithm is compared to the performance of an optimal offline algorithm. For deterministic online algorithms, there is a tight bound $2n-1$ on the competitive ratio due to Borodin et al. (1992).

For randomized online algorithms, the competitive ratio is lower bounded by $\Omega (\log n/\log \log n)$ and upper bounded by $O\left((\log n)^{2}\right)$ . The lower bound is due to Bartal et al. (2006, 2005). The upper bound is due to Bubeck, Cohen, Lee and Lee (2018) who improved upon a result of Fiat and Mendel (2003).

There are many results for various types of restricted metrics.

Watch videos about Metrical task systemExplainers and documentaries on YouTube (opens in a new tab)

Sources and credits

This article is adapted from the Wikipedia article “Metrical task system”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.

Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.

Metrical task system

01Formal definition

02Known results

Sources and credits

Related topics

Adversary model

Competitive analysis (online algorithm)

K-server problem