skip to main content
10.1145/1462689.1462692acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmiddlewareConference Proceedingsconference-collections
research-article

Execution plans for cyber foraging

Published:01 December 2008Publication History

ABSTRACT

Cyber foraging helps small devices perform heavy tasks by opportunistically discovering and utilising available resources (such as computation, storage, bandwidth, etc.) held by larger, nearby peers. This offloading is done in an ad-hoc manner, as larger machines will not always be within reach.

In order to facilitate cyber foraging, an application has to be split up into locally executable code (e.g., GUI-code) and remotely executable tasks. Most cyber foraging systems strive to keep these tasks as large as possible, so that the benefits of executing code on a faster machine outweighs the cost of remote execution. Working with large, atomic tasks has some limitations, e. g., with regards to mobility and efficient use of remote resources. In order to dynamically allocate available resources in a manner most suitable for a given job, a task can be broken down into sub-tasks and services, and arranged in an directed graph. Using this graph combined with information about available, nearby peers, a cyber foraging scheduler can distribute tasks across multiple peers, allowing the user to do more with less.

This paper presents the Locusts cyber foraging framework, with special focus on the task description language and the associated scheduler.

References

  1. R. K. Balan, D. Gergle, M. Satyanarayanan, and J. Herbsleb. Simplifying cyber foraging for mobile devices. In MobiSys '07, pages 272--285, New York, NY, USA, 2007. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. R. K. Balan, M. Satyanarayanan, S. Y. Park, and T. Okoshi. Tactics-based remote execution for mobile computing. In MobiSys '03, pages 273--286, New York, NY, USA, 2003. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. M. Chess. Security issues in mobile code systems. In Mobile Agents and Security, pages 1--14. Springer Berlin / Heidelberg, 1998. Google ScholarGoogle ScholarCross RefCross Ref
  4. J. Flinn, S. Park, and M. Satyanarayanan. Balancing performance, energy, and quality in pervasive computing. In Distributed Computing Systems, 2002. Proc., pages 217--226, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. D. Kristensen. Enabling cyber foraging for mobile devices. In Proceedings of the 5th MiNEMA Workshop, pages 32--36, Magdeburg, Germany, September 2007.Google ScholarGoogle Scholar
  6. M. D. Kristensen. Scavenger -- mobile remote execution. Technical Report DAIMI PB-587, University of Aarhus, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  7. M. D. Kristensen and N. O. Bouvin. Developing cyber foraging applications for portable devices. Portable Information Devices, 2008. Portable08. IEEE International Conference on, August 2008.Google ScholarGoogle ScholarCross RefCross Ref
  8. M. Satyanarayanan. Pervasive computing: vision and challenges. Personal Communications, IEEE, 8(4):10--17, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  9. G. Singh, C. Kesselman, and E. Deelman. Optimizing grid-based workflow execution. Journal of Grid Computing, 3(3):201--219, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  10. Y.-Y. Su and J. Flinn. Slingshot: deploying stateful services in wireless hotspots. In MobiSys '05, pages 79--92, New York, NY, USA, 2005. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Execution plans for cyber foraging

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      MobMid '08: Proceedings of the 1st workshop on Mobile middleware: embracing the personal communication device
      December 2008
      43 pages
      ISBN:9781605583624
      DOI:10.1145/1462689
      • Program Chairs:
      • Oriana Riva,
      • Luis Veiga

      Copyright © 2008 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 December 2008

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader