skip to main content
research-article

Enabling rich mobile applications: joint computation and communication scheduling

Published: 21 January 2010 Publication History

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).

References

[1]
S. Mukhopadhyay, C. Schurgers, and S. Dey, "Joint Computation and Communication Scheduling to Enable Rich Mobile Applications," in IEEE Global Telecommunications Conference (GLOBECOM'07), Nov. 2007, pp. 2117--2122.
[2]
K. Ramamritham, J. Stankovic, and W. Zhao, "Distributed scheduling of tasks with deadlines and resource requirements," IEEE Transactions on Computers, vol. 38, no. 8, 1989.
[3]
J. Chen and A. Miranda, "A polynomial time approximation scheme for general multiprocessor job scheduling," SIAM Journal on Computing, vol. 31, no. 1, 2001.
[4]
R. Li and L. Shi, "An on-line algorithm for some uniform processor scheduling," SIAM Journal on Computing, vol. 27, no. 2, 1998.
[5]
Z. Abrams, H.-L. Chen, L. Guibas, J. Liu, and F. Zhao, "Kinetically stable task assignment for networks of microservers," in Proc. IEEE Information processing in sensor networks (IPSN), 2006.
[6]
G. L. Marko Bertogna, Michele Cirinei, "Improved schedulability analysis of edf on multiprocessor platforms," in 17th Euromicro Conference on Real-Time Systems (ECRTS'05), 2005, pp. 209--218.
[7]
T. Baker, "An analysis of EDF schedulability on a multiprocessor," Parallel and Distributed Systems, IEEE Trans. on, vol. 16, no. 8, 2005.
[8]
N. Vaidya, A. Dugar, S. Gupta, and P. Bahl, "Distributed fair scheduling in a wireless LAN," Mobile Computing, IEEE Transactions on, vol. 4, no. 6, 2005.
[9]
Y. Liu and E. Knightly, "Opportunistic fair scheduling over multiple wireless channels," in Proc. IEEE INFOCOM, 2003.
[10]
L. Tassiulas and S. Sarkar, "Maxmin fair scheduling in wireless networks," in Proc. IEEE INFOCOM, 2002.
[11]
D. Julian, M. Chiang, D. O'Neill, and S. Boyd, "QoS and fairness constrained convex optimization of resource allocation for wireless cellular and ad hoc networks," in Proc. IEEE INFOCOM, 2002.
[12]
T. Elbatt and A. Ephremides, "Joint scheduling and power control for wireless ad-hoc networks," in Proc. IEEE INFOCOM, 2002.
[13]
R. L. Cruz and A. V. Santhanam, "Optimal routing, link scheduling and power control in multihop wireless networks," in Proc. IEEE INFOCOM, 2003.
[14]
D. P. Bertsekas, Nonlinear Programming. Athena Scientific, 1999.
[15]
R. Ahuja and C. Cunha, "Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem," Journal of Heuristics, vol. 11, no. 5-6, pp. 465--481, 2005.
[16]
A. Jow, C. Schurgers, and D. Palmer, "Calradio: a portable, flexible 802.11 wireless research platform," in MobiEval '07: Proceedings of the 1st international workshop on System evaluation for mobile platforms. New York, NY, USA: ACM, 2007, pp. 49--54.
[17]
"The Network Simulator-ns2." {Online}. Available: http://www.isi.edu/nsnam/ns/

Cited By

View all
  • (2014)Rich Mobile ApplicationsJournal of Network and Computer Applications10.5555/2773807.277405440:C(345-362)Online publication date: 1-Apr-2014
  • (2014)Rich Mobile Applications: Genesis, taxonomy, and open issuesJournal of Network and Computer Applications10.1016/j.jnca.2013.09.00940(345-362)Online publication date: Apr-2014

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMOBILE Mobile Computing and Communications Review
ACM SIGMOBILE Mobile Computing and Communications Review  Volume 13, Issue 3
July 2009
61 pages
ISSN:1559-1662
EISSN:1931-1222
DOI:10.1145/1710130
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 January 2010
Published in SIGMOBILE Volume 13, Issue 3

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2014)Rich Mobile ApplicationsJournal of Network and Computer Applications10.5555/2773807.277405440:C(345-362)Online publication date: 1-Apr-2014
  • (2014)Rich Mobile Applications: Genesis, taxonomy, and open issuesJournal of Network and Computer Applications10.1016/j.jnca.2013.09.00940(345-362)Online publication date: Apr-2014

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media