A Unified Modeling Framework for Distributed Resource Allocation of General Fork and Join Processing Networks in ACM SIGMETRICS 2010 1.

Slides:



Advertisements
Similar presentations
A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS.
Advertisements

February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Mission-based Joint Optimal Resource Allocation in Wireless Multicast Sensor Networks Yun Hou Prof Kin K. Leung Archan Misra.
Traffic Control and the Problem of Congestion within the Internet By Liz Brown and Nadine Sur.
Utility Optimization for Event-Driven Distributed Infrastructures Cristian Lumezanu University of Maryland, College Park Sumeer BholaMark Astley IBM T.J.
January 23 rd, Document classification task We are interested to solve a task of Text Classification, i.e. to automatically assign a given document.
Hadi Goudarzi and Massoud Pedram
INTRODUCTION TO MODELING
Price-based Resource Allocation in Wireless Ad Hoc Networks Yuan Xue, Baochun Li and Klara Nahrstedt University of Illinois at Urbana-Champaign University.
Multi-scale Planning and Scheduling Under Uncertain and Varying Demand Conditions in the Pharmaceutical Industry Hierarchically Structured Integrated Multi-scale.
Rake Linking for Suburban Train Services. Rake-Linker The Rake-Linker assigns physical trains (rakes) to services that have been proposed in a timetable.
Decomposable Optimisation Methods LCA Reading Group, 12/04/2011 Dan-Cristian Tomozei.
Network Optimization Models: Maximum Flow Problems
An Energy Efficient Hierarchical Heterogeneous Wireless Sensor Network
The Cache Location Problem IEEE/ACM Transactions on Networking, Vol. 8, No. 5, October 2000 P. Krishnan, Danny Raz, Member, IEEE, and Yuval Shavitt, Member,
Funding Networks Abdullah Sevincer University of Nevada, Reno Department of Computer Science & Engineering.
Abhijit Davare 1, Qi Zhu 1, Marco Di Natale 2, Claudio Pinello 3, Sri Kanajan 2, Alberto Sangiovanni-Vincentelli 1 1 University of California, Berkeley.
11 1 Hierarchical Coarse-grained Stream Compilation for Software Defined Radio Yuan Lin, Manjunath Kudlur, Scott Mahlke, Trevor Mudge Advanced Computer.
Charge-Sensitive TCP and Rate Control Richard J. La Department of EECS UC Berkeley November 22, 1999.
CES 514 – Data Mining Lecture 8 classification (contd…)
Network Optimization Models: Maximum Flow Problems In this handout: The problem statement Solving by linear programming Augmenting path algorithm.
Gene Regulatory Networks - the Boolean Approach Andrey Zhdanov Based on the papers by Tatsuya Akutsu et al and others.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley Asynchronous Distributed Algorithm Proof.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Multiple Sender Distributed Video Streaming Nguyen, Zakhor IEEE Transactions on Multimedia April 2004.
Flow Models and Optimal Routing. How can we evaluate the performance of a routing algorithm –quantify how well they do –use arrival rates at nodes and.
Steady and Fair Rate Allocation for Rechargeable Sensors in Perpetual Sensor Networks Zizhan Zheng Authors: Kai-Wei Fan, Zizhan Zheng and Prasun Sinha.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
1 IEEE Trans. on Smart Grid, 3(1), pp , Optimal Power Allocation Under Communication Network Externalities --M.G. Kallitsis, G. Michailidis.
EE 685 presentation Distributed Cross-layer Algorithms for the Optimal Control of Multi-hop Wireless Networks By Atilla Eryılmaz, Asuman Özdağlar, Devavrat.
Flows and Networks Plan for today (lecture 5): Last time / Questions? Blocking of transitions Kelly / Whittle network Optimal design of a Kelly / Whittle.
An Autonomic Framework in Cloud Environment Jiedan Zhu Advisor: Prof. Gagan Agrawal.
Mazumdar Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN N ETWORKING 1 Non-convex.
1 Transport BW Allocation, and Review of Network Routing 11/2/2009.
Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.
Optimization Flow Control—I: Basic Algorithm and Convergence Present : Li-der.
Congestion Control in CSMA-Based Networks with Inconsistent Channel State V. Gambiroza and E. Knightly Rice Networks Group
EE 685 presentation Utility-Optimal Random-Access Control By Jang-Won Lee, Mung Chiang and A. Robert Calderbank.
Paper # – 2009 A Comparison of Heterogeneous Video Multicast schemes: Layered encoding or Stream Replication Authors: Taehyun Kim and Mostafa H.
Localized Algorithm for Aggregate Fairness in Wireless Sensor Networks Authors : Shigang Chen, Zhan Zhang CISE university of Florida CISE university of.
CS 4407, Algorithms University College Cork, Gregory M. Provan Network Optimization Models: Maximum Flow Problems In this handout: The problem statement.
On the Optimal Scheduling for Media Streaming in Data-driven Overlay Networks Meng ZHANG with Yongqiang XIONG, Qian ZHANG, Shiqiang YANG Globecom 2006.
Simultaneous routing and resource allocation via dual decomposition AUTHOR: Lin Xiao, Student Member, IEEE, Mikael Johansson, Member, IEEE, and Stephen.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.
1 - CS7701 – Fall 2004 Review of: Detecting Network Intrusions via Sampling: A Game Theoretic Approach Paper by: – Murali Kodialam (Bell Labs) – T.V. Lakshman.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
1  Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Paper Title Authors names Conference and Year Presented by Your Name Date.
Distributed Network Coding Based Opportunistic Routing for Multicast Abdallah Khreishah, Issa Khalil, and Jie Wu.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
Bing Wang, Wei Wei, Hieu Dinh, Wei Zeng, Krishna R. Pattipati (Fellow IEEE) IEEE Transactions on Mobile Computing, March 2012.
A Brief Maximum Entropy Tutorial Presenter: Davidson Date: 2009/02/04 Original Author: Adam Berger, 1996/07/05
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Optimizing server placement in distributed systems in the presence of competition Jan-Jan Wu( 吳真貞 ), Shu-Fan Shih ( 施書帆 ), Pangfeng Liu ( 劉邦鋒 ), Yi-Min.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
1 Transport Bandwidth Allocation 3/29/2012. Admin. r Exam 1 m Max: 65 m Avg: 52 r Any questions on programming assignment 2 2.
BAHIR DAR UNIVERSITY Institute of technology Faculty of Computing Department of information technology Msc program Distributed Database Article Review.
Authors: Jiang Xie, Ian F. Akyildiz
BIPARTITE GRAPHS AND ITS APPLICATIONS
The minimum cost flow problem
Server Allocation for Multiplayer Cloud Gaming
Year 2 Updates.
IEEE Student Paper Contest
Flows and Networks Plan for today (lecture 6):
Software models - Software Architecture Design Patterns
Networked Real-Time Systems: Routing and Scheduling
ACHIEVEMENT DESCRIPTION
Paper discussed in class: M. Chiodo, P. Giusto, A. Jurecska, H
Presentation transcript:

A Unified Modeling Framework for Distributed Resource Allocation of General Fork and Join Processing Networks in ACM SIGMETRICS

Agenda Introduction System Description A Unified Modeling Framework Distributed Algorithm Performance Analysis Extensions Evaluation Conclusion 2

Introduction Fork and Join Processing Networks arise in many networked or distributed computing areas, including cloud computing. Data processing software typically consists of a rich set of semantics that define – Join: how data from various input links are processed – Fork: how output data are disseminated to each output link 3

Join and Fork Join Fork 4

Introduction (cont’d) Four types of fork and join: – synchronous  -join, asynchronous  -join With a synchronous join, data from all input buffers are assembled simultaneously; whereas an asynchronous join processes data from one input buffer at a time. – synchronous  -fork, asynchronous  -fork A synchronous fork dis-assemble or duplicate data over all output links simultaneously; while an asynchronous fork sends data over one output link at a time. 5

Introduction (cont’d) Our goal is to address the problem of distributed resource allocation in such general fork and join processing networks. – how to formulate the resource allocation problem for a general fork and join processing network? – the different types of semantics and processing requirements introduce complex interdependencies among the various data flows – These ingredients make the distributed resource allocation problem much more challenging. 6

System Description G 0 = (V 0, E 0 ), where V 0 = S 0  P 0  D 0 consists of three types of nodes: (data) sources S 0, (processing) tasks P 0 and (data) sinks D 0. Assume there is a finite set of resources R. We view each resource as a ‘server’ r  R, which has limited capacity R r. Assume the tasks have been assigned to the various servers Objective: maximize the sum of the utilities for all the flow output rates 7

A Unified Modeling Framework One important characteristic of a fork and join processing network is that it can be “lossy”. In such a “lossy” network, the flow constraint is that a child node cannot consume more than what the parent node can output, i.e., we must have 8

Bipartite Model  -join,  -fork  -join,  -fork  -join,  -fork  -join,  -fork 9

The Resource Allocation Problem Utility of sinks Flow constraints Resource constraints 10

The Dual Decomposition Lagrange function The dual problem is 11

The Dual Decomposition (cont’d) When the multipliers (p m,m  M) are given, the solution to the above congestion control and resource allocation problems are straight-forward: 12

Distributed Algorithm Shadow Queue Based Algorithm – Since utility is charged at the sinks, update equation (13) suggests that the shadow prices (multipliers) can be related to credits created at the sinks and that flow bottom up towards the sources. – That is, a back-pressure algorithm can be applied to the shadow queues on the reversed graph – Credits in the shadow queues can be used to guide the processing of the real queues 13

Shadow Queue Based Algorithm 14

Back-pressure algorithm on shadow queues 15

Evaluation We use the task graph in Figure 1. All resource constraints are set to 100 except R r1 = 90. The utility functions are set to the natural log function (U a (x) = ln(x)). 16

Evaluation (cont’d) After 1000 iterations, the resource for server r 2 is reduced from 100 to 70. After another 1000 iterations, the importance of the d 2 output stream is increased by changing its utility function from ln(x) to 2 ln(x). 17

Sink Output Rates and Total Utility 18 r 2 : 100->90 d 2 *2

Other detail results 19 Real queue at sink is stable. P 5 is a simultaneous join and is involved in a lossy link from p 3.

Conclusion This paper propose a unified modeling framework that can represent all combinations of fork and join semantics, and formulate the resource allocation problem into an elegant optimization problem The authors further present a shadow queue based algorithm to solve the resource allocation problem in a distributed fashion. 20

Comments This paper considered a more complex task network and resource allocation problem. – Flaw: tasks on which server is fixed. A distributed resource allocation algorithm would be a major concern in the research of cloud computing. – The approach in this paper is still too complex. The issue of service model of a cloud service must also be considered. 21