Skip to main content
Springer Nature Link
Log in

Adaptability and the Usefulness of Hints (Extended Abstract)

  • Conference paper
  • First Online:
Algorithms — ESA’ 98 (ESA 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1461))

Included in the following conference series:

  • 1011 Accesses

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.

Work partly done while the author was visiting the Centrum voor Wiskunde en Informatica (CWI), Amsterdam, NL, and at the IBM T.J. Watson Research Center, Yorktown Heights.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. S. Albers, Better bounds for online scheduling. Proc. 29th Annual ACM Symp. on the Theory of Computing, pp. 130–139, El Paso, TX, May 1997.

    Google Scholar 

  2. M. Ajtai, J. Aspnes, C. Dwork, and O. Waarts. A Theory of Competitive Analysis for Distributed Algorithms. Proc. 33rd IEEE Symp. on the Foundations of Computer Science, pp. 401–411, November 1994.

    Google Scholar 

  3. Y. Azar, A. Broder and M. Manasse. On-line choice of on-line algorithms. Proc. 4th Annual ACM/SIAM Symp. on Discrete Algorithms, pp. 432–440, 1993.

    Google Scholar 

  4. J. Aspnes and O. Waarts. Modular Competitiveness for Distributed Algorithms. Proc. 28th Annual ACM Symp. on the Theory of Computing, pp. 237–246, Philadelphia, PA, May 1996.

    Google Scholar 

  5. A. Bar-Noy, D. Dolev, C. Dwork and H.R. Strong. Shifting gears: changing algorithms on the fly to expedite Byzantine Agreement. Proc. 6th ACM Symposium on the Principles of Distributed Computing, pp. 42–51, 1987.

    Google Scholar 

  6. Y. Bartal, A. Fiat, H. Karloff and Y. Rabani, New algorithms for the ancient scheduling problem. Journal of Computer and System Sciences, 51:359–366, 1995.

    Article  MathSciNet  Google Scholar 

  7. P. Berman, J. Garay, and K. Perry. Bit Optimal Distributed Consensus. In Computer Science Research (ed. R. Yaeza-Bates and U. Manber), Plenum Publishing Corporation, NY, NY, pp. 313–322, 1992.

    Google Scholar 

  8. P. Berman, J. Garay, and K. Perry. Optimal Early Stopping in Distributed Consensus. Proc. 6th International Workshop on Distributed Algorithms, LNCS (647), Springer-Verlag, pp. 221–237, Haifa, Israel, November 1992.

    Google Scholar 

  9. A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive Paging with Locality of Reference. Proc. 23rd Annual ACM Symp. on the Theory of Computing, pp. 249–259, New Orleans, Louisiana, May 1991.

    Google Scholar 

  10. B. Coan and J. Welch, Modular Construction of an Efficient 1-Bit Byzantine Agreement Protocol. Mathematical Systems Theory, special issue on Fault-Tolerant Distributed Algorithms (ed. H.R. Strong), Vol. 26, No. 1 (1993).

    Google Scholar 

  11. D. Dolev and R. Reischuk, Bounds of Information Exchange for Byzantine Agreement. JACM, Vol. 32, No. 1, pp. 191–204, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  12. D. Dolev, R. Reischuk and H.R. Strong. Early Stopping in Byzantine Agreement. JACM, Vol. 37, No. 4 (1990), pp. 720–741.

    Article  MATH  MathSciNet  Google Scholar 

  13. U. Faigle, W. Kern and G. Turan, On the performance of online algorithms for particular problems. Acta Cybernetica, 9:107–119, 1989.

    MATH  MathSciNet  Google Scholar 

  14. M. J. Fischer and N. A. Lynch. A lower bound for the time to assure interactive consistency. Inf. Proc. Letters, 14 (1982), pp. 183–186.

    Article  MATH  MathSciNet  Google Scholar 

  15. R.L. Graham. Bounds on multiprocessing anomalies. SIAM Journal of Applied Mathematics, 17:263–269, 1969.

    Google Scholar 

  16. V. Hadzilacos and J. Halpern. Message-Optimal Protocols for Byzantine Agreement. Proc. 10th Annual ACM Symp. on the Principles of Distributed Computing, pp. 309–324, Montreal, Canada, August 1991.

    Google Scholar 

  17. D.R. Karger, S.J. Phillips and E. Torng, A better algorithm for an ancient scheduling problem, Journal of ALgorithms, 20:400–430, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  18. A. Karlin, M. Manasse, L. Rudolph, and D. Sleator. Competitive Snoopy Caching. Algorithmica, 3(1):70–119, 1988.

    Article  MathSciNet  Google Scholar 

  19. A. Karlin, S. Phillips, and P. Raghavan. Markov Paging. Proc. 33rd Annual IEEE Symp. on Foundations of Computer Science, pp. 208–217, 1992.

    Google Scholar 

  20. L. Lamport, R.E. Shostak and M. Pease. The Byzantine generals problem. ACM Trans. Prog. Lang. and Systems, 4:3 (1982), pp. 382–401.

    Article  MATH  Google Scholar 

  21. D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 32:652–686, 1985.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department Pond Lab, The Pennsylvania State University, University Park, 16802, USA

    Piotr Berman

  2. Bell Laboratories, Information Sciences Research Center, 600 Mountain Ave, Murray Hill, NJ, 07974, USA

    Juan A. Garay

Authors
  1. Piotr Berman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juan A. Garay
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Elettronica e Informatica, Università di Padova, via Gradenigo 6/A, I-35131, Padova, Italy

    Gianfranco Bilardi  & Geppino Pucci  & 

  2. Department of Electrical Engineering and Computer Science, The University of Illinois at Chicago, 851 South Morgan Street - 1009 SEO, Chicago, IL, 60607-7053, USA

    Gianfranco Bilardi

  3. Dipartimento di Matematica Applicata e Informatica, Università “Cá Foscari” di Venezia, via Torino 155, I-30173, Venezia Mestre, Italy

    Giuseppe F. Italiano

  4. Dipartimento di Matematica Pura e Applicata, Università di Padova, via Belzoni 7, I-35131, Padova, Italy

    Andrea Pietracaprina

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berman, P., Garay, J.A. (1998). Adaptability and the Usefulness of Hints (Extended Abstract). In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds) Algorithms — ESA’ 98. ESA 1998. Lecture Notes in Computer Science, vol 1461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-68530-8_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64848-2

  • Online ISBN: 978-3-540-68530-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics