List scheduling with and without communication delays
Parallel Computing
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Ad Hoc Wireless Networks: Protocols and Systems
Ad Hoc Wireless Networks: Protocols and Systems
Optimal Scheduling of Cooperative Tasks in a Distributed System Using an Enumerative Method
IEEE Transactions on Software Engineering
Self-Tuned Remote Execution for Pervasive Computing
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
An advanced signature system for OLSR
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
| Hi-index | 0.00 |
In this paper we present a consolidated scheduling and routing solution to the multimedia ad hoc network problem. We consider a generic ad hoc network with all kinds of heterogeneous devices. These devices are known to have different capabilities and capacities in terms of system resources and network connection speeds. We propose a task partitioning and scheduling mechanism which results in distribution of N tasks with various real-time constraints and work loads on M heterogeneous devices.It has been shown that in case of M=1 an optimal solution to task scheduling can be obtained with computational complexity O(N) however for M≥2 the scheduling algorithm can be demonstrated to be NP-hard by reducing it to the well known NP-Complete bin-packing problem The mechanism proposed in this paper considers device capabilities, Link capacities and task constraints to find a near optimal solution to the multimedia scheduling problem in Ad hoc networks.