# An algorithm for Performance Analysis of Single-Source Acyclic graphs

Size: px
Start display at page:

## Transcription

1 An algorithm for Performance Analysis of Single-Source Acyclic graphs Gabriele Mencagli September 26, 2011 In this document we face with the problem of exploiting the performance analysis of acyclic graphs of cooperating computation modules. In particular we need an algorithm designed for solving the following problem: Problem 0.1 (Steady-state analysis of acyclic computation graphs). Given an acyclic computation graph G = (V, E), in which nodes represent computation modules and edges are data streams, we need a procedure that determines the inter-departure times, that is the effective performance behavior at steady-state, of each node in the graph. 25 t 40 t 0.3 S t 30 t 0.6 S S 6 S S t t t S 3 S 7 Figure 1: An acyclic computation graph labeled with the ideal service times of each node and the routing probabilities. In Figure 1 is depicted an example of an acyclic computation graph of seven modules working asynchronously and cooperating by exchanging messages. In the graph each node is labeled with its ideal service time and, when a node has multiple out-going edges, they are labeled with the corresponding probability of transmission. We need an algorithm that has the following features: ˆ it needs to perform an ordered graph traversal: to correctly establish for each node its inter-arrival time and thus its utilization factor, each node should be visited only when all its in-coming neighbors have been visited and their inter-departure times correctly determined; 1

2 ˆ for each node of the graph it is necessary to calculate its inter-arrival time and its utilization factor in order to discover if it is a bottleneck or not. We have two possible situations: (1) the currently visited node is not a bottleneck, i.e. its ideal service time is equal or less than its inter-arrival time and consequently the node influences neither the interdeparture times of the already visited nodes nor of the nodes that are still to be explored; (2) the current node is a bottleneck and it influences the inter-departure times of the previously explored nodes that will be properly incremented. The first requirement implies that the nodes of the graph should be visited according to a specific ordering. As it is known from basic notions in Graph Theory, every directed acyclic graph has at least one topological ordering, i.e. an ordering of its nodes such that the starting vertex of every edge occurs earlier in the ordering than the ending vertex. It can also be shown that an acyclic graph can have multiple admissible topological orderings. Therefore let us suppose to have one of these topological orderings as input of the algorithm. We can observe that if the algorithm visits the nodes following this ordering, the first requirement will be achieved: each node will be visited iff all its in-coming neighbors have already been explored. An example of a topological ordering of the graph in Figure 1 is depicted in Figure 2. S 1 S 2 S 3 S 4 S 5 S 6 S 7 Figure 2: A topological ordering of the graph depicted in Figure 1. We need a data-structure that represents a general node of the graph. Each node n has four numerical attributes that describe: (1) its inter-arrival time; (2) its ideal service time; (3) its inter-departure time; (4) its utilization factor. Moreover the node maintains a list OUT of references to out-going neighbors and a list IN of pairs (n, p), where n is a reference to one of its in-coming neighbors which transmits to n with probability p. Function of the node data-structure Class Node { double T A ; double T S ; double T p ; double ρ; ListNode OUT ; ListPair IN ; } These data-structures are properly initialized at the beginning of the algorithm execution. For each node the service time variable and the IN and OUT lists are properly initialized according to the structure of the input graph. The 2

3 inter-arrival, the inter-departure times and the utilization factors will be calculated by the algorithm. For each sink node we assume the presence of a fictitious out-going edge such that the inter-departure time can always be defined. For each source node (although in-coming edges do not exist), the inter-arrival time is kept to be equal to the inter-departure time from that node (and furthermore at the beginning of the execution it coincides with the ideal service time of the node too). The algorithm evolves as follows: 1. The inputs are a directed graph G = (V, E) and one of its topological ordering S (represented as an array of V nodes); 2. The algorithm performs the graph traversal by visiting each node following the ordering S. For each explored node its inter-arrival time and its actual utilization factor are determined. Therefore we are able to identify if the node is a bottleneck or not; 3. If the currently explored node is not a bottleneck (ρ 1), its interdeparture time equals its inter-arrival time and the graph traversal continues with the next node in the topological ordering S; 4. If the explored node is a bottleneck (ρ > 1), its inter-departure time coincides with its ideal service time. At this point the algorithm needs to update the inter-departure times of the nodes already visited in the graph ordering; 5. The algorithm ends when all the nodes have been explored and no bottleneck has been discovered (i.e. nodes have an utilization factor less or equal to 1). The fourth point is the most critical one. In this section we introduce a formal algorithm for acyclic graphs in which there is exactly one source node. In this case we are able to define an efficient algorithm whose correctness can be proved by introducing the following invariant property: Invariant 0.2. When the i-th node in the input topological ordering S is visited, all the previously explored nodes (i.e. from the first one to the (i 1)-th of the ordering) have an utilization factor less or at most equal to 1. The invariant is satisfied at the beginning of the execution. Every topological ordering of a single source graph starts with the source node. As stated before, for this node its inter-arrival time is initialized to the ideal service time, thus its utilization factor is initially equal to 1. If, during the graph traversal, no bottleneck node is discovered, the algorithm will end when the last node is visited. In this case for each node its inter-departure time equals its inter-arrival time and the graph analysis can trivially be completed. On the other hand let us suppose that when the i-th node of ordering is visited, its utilization factor is greater than 1. This situation is depicted in Figure 3. We denote the currently discovered bottleneck the node S b at position i of the topological ordering. Its ideal service time T b is greater than its actual calculated inter-arrival time T A (i.e. ρ b > 1). Since, by the invariant, every previous node in the ordering has already been visited and its utilization factor is less (or equal) to 1, the inter-arrival time to S b can be expressed in function of the actual inter-departure time T ps from the unique source node of the graph. 3

4 π T A B S T ps π' T b Figure 3: Bottleneck discovery. To this end we take the set P(S b ) of all the paths in the graph starting from the source node and ending to the current bottleneck node S b. A path π is an ordered sequence of edges such that the origin of each is equal to the destination of its predecessor edge. E.g: π = (N 1, p 1, N 2 ), (N 2, p 2, N 3 ),..., (N k 1, p k 1, N k ) Where a directed edge is represented as a triple e = (N, p, N ) where the first and the third element are the two end-point vertices of the edge and the second element is the probability that the first node transmits to the second one. For brevity we indicate with the probability corresponding to the edge e. By invariant all the nodes preceding S b in the ordering have ρ 1, thus we can determine the inter-arrival time to S b by taking all the paths starting from the source node and ending to S b, and iteratively applying the Server Partitioning theorem to calculate the inter-arrival time to the bottleneck: T A = 1 (1) As we have seen the presence of the new discovered bottleneck node S b influences the inter-departure times of all the previously explored nodes: i.e. they must be properly corrected. After this correction, the new inter-arrival time T A to S b must be equal to its ideal service time T b. Thus, similarly to the previous case, we can express the new inter-arrival time to S b in function of the corrected inter-departure time from the source node T p s : T A = T p S T ps 1 = T b (2) In order to understand how we can correct the inter-departure time from the source, we can express the following relation: T p s = T ps α where α is a multi- 4

5 plicative factor. At this point we need to find an α such that: 1 = T b α T ps From which we obtain the right expression for the coefficient α: 1 T = ( ps ) = T b α T ps α We can observe that the first element of the equation is the original inter-arrival time T A, thus we can write: T A = T b α = α = T b T A = ρ b Therefore, when a new bottleneck node is discovered, we can correct the interdeparture time from the source node by multiplying the old inter-departure time by the utilization factor of the bottleneck node that has been discovered. Proposition 0.3 (Invariant preservation). During the algorithm execution, if the i-th node of the topological ordering is a bottleneck (ρ i > 1), we need to correct the inter-departure time from the source by multiplying this value by the utilization factor ρ i. Then the algorithm is re-started from the beginning and, this time, when the i-th node is reached its utilization factor will be equal to 1 and all the previous nodes will continue to have an utilization factor less than 1. Proof. This proposition proves the correctness of the algorithm. Multiplying the inter-departure time of the source by the utilization factor of the discovered bottleneck is the only way to achieve a new corrected inter-arrival time T A to S b equals its service time T b. Since ρ b > 1 this means that the corrected interdeparture time T p s is greater than the original one T ps, and thus the nodes preceding S b in the ordering will continue to have an utilization factor less than 1. 1 Algorithm description Algorithm 2 presents an automatic procedure for single source acyclic graph analysis. The algorithm proceeds in the following fashion. All the nodes are visited according to an input topological ordering. For each node is calculated its inter-arrival time by accessing its IN neighbor list (row 4). After that the utilization factor of the node is determined (row 5) and the bottleneck and nonbottleneck cases are examined. The most simply situation is when no bottleneck is discovered: in this case (from row 9 to 11) the inter-departure time of the current node is equal to the calculated inter-arrival time. Otherwise, if a bottleneck is discovered (from row 6 to 8), the inter-departure time of the source (first node in the ordering) is corrected as we have said and the visit re-starts from the beginning. 5

