Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
An On-Line Algorithm for Some Uniform Processor Scheduling
SIAM Journal on Computing
A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling
SIAM Journal on Computing
An Analysis of EDF Schedulability on a Multiprocessor
IEEE Transactions on Parallel and Distributed Systems
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Distributed Fair Scheduling in a Wireless LAN
IEEE Transactions on Mobile Computing
Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem
Journal of Heuristics
Kinetically stable task assignment for networks of microservers
Proceedings of the 5th international conference on Information processing in sensor networks
CalRadio: a portable, flexible 802.11 wireless research platform
MobiEval '07 Proceedings of the 1st international workshop on System evaluation for mobile platforms
| Hi-index | 0.00 |
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).