Skip to main content
SpringerLink
Log in

Multi-Fidelity Algorithms for Interactive Mobile Applications

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

We introduce the concept of multi-fidelity algorithms, which revises the classical notion of an algorithm. Instead of having a fixed output criterion and allowing the resource consumption to vary, we bound the resource consumption and allow the fidelity or output criterion to vary. We discuss how multi-fidelity algorithms can improve the latency and battery life of interactive mobile applications. An extension of this idea allows the system to automatically discover sweet spots: sharp discontinuities in the fidelity-resource tradeoff space.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Aeschlimann, P. Dinda, L. Kallivokas, J. López, B. Lowekamp and D. O'Hallaron, Preliminary report on the design of a framework for distributed visualization, in: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'99), Las Vegas, NV (June 1999).

  2. M.F. Cohen and J.R. Wallace, Radiosity and Realistic Image Synthesis (Academic Press Professional, Boston, MA, 1993).

    Google Scholar 

  3. T. Dean and M. Boddy, An analysis of time-dependent planning, in: Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI-88), Saint Paul, MN (AAAI Press/MIT Press, August 1988) pp. 49–54.

  4. W. Feng and J.W.S. Liu, An extended imprecise computation model for time-constrained speech processing and generation, in: Proceedings of the IEEE Workshop on Real-Time Applications, New York, NY (May 1993) pp. 76–80.

  5. W. Feng and J.W.S. Liu, Algorithms for scheduling tasks with input error and end-to-end deadlines, Technical report UIUCDCS-R–94–1888, University of Illinois at Urbana-Champaign (September 1994).

  6. M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic, D. Steele and P. Yanker, Query by image and video content: The QBIC system, Computer 28(9) (September 1995) 23–32.

    Google Scholar 

  7. J. Flinn and M. Satyanarayanan, PowerScope: A tool for profiling the energy usage of mobile applications, in: Proceedings of the Second IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA (February 1999).

  8. J. Flinn and M. Satyanarayanan, Energy-aware adaptation for mobile application, in: Seventeenth ACM Symposium on Operating Systems Principles (SOSP'99), Kiawah Island, SC (December 1999) pp. 48–63.

  9. G.H. Forman and J. Zahorjan, The challenges of mobile computing, IEEE Computer 27(4) (April 1994).

  10. A. Frieze, R. Kannan and S. Vempala, Fast Monte-Carlo algorithms for finding low-rank approximations, in: IEEE Symposium on Foundations of Computer Science (FOCS), Palo Alto, CA (1998).

  11. M.R. Garey and D.S. Johnson, Computers and Intractability (Freeman and Co., New York, 1979).

    Google Scholar 

  12. D. Hull, W. Feng and J.W.S. Liu, Operating system support for imprecise computation, in: Flexible Computation in Intelligent Systems: Results, Issues, and Opportunities, Cambridge, MA (November 1996).

  13. R.H. Katz, Adaptation and mobility in wireless information systems, IEEE Personal Communications 1(1) (1996).

  14. F. Korn, H.V. Jagadish and C. Faloutsos, Efficiently supporting ad hoc queries in large datasets of time sequences, in: Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, Tucson, AZ (May 1997).

  15. R. Motwani and P. Raghavan, Randomized Algorithms (Cambridge University Press, Cambridge, UK, 1995).

    Google Scholar 

  16. D.J. Musliner, E.H. Durfee and K.G. Shin, Any-dimension algorithms, in: Proc. Workshop on Real-Time Operating Systems and Software (May 1992) pp. 78–81.

  17. D. Narayanan, J. Flinn and M. Satyanarayanan, Using history to improve mobile application adaptation, in: Proceedings of the Third IEEE Workshop on Mobile Computing Systems and Applications (WMCSA 2000), Monterey, CA (December 2000).

  18. B.D. Noble, M. Satyanarayanan, D. Narayanan, J.E. Tilton, J. Flinn and K.R. Walker, Agile application-aware adaptation for mobility, in: Proceedings of the 16th ACM Symposium on Operating Systems and Principles, Saint-Malo, France (October 1997).

  19. M. Satyanarayanan, Mobile information access, IEEE Personal Communications 3(1) (February 1996).

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA, 15213, USA

    M. Satyanarayanan & Dushyanth Narayanan

Authors
  1. M. Satyanarayanan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dushyanth Narayanan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Satyanarayanan, M., Narayanan, D. Multi-Fidelity Algorithms for Interactive Mobile Applications. Wireless Networks 7, 601–607 (2001). https://doi.org/10.1023/A:1012315301312

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1012315301312

Search

Navigation