Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Enabling rich mobile applications: joint computation and communication scheduling

Enabling rich mobile applications: joint computation and communication scheduling With the universal adoption of mobile communication devices for many common computing applications like email and web access, there is a growing demand to use these devices for richer applications that require high computing power. This paper looks at a way of enabling thin wireless clients to support powerful applications by using processing and networking infrastructure that are available in our surroundings. One of the major challenges is in determining how to schedule both the wireless communication and computing resources together to support a broad set of client nodes. This scheduling has to take into account the resource limitations and locations of the processing elements, as well as the constraints on wireless communication, in terms of available channels and the capacity of each channel. Additionally, the scheduling needs to be completed in a short time, in order to minimize the delay in initiating the applications after the clients request the resources. We present this in the form of a joint-scheduling problem, and present a fast algorithm that can perform this scheduling efficiently. Our approach can achieve a scheduling performance close to the optimal exhaustive solution, but with an execution time that is reduced by three or more orders of magnitude (from hours to seconds). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGMOBILE Mobile Computing and Communications Review Association for Computing Machinery

Enabling rich mobile applications: joint computation and communication scheduling

Download PDF
12 pages

Loading next page...
 
/lp/association-for-computing-machinery/enabling-rich-mobile-applications-joint-computation-and-communication-kggM0qfjnV

References (20)

Publisher
Association for Computing Machinery
Copyright
The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
ISSN
1559-1662
DOI
10.1145/1710130.1710133
Publisher site
See Article on Publisher Site

Abstract

With the universal adoption of mobile communication devices for many common computing applications like email and web access, there is a growing demand to use these devices for richer applications that require high computing power. This paper looks at a way of enabling thin wireless clients to support powerful applications by using processing and networking infrastructure that are available in our surroundings. One of the major challenges is in determining how to schedule both the wireless communication and computing resources together to support a broad set of client nodes. This scheduling has to take into account the resource limitations and locations of the processing elements, as well as the constraints on wireless communication, in terms of available channels and the capacity of each channel. Additionally, the scheduling needs to be completed in a short time, in order to minimize the delay in initiating the applications after the clients request the resources. We present this in the form of a joint-scheduling problem, and present a fast algorithm that can perform this scheduling efficiently. Our approach can achieve a scheduling performance close to the optimal exhaustive solution, but with an execution time that is reduced by three or more orders of magnitude (from hours to seconds).

Journal

ACM SIGMOBILE Mobile Computing and Communications Review – Association for Computing Machinery

Published: Jan 21, 2010

There are no references for this article.