Adaptability and the usefulness of hints

Piotr Berman, Juan A. Garay

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    8 Scopus citations

    Abstract

    In this paper we study the problem of designing algorithms in situations where there is some information concerning the typical conditions that are encountered when the respective problem is solved. The basic goal is to assure efficient performance in the typical case, while satisfying the correctness requirements in every case. We introduce adaptability, a new measure for the quality of an algorithm, which generalizes competitive analysis and related frameworks. This new notion applies to sequential, parallel and distributed algorithms alike. In a nutshell, a "hint" function conveys certain information about the environment in which the algorithm operates. Adaptability compares the performance of the algorithm against the "specialist"-an algorithm specifically tuned to the particular hint value. From this perspective, finding that no single algorithm can adapt to all possible hint values is not necessarily a negative result, provided that a family of specialists can be constructed. Our case studies provide examples of both kinds. We first consider the "ancient" problem of on-line scheduling of jobs in m identical processors, and show that no algorithm can fully adapt to the natural hint of largest job size. In particular, for the cases m = 2,3, we present specialists that beat the general lower bound for on-line makespan. In the domain of distributed computing, we analyze the Distributed Consensus problem under several hint functions. To fulfill the requirements of one of the cases we consider, we present the first consensus algorithm that is simultaneously optimal in number of processors, early-stopping property (that is, it runs in time proportional to the actual number of faults), and total number of communicated bits. In our new parlance, the algorithm adapts to the number of faults hint with both running time and communication.

    Original languageEnglish (US)
    Title of host publicationAlgorithms, ESA 1998 - 6th Annual European Symposium, Proceedings
    PublisherSpringer Verlag
    Pages271-282
    Number of pages12
    ISBN (Print)3540648488, 9783540648482
    Publication statusPublished - Jan 1 1998
    Event6th Annual European Symposium on Algorithms, ESA 1998 - Venice, Italy
    Duration: Aug 24 1998Aug 26 1998

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume1461 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other6th Annual European Symposium on Algorithms, ESA 1998
    CountryItaly
    CityVenice
    Period8/24/988/26/98

      Fingerprint

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Berman, P., & Garay, J. A. (1998). Adaptability and the usefulness of hints. In Algorithms, ESA 1998 - 6th Annual European Symposium, Proceedings (pp. 271-282). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1461 LNCS). Springer Verlag.