6 Algorithm 2: Steady-state Analysis(G, S) Data: a single-source acyclic graph G = (V, E) and one of its topological ordering S. Result: at the end of the execution the attribute T p of each node corresponds to its inter-departure time at steady-state. begin i 1; while i V do ( ) 1 p S[i].T A = ; u.t p end (u,p) S[i].IN S[i].ρ = S[i].T S ; S[i].T A if S[i].ρ > 1 then bottleneck case S[1].T p = S[1].T p S[i].ρ; i 1; else not bottleneck case S[i].T p = S[i].T A ; i i + 1; Proposition 1.1 (Time complexity of steady-state analysis). At the worst case the time complexity of steady-state analysis is O( V 2 ) for sparse graphs and O( V 3 ) for dense graphs. Proof. The cost in terms of time complexity of a graph traversal (without any restart) is O( V + E ), since for each node its list IN is visited once (see row 4). The traversal of the graph needs to be re-started whenever a bottleneck node is discovered. Let us consider B the number of bottleneck nodes that are discovered during the algorithm execution, where 0 B V. The complexity of steady-state analysis is O (B ( V + E )) where at the worst case B = V (i.e. whenever a node is explored for the first time it results a bottleneck). Therefore for sparse graphs (where E = O( V )) the time complexity is O( V 2 ) whereas for dense graphs (where E = O( V 2 )) is O( V 3 ). We can also notice that if no bottleneck node is discovered (i.e. B = 0), the time complexity of the algorithm is the same of a simple graph traversal. For completeness we can observe that the algorithm needs as inputs a topological ordering S. As it is well-known the time complexity for finding a topological ordering is the same of a DFS (depth-first search) traversal of the graph, i.e. O( V + E ). Thus the cost of Algorithm 2 dominates the overall time complexity for the steady-state analysis. Example. In Figure 4 is provided an example of steady-state analysis of an acyclic graph. Let us consider the input graph depicted in Figure 1 labeled with the ideal service times of each node and the routing probabilities. Figure 4 depicts the different phases of the algorithm execution following the topological ordering shown in Figure 2. Gray nodes represent explored vertices, white nodes 6

7 25 t ~166 t S 4 40 t 27 t 50 t S 2 S 6 30 t ~54 t S 1 S 5 25 t t t 75 t 75 t S 3 S 7 (a) The graph traversal starts from the node S 1. It is the unique source so its inter-arrival time is initially equal to its service time. Next, node S 2 is explored: the node is not a bottleneck since its inter-arrival time (50t) is greater than its service time. The same thing happens for nodes S 3 (with inter-arrival time 75t) and for S 4 with inter-arrival time 166t. When S 5 is discovered, its is a bottleneck: its inter-arrival time 54t is less than its service time 150t and its utilization factor is ρ 5 = Therefore we update the inter-departure time of the source node that passes from 30t to 30t ρ 5 = 84t. 25 t ~465 t S 4 ~84 t ~140 t 40 t S 2 ~150 t 27 t ~266 t ~266 t S 6 S 1 S 5 25 t t t ~209 ~209 t ~123 t t S 3 S 7 (b) At this point the graph traversal re-starts from node 1. When S 5 is reached, it is not a bottleneck anymore (i.e. ρ 5 = 1). Now the node S 6 is explored and it is not a bottleneck (its inter-arrival time is 266t). Then the last node S 7 is visited and its inter-arrival time 123t is less than its service time 200t. So this node is a bottleneck and its utilization factor is ρ 7 = Hence we update the inter-departure time of the source node that passes from 84t to 84t ρ 7 = 136t. 25 t ~755 t S 4 ~136 t ~226 t 40 t S 2 ~943 t 27 t ~427 t ~427 t S 6 S 1 S 5 25 t t t ~340 t ~200 t ~200 t ~340 t S 3 S 7 (c) The graph traversal re-starts from node 1. At this point no bottleneck node is identified: i.e. for every node in the graph its utilization factor is now lower or equal to 1. The algorithm terminates correctly providing the steady-state behavior of the acyclic graph. Figure 4: An example of steady-state analysis of an acyclic graph. 7

8 Node Service time Inter-departure time Utilization factor S 1 30t 136t.2205 S 2 40t 226t.1770 S 3 25t 340t.0736 S 4 25t 755t.0326 S 5 150t 241t.6224 S 6 27t 427t.0633 S 7 200t 200t 1 Table 1: Results of steady-state analysis. correspond to vertices that are still to be explored whereas a point-based black node is the currently discovered bottleneck. The final results are shown in Table 1. 2 Impact of randomness on Single-Source graphs Analysis We conclude the analysis of acyclic computation graphs by providing a brief discussion about the impact of the randomness on the accuracy of the results achieved with the algorithm. In the previous sections we have assumed deterministic service times for each node of the graph: i.e. for each node its ideal service time is a fixed constant value. In this case the accuracy of the algorithm has been evaluated on several example graphs through a Queueing Network simulator (Java Modelling Tool). The simulation results demonstrate an absolute precision of the algorithm which is able to quantify the steady-state behavior of each node. Things can become different if we introduce randomness, i.e. if we suppose stochastic random variables that model the service time of each node. Here, the service time assumes stochastic values following a probability density function with a known average value. A valuable modeling consists in assuming that the service processes of each node follow an exponential distribution. With this assumption each node in the network is modeled as a M/M/1 queue (instead of D/D/1 queues as in the previous discussion). The main property of this distribution is the memoryless: if we assume that each service request (task) is independent from the others, the service time for completing a task does not depend on the service times spent for the previous tasks calculated by the node. For stream-based parallel computations the exponential approximation is usually an acceptable modeling approach. All the basic results for graph analysis, i.e. the inter-departure, server partitioning and multiple clients theorems are still valid if we assume exponential random variables modeling the ideal service times of each node in the graph. On the other hand, compared to the deterministic case, in the exponential case the size of each queue plays an important role for attenuating the randomness impact. In fact we expect that the results of the steady-state analysis approximates well the behavior of a M/M/1 network if, for each node, the queue size is large enough (but still bounded). For this reason we have simulated the behav- 8

9 ior of the network shown in Figure 1, in which ideal service times are assumed to be the average values of corresponding exponential random variables. The simulations have been performed by using Java Modelling Tools and by varying the size of each queue. Tests for 25, 6, 3, 2 and 1 buffer positions are depicted in Table 2. Node Er %.(25) Er %.(6) Er %.(3) Er %.(2) Er %.(1) S S S S S S S Table 2: Accuracy of steady-state analysis in function of the queue size of each node. In the table are reported for each queue node the percentage errors between the simulation results and the inter-departure times obtained by the algorithm execution. As we can expect if we decrease the size of each queue the errors increase. For this example we can observe that for large enough queue size (up to 12 buffer positions), the errors are less than 1% for each node. For very limited queue size (i.e. 3, 2 and 1 positions), the errors are less than 8, 11 and 19% for each node. 9

### From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols

SIAM Journal on Computing to appear From Static to Dynamic Routing: Efficient Transformations of StoreandForward Protocols Christian Scheideler Berthold Vöcking Abstract We investigate how static storeandforward

### Solution for Homework set 3

TTIC 300 and CMSC 37000 Algorithms Winter 07 Solution for Homework set 3 Question (0 points) We are given a directed graph G = (V, E), with two special vertices s and t, and non-negative integral capacities

### CS 161 Lecture 11 BFS, Dijkstra s algorithm Jessica Su (some parts copied from CLRS) 1 Review

1 Review 1 Something I did not emphasize enough last time is that during the execution of depth-firstsearch, we construct depth-first-search trees. One graph may have multiple depth-firstsearch trees,

### 3 No-Wait Job Shops with Variable Processing Times

3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select

### Finding Strongly Connected Components

Yufei Tao ITEE University of Queensland We just can t get enough of the beautiful algorithm of DFS! In this lecture, we will use it to solve a problem finding strongly connected components that seems to

### 1 Linear programming relaxation

Cornell University, Fall 2010 CS 6820: Algorithms Lecture notes: Primal-dual min-cost bipartite matching August 27 30 1 Linear programming relaxation Recall that in the bipartite minimum-cost perfect matching

### Matching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.

18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have

### (Refer Slide Time: 02.06)

Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture 27 Depth First Search (DFS) Today we are going to be talking

### Lecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize.

Cornell University, Fall 2017 CS 6820: Algorithms Lecture notes on the simplex method September 2017 1 The Simplex Method We will present an algorithm to solve linear programs of the form maximize subject

### Lecture 3: Graphs and flows

Chapter 3 Lecture 3: Graphs and flows Graphs: a useful combinatorial structure. Definitions: graph, directed and undirected graph, edge as ordered pair, path, cycle, connected graph, strongly connected

### Model suitable for virtual circuit networks

. The leinrock Independence Approximation We now formulate a framework for approximation of average delay per packet in telecommunications networks. Consider a network of communication links as shown in

### Byzantine Consensus in Directed Graphs

Byzantine Consensus in Directed Graphs Lewis Tseng 1,3, and Nitin Vaidya 2,3 1 Department of Computer Science, 2 Department of Electrical and Computer Engineering, and 3 Coordinated Science Laboratory

### Elementary Graph Algorithms. Ref: Chapter 22 of the text by Cormen et al. Representing a graph:

Elementary Graph Algorithms Ref: Chapter 22 of the text by Cormen et al. Representing a graph: Graph G(V, E): V set of nodes (vertices); E set of edges. Notation: n = V and m = E. (Vertices are numbered

### Binary Decision Diagrams

Logic and roof Hilary 2016 James Worrell Binary Decision Diagrams A propositional formula is determined up to logical equivalence by its truth table. If the formula has n variables then its truth table

### ACONCURRENT system may be viewed as a collection of

252 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 10, NO. 3, MARCH 1999 Constructing a Reliable Test&Set Bit Frank Stomp and Gadi Taubenfeld AbstractÐThe problem of computing with faulty

### Graph Algorithms. Chapter 22. CPTR 430 Algorithms Graph Algorithms 1

Graph Algorithms Chapter 22 CPTR 430 Algorithms Graph Algorithms Why Study Graph Algorithms? Mathematical graphs seem to be relatively specialized and abstract Why spend so much time and effort on algorithms

### On the Relationships between Zero Forcing Numbers and Certain Graph Coverings

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,

### CHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism

CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented

### DFS & STRONGLY CONNECTED COMPONENTS

DFS & STRONGLY CONNECTED COMPONENTS CS 4407 Search Tree Breadth-First Search (BFS) Depth-First Search (DFS) Depth-First Search (DFS) u d[u]: when u is discovered f[u]: when searching adj of u is finished

### Graph Representation

Graph Representation Adjacency list representation of G = (V, E) An array of V lists, one for each vertex in V Each list Adj[u] contains all the vertices v such that there is an edge between u and v Adj[u]

### Graphs. Graph G = (V, E) Types of graphs E = O( V 2 ) V = set of vertices E = set of edges (V V)

Graph Algorithms Graphs Graph G = (V, E) V = set of vertices E = set of edges (V V) Types of graphs Undirected: edge (u, v) = (v, u); for all v, (v, v) E (No self loops.) Directed: (u, v) is edge from

### CSI 604 Elementary Graph Algorithms

CSI 604 Elementary Graph Algorithms Ref: Chapter 22 of the text by Cormen et al. (Second edition) 1 / 25 Graphs: Basic Definitions Undirected Graph G(V, E): V is set of nodes (or vertices) and E is the

### 2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006

2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,

### From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols

From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols Christian Scheideler Ý Berthold Vöcking Þ Abstract We investigate how static store-and-forward routing algorithms

### The Resolution Algorithm

The Resolution Algorithm Introduction In this lecture we introduce the Resolution algorithm for solving instances of the NP-complete CNF- SAT decision problem. Although the algorithm does not run in polynomial

### NEW STABILITY RESULTS FOR ADVERSARIAL QUEUING

NEW STABILITY RESULTS FOR ADVERSARIAL QUEUING ZVI LOTKER, BOAZ PATT-SHAMIR, AND ADI ROSÉN Abstract. We consider the model of adversarial queuing theory for packet networks introduced by Borodin et al.

### st-orientations September 29, 2005

st-orientations September 29, 2005 Introduction Let G = (V, E) be an undirected biconnected graph of n nodes and m edges. The main problem this chapter deals with is different algorithms for orienting

### The Encoding Complexity of Network Coding

The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network

### Graphs. The ultimate data structure. graphs 1

Graphs The ultimate data structure graphs 1 Definition of graph Non-linear data structure consisting of nodes & links between them (like trees in this sense) Unlike trees, graph nodes may be completely

### W4231: Analysis of Algorithms

W4231: Analysis of Algorithms 10/21/1999 Definitions for graphs Breadth First Search and Depth First Search Topological Sort. Graphs AgraphG is given by a set of vertices V and a set of edges E. Normally

### Lecture 2 September 3

EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give

### Design and Analysis of Algorithms

Design and Analysis of Algorithms CSE 5311 Lecture 18 Graph Algorithm Junzhou Huang, Ph.D. Department of Computer Science and Engineering CSE5311 Design and Analysis of Algorithms 1 Graphs Graph G = (V,

### Distributed minimum spanning tree problem

Distributed minimum spanning tree problem Juho-Kustaa Kangas 24th November 2012 Abstract Given a connected weighted undirected graph, the minimum spanning tree problem asks for a spanning subtree with

### COL351: Analysis and Design of Algorithms (CSE, IITD, Semester-I ) Name: Entry number:

Name: Entry number: There are 6 questions for a total of 75 points. 1. Consider functions f(n) = 10n2 n + 3 n and g(n) = n3 n. Answer the following: (a) ( 1 / 2 point) State true or false: f(n) is O(g(n)).

### Elementary Graph Algorithms

Elementary Graph Algorithms Graphs Graph G = (V, E)» V = set of vertices» E = set of edges (V V) Types of graphs» Undirected: edge (u, v) = (v, u); for all v, (v, v) E (No self loops.)» Directed: (u, v)

### MC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points

MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you

### CPS 102: Discrete Mathematics. Quiz 3 Date: Wednesday November 30, Instructor: Bruce Maggs NAME: Prob # Score. Total 60

CPS 102: Discrete Mathematics Instructor: Bruce Maggs Quiz 3 Date: Wednesday November 30, 2011 NAME: Prob # Score Max Score 1 10 2 10 3 10 4 10 5 10 6 10 Total 60 1 Problem 1 [10 points] Find a minimum-cost

### Graph Representations and Traversal

COMPSCI 330: Design and Analysis of Algorithms 02/08/2017-02/20/2017 Graph Representations and Traversal Lecturer: Debmalya Panigrahi Scribe: Tianqi Song, Fred Zhang, Tianyu Wang 1 Overview This lecture

### Scribes: Romil Verma, Juliana Cook (2015), Virginia Williams, Date: May 1, 2017 and Seth Hildick-Smith (2016), G. Valiant (2017), M.

Lecture 9 Graphs Scribes: Romil Verma, Juliana Cook (2015), Virginia Williams, Date: May 1, 2017 and Seth Hildick-Smith (2016), G. Valiant (2017), M. Wootters (2017) 1 Graphs A graph is a set of vertices

### Theorem 2.9: nearest addition algorithm

There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used

### Figure 1: A directed graph.

1 Graphs A graph is a data structure that expresses relationships between objects. The objects are called nodes and the relationships are called edges. For example, social networks can be represented as

### 1 Random Walks on Graphs

Lecture 7 Com S 633: Randomness in Computation Scribe: Ankit Agrawal In the last lecture, we looked at random walks on line and used them to devise randomized algorithms for 2-SAT and 3-SAT For 2-SAT we

### CHAPTER 9. GRAPHS 310. Figure 9.1 An undirected graph. Figure 9.2 A directed graph

Chapter 9 Graphs Often we need to model relationships that can be expressed using a set of pairs. Examples include distances between points on a map, links in a communications network, precedence constraints

### Unlabeled equivalence for matroids representable over finite fields

Unlabeled equivalence for matroids representable over finite fields November 16, 2012 S. R. Kingan Department of Mathematics Brooklyn College, City University of New York 2900 Bedford Avenue Brooklyn,

### MOST attention in the literature of network codes has

3862 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 8, AUGUST 2010 Efficient Network Code Design for Cyclic Networks Elona Erez, Member, IEEE, and Meir Feder, Fellow, IEEE Abstract This paper introduces

### Chapter 22: Elementary Graph Algorithms. Definitions:

Chapter 22: Elementary Graph Algorithms. Definitions: 1. G = (V, E), where V is a set of points and E is a set of edges connecting point-pairs from V. 2. We use V synonymously with V and E with E when

### Joint Entity Resolution

Joint Entity Resolution Steven Euijong Whang, Hector Garcia-Molina Computer Science Department, Stanford University 353 Serra Mall, Stanford, CA 94305, USA {swhang, hector}@cs.stanford.edu No Institute

### Announcements. HW3 is graded. Average is 81%

CSC263 Week 9 Announcements HW3 is graded. Average is 81% Announcements Problem Set 4 is due this Tuesday! Due Tuesday (Nov 17) Recap The Graph ADT definition and data structures BFS gives us single-source

### NP-Hardness. We start by defining types of problem, and then move on to defining the polynomial-time reductions.

CS 787: Advanced Algorithms NP-Hardness Instructor: Dieter van Melkebeek We review the concept of polynomial-time reductions, define various classes of problems including NP-complete, and show that 3-SAT

### Chapter 22. Elementary Graph Algorithms

Graph Algorithms - Spring 2011 Set 7. Lecturer: Huilan Chang Reference: (1) Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms, 2nd Edition, The MIT Press. (2) Lecture notes from C. Y. Chen

### A NEW ALGORITHM FOR JITTER CONTROL IN WIRELESS NETWORKS FOR QUALITY OF SERVICE

Int. J. Elec&Electr.Eng&Telecoms. 2013 B Santosh Kumar et al., 2013 Research Paper ISSN 2319 2518 www.ijeetc.com Vol. 2, No. 2, April 2013 2013 IJEETC. All Rights Reserved A NEW ALGORITHM FOR JITTER CONTROL

### Faster parameterized algorithms for Minimum Fill-In

Faster parameterized algorithms for Minimum Fill-In Hans L. Bodlaender Pinar Heggernes Yngve Villanger Technical Report UU-CS-2008-042 December 2008 Department of Information and Computing Sciences Utrecht

### Trees. 3. (Minimally Connected) G is connected and deleting any of its edges gives rise to a disconnected graph.

Trees 1 Introduction Trees are very special kind of (undirected) graphs. Formally speaking, a tree is a connected graph that is acyclic. 1 This definition has some drawbacks: given a graph it is not trivial

### Stop-and-Go Service Using Hierarchical Round Robin

Stop-and-Go Service Using Hierarchical Round Robin S. Keshav AT&T Bell Laboratories 600 Mountain Avenue, Murray Hill, NJ 07974, USA keshav@research.att.com Abstract The Stop-and-Go service discipline allows

### Module 11. Directed Graphs. Contents

Module 11 Directed Graphs Contents 11.1 Basic concepts......................... 256 Underlying graph of a digraph................ 257 Out-degrees and in-degrees.................. 258 Isomorphism..........................

### Dynamic Wavelength Assignment for WDM All-Optical Tree Networks

Dynamic Wavelength Assignment for WDM All-Optical Tree Networks Poompat Saengudomlert, Eytan H. Modiano, and Robert G. Gallager Laboratory for Information and Decision Systems Massachusetts Institute of

### Solutions to relevant spring 2000 exam problems

Problem 2, exam Here s Prim s algorithm, modified slightly to use C syntax. MSTPrim (G, w, r): Q = V[G]; for (each u Q) { key[u] = ; key[r] = 0; π[r] = 0; while (Q not empty) { u = ExtractMin (Q); for

### Application Layer Multicast Algorithm

Application Layer Multicast Algorithm Sergio Machado Universitat Politècnica de Catalunya Castelldefels Javier Ozón Universitat Politècnica de Catalunya Castelldefels Abstract This paper presents a multicast

### A Randomized Algorithm for Minimum Cuts

Randomized lgorithm for Minimum uts ndreas Klappenecker randomized algorithm is an algorithm that receives, in addition to its input, a stream of random bits which is used to make random choices. The random

### Lecture 15: The subspace topology, Closed sets

Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology

### Queuing Systems. 1 Lecturer: Hawraa Sh. Modeling & Simulation- Lecture -4-21/10/2012

Queuing Systems Queuing theory establishes a powerful tool in modeling and performance analysis of many complex systems, such as computer networks, telecommunication systems, call centers, manufacturing

### Worst-case Ethernet Network Latency for Shaped Sources

Worst-case Ethernet Network Latency for Shaped Sources Max Azarov, SMSC 7th October 2005 Contents For 802.3 ResE study group 1 Worst-case latency theorem 1 1.1 Assumptions.............................

### Efficient Bufferless Packet Switching on Trees and Leveled Networks

Efficient Bufferless Packet Switching on Trees and Leveled Networks Costas Busch Malik Magdon-Ismail Marios Mavronicolas Abstract In bufferless networks the packets cannot be buffered while they are in

### Compiler Design Prof. Y. N. Srikant Department of Computer Science and Automation Indian Institute of Science, Bangalore

Compiler Design Prof. Y. N. Srikant Department of Computer Science and Automation Indian Institute of Science, Bangalore Module No. # 10 Lecture No. # 16 Machine-Independent Optimizations Welcome to the

### Integer Programming Theory

Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x

### On the Max Coloring Problem

On the Max Coloring Problem Leah Epstein Asaf Levin May 22, 2010 Abstract We consider max coloring on hereditary graph classes. The problem is defined as follows. Given a graph G = (V, E) and positive

### Delay-minimal Transmission for Energy Constrained Wireless Communications

Delay-minimal Transmission for Energy Constrained Wireless Communications Jing Yang Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, M0742 yangjing@umd.edu

### Advanced Combinatorial Optimization September 17, Lecture 3. Sketch some results regarding ear-decompositions and factor-critical graphs.

18.438 Advanced Combinatorial Optimization September 17, 2009 Lecturer: Michel X. Goemans Lecture 3 Scribe: Aleksander Madry ( Based on notes by Robert Kleinberg and Dan Stratila.) In this lecture, we

### CS2 Algorithms and Data Structures Note 10. Depth-First Search and Topological Sorting

CS2 Algorithms and Data Structures Note 10 Depth-First Search and Topological Sorting In this lecture, we will analyse the running time of DFS and discuss a few applications. 10.1 A recursive implementation

### 22.3 Depth First Search

22.3 Depth First Search Depth-First Search(DFS) always visits a neighbour of the most recently visited vertex with an unvisited neighbour. This means the search moves forward when possible, and only backtracks

### Mean Value Analysis and Related Techniques

Mean Value Analysis and Related Techniques 34-1 Overview 1. Analysis of Open Queueing Networks 2. Mean-Value Analysis 3. Approximate MVA 4. Balanced Job Bounds 34-2 Analysis of Open Queueing Networks Used

### Undirected Graphs. DSA - lecture 6 - T.U.Cluj-Napoca - M. Joldos 1

Undirected Graphs Terminology. Free Trees. Representations. Minimum Spanning Trees (algorithms: Prim, Kruskal). Graph Traversals (dfs, bfs). Articulation points & Biconnected Components. Graph Matching

### Lecture 10: Strongly Connected Components, Biconnected Graphs

15-750: Graduate Algorithms February 8, 2016 Lecture 10: Strongly Connected Components, Biconnected Graphs Lecturer: David Witmer Scribe: Zhong Zhou 1 DFS Continued We have introduced Depth-First Search

### Read Chapter 4 of Kurose-Ross

CSE 422 Notes, Set 4 These slides contain materials provided with the text: Computer Networking: A Top Down Approach,5th edition, by Jim Kurose and Keith Ross, Addison-Wesley, April 2009. Additional figures

### Data Structures. Elementary Graph Algorithms BFS, DFS & Topological Sort

Data Structures Elementary Graph Algorithms BFS, DFS & Topological Sort 1 Graphs A graph, G = (V, E), consists of two sets: V is a finite non-empty set of vertices. E is a set of pairs of vertices, called

### Matching Theory. Figure 1: Is this graph bipartite?

Matching Theory 1 Introduction A matching M of a graph is a subset of E such that no two edges in M share a vertex; edges which have this property are called independent edges. A matching M is said to

### Dartmouth Computer Science Technical Report TR Chain Match: An Algorithm for Finding a Perfect Matching of a Regular Bipartite Multigraph

Dartmouth Computer Science Technical Report TR2014-753 Chain Match: An Algorithm for Finding a Perfect Matching of a Regular Bipartite Multigraph Stefanie Ostrowski May 28, 2014 Abstract We consider the

### Depth-first search in undirected graphs What parts of the graph are reachable from a given vertex?

Why graphs? Chapter 3. Decompositions of graphs Awiderangeofproblemscanbeexpressedwithclarityandprecisionin the concise pictorial language of graphs. Graph coloring. Graph connectivity and reachability.

### Performance of Multihop Communications Using Logical Topologies on Optical Torus Networks

Performance of Multihop Communications Using Logical Topologies on Optical Torus Networks X. Yuan, R. Melhem and R. Gupta Department of Computer Science University of Pittsburgh Pittsburgh, PA 156 fxyuan,

### Algorithms: Lecture 10. Chalmers University of Technology

Algorithms: Lecture 10 Chalmers University of Technology Today s Topics Basic Definitions Path, Cycle, Tree, Connectivity, etc. Graph Traversal Depth First Search Breadth First Search Testing Bipartatiness

### Distributed Sorting. Chapter Array & Mesh

Chapter 9 Distributed Sorting Indeed, I believe that virtually every important aspect of programming arises somewhere in the context of sorting [and searching]! Donald E. Knuth, The Art of Computer Programming

### Dr. Amotz Bar-Noy s Compendium of Algorithms Problems. Problems, Hints, and Solutions

Dr. Amotz Bar-Noy s Compendium of Algorithms Problems Problems, Hints, and Solutions Chapter 1 Searching and Sorting Problems 1 1.1 Array with One Missing 1.1.1 Problem Let A = A[1],..., A[n] be an array

### MAL 376: Graph Algorithms I Semester Lecture 1: July 24

MAL 376: Graph Algorithms I Semester 2014-2015 Lecture 1: July 24 Course Coordinator: Prof. B. S. Panda Scribes: Raghuvansh, Himanshu, Mohit, Abhishek Disclaimer: These notes have not been subjected to

### Lecture 22 Tuesday, April 10

CIS 160 - Spring 2018 (instructor Val Tannen) Lecture 22 Tuesday, April 10 GRAPH THEORY Directed Graphs Directed graphs (a.k.a. digraphs) are an important mathematical modeling tool in Computer Science,

### CHAPTER-III WAVELENGTH ROUTING ALGORITHMS

CHAPTER-III WAVELENGTH ROUTING ALGORITHMS Introduction A wavelength routing (WR) algorithm selects a good route and a wavelength to satisfy a connection request so as to improve the network performance.

### Reaching Approximate Byzantine Consensus with Multi-hop Communication

Reaching Approximate Byzantine Consensus with Multi-hop Communication Lili Su, Nitin Vaidya Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign {lilisu3, nhv}@illinois.edu

### Lecture 8: PATHS, CYCLES AND CONNECTEDNESS

Discrete Mathematics August 20, 2014 Lecture 8: PATHS, CYCLES AND CONNECTEDNESS Instructor: Sushmita Ruj Scribe: Ishan Sahu & Arnab Biswas 1 Paths, Cycles and Connectedness 1.1 Paths and Cycles 1. Paths

### Lecture 20 : Trees DRAFT

CS/Math 240: Introduction to Discrete Mathematics 4/12/2011 Lecture 20 : Trees Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we discussed graphs. Today we continue this discussion,

### Precomputation Schemes for QoS Routing

578 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 4, AUGUST 2003 Precomputation Schemes for QoS Routing Ariel Orda, Senior Member, IEEE, and Alexander Sprintson, Student Member, IEEE Abstract Precomputation-based

### Adaptations of the A* Algorithm for the Computation of Fastest Paths in Deterministic Discrete-Time Dynamic Networks

60 IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, VOL. 3, NO. 1, MARCH 2002 Adaptations of the A* Algorithm for the Computation of Fastest Paths in Deterministic Discrete-Time Dynamic Networks

### A Mechanism for Sequential Consistency in a Distributed Objects System

A Mechanism for Sequential Consistency in a Distributed Objects System Cristian Ţăpuş, Aleksey Nogin, Jason Hickey, and Jerome White California Institute of Technology Computer Science Department MC 256-80,

### Incompatibility Dimensions and Integration of Atomic Commit Protocols

The International Arab Journal of Information Technology, Vol. 5, No. 4, October 2008 381 Incompatibility Dimensions and Integration of Atomic Commit Protocols Yousef Al-Houmaily Department of Computer

### Graph Theory. Part of Texas Counties.

Graph Theory Part of Texas Counties. We would like to visit each of the above counties, crossing each county only once, starting from Harris county. Is this possible? This problem can be modeled as a graph.

### arxiv: v2 [cs.ds] 30 Nov 2012

A New Upper Bound for the Traveling Salesman Problem in Cubic Graphs Maciej Liśkiewicz 1 and Martin R. Schuster 1 1 Institute of Theoretical Computer Science, University of Lübeck Ratzeburger Allee 160,

### Scheduling with Bus Access Optimization for Distributed Embedded Systems

472 IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 8, NO. 5, OCTOBER 2000 Scheduling with Bus Access Optimization for Distributed Embedded Systems Petru Eles, Member, IEEE, Alex

### 22 Elementary Graph Algorithms. There are two standard ways to represent a

VI Graph Algorithms Elementary Graph Algorithms Minimum Spanning Trees Single-Source Shortest Paths All-Pairs Shortest Paths 22 Elementary Graph Algorithms There are two standard ways to represent a graph

### A step towards the Bermond-Thomassen conjecture about disjoint cycles in digraphs

A step towards the Bermond-Thomassen conjecture about disjoint cycles in digraphs Nicolas Lichiardopol Attila Pór Jean-Sébastien Sereni Abstract In 1981, Bermond and Thomassen conjectured that every digraph

### CS 125 Section #6 Graph Traversal and Linear Programs 10/13/14

CS 125 Section #6 Graph Traversal and Linear Programs 10/13/14 1 Depth first search 1.1 The Algorithm Besides breadth first search, which we saw in class in relation to Dijkstra s algorithm, there is one