Sciweavers

Share
INFOCOM
2010
IEEE

Distributed Resource Allocation for Synchronous Fork and Join Processing Networks

10 years 9 months ago
Distributed Resource Allocation for Synchronous Fork and Join Processing Networks
—Many emerging information processing applications require applying various fork and join type operations such as correlation, aggregation, and encoding/decoding to data streams in real-time. Each operation will require one or more simultaneous input data streams and produce one or more output streams, where the processing may shrink or expand the data rates upon completion. Multiple tasks can be co-located on the same server and compete for limited resources. Effective innetwork processing and resource management in a distributed heterogeneous environment is critical to achieving better scalability and provision of quality of service. In this paper, we study the distributed resource allocation problem for a synchronous fork and join processing network, with the goal of achieving the maximum total utility of output streams. Using primal and dual based optimization techniques, we propose several decentralized iterative algorithms to solve the problem, and design protocols that impleme...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona
Added 28 Jan 2011
Updated 28 Jan 2011
Type Journal
Year 2010
Where INFOCOM
Authors Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Donald F. Towsley
Comments (0)
books