GridFlow: Workflow Management for Grid Computing
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Maximum Pressure Policies in Stochastic Processing Networks
Operations Research
Adaptive Control of Extreme-scale Stream Processing Systems
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks
IEEE Transactions on Mobile Computing
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Stable and utility-maximizing scheduling for stochastic processing networks
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
IBM infosphere streams for scalable, real-time, intelligent transportation services
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The optimality of two prices: maximizing revenue in a stochastic communication system
IEEE/ACM Transactions on Networking (TON)
Energy optimal control for time-varying wireless networks
IEEE Transactions on Information Theory
Super-fast delay tradeoffs for utility optimal fair scheduling in wireless networks
IEEE Journal on Selected Areas in Communications
Utility optimal scheduling in energy-harvesting networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We consider the problem of utility optimal scheduling in general processing networks with random arrivals and network conditions. These are generalizations of traditional data networks where commodities in one or more queues can be combined to produce new commodities that are delivered to other parts of the network, and can be used to model problems such as in-network data fusion, stream processing, MapReduce scheduling, and grid computing. Scheduling actions are complicated by the underflow problem that arises when some queues with required components go empty. In this paper, we develop a novel methodology for constructing and analyzing online algorithms for such processing networks. Specifically, we develop the Perturbed Max-Weight algorithm (PMW) to achieve optimal utility. The idea of PMW is to perturb the weights used by the usual Max-Weight algorithm to ''push'' queue levels toward non-zero values (avoiding underflows). We then show, using a novel combination of Lyapunov drift analysis and duality theory, that when the perturbations are carefully chosen, PMW is able to achieve a utility that is within O(1/V) of the optimal value for any V=1, while ensuring an average network backlog of O(V). The methodology developed here is very general and can also be applied to other problems that involve such underflow constraints.