├── .gitignore
├── README
├── create_relation_graph.py
├── drmt.py
├── drmt_latencies.py
├── experiment_results
    ├── drmt_ipc_1_switch_combined.txt
    ├── drmt_ipc_1_switch_combined_subset.txt
    ├── drmt_ipc_1_switch_egress.txt
    ├── drmt_ipc_1_switch_egress_subset.txt
    ├── drmt_ipc_1_switch_ingress.txt
    ├── drmt_ipc_1_switch_ingress_subset.txt
    ├── drmt_ipc_2_switch_combined.txt
    ├── drmt_ipc_2_switch_combined_subset.txt
    ├── drmt_ipc_2_switch_egress.txt
    ├── drmt_ipc_2_switch_egress_subset.txt
    ├── drmt_ipc_2_switch_ingress.txt
    ├── drmt_ipc_2_switch_ingress_subset.txt
    ├── prmt_coarse_switch_combined.txt
    ├── prmt_coarse_switch_combined_subset.txt
    ├── prmt_coarse_switch_egress.txt
    ├── prmt_coarse_switch_egress_subset.txt
    ├── prmt_coarse_switch_ingress.txt
    ├── prmt_coarse_switch_ingress_subset.txt
    ├── prmt_fine_switch_combined.txt
    ├── prmt_fine_switch_combined_subset.txt
    ├── prmt_fine_switch_egress.txt
    ├── prmt_fine_switch_egress_subset.txt
    ├── prmt_fine_switch_ingress.txt
    └── prmt_fine_switch_ingress_subset.txt
├── expt_times.txt
├── figures
    ├── switch_combined.pdf
    ├── switch_combined_subset.pdf
    ├── switch_egress.pdf
    ├── switch_egress_subset.pdf
    ├── switch_ingress.pdf
    ├── switch_ingress_subset.pdf
    └── threads.txt
├── fine_to_coarse.py
├── graph_generator.py
├── greedy_prmt_solver.py
├── large_hw.py
├── large_hw_ipc2.py
├── printers.py
├── prmt.py
├── prmt_latencies.py
├── random_odg_generator.py
├── randomized_sieve.py
├── run_experiments.sh
├── schedule_dag.py
├── sieve_rotator.py
├── simple_dag_generator.py
├── small_hw.py
├── solution.py
├── switch_combined.py
├── switch_combined_subset.py
├── switch_egress.py
├── switch_egress_subset.py
├── switch_ingress.py
└── switch_ingress_subset.py


/.gitignore:
--------------------------------------------------------------------------------
1 | *.log
2 | *.pyc
3 | 


--------------------------------------------------------------------------------
/README:
--------------------------------------------------------------------------------
 1 | Prereqs:
 2 | 1. Install Gurobi from http://www.gurobi.com
 3 | 2. Install networkx from http://networkx.github.io or
 4 |    using the command "pip install networkx"
 5 | 
 6 | Running the program:
 7 | Usage:  drmt_scheduler_full.py  <scheduling input file without .py suffix>
 8 | For instance, to run example.py, type "drmt_scheduler_full.py example"
 9 | 
10 | Format of input file: Look at the comments in example.py 
11 | 


--------------------------------------------------------------------------------
/create_relation_graph.py:
--------------------------------------------------------------------------------
  1 | # -*- coding: utf-8 -*-
  2 | """
  3 | Spyder Editor
  4 | 
  5 | This is a temporary script file.
  6 | """
  7 | 
  8 | import importlib as im
  9 | import networkx as nx
 10 | import matplotlib.pyplot as plt
 11 | import time
 12 | import os
 13 | 
 14 | from random_odg_generator import odg_generator
 15 | 
 16 | 
 17 | # return True if substr is a substring of srt and false otherwise.
 18 | def is_substring(srt, substr):    
 19 |     return bool(srt.find(substr) >= 0)
 20 | 
 21 | 
 22 | 
 23 | def reduce_graph(super_source, fn):
 24 |   
 25 |     # import operation dependancy graph    
 26 |     input_graph = im.import_module(fn, "*")
 27 |     
 28 |     # retreive nodes and edges   
 29 |     nodes = input_graph.nodes
 30 |     edges = input_graph.edges
 31 |                 
 32 |     new_nodes = []
 33 |     new_edges = []
 34 |     
 35 |     for node in nodes:
 36 |             
 37 |         if is_substring(node, 'condition'): 
 38 |                    
 39 |             input_node = node + '_' +  'input'                     
 40 |             output_node = node + '_' +  'output'
 41 |             
 42 |             cond_true = node + '_' + 'true'
 43 |             cond_false = node + '_' + 'false'
 44 |     
 45 |             new_nodes.append(input_node)                    
 46 |             new_nodes.append(output_node)
 47 | 
 48 |             new_nodes.append(cond_true)                    
 49 |             new_nodes.append(cond_false)
 50 |             
 51 |             cond_edge = (input_node, output_node)
 52 |             
 53 |             true_edge = (output_node, cond_true)
 54 |             false_edge = (output_node, cond_false)
 55 |             
 56 |             new_edges.append(cond_edge)
 57 |             
 58 |             new_edges.append(true_edge)
 59 |             new_edges.append(false_edge)
 60 |             
 61 |         else: 
 62 |     
 63 |             new_nodes.append(node) 
 64 |     
 65 |                      
 66 |     for edge in edges: 
 67 |     
 68 |         source, destination = edge           
 69 |     
 70 |         source_cond = is_substring(source, 'condition') 
 71 |         destination_cond = is_substring(destination, 'condition')
 72 |                 
 73 |         if source_cond and destination_cond:
 74 |             
 75 |             true_false = edges[edge]['condition']
 76 |             
 77 |             # True
 78 |             if true_false:
 79 |             
 80 |                 new_source = source  + '_' + 'true'
 81 |                 new_destination = destination + '_' + 'input'
 82 |                 
 83 |                 new_edge = (new_source, new_destination)        
 84 |                 new_edges.append(new_edge)
 85 |             
 86 |             # False    
 87 |             else:
 88 |                 
 89 |                 new_source = source  + '_' + 'false'
 90 |                 new_destination = destination + '_' + 'input'
 91 |                 
 92 |                 new_edge = (new_source, new_destination)        
 93 |                 new_edges.append(new_edge)
 94 | 
 95 |                 
 96 |     
 97 |         elif source_cond:
 98 |           
 99 | 
100 | 
101 |             true_false = edges[edge]['condition']
102 |             
103 | 
104 |             # True
105 |             if true_false:
106 |             
107 |                 new_source = source  + '_' + 'true'
108 |                 
109 |                 new_edge = (new_source, destination)        
110 |                 new_edges.append(new_edge)
111 |             
112 |             # False    
113 |             else:
114 |                 
115 |                 new_source = source  + '_' + 'false'
116 |                 
117 |                 new_edge = (new_source, destination)        
118 |                 new_edges.append(new_edge)
119 | 
120 | 
121 |             
122 |         elif destination_cond:
123 |     
124 |             new_destination = destination + '_' + 'input'
125 |             
126 |             new_edge = (source, new_destination)        
127 |             new_edges.append(new_edge) 
128 |             
129 |         else:
130 |             
131 |             new_edges.append(edge)
132 |         
133 |     
134 |     new_weighted_edges = []
135 |     
136 |     for edge in new_edges:
137 |         source, destination = edge
138 |         weighted_edge = (source, destination, 1)
139 |         new_weighted_edges.append(weighted_edge)
140 |         
141 |     
142 |     G = nx.DiGraph()
143 |     
144 |     G.add_nodes_from(new_nodes)
145 |     G.add_weighted_edges_from(new_weighted_edges)    
146 |         
147 | 
148 |     if super_source:  
149 |         
150 |         in_degrees = G.in_degree()
151 |         
152 |         zero_in_degree_nodes = [node for node in in_degrees if in_degrees[node]==0]
153 |         zero_in_degree_nodes_sorted = zero_in_degree_nodes
154 |         zero_in_degree_nodes_sorted.sort()
155 |                 
156 |         super_source_node = 'super_source_node'
157 |         super_source_node_edges = []
158 |         
159 |         for zero_in_degree_node in zero_in_degree_nodes: 
160 |             zero_in_degree_weighted_edge = (super_source_node, zero_in_degree_node, 1)
161 |             super_source_node_edges.append(zero_in_degree_weighted_edge)
162 |                     
163 |         G.add_node(super_source_node)
164 |         G.add_weighted_edges_from(super_source_node_edges)
165 |         
166 |         
167 |     
168 |     return G
169 | 
170 | 
171 | 
172 | def main(fn):
173 |     
174 |     # Change to True to create a source to all zero degree nodes.
175 |     super_source = True
176 |     G = reduce_graph(super_source, fn)
177 |     
178 | #     nx.draw(G,pos=nx.random_layout(G),with_labels=True,node_size=1000,iterations=10000)
179 | #     plt.show()
180 |         
181 |     nodes = G.nodes()
182 |     
183 |     super_sink_node = 'super_sink_node'
184 |     
185 |     G.add_node(super_sink_node)
186 |                   
187 |     dep_edges = []
188 |     ancestor_to_descendant = []
189 |      
190 |     # find all descendant-ancestor relations. 
191 |     for node_1 in nodes:
192 |         for node_2 in nodes:            
193 |             if node_1 != node_2:
194 |                 if not is_substring(node_1, 'condition') and not is_substring(node_2, 'condition'): 
195 | 
196 |                     if nx.has_path(G, node_1, node_2):
197 |                         ancestor_to_descendant.append((node_1, node_2))
198 |                         if (node_2, node_1) not in dep_edges:
199 |                             dep_edges.append((node_1, node_2))
200 |                     if nx.has_path(G, node_2, node_1):
201 |                         ancestor_to_descendant.append((node_2, node_1))
202 |                         if (node_2, node_1) not in dep_edges:
203 |                             dep_edges.append((node_1, node_2))
204 |                             
205 | 
206 |     # for all nodes that do not have descendant-ancestor relations we look for max-flow.                                                                                           
207 |     for node_1 in nodes:
208 |         for node_2 in nodes:
209 |             if not is_substring(node_1, 'condition') and not is_substring(node_2, 'condition'):
210 |                 if (node_1, node_2) not in dep_edges and (node_2, node_1) not in dep_edges:
211 |                     if node_1 != node_2 and node_1 != 'super_source_node' and node_2 != 'super_source_node':
212 |                         
213 |                         G.add_weighted_edges_from([(node_1, super_sink_node, 1),(node_2, super_sink_node, 1)]) 
214 |                                                  
215 |                         for curr_source in nodes:
216 |                            if not is_substring(curr_source, 'condition'):
217 |                                if nx.maximum_flow_value(G, curr_source, 'super_sink_node', capacity='weight') == 2:
218 |                                     dep_edges.append((node_1, node_2))
219 |                                     
220 |                                     # make relationship between descendants
221 |                                     for ancestor, descendant in ancestor_to_descendant:
222 |                                         if ancestor == node_1:
223 |                                             if (descendant, node_2) not in dep_edges and (node_2, descendant) not in dep_edges:
224 |                                                 dep_edges.append((descendant, node_2))
225 |                                         if ancestor == node_2:
226 |                                             if (descendant, node_1) not in dep_edges and (node_1, descendant) not in dep_edges:
227 |                                                 dep_edges.append((descendant, node_1))
228 |                                                 
229 |                                     break
230 |                                                                
231 |                         G.remove_edges_from([(node_1, super_sink_node, 1),(node_2, super_sink_node, 1)])
232 |                 
233 |                     
234 |     RG = nx.Graph()
235 |     
236 |     RG.add_edges_from(dep_edges) 
237 |     if super_source:
238 |         RG.remove_node('super_source_node')
239 | 
240 |     # Draw the relation graph.
241 |     # print "\nDrawing the relation graph...\n" 
242 |     # nx.draw(RG,pos=nx.circular_layout(RG),with_labels=True,node_size=1000,iterations=10000)
243 | 
244 |     N = RG.number_of_nodes()
245 |     print "|V| = %d" % N
246 |     max_num_of_edges = (N*(N-1)) >> 1
247 |     print "0.5(|V|^2 - |V|) = %d" % max_num_of_edges
248 |     E = RG.number_of_edges()
249 |     print "|E| = %d" % E
250 |     unrelated_nodes  = max_num_of_edges - E
251 |     print "Number of unrelated node couples = %d" % unrelated_nodes
252 |     
253 | 
254 | ###############################################################################
255 | ###############################################################################      
256 | 
257 | if __name__ == "__main__":
258 |   
259 |     start_time = time.time()
260 |        
261 |     random_odg = False
262 |     
263 |     if random_odg:
264 |         
265 |         fn = 'test_odg.py'
266 |         
267 |         try:
268 |             os.remove('test_odg.py')
269 |         except OSError:
270 |             pass
271 |         
272 |         print "######################### ODG data - start ########################"
273 |         odg_generator(30, 'test_odg') 
274 |         print "######################### ODG data - end ##########################"
275 |         
276 |     else:
277 |         
278 |         # file name
279 |         fn = 'switch_ingress_sched_data'
280 |         
281 |     
282 |     print "##################### relation graph data - start ##################"
283 |     main(fn) 
284 |     print "##################### relation graph data - end ####################"
285 |            
286 |     print("TIME: --- %s seconds ---" % round(time.time() - start_time, 2))
287 |     
288 |     
289 |        
290 |     
291 |     
292 |     
293 |     
294 |     
295 |     
296 |     
297 |     
298 |     
299 |     
300 |     
301 |     
302 |     
303 |     
304 |     
305 | 


--------------------------------------------------------------------------------
/drmt.py:
--------------------------------------------------------------------------------
  1 | from gurobipy import *
  2 | import numpy as np
  3 | import collections
  4 | import importlib
  5 | import math
  6 | from schedule_dag import ScheduleDAG
  7 | from printers import *
  8 | from solution import Solution
  9 | from randomized_sieve import *
 10 | from sieve_rotator import *
 11 | from prmt import PrmtFineSolver
 12 | 
 13 | RND_SIEVE_TIME = 30
 14 | 
 15 | class DrmtScheduleSolver:
 16 |     def __init__(self, dag, input_spec, latency_spec, seed_rnd_sieve, period_duration, minute_limit):
 17 |         self.G = dag
 18 |         self.input_spec = input_spec
 19 |         self.latency_spec = latency_spec
 20 |         self.seed_rnd_sieve = seed_rnd_sieve
 21 |         self.period_duration = period_duration
 22 |         self.minute_limit    = minute_limit
 23 | 
 24 |     def solve(self):
 25 |         """ Returns the optimal schedule
 26 | 
 27 |         Returns
 28 |         -------
 29 |         time_of_op : dict
 30 |             Timeslot for each operation in the DAG
 31 |         ops_at_time : defaultdic
 32 |             List of operations in each timeslot
 33 |         length : int
 34 |             Maximum latency of optimal schedule
 35 |         """
 36 |         init_drmt_schedule = None
 37 |         if (self.seed_rnd_sieve):
 38 |           print ('{:*^80}'.format(' Running rnd sieve '))
 39 |           rnd_sch = rnd_sieve(self.input_spec, self.G, RND_SIEVE_TIME, self.period_duration)
 40 | 
 41 |           print ('{:*^80}'.format(' Running PRMT + rotator '))
 42 |           psolver = PrmtFineSolver(self.G, self.input_spec, self.latency_spec, seed_greedy=True)
 43 |           solution = psolver.solve(solve_coarse = False)
 44 |           prmt_sch = sieve_rotator(solution.ops_at_time, self.period_duration, self.latency_spec.dM, self.latency_spec.dA)
 45 | 
 46 |           if ((rnd_sch == None) and (prmt_sch == None)):
 47 |             print ("Both heuristics returned nothing")
 48 |             init_drmt_schedule = None
 49 |           elif ((rnd_sch == None)):
 50 |             print ("Picking output from PRMT")
 51 |             print ("Latency for PRMT ", max(prmt_sch.values()))
 52 |             init_drmt_schedule = prmt_sch
 53 |           elif ((prmt_sch == None)):
 54 |             print ("Picking output from RND sieve")
 55 |             print ("Latency for RND sieve: ", max(rnd_sch.values()))
 56 |             init_drmt_schedule = rnd_sch
 57 |           else:
 58 |             print ("Latencies, PRMT: ", max(prmt_sch.values()), " RND sieve: ", max(rnd_sch.values()))
 59 |             if (max(prmt_sch.values()) < max(rnd_sch.values())):
 60 |               print ("Picking output from PRMT")
 61 |               init_drmt_schedule = prmt_sch
 62 |             else:
 63 |               print ("Picking output from RND sieve")
 64 |               init_drmt_schedule = rnd_sch
 65 | 
 66 |         if (init_drmt_schedule):
 67 |           Q_MAX = int(math.ceil((1.0 * (max(init_drmt_schedule.values()) + 1)) / self.period_duration))
 68 |         else:
 69 |           # Set Q_MAX based on critical path
 70 |           cpath, cplat = self.G.critical_path()
 71 |           Q_MAX = int(math.ceil(1.5 * cplat / self.period_duration))
 72 | 
 73 |         print ('{:*^80}'.format(' Running DRMT ILP solver '))
 74 |         T = self.period_duration
 75 |         nodes = self.G.nodes()
 76 |         match_nodes = self.G.nodes(select='match')
 77 |         action_nodes = self.G.nodes(select='action')
 78 |         edges = self.G.edges()
 79 | 
 80 |         m = Model()
 81 |         m.setParam("LogToConsole", 0)
 82 | 
 83 |         # Create variables
 84 |         # t is the start time for each DAG node in the first scheduling period
 85 |         t = m.addVars(nodes, lb=0, ub=GRB.INFINITY, vtype=GRB.INTEGER, name="t")
 86 | 
 87 |         # The quotients and remainders when dividing by T (see below)
 88 |         # qr[v, q, r] is 1 when t[v]
 89 |         # leaves a quotient of q and a remainder of r, when divided by T.
 90 |         qr  = m.addVars(list(itertools.product(nodes, range(Q_MAX), range(T))), vtype=GRB.BINARY, name="qr")
 91 | 
 92 |         # Is there any match/action from packet q in time slot r?
 93 |         # This is required to enforce limits on the number of packets that
 94 |         # can be performing matches or actions concurrently on any processor.
 95 |         any_match = m.addVars(list(itertools.product(range(Q_MAX), range(T))), vtype=GRB.BINARY, name = "any_match")
 96 |         any_action = m.addVars(list(itertools.product(range(Q_MAX), range(T))), vtype=GRB.BINARY, name = "any_action")
 97 | 
 98 |         # The length of the schedule
 99 |         length = m.addVar(lb=0, ub=GRB.INFINITY, vtype=GRB.INTEGER, name="length")
100 | 
101 |         # Set objective: minimize length of schedule
102 |         m.setObjective(length, GRB.MINIMIZE)
103 | 
104 |         # Set constraints
105 | 
106 |         # The length is the maximum of all t's
107 |         m.addConstrs((t[v]  <= length for v in nodes), "constr_length_is_max")
108 | 
109 |         # Given v, qr[v, q, r] is 1 for exactly one q, r, i.e., there's a unique quotient and remainder
110 |         m.addConstrs((sum(qr[v, q, r] for q in range(Q_MAX) for r in range(T)) == 1 for v in nodes),\
111 |                      "constr_unique_quotient_remainder")
112 | 
113 |         # This is just a way to write dividend = quotient * divisor + remainder
114 |         m.addConstrs((t[v] == \
115 |                       sum(q * qr[v, q, r] for q in range(Q_MAX) for r in range(T)) * T + \
116 |                       sum(r * qr[v, q, r] for q in range(Q_MAX) for r in range(T)) \
117 |                       for v in nodes), "constr_division")
118 | 
119 |         # Respect dependencies in DAG
120 |         m.addConstrs((t[v] - t[u] >= self.G.edge[u][v]['delay'] for (u,v) in edges),\
121 |                      "constr_dag_dependencies")
122 | 
123 |         # Number of match units does not exceed match_unit_limit
124 |         # for every time step (j) < T, check the total match unit requirements
125 |         # across all nodes (v) that can be "rotated" into this time slot.
126 |         m.addConstrs((sum(math.ceil((1.0 * self.G.node[v]['key_width']) / self.input_spec.match_unit_size) * qr[v, q, r]\
127 |                       for v in match_nodes for q in range(Q_MAX))\
128 |                       <= self.input_spec.match_unit_limit for r in range(T)),\
129 |                       "constr_match_units")
130 | 
131 |         # The action field resource constraint (similar comments to above)
132 |         m.addConstrs((sum(self.G.node[v]['num_fields'] * qr[v, q, r]\
133 |                       for v in action_nodes for q in range(Q_MAX))\
134 |                       <= self.input_spec.action_fields_limit for r in range(T)),\
135 |                       "constr_action_fields")
136 | 
137 |         # Any time slot (r) can have match or action operations
138 |         # from only match_proc_limit/action_proc_limit packets
139 |         # We do this in two steps.
140 | 
141 |         # First, detect if there is any (at least one) match/action operation from packet q in time slot r
142 |         # if qr[v, q, r] = 1 for any match node, then any_match[q,r] must = 1 (same for actions)
143 |         # Notice that any_match[q, r] may be 1 even if all qr[v, q, r] are zero
144 |         m.addConstrs((sum(qr[v, q, r] for v in match_nodes) <= (len(match_nodes) * any_match[q, r]) \
145 |                       for q in range(Q_MAX)\
146 |                       for r in range(T)),\
147 |                       "constr_any_match1");
148 | 
149 |         m.addConstrs((sum(qr[v, q, r] for v in action_nodes) <= (len(action_nodes) * any_action[q, r]) \
150 |                       for q in range(Q_MAX)\
151 |                       for r in range(T)),\
152 |                       "constr_any_action1");
153 | 
154 |         # Second, check that, for any r, the summation over q of any_match[q, r] is under proc_limits
155 |         m.addConstrs((sum(any_match[q, r] for q in range(Q_MAX)) <= self.input_spec.match_proc_limit\
156 |                       for r in range(T)), "constr_match_proc")
157 |         m.addConstrs((sum(any_action[q, r] for q in range(Q_MAX)) <= self.input_spec.action_proc_limit\
158 |                       for r in range(T)), "constr_action_proc")
159 | 
160 |         # Seed initial values
161 |         if init_drmt_schedule:
162 |           for i in nodes:
163 |             t[i].start = init_drmt_schedule[i]
164 | 
165 |         # Solve model
166 |         m.setParam('TimeLimit', self.minute_limit * 60)
167 |         m.optimize()
168 |         ret = m.Status
169 | 
170 |         if (ret == GRB.INFEASIBLE):
171 |           print ('Infeasible')
172 |           return None
173 |         elif ((ret == GRB.TIME_LIMIT) or (ret == GRB.INTERRUPTED)):
174 |           if (m.SolCount == 0):
175 |             print ('Hit time limit or interrupted, no solution found yet')
176 |             return None
177 |           else:
178 |             print ('Hit time limit or interrupted, suboptimal solution found with gap ', m.MIPGap)
179 |         elif (ret == GRB.OPTIMAL):
180 |           print ('Optimal solution found with gap ', m.MIPGap)
181 |         else:
182 |           print ('Return code is ', ret)
183 |           assert(False)
184 | 
185 |         # Construct and return schedule
186 |         self.time_of_op = {}
187 |         self.ops_at_time = collections.defaultdict(list)
188 |         self.length = int(length.x + 1)
189 |         assert(self.length == length.x + 1)
190 |         for v in nodes:
191 |             tv = int(t[v].x)
192 |             self.time_of_op[v] = tv
193 |             self.ops_at_time[tv].append(v)
194 | 
195 |         # Compute periodic schedule to calculate resource usage
196 |         self.compute_periodic_schedule()
197 | 
198 |         # Populate solution
199 |         solution = Solution()
200 |         solution.time_of_op = self.time_of_op
201 |         solution.ops_at_time = self.ops_at_time
202 |         solution.ops_on_ring = self.ops_on_ring
203 |         solution.length = self.length
204 |         solution.match_key_usage     = self.match_key_usage
205 |         solution.action_fields_usage = self.action_fields_usage
206 |         solution.match_units_usage   = self.match_units_usage
207 |         solution.match_proc_usage    = self.match_proc_usage
208 |         solution.action_proc_usage   = self.action_proc_usage
209 |         return solution
210 | 
211 |     def compute_periodic_schedule(self):
212 |         T = self.period_duration
213 |         self.ops_on_ring = collections.defaultdict(list)
214 |         self.match_key_usage = dict()
215 |         self.action_fields_usage = dict()
216 |         self.match_units_usage = dict()
217 |         self.match_proc_set = dict()
218 |         self.match_proc_usage = dict()
219 |         self.action_proc_set = dict()
220 |         self.action_proc_usage = dict()
221 |         for t in range(T):
222 |           self.match_key_usage[t]     = 0
223 |           self.action_fields_usage[t] = 0
224 |           self.match_units_usage[t]   = 0
225 |           self.match_proc_set[t]      = set()
226 |           self.match_proc_usage[t]    = 0
227 |           self.action_proc_set[t]     = set()
228 |           self.action_proc_usage[t]   = 0
229 | 
230 |         for v in self.G.nodes():
231 |             k = self.time_of_op[v] / T
232 |             r = self.time_of_op[v] % T
233 |             self.ops_on_ring[r].append('p[%d].%s' % (k,v))
234 |             if self.G.node[v]['type'] == 'match':
235 |                 self.match_key_usage[r] += self.G.node[v]['key_width']
236 |                 self.match_units_usage[r] += math.ceil((1.0 * self.G.node[v]['key_width'])/ self.input_spec.match_unit_size)
237 |                 self.match_proc_set[r].add(k)
238 |                 self.match_proc_usage[r] = len(self.match_proc_set[r])
239 |             else:
240 |                 self.action_fields_usage[r] += self.G.node[v]['num_fields']
241 |                 self.action_proc_set[r].add(k)
242 |                 self.action_proc_usage[r] = len(self.action_proc_set[r])
243 | 
244 | if __name__ == "__main__":
245 |   # Cmd line args
246 |   if (len(sys.argv) != 5):
247 |     print ("Usage: ", sys.argv[0], " <DAG file> <HW file> <latency file> <time limit in mins>")
248 |     exit(1)
249 |   elif (len(sys.argv) == 5):
250 |     input_file   = sys.argv[1]
251 |     hw_file      = sys.argv[2]
252 |     latency_file = sys.argv[3]
253 |     minute_limit = int(sys.argv[4])
254 | 
255 |   # Input specification
256 |   input_spec = importlib.import_module(input_file, "*")
257 |   hw_spec    = importlib.import_module(hw_file, "*")
258 |   latency_spec=importlib.import_module(latency_file, "*")
259 |   input_spec.action_fields_limit = hw_spec.action_fields_limit
260 |   input_spec.match_unit_limit    = hw_spec.match_unit_limit
261 |   input_spec.match_unit_size     = hw_spec.match_unit_size
262 |   input_spec.action_proc_limit   = hw_spec.action_proc_limit
263 |   input_spec.match_proc_limit    = hw_spec.match_proc_limit
264 | 
265 |   # Create G
266 |   G = ScheduleDAG()
267 |   G.create_dag(input_spec.nodes, input_spec.edges, latency_spec)
268 |   cpath, cplat = G.critical_path()
269 | 
270 |   print ('{:*^80}'.format(' Input DAG '))
271 |   tpt_upper_bound = print_problem(G, input_spec)
272 |   tpt_lower_bound = 0.01 # Just for kicks
273 |   print ('\n\n')
274 | 
275 |   # Try to max. throughput
276 |   # We do this by min. the period
277 |   period_lower_bound = int(math.ceil((1.0) / tpt_upper_bound))
278 |   period_upper_bound = int(math.ceil((1.0) / tpt_lower_bound))
279 |   period = period_upper_bound
280 |   last_good_solution = None
281 |   last_good_period   = None
282 |   print ('Searching between limits ', period_lower_bound, ' and ', period_upper_bound, ' cycles')
283 |   low = period_lower_bound
284 |   high = period_upper_bound
285 |   while (low <= high):
286 |     assert(low > 0)
287 |     assert(high > 0)
288 |     period = int(math.ceil((low + high)/2.0))
289 |     print ('\nperiod =', period, ' cycles')
290 |     print ('{:*^80}'.format(' Scheduling DRMT '))
291 |     solver = DrmtScheduleSolver(G, input_spec, latency_spec,\
292 |                                 seed_rnd_sieve = True, period_duration = period, minute_limit = minute_limit)
293 |     solution = solver.solve()
294 |     if (solution):
295 |       last_good_period   = period
296 |       last_good_solution = solution
297 |       high = period - 1
298 |     else:
299 |       low  = period + 1
300 | 
301 |   if (last_good_solution == None):
302 |     print ("Best throughput so far is below ", tpt_lower_bound, " packets/cycle.")
303 |     exit(1)
304 | 
305 |   print ('\nBest achieved throughput = 1 packet every %d cycles' % (last_good_period))
306 |   print ('Schedule length (thread count) = %d cycles' % last_good_solution.length)
307 |   print ('Critical path length = %d cycles' % cplat)
308 | 
309 |   print ('\n\n')
310 | 
311 |   print ('{:*^80}'.format(' First scheduling period on one processor'))
312 |   print (timeline_str(last_good_solution.ops_at_time, white_space=0, timeslots_per_row=4),'\n\n')
313 | 
314 |   print ('{:*^80}'.format(' Steady state on one processor'))
315 |   print ('{:*^80}'.format('p[u] is packet from u scheduling periods ago'))
316 |   print (timeline_str(last_good_solution.ops_on_ring, white_space=0, timeslots_per_row=4), '\n\n')
317 | 
318 |   print_resource_usage(input_spec, last_good_solution)
319 | 


--------------------------------------------------------------------------------
/drmt_latencies.py:
--------------------------------------------------------------------------------
1 | dM = 22
2 | dA = 2
3 | dS = 0
4 | 


--------------------------------------------------------------------------------
/experiment_results/drmt_ipc_1_switch_egress_subset.txt:
--------------------------------------------------------------------------------
  1 | ********************************** Input DAG ***********************************
  2 | # of nodes =  46
  3 | # of edges =  87
  4 | # of matches =  16
  5 | # of actions =  30
  6 | Match unit size =  80
  7 | # of match units =  16
  8 | match_unit_limit =  8
  9 | max size of match key in program =  43
 10 | max size of match key in hw =  640
 11 | # of action fields =  65
 12 | action_fields_limit =  32
 13 | max number of action fields in program =  8
 14 | max number of action fields in hw =  32
 15 | match_proc_limit = 1
 16 | action_proc_limit = 1
 17 | Critical path:  ['rid_MATCH', 'rid_ACTION', 'replica_type_MATCH', 'replica_type_ACTION', 'rewrite_ACTION', 'egress_bd_map_MATCH', 'egress_bd_map_ACTION', 'smac_rewrite_MATCH', 'smac_rewrite_ACTION']
 18 | Critical path length = 97 cycles
 19 | Upper bound on throughput =  0.49230769230769234
 20 | 
 21 | 
 22 | 
 23 | Searching between limits  3  and  100  cycles
 24 | 
 25 | period = 52  cycles
 26 | ******************************* Scheduling DRMT ********************************
 27 | ****************************** Running rnd sieve *******************************
 28 | Looking for greedy feasible solution for 30 seconds
 29 | Found Feasible Solution With Latency 96
 30 | **************************** Running PRMT + rotator ****************************
 31 | *************************** Running greedy heuristic ***************************
 32 | ****************************** Running ILP solver ******************************
 33 | Latencies, PRMT:  118  RND sieve:  96
 34 | Picking output from RND sieve
 35 | *************************** Running DRMT ILP solver ****************************
 36 | Optimal solution found with gap  0.0
 37 | 
 38 | period = 27  cycles
 39 | ******************************* Scheduling DRMT ********************************
 40 | ****************************** Running rnd sieve *******************************
 41 | Looking for greedy feasible solution for 30 seconds
 42 | Found Feasible Solution With Latency 96
 43 | **************************** Running PRMT + rotator ****************************
 44 | *************************** Running greedy heuristic ***************************
 45 | ****************************** Running ILP solver ******************************
 46 | Latencies, PRMT:  118  RND sieve:  96
 47 | Picking output from RND sieve
 48 | *************************** Running DRMT ILP solver ****************************
 49 | Optimal solution found with gap  0.0
 50 | 
 51 | period = 15  cycles
 52 | ******************************* Scheduling DRMT ********************************
 53 | ****************************** Running rnd sieve *******************************
 54 | Looking for greedy feasible solution for 30 seconds
 55 | Found Feasible Solution With Latency 96
 56 | **************************** Running PRMT + rotator ****************************
 57 | *************************** Running greedy heuristic ***************************
 58 | ****************************** Running ILP solver ******************************
 59 | Latencies, PRMT:  118  RND sieve:  96
 60 | Picking output from RND sieve
 61 | *************************** Running DRMT ILP solver ****************************
 62 | Optimal solution found with gap  0.0
 63 | 
 64 | period = 9  cycles
 65 | ******************************* Scheduling DRMT ********************************
 66 | ****************************** Running rnd sieve *******************************
 67 | Looking for greedy feasible solution for 30 seconds
 68 | Found Feasible Solution With Latency 106
 69 | Found Feasible Solution With Latency 97
 70 | **************************** Running PRMT + rotator ****************************
 71 | *************************** Running greedy heuristic ***************************
 72 | ****************************** Running ILP solver ******************************
 73 | Latencies, PRMT:  119  RND sieve:  97
 74 | Picking output from RND sieve
 75 | *************************** Running DRMT ILP solver ****************************
 76 | Optimal solution found with gap  0.0
 77 | 
 78 | period = 6  cycles
 79 | ******************************* Scheduling DRMT ********************************
 80 | ****************************** Running rnd sieve *******************************
 81 | Looking for greedy feasible solution for 30 seconds
 82 | **************************** Running PRMT + rotator ****************************
 83 | *************************** Running greedy heuristic ***************************
 84 | ****************************** Running ILP solver ******************************
 85 | Picking output from PRMT
 86 | Latency for PRMT  122
 87 | *************************** Running DRMT ILP solver ****************************
 88 | Optimal solution found with gap  0.0
 89 | 
 90 | period = 4  cycles
 91 | ******************************* Scheduling DRMT ********************************
 92 | ****************************** Running rnd sieve *******************************
 93 | Looking for greedy feasible solution for 30 seconds
 94 | **************************** Running PRMT + rotator ****************************
 95 | *************************** Running greedy heuristic ***************************
 96 | ****************************** Running ILP solver ******************************
 97 | Can't find a solution in rotator, match const. violated
 98 | Both heuristics returned nothing
 99 | *************************** Running DRMT ILP solver ****************************
100 | Hit time limit or interrupted, no solution found yet
101 | 
102 | period = 5  cycles
103 | ******************************* Scheduling DRMT ********************************
104 | ****************************** Running rnd sieve *******************************
105 | Looking for greedy feasible solution for 30 seconds
106 | **************************** Running PRMT + rotator ****************************
107 | *************************** Running greedy heuristic ***************************
108 | ****************************** Running ILP solver ******************************
109 | Picking output from PRMT
110 | Latency for PRMT  118
111 | *************************** Running DRMT ILP solver ****************************
112 | Optimal solution found with gap  0.0
113 | 
114 | Best achieved throughput = 1 packet every 5 cycles
115 | Schedule length (thread count) = 99 cycles
116 | Critical path length = 97 cycles
117 | 
118 | 
119 | 
120 | ******************* First scheduling period on one processor********************
121 | |           t=0            |           t=1            |           t=2            |           t=3            |
122 | |     egress_nat_MATCH     |                          |                          |                          |
123 | |egress_port_mapping_MATCH |                          |                          |                          |
124 | |       mirror_MATCH       |                          |                          |                          |
125 | |        rid_MATCH         |                          |                          |                          |
126 | |     vlan_decap_MATCH     |                          |                          |                          |
127 | 
128 | |           t=20           |           t=21           |           t=22           |           t=23           |
129 | |                          |                          |      mirror_ACTION       |                          |
130 | |                          |                          |        rid_ACTION        |                          |
131 | |                          |                          |      _condition_42       |                          |
132 | |                          |                          |      _condition_43       |                          |
133 | |                          |                          |      _condition_41       |                          |
134 | |                          |                          |      _condition_52       |                          |
135 | 
136 | |           t=24           |           t=25           |           t=26           |           t=27           |
137 | |      rewrite_MATCH       |                          |                          |                          |
138 | |    replica_type_MATCH    |                          |                          |                          |
139 | 
140 | |           t=32           |           t=33           |           t=34           |           t=35           |
141 | |                          | rewrite_multicast_MATCH  |                          |                          |
142 | 
143 | |           t=44           |           t=45           |           t=46           |           t=47           |
144 | |                          |                          |   replica_type_ACTION    |                          |
145 | |                          |                          |      _condition_44       |                          |
146 | |                          |                          |      _condition_50       |                          |
147 | |                          |                          |egress_port_mapping_ACTION|                          |
148 | 
149 | |           t=48           |           t=49           |           t=50           |           t=51           |
150 | |                          |                          |      rewrite_ACTION      |                          |
151 | |                          |                          |      _condition_46       |                          |
152 | |                          |                          |      _condition_45       |                          |
153 | 
154 | |           t=52           |           t=53           |           t=54           |           t=55           |
155 | | egress_vlan_xlate_MATCH  |                          |                          |                          |
156 | |        mtu_MATCH         |                          |                          |                          |
157 | |   egress_qos_map_MATCH   |                          |                          |                          |
158 | |  egress_bd_stats_MATCH   |                          |                          |                          |
159 | |   egress_bd_map_MATCH    |                          |                          |                          |
160 | 
161 | |           t=72           |           t=73           |           t=74           |           t=75           |
162 | |                          |                          |   egress_filter_ACTION   |                          |
163 | |                          |                          |  egress_qos_map_ACTION   |                          |
164 | |                          |                          |  egress_bd_stats_ACTION  |                          |
165 | |                          |                          |   egress_bd_map_ACTION   |                          |
166 | |                          |                          |      _condition_49       |                          |
167 | |                          |                          |      _condition_47       |                          |
168 | |                          |                          | rewrite_multicast_ACTION |                          |
169 | |                          |                          |        mtu_ACTION        |                          |
170 | |                          |                          |    vlan_decap_ACTION     |                          |
171 | 
172 | |           t=76           |           t=77           |           t=78           |           t=79           |
173 | |    smac_rewrite_MATCH    |                          |                          |                          |
174 | | egress_system_acl_MATCH  |                          |                          |                          |
175 | |     l3_rewrite_MATCH     |                          |                          |                          |
176 | 
177 | |           t=96           |           t=97           |           t=98           |
178 | |                          |                          |      _condition_51       |
179 | |                          |                          | egress_vlan_xlate_ACTION |
180 | |                          |                          |    egress_nat_ACTION     |
181 | |                          |                          |      _condition_48       |
182 | |                          |                          |   smac_rewrite_ACTION    |
183 | |                          |                          |    l3_rewrite_ACTION     |
184 | |                          |                          |egress_filter_drop_ACTION |
185 | |                          |                          | egress_system_acl_ACTION |
186 | 
187 |  
188 | 
189 | 
190 | ************************* Steady state on one processor*************************
191 | ******************p[u] is packet from u scheduling periods ago******************
192 | |              t=0              |              t=1              |              t=2              |              t=3              |
193 | |     p[0].egress_nat_MATCH     |   p[9].replica_type_ACTION    | p[10].egress_vlan_xlate_MATCH | p[6].rewrite_multicast_MATCH  |
194 | |p[0].egress_port_mapping_MATCH |   p[15].smac_rewrite_MATCH    |      p[4].mirror_ACTION       |      p[19]._condition_51      |
195 | |     p[10].rewrite_ACTION      | p[15].egress_system_acl_MATCH |        p[10].mtu_MATCH        |p[19].egress_vlan_xlate_ACTION |
196 | |      p[10]._condition_46      |      p[9]._condition_44       |        p[4].rid_ACTION        |    p[19].egress_nat_ACTION    |
197 | |      p[10]._condition_45      |      p[9]._condition_50       |      p[4]._condition_42       |      p[19]._condition_48      |
198 | |       p[0].mirror_MATCH       |p[9].egress_port_mapping_ACTION|      p[4]._condition_43       |   p[19].smac_rewrite_ACTION   |
199 | |        p[0].rid_MATCH         |    p[15].l3_rewrite_MATCH     |      p[4]._condition_41       |    p[19].l3_rewrite_ACTION    |
200 | |     p[0].vlan_decap_MATCH     |                               |      p[4]._condition_52       |p[19].egress_filter_drop_ACTION|
201 | |                               |                               |  p[10].egress_qos_map_MATCH   |p[19].egress_system_acl_ACTION |
202 | |                               |                               |  p[10].egress_bd_stats_MATCH  |                               |
203 | |                               |                               |   p[10].egress_bd_map_MATCH   |                               |
204 | 
205 | |              t=4              |
206 | |  p[14].egress_filter_ACTION   |
207 | |  p[14].egress_qos_map_ACTION  |
208 | | p[14].egress_bd_stats_ACTION  |
209 | |  p[14].egress_bd_map_ACTION   |
210 | |      p[14]._condition_49      |
211 | |      p[4].rewrite_MATCH       |
212 | |      p[14]._condition_47      |
213 | |p[14].rewrite_multicast_ACTION |
214 | |       p[14].mtu_ACTION        |
215 | |    p[14].vlan_decap_ACTION    |
216 | |    p[4].replica_type_MATCH    |
217 | 
218 |  
219 | 
220 | 
221 | Match units usage (max = 8 units) on one processor
222 | |t=0|t=1|t=2|t=3|t=4|
223 | | 5 | 3 | 5 | 1 | 2 |
224 | 
225 | 
226 | Action fields usage (max = 32 fields) on one processor
227 | |t=0|t=1|t=2|t=3|t=4|
228 | | 8 | 7 |13 |23 |14 |
229 | 
230 | 
231 | Match packets (max = 1 match packets) on one processor
232 | |t=0|t=1|t=2|t=3|t=4|
233 | | 1 | 1 | 1 | 1 | 1 |
234 | 
235 | 
236 | Action packets (max = 1 action packets) on one processor
237 | |t=0|t=1|t=2|t=3|t=4|
238 | | 1 | 1 | 1 | 1 | 1 |
239 | 
240 | 
241 | 


--------------------------------------------------------------------------------
/experiment_results/drmt_ipc_2_switch_egress_subset.txt:
--------------------------------------------------------------------------------
  1 | ********************************** Input DAG ***********************************
  2 | # of nodes =  46
  3 | # of edges =  87
  4 | # of matches =  16
  5 | # of actions =  30
  6 | Match unit size =  80
  7 | # of match units =  16
  8 | match_unit_limit =  8
  9 | max size of match key in program =  43
 10 | max size of match key in hw =  640
 11 | # of action fields =  65
 12 | action_fields_limit =  32
 13 | max number of action fields in program =  8
 14 | max number of action fields in hw =  32
 15 | match_proc_limit = 2
 16 | action_proc_limit = 2
 17 | Critical path:  ['rid_MATCH', 'rid_ACTION', 'replica_type_MATCH', 'replica_type_ACTION', 'rewrite_ACTION', 'egress_bd_map_MATCH', 'egress_bd_map_ACTION', 'smac_rewrite_MATCH', 'smac_rewrite_ACTION']
 18 | Critical path length = 97 cycles
 19 | Upper bound on throughput =  0.49230769230769234
 20 | 
 21 | 
 22 | 
 23 | Searching between limits  3  and  100  cycles
 24 | 
 25 | period = 52  cycles
 26 | ******************************* Scheduling DRMT ********************************
 27 | ****************************** Running rnd sieve *******************************
 28 | Looking for greedy feasible solution for 30 seconds
 29 | Found Feasible Solution With Latency 96
 30 | **************************** Running PRMT + rotator ****************************
 31 | *************************** Running greedy heuristic ***************************
 32 | ****************************** Running ILP solver ******************************
 33 | Latencies, PRMT:  118  RND sieve:  96
 34 | Picking output from RND sieve
 35 | *************************** Running DRMT ILP solver ****************************
 36 | Optimal solution found with gap  0.0
 37 | 
 38 | period = 27  cycles
 39 | ******************************* Scheduling DRMT ********************************
 40 | ****************************** Running rnd sieve *******************************
 41 | Looking for greedy feasible solution for 30 seconds
 42 | Found Feasible Solution With Latency 96
 43 | **************************** Running PRMT + rotator ****************************
 44 | *************************** Running greedy heuristic ***************************
 45 | ****************************** Running ILP solver ******************************
 46 | Latencies, PRMT:  118  RND sieve:  96
 47 | Picking output from RND sieve
 48 | *************************** Running DRMT ILP solver ****************************
 49 | Optimal solution found with gap  0.0
 50 | 
 51 | period = 15  cycles
 52 | ******************************* Scheduling DRMT ********************************
 53 | ****************************** Running rnd sieve *******************************
 54 | Looking for greedy feasible solution for 30 seconds
 55 | Found Feasible Solution With Latency 96
 56 | **************************** Running PRMT + rotator ****************************
 57 | *************************** Running greedy heuristic ***************************
 58 | ****************************** Running ILP solver ******************************
 59 | Latencies, PRMT:  118  RND sieve:  96
 60 | Picking output from RND sieve
 61 | *************************** Running DRMT ILP solver ****************************
 62 | Optimal solution found with gap  0.0
 63 | 
 64 | period = 9  cycles
 65 | ******************************* Scheduling DRMT ********************************
 66 | ****************************** Running rnd sieve *******************************
 67 | Looking for greedy feasible solution for 30 seconds
 68 | Found Feasible Solution With Latency 96
 69 | **************************** Running PRMT + rotator ****************************
 70 | *************************** Running greedy heuristic ***************************
 71 | ****************************** Running ILP solver ******************************
 72 | Latencies, PRMT:  119  RND sieve:  96
 73 | Picking output from RND sieve
 74 | *************************** Running DRMT ILP solver ****************************
 75 | Optimal solution found with gap  0.0
 76 | 
 77 | period = 6  cycles
 78 | ******************************* Scheduling DRMT ********************************
 79 | ****************************** Running rnd sieve *******************************
 80 | Looking for greedy feasible solution for 30 seconds
 81 | Found Feasible Solution With Latency 98
 82 | Found Feasible Solution With Latency 97
 83 | **************************** Running PRMT + rotator ****************************
 84 | *************************** Running greedy heuristic ***************************
 85 | ****************************** Running ILP solver ******************************
 86 | Latencies, PRMT:  122  RND sieve:  97
 87 | Picking output from RND sieve
 88 | *************************** Running DRMT ILP solver ****************************
 89 | Optimal solution found with gap  0.0
 90 | 
 91 | period = 4  cycles
 92 | ******************************* Scheduling DRMT ********************************
 93 | ****************************** Running rnd sieve *******************************
 94 | Looking for greedy feasible solution for 30 seconds
 95 | Found Feasible Solution With Latency 117
 96 | Found Feasible Solution With Latency 104
 97 | Found Feasible Solution With Latency 101
 98 | Found Feasible Solution With Latency 97
 99 | **************************** Running PRMT + rotator ****************************
100 | *************************** Running greedy heuristic ***************************
101 | ****************************** Running ILP solver ******************************
102 | Can't find a solution in rotator, match const. violated
103 | Picking output from RND sieve
104 | Latency for RND sieve:  97
105 | *************************** Running DRMT ILP solver ****************************
106 | Optimal solution found with gap  0.0
107 | 
108 | period = 3  cycles
109 | ******************************* Scheduling DRMT ********************************
110 | ****************************** Running rnd sieve *******************************
111 | Looking for greedy feasible solution for 30 seconds
112 | **************************** Running PRMT + rotator ****************************
113 | *************************** Running greedy heuristic ***************************
114 | ****************************** Running ILP solver ******************************
115 | Can't find a solution in rotator, match const. violated
116 | Both heuristics returned nothing
117 | *************************** Running DRMT ILP solver ****************************
118 | Optimal solution found with gap  0.0
119 | 
120 | Best achieved throughput = 1 packet every 3 cycles
121 | Schedule length (thread count) = 99 cycles
122 | Critical path length = 97 cycles
123 | 
124 | 
125 | 
126 | ******************* First scheduling period on one processor********************
127 | |           t=0            |           t=1            |           t=2            |           t=3            |
128 | |     l3_rewrite_MATCH     |egress_port_mapping_MATCH |      _condition_41       |                          |
129 | |     vlan_decap_MATCH     |                          |      _condition_42       |                          |
130 | |        rid_MATCH         |                          |      _condition_52       |                          |
131 | |     egress_nat_MATCH     |                          |      _condition_43       |                          |
132 | |       mirror_MATCH       |                          |                          |                          |
133 | | rewrite_multicast_MATCH  |                          |                          |                          |
134 | 
135 | |           t=20           |           t=21           |           t=22           |           t=23           |
136 | |                          |                          |      mirror_ACTION       |                          |
137 | |                          |                          |        rid_ACTION        |                          |
138 | 
139 | |           t=24           |           t=25           |           t=26           |           t=27           |
140 | |    replica_type_MATCH    |                          |                          |                          |
141 | |      rewrite_MATCH       |                          |                          |                          |
142 | 
143 | |           t=44           |           t=45           |           t=46           |           t=47           |
144 | |                          |                          |    vlan_decap_ACTION     |                          |
145 | |                          |                          |      _condition_50       |                          |
146 | |                          |                          |      _condition_46       |                          |
147 | |                          |                          |      _condition_44       |                          |
148 | |                          |                          |   replica_type_ACTION    |                          |
149 | |                          |                          |egress_port_mapping_ACTION|                          |
150 | 
151 | |           t=48           |           t=49           |           t=50           |           t=51           |
152 | |      rewrite_ACTION      |                          | egress_vlan_xlate_MATCH  |                          |
153 | |      _condition_49       |                          |   egress_bd_map_MATCH    |                          |
154 | |      _condition_45       |                          |  egress_bd_stats_MATCH   |                          |
155 | | rewrite_multicast_ACTION |                          |   egress_qos_map_MATCH   |                          |
156 | |                          |                          |        mtu_MATCH         |                          |
157 | 
158 | |           t=72           |           t=73           |           t=74           |           t=75           |
159 | |   egress_filter_ACTION   |                          |    smac_rewrite_MATCH    |                          |
160 | |      _condition_47       |                          | egress_system_acl_MATCH  |                          |
161 | | egress_vlan_xlate_ACTION |                          |                          |                          |
162 | |   egress_bd_map_ACTION   |                          |                          |                          |
163 | |  egress_bd_stats_ACTION  |                          |                          |                          |
164 | |  egress_qos_map_ACTION   |                          |                          |                          |
165 | |        mtu_ACTION        |                          |                          |                          |
166 | 
167 | |           t=96           |           t=97           |           t=98           |
168 | |                          |                          |egress_filter_drop_ACTION |
169 | |                          |                          |    egress_nat_ACTION     |
170 | |                          |                          |      _condition_48       |
171 | |                          |                          |   smac_rewrite_ACTION    |
172 | |                          |                          |      _condition_51       |
173 | |                          |                          | egress_system_acl_ACTION |
174 | |                          |                          |    l3_rewrite_ACTION     |
175 | 
176 |  
177 | 
178 | 
179 | ************************* Steady state on one processor*************************
180 | ******************p[u] is packet from u scheduling periods ago******************
181 | |              t=0               |              t=1               |              t=2               |
182 | |      p[16].rewrite_ACTION      |    p[15].vlan_decap_ACTION     | p[16].egress_vlan_xlate_MATCH  |
183 | |    p[8].replica_type_MATCH     |      p[15]._condition_50       |    p[24].smac_rewrite_MATCH    |
184 | |   p[24].egress_filter_ACTION   |      p[15]._condition_46       |       p[0]._condition_41       |
185 | |      p[16]._condition_49       |      p[15]._condition_44       |       p[0]._condition_42       |
186 | |      p[16]._condition_45       | p[0].egress_port_mapping_MATCH |       p[0]._condition_52       |
187 | | p[16].rewrite_multicast_ACTION |       p[7].mirror_ACTION       |p[32].egress_filter_drop_ACTION |
188 | |      p[24]._condition_47       |   p[15].replica_type_ACTION    |    p[32].egress_nat_ACTION     |
189 | |     p[0].l3_rewrite_MATCH      |        p[7].rid_ACTION         |       p[0]._condition_43       |
190 | |     p[0].vlan_decap_MATCH      |p[15].egress_port_mapping_ACTION|      p[32]._condition_48       |
191 | | p[24].egress_vlan_xlate_ACTION |                                | p[24].egress_system_acl_MATCH  |
192 | |   p[24].egress_bd_map_ACTION   |                                |   p[32].smac_rewrite_ACTION    |
193 | |         p[0].rid_MATCH         |                                |   p[16].egress_bd_map_MATCH    |
194 | |       p[8].rewrite_MATCH       |                                |      p[32]._condition_51       |
195 | |     p[0].egress_nat_MATCH      |                                |  p[16].egress_bd_stats_MATCH   |
196 | |       p[0].mirror_MATCH        |                                |   p[16].egress_qos_map_MATCH   |
197 | |  p[24].egress_bd_stats_ACTION  |                                |        p[16].mtu_MATCH         |
198 | |  p[24].egress_qos_map_ACTION   |                                | p[32].egress_system_acl_ACTION |
199 | |        p[24].mtu_ACTION        |                                |    p[32].l3_rewrite_ACTION     |
200 | |  p[0].rewrite_multicast_MATCH  |                                |                                |
201 | 
202 |  
203 | 
204 | 
205 | Match units usage (max = 8 units) on one processor
206 | |t=0|t=1|t=2|
207 | | 8 | 1 | 7 |
208 | 
209 | 
210 | Action fields usage (max = 32 fields) on one processor
211 | |t=0|t=1|t=2|
212 | |25 |20 |20 |
213 | 
214 | 
215 | Match packets (max = 2 match packets) on one processor
216 | |t=0|t=1|t=2|
217 | | 2 | 1 | 2 |
218 | 
219 | 
220 | Action packets (max = 2 action packets) on one processor
221 | |t=0|t=1|t=2|
222 | | 2 | 2 | 2 |
223 | 
224 | 
225 | 


--------------------------------------------------------------------------------
/experiment_results/prmt_coarse_switch_combined_subset.txt:
--------------------------------------------------------------------------------
  1 | ********************************** Input DAG ***********************************
  2 | # of nodes =  192
  3 | # of edges =  508
  4 | # of matches =  69
  5 | # of actions =  123
  6 | Match unit size =  80
  7 | # of match units =  78
  8 | match_unit_limit =  8
  9 | max size of match key in program =  153
 10 | max size of match key in hw =  640
 11 | # of action fields =  291
 12 | action_fields_limit =  32
 13 | max number of action fields in program =  21
 14 | max number of action fields in hw =  32
 15 | match_proc_limit = 1
 16 | action_proc_limit = 1
 17 | Critical path:  ['ing_ingress_port_mapping_MATCH', 'ing_ingress_port_mapping_ACTION', 'ing_port_vlan_mapping_MATCH', 'ing_port_vlan_mapping_ACTION', 'ing_ipsg_MATCH', 'ing_ipsg_ACTION', 'ing_native_packet_over_fabric_ACTION', 'ing_ingress_l4_src_port_MATCH', 'ing_ingress_l4_src_port_ACTION', 'ing_ip_acl_MATCH', 'ing_ip_acl_ACTION', 'ing_ipv4_racl_ACTION', 'ing_fwd_result_MATCH', 'ing_fwd_result_ACTION', 'ing_nexthop_MATCH', 'ing_nexthop_ACTION', 'ing_lag_group_MATCH', 'ing_lag_group_ACTION', 'ing_fabric_lag_MATCH', 'ing_fabric_lag_ACTION']
 18 | Critical path length = 181 cycles
 19 | Upper bound on throughput =  0.10256410256410256
 20 | ***************************** Scheduling PRMT fine *****************************
 21 | *************************** Running greedy heuristic ***************************
 22 | ****************************** Running ILP solver ******************************
 23 | Number of pipeline stages: 12.000000
 24 | *********************************** Schedule************************************
 25 | |                  t=0                  |                  t=1                  |                  t=2                  |                  t=3                  |
 26 | |             egr_rid_MATCH             |           _condition_ing_0            |    ing_switch_config_params_MATCH     |        egr_replica_type_ACTION        |
 27 | |    ing_ingress_port_mapping_MATCH     |           _condition_ing_3            |      ing_port_vlan_mapping_MATCH      |    ing_switch_config_params_ACTION    |
 28 | | ing_validate_outer_ipv4_packet_MATCH  |           _condition_egr_43           |        egr_replica_type_MATCH         |     ing_port_vlan_mapping_ACTION      |
 29 | |   ing_validate_outer_ethernet_MATCH   |           _condition_egr_42           |                                       |           _condition_ing_16           |
 30 | |      ing_adjust_lkp_fields_MATCH      | ing_validate_outer_ipv4_packet_ACTION |                                       |           _condition_ing_18           |
 31 | |                                       |           _condition_ing_32           |                                       |           _condition_ing_33           |
 32 | |                                       |           _condition_egr_41           |                                       |           _condition_ing_12           |
 33 | |                                       |  ing_validate_outer_ethernet_ACTION   |                                       |           _condition_ing_6            |
 34 | |                                       |           _condition_egr_52           |                                       |                                       |
 35 | |                                       |            egr_rid_ACTION             |                                       |                                       |
 36 | |                                       |     ing_adjust_lkp_fields_ACTION      |                                       |                                       |
 37 | |                                       |    ing_ingress_port_mapping_ACTION    |                                       |                                       |
 38 | 
 39 | |                  t=4                  |                  t=5                  |                  t=6                  |                  t=7                  |
 40 | |     egr_egress_port_mapping_MATCH     |            ing_ipsg_ACTION            |   ing_fabric_ingress_src_lkp_MATCH    |           _condition_ing_37           |
 41 | |           egr_mirror_MATCH            |   ing_fabric_ingress_dst_lkp_ACTION   |    ing_ingress_qos_map_dscp_MATCH     |           _condition_ing_13           |
 42 | |            ing_ipsg_MATCH             |           _condition_egr_44           |     ing_ingress_qos_map_pcp_MATCH     |           _condition_ing_14           |
 43 | |   ing_ingress_port_properties_MATCH   |           _condition_ing_34           |     ing_ipsg_permit_special_MATCH     |    ing_ipsg_permit_special_ACTION     |
 44 | |   ing_fabric_ingress_dst_lkp_MATCH    |           _condition_ing_8            |  ing_native_packet_over_fabric_MATCH  |           _condition_ing_19           |
 45 | |                                       |    egr_egress_port_mapping_ACTION     |           egr_rewrite_MATCH           |   ing_fabric_ingress_src_lkp_ACTION   |
 46 | |                                       |  ing_ingress_port_properties_ACTION   |        ing_spanning_tree_MATCH        |           _condition_egr_45           |
 47 | |                                       |           egr_mirror_ACTION           |                                       |    ing_ingress_qos_map_dscp_ACTION    |
 48 | |                                       |           _condition_ing_7            |                                       |           _condition_ing_4            |
 49 | |                                       |                                       |                                       |           _condition_ing_9            |
 50 | |                                       |                                       |                                       |          egr_rewrite_ACTION           |
 51 | |                                       |                                       |                                       | ing_native_packet_over_fabric_ACTION  |
 52 | |                                       |                                       |                                       |           _condition_egr_49           |
 53 | |                                       |                                       |                                       |           _condition_ing_2            |
 54 | |                                       |                                       |                                       |           _condition_ing_15           |
 55 | |                                       |                                       |                                       |    ing_ingress_qos_map_pcp_ACTION     |
 56 | |                                       |                                       |                                       |           _condition_ing_10           |
 57 | |                                       |                                       |                                       |           _condition_ing_31           |
 58 | |                                       |                                       |                                       |       ing_spanning_tree_ACTION        |
 59 | |                                       |                                       |                                       |           _condition_ing_5            |
 60 | 
 61 | |                  t=8                  |                  t=9                  |                 t=10                  |                 t=11                  |
 62 | |        ing_storm_control_MATCH        |           _condition_ing_11           |        ing_ipv4_fib_lpm_MATCH         |          ing_mac_acl_ACTION           |
 63 | |          ing_nat_twice_MATCH          |            ing_rmac_ACTION            |           ing_mac_acl_MATCH           |        ing_ipv4_fib_lpm_ACTION        |
 64 | |            ing_dmac_MATCH             |         ing_nat_twice_ACTION          |          ing_ipv4_fib_MATCH           |    ing_ipv4_multicast_route_ACTION    |
 65 | |            ing_rmac_MATCH             |    ing_ingress_l4_dst_port_ACTION     |    ing_ipv4_multicast_route_MATCH     |          ing_ipv4_fib_ACTION          |
 66 | |     ing_ingress_l4_src_port_MATCH     |       egr_egress_bd_map_ACTION        |           ing_ip_acl_MATCH            |           ing_ip_acl_ACTION           |
 67 | |        egr_egress_bd_map_MATCH        |           _condition_ing_21           |                                       |                                       |
 68 | |     ing_ingress_l4_dst_port_MATCH     |       ing_storm_control_ACTION        |                                       |                                       |
 69 | |                                       |           _condition_ing_25           |                                       |                                       |
 70 | |                                       |    ing_ingress_l4_src_port_ACTION     |                                       |                                       |
 71 | |                                       |            ing_dmac_ACTION            |                                       |                                       |
 72 | |                                       |       egr_egress_filter_ACTION        |                                       |                                       |
 73 | |                                       |           _condition_ing_23           |                                       |                                       |
 74 | |                                       |           _condition_egr_50           |                                       |                                       |
 75 | |                                       |           _condition_ing_17           |                                       |                                       |
 76 | |                                       |           _condition_ing_26           |                                       |                                       |
 77 | 
 78 | |                 t=12                  |                 t=13                  |                 t=14                  |                 t=15                  |
 79 | | ing_ipv4_multicast_route_star_g_MATCH |       egr_egress_qos_map_ACTION       |          ing_ipv4_racl_MATCH          |           _condition_ing_30           |
 80 | |       ing_validate_packet_MATCH       |          ing_nat_src_ACTION           |    ing_ipv4_multicast_bridge_MATCH    |           _condition_ing_27           |
 81 | |           ing_nat_src_MATCH           |           _condition_egr_46           |ing_ipv4_multicast_bridge_star_g_MATCH |   ing_compute_non_ip_hashes_ACTION    |
 82 | |           ing_nat_dst_MATCH           |           _condition_ing_38           |     ing_compute_ipv4_hashes_MATCH     |         ing_ipv4_racl_ACTION          |
 83 | |          ing_nat_flow_MATCH           |           _condition_egr_48           |    ing_compute_non_ip_hashes_MATCH    |     egr_egress_filter_drop_ACTION     |
 84 | |       egr_egress_qos_map_MATCH        |           _condition_egr_51           |                                       |    ing_compute_ipv4_hashes_ACTION     |
 85 | |                                       |ing_ipv4_multicast_route_star_g_ACTION |                                       |   ing_ipv4_multicast_bridge_ACTION    |
 86 | |                                       |          ing_nat_flow_ACTION          |                                       |ing_ipv4_multicast_bridge_star_g_ACTION|
 87 | |                                       |          ing_nat_dst_ACTION           |                                       |                                       |
 88 | |                                       |           _condition_ing_39           |                                       |                                       |
 89 | |                                       |           _condition_ing_22           |                                       |                                       |
 90 | |                                       |      ing_validate_packet_ACTION       |                                       |                                       |
 91 | 
 92 | |                 t=16                  |                 t=17                  |                 t=18                  |                 t=19                  |
 93 | |    ing_compute_other_hashes_MATCH     |     egr_rewrite_multicast_ACTION      |        egr_smac_rewrite_MATCH         |         ing_ecmp_group_ACTION         |
 94 | |        ing_traffic_class_MATCH        |       ing_ipv4_urpf_lpm_ACTION        |             egr_mtu_MATCH             |         egr_l3_rewrite_ACTION         |
 95 | |        ing_ipv4_urpf_lpm_MATCH        |      ing_ingress_bd_stats_ACTION      |         egr_l3_rewrite_MATCH          |            ing_smac_ACTION            |
 96 | |          ing_ipv4_urpf_MATCH          |    ing_compute_other_hashes_ACTION    |         egr_vlan_decap_MATCH          |           _condition_ing_29           |
 97 | |       egr_egress_bd_stats_MATCH       |         ing_acl_stats_ACTION          |         ing_ecmp_group_MATCH          |        egr_smac_rewrite_ACTION        |
 98 | |         ing_fwd_result_MATCH          |         ing_fwd_result_ACTION         |           ing_urpf_bd_MATCH           |         ing_drop_stats_ACTION         |
 99 | |      egr_rewrite_multicast_MATCH      |      egr_egress_bd_stats_ACTION       |            ing_smac_MATCH             |            egr_mtu_ACTION             |
100 | |                                       |         ing_ipv4_urpf_ACTION          |           ing_nexthop_MATCH           |          ing_nexthop_ACTION           |
101 | |                                       |       ing_traffic_class_ACTION        |                                       |           _condition_ing_35           |
102 | |                                       |                                       |                                       |           _condition_egr_47           |
103 | |                                       |                                       |                                       |         egr_vlan_decap_ACTION         |
104 | |                                       |                                       |                                       |          ing_urpf_bd_ACTION           |
105 | |                                       |                                       |                                       |           _condition_ing_40           |
106 | 
107 | |                 t=20                  |                 t=21                  |                 t=22                  |                 t=23                  |
108 | |         ing_meter_index_MATCH         |     egr_egress_system_acl_ACTION      |     ing_storm_control_stats_MATCH     |        ing_meter_action_ACTION        |
109 | |      egr_egress_vlan_xlate_MATCH      |         ing_lag_group_ACTION          |        ing_meter_action_MATCH         |         ing_system_acl_ACTION         |
110 | |        ing_learn_notify_MATCH         |        ing_meter_index_ACTION         |         ing_system_acl_MATCH          |         ing_fabric_lag_ACTION         |
111 | |         egr_egress_nat_MATCH          |           _condition_ing_36           |         ing_fabric_lag_MATCH          |    ing_storm_control_stats_ACTION     |
112 | |      egr_egress_system_acl_MATCH      |         egr_egress_nat_ACTION         |                                       |                                       |
113 | |          ing_lag_group_MATCH          |        ing_learn_notify_ACTION        |                                       |                                       |
114 | |          ing_bd_flood_MATCH           |          ing_bd_flood_ACTION          |                                       |                                       |
115 | |                                       |     egr_egress_vlan_xlate_ACTION      |                                       |                                       |
116 | 
117 |  
118 | 
119 | 
120 | Match units usage (max = 8 units) on one processor
121 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |t=10|t=11|t=12|t=13|t=14|t=15|
122 | | 6  | 0  | 3  | 0  | 6  | 0  | 7  | 0  | 8  | 0  | 7  | 0  | 8  | 0  | 6  | 0  |
123 | 
124 | |t=16|t=17|t=18|t=19|t=20|t=21|t=22|t=23|
125 | | 7  | 0  | 8  | 0  | 7  | 0  | 5  | 0  |
126 | 
127 | 
128 | Action fields usage (max = 32 fields) on one processor
129 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |t=10|t=11|t=12|t=13|t=14|t=15|
130 | | 0  | 31 | 0  | 32 | 0  | 26 | 0  | 32 | 0  | 25 | 0  | 30 | 0  | 23 | 0  | 18 |
131 | 
132 | |t=16|t=17|t=18|t=19|t=20|t=21|t=22|t=23|
133 | | 0  | 20 | 0  | 24 | 0  | 21 | 0  | 9  |
134 | 
135 | 
136 | Match packets (max = 1 match packets) on one processor
137 | empty dictionary
138 | Action packets (max = 1 action packets) on one processor
139 | empty dictionary
140 | 


--------------------------------------------------------------------------------
/experiment_results/prmt_coarse_switch_egress.txt:
--------------------------------------------------------------------------------
  1 | ********************************** Input DAG ***********************************
  2 | # of nodes =  104
  3 | # of edges =  291
  4 | # of matches =  41
  5 | # of actions =  63
  6 | Match unit size =  80
  7 | # of match units =  46
  8 | match_unit_limit =  8
  9 | max size of match key in program =  312
 10 | max size of match key in hw =  640
 11 | # of action fields =  197
 12 | action_fields_limit =  32
 13 | max number of action fields in program =  25
 14 | max number of action fields in hw =  32
 15 | match_proc_limit = 1
 16 | action_proc_limit = 1
 17 | Critical path:  ['rid_MATCH', 'rid_ACTION', 'replica_type_MATCH', 'replica_type_ACTION', 'rewrite_ACTION', 'egress_bd_map_MATCH', 'egress_bd_map_ACTION', '_condition_65', 'egress_nat_ACTION', 'egress_l4port_fields_ACTION', 'egress_l4_src_port_MATCH', 'egress_l4_src_port_ACTION', 'tunnel_encap_process_outer_ACTION', 'tunnel_rewrite_MATCH', 'tunnel_rewrite_ACTION', 'tunnel_smac_rewrite_MATCH', 'tunnel_smac_rewrite_ACTION', 'egress_mac_acl_MATCH', 'egress_mac_acl_ACTION', 'egress_system_acl_MATCH', 'egress_system_acl_ACTION']
 18 | Critical path length = 165 cycles
 19 | Upper bound on throughput =  0.16243654822335024
 20 | ***************************** Scheduling PRMT fine *****************************
 21 | *************************** Running greedy heuristic ***************************
 22 | ****************************** Running ILP solver ******************************
 23 | Number of pipeline stages: 12.000000
 24 | *********************************** Schedule************************************
 25 | |               t=0               |               t=1               |               t=2               |               t=3               |
 26 | |            rid_MATCH            |          _condition_57          |tunnel_decap_process_inner_MATCH |          _condition_60          |
 27 | |          mirror_MATCH           |          _condition_55          |    egress_port_mapping_MATCH    |        vlan_decap_ACTION        |
 28 | |                                 |           rid_ACTION            |        int_insert_MATCH         |   egress_port_mapping_ACTION    |
 29 | |                                 |          _condition_56          |        vlan_decap_MATCH         |tunnel_decap_process_inner_ACTION|
 30 | |                                 |          mirror_ACTION          |                                 |          _condition_58          |
 31 | |                                 |          _condition_74          |                                 |          _condition_59          |
 32 | |                                 |                                 |                                 |          _condition_72          |
 33 | |                                 |                                 |                                 |        int_insert_ACTION        |
 34 | 
 35 | |               t=4               |               t=5               |               t=6               |               t=7               |
 36 | |       int_inst_0003_MATCH       |          _condition_62          |          rewrite_MATCH          |         int_bos_ACTION          |
 37 | |tunnel_decap_process_outer_MATCH |tunnel_decap_process_outer_ACTION|     rewrite_multicast_MATCH     |         rewrite_ACTION          |
 38 | |      egress_qos_map_MATCH       |          _condition_71          |          int_bos_MATCH          |          _condition_61          |
 39 | |       int_inst_1215_MATCH       |      int_inst_0407_ACTION       |                                 |    rewrite_multicast_ACTION     |
 40 | |       replica_type_MATCH        |      int_inst_0811_ACTION       |                                 |                                 |
 41 | |       int_inst_0811_MATCH       |      int_inst_1215_ACTION       |                                 |                                 |
 42 | |       int_inst_0407_MATCH       |      egress_qos_map_ACTION      |                                 |                                 |
 43 | |                                 |       replica_type_ACTION       |                                 |                                 |
 44 | |                                 |          _condition_70          |                                 |                                 |
 45 | |                                 |          _condition_64          |                                 |                                 |
 46 | |                                 |      int_inst_0003_ACTION       |                                 |                                 |
 47 | 
 48 | |               t=8               |               t=9               |              t=10               |              t=11               |
 49 | |  int_meta_header_update_MATCH   |           mtu_ACTION            |        egress_nat_MATCH         |          _condition_65          |
 50 | |            mtu_MATCH            |        l3_rewrite_ACTION        |       smac_rewrite_MATCH        |       smac_rewrite_ACTION       |
 51 | |        egress_vni_MATCH         |      egress_bd_map_ACTION       |                                 |        egress_nat_ACTION        |
 52 | |       egress_bd_map_MATCH       |        egress_vni_ACTION        |                                 |                                 |
 53 | |        l3_rewrite_MATCH         |          _condition_66          |                                 |                                 |
 54 | |                                 |          _condition_67          |                                 |                                 |
 55 | |                                 |  int_meta_header_update_ACTION  |                                 |                                 |
 56 | |                                 |          _condition_63          |                                 |                                 |
 57 | 
 58 | |              t=12               |              t=13               |              t=14               |              t=15               |
 59 | |   egress_l4port_fields_MATCH    |tunnel_encap_process_inner_ACTION|tunnel_encap_process_outer_MATCH |    egress_l4_src_port_ACTION    |
 60 | |tunnel_encap_process_inner_MATCH |   egress_l4port_fields_ACTION   |    egress_l4_dst_port_MATCH     |    egress_l4_dst_port_ACTION    |
 61 | |                                 |                                 |    egress_l4_src_port_MATCH     |tunnel_encap_process_outer_ACTION|
 62 | 
 63 | |              t=16               |              t=17               |              t=18               |              t=19               |
 64 | |        tunnel_mtu_MATCH         |     egress_bd_stats_ACTION      |    tunnel_smac_rewrite_MATCH    |      egress_filter_ACTION       |
 65 | |      tunnel_rewrite_MATCH       |     int_outer_encap_ACTION      |    tunnel_src_rewrite_MATCH     |    tunnel_dst_rewrite_ACTION    |
 66 | |      int_outer_encap_MATCH      |      tunnel_rewrite_ACTION      |    tunnel_dmac_rewrite_MATCH    |   tunnel_dmac_rewrite_ACTION    |
 67 | |      egress_bd_stats_MATCH      |          _condition_68          |    tunnel_dst_rewrite_MATCH     |    tunnel_src_rewrite_ACTION    |
 68 | |                                 |        tunnel_mtu_ACTION        |                                 |   tunnel_smac_rewrite_ACTION    |
 69 | |                                 |          _condition_69          |                                 |                                 |
 70 | 
 71 | |              t=20               |              t=21               |              t=22               |              t=23               |
 72 | |       egress_ip_acl_MATCH       |     egress_ipv6_acl_ACTION      |     egress_vlan_xlate_MATCH     |    egress_vlan_xlate_ACTION     |
 73 | |      egress_ipv6_acl_MATCH      |      egress_mac_acl_ACTION      |     egress_system_acl_MATCH     |    egress_system_acl_ACTION     |
 74 | |      egress_mac_acl_MATCH       |          _condition_73          |                                 |                                 |
 75 | |                                 |    egress_filter_drop_ACTION    |                                 |                                 |
 76 | |                                 |      egress_ip_acl_ACTION       |                                 |                                 |
 77 | 
 78 |  
 79 | 
 80 | 
 81 | Match units usage (max = 8 units) on one processor
 82 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |t=10|t=11|t=12|t=13|t=14|t=15|
 83 | | 2  | 0  | 4  | 0  | 7  | 0  | 3  | 0  | 5  | 0  | 2  | 0  | 2  | 0  | 3  | 0  |
 84 | 
 85 | |t=16|t=17|t=18|t=19|t=20|t=21|t=22|t=23|
 86 | | 4  | 0  | 4  | 0  | 8  | 0  | 2  | 0  |
 87 | 
 88 | 
 89 | Action fields usage (max = 32 fields) on one processor
 90 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |t=10|t=11|t=12|t=13|t=14|t=15|
 91 | | 0  | 16 | 0  | 32 | 0  | 31 | 0  | 10 | 0  | 12 | 0  | 8  | 0  | 8  | 0  | 27 |
 92 | 
 93 | |t=16|t=17|t=18|t=19|t=20|t=21|t=22|t=23|
 94 | | 0  | 28 | 0  | 7  | 0  | 8  | 0  | 10 |
 95 | 
 96 | 
 97 | Match packets (max = 1 match packets) on one processor
 98 | empty dictionary
 99 | Action packets (max = 1 action packets) on one processor
100 | empty dictionary
101 | 


--------------------------------------------------------------------------------
/experiment_results/prmt_coarse_switch_egress_subset.txt:
--------------------------------------------------------------------------------
 1 | ********************************** Input DAG ***********************************
 2 | # of nodes =  46
 3 | # of edges =  87
 4 | # of matches =  16
 5 | # of actions =  30
 6 | Match unit size =  80
 7 | # of match units =  16
 8 | match_unit_limit =  8
 9 | max size of match key in program =  43
10 | max size of match key in hw =  640
11 | # of action fields =  65
12 | action_fields_limit =  32
13 | max number of action fields in program =  8
14 | max number of action fields in hw =  32
15 | match_proc_limit = 1
16 | action_proc_limit = 1
17 | Critical path:  ['rid_MATCH', 'rid_ACTION', 'replica_type_MATCH', 'replica_type_ACTION', 'rewrite_ACTION', 'egress_bd_map_MATCH', 'egress_bd_map_ACTION', 'smac_rewrite_MATCH', 'smac_rewrite_ACTION']
18 | Critical path length = 81 cycles
19 | Upper bound on throughput =  0.49230769230769234
20 | ***************************** Scheduling PRMT fine *****************************
21 | *************************** Running greedy heuristic ***************************
22 | ****************************** Running ILP solver ******************************
23 | Number of pipeline stages: 5.000000
24 | *********************************** Schedule************************************
25 | |           t=0            |           t=1            |           t=2            |           t=3            |
26 | |        rid_MATCH         |      _condition_42       |     vlan_decap_MATCH     |      _condition_50       |
27 | |       mirror_MATCH       |      _condition_43       |egress_port_mapping_MATCH |   replica_type_ACTION    |
28 | |                          |      _condition_52       |    replica_type_MATCH    |      _condition_46       |
29 | |                          |      _condition_41       |                          |      _condition_44       |
30 | |                          |        rid_ACTION        |                          |    vlan_decap_ACTION     |
31 | |                          |      mirror_ACTION       |                          |egress_port_mapping_ACTION|
32 | 
33 | |           t=4            |           t=5            |           t=6            |           t=7            |
34 | |      rewrite_MATCH       |      _condition_49       |   egress_bd_map_MATCH    |        mtu_ACTION        |
35 | | rewrite_multicast_MATCH  |      _condition_45       |        mtu_MATCH         |   egress_filter_ACTION   |
36 | |                          | rewrite_multicast_ACTION |   egress_qos_map_MATCH   |  egress_qos_map_ACTION   |
37 | |                          |      rewrite_ACTION      |                          |      _condition_47       |
38 | |                          |                          |                          |   egress_bd_map_ACTION   |
39 | 
40 | |           t=8            |           t=9            |
41 | | egress_system_acl_MATCH  |    l3_rewrite_ACTION     |
42 | |     l3_rewrite_MATCH     |egress_filter_drop_ACTION |
43 | |    smac_rewrite_MATCH    | egress_vlan_xlate_ACTION |
44 | | egress_vlan_xlate_MATCH  |  egress_bd_stats_ACTION  |
45 | |  egress_bd_stats_MATCH   |    egress_nat_ACTION     |
46 | |     egress_nat_MATCH     |      _condition_48       |
47 | |                          |   smac_rewrite_ACTION    |
48 | |                          |      _condition_51       |
49 | |                          | egress_system_acl_ACTION |
50 | 
51 |  
52 | 
53 | 
54 | Match units usage (max = 8 units) on one processor
55 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |
56 | | 2  | 0  | 3  | 0  | 2  | 0  | 3  | 0  | 6  | 0  |
57 | 
58 | 
59 | Action fields usage (max = 32 fields) on one processor
60 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |
61 | | 0  | 13 | 0  | 11 | 0  | 9  | 0  | 9  | 0  | 23 |
62 | 
63 | 
64 | Match packets (max = 1 match packets) on one processor
65 | empty dictionary
66 | Action packets (max = 1 action packets) on one processor
67 | empty dictionary
68 | 


--------------------------------------------------------------------------------
/experiment_results/prmt_coarse_switch_ingress.txt:
--------------------------------------------------------------------------------
  1 | ********************************** Input DAG ***********************************
  2 | # of nodes =  224
  3 | # of edges =  930
  4 | # of matches =  83
  5 | # of actions =  141
  6 | Match unit size =  80
  7 | # of match units =  120
  8 | match_unit_limit =  8
  9 | max size of match key in program =  328
 10 | max size of match key in hw =  640
 11 | # of action fields =  387
 12 | action_fields_limit =  32
 13 | max number of action fields in program =  29
 14 | max number of action fields in hw =  32
 15 | match_proc_limit = 1
 16 | action_proc_limit = 1
 17 | Critical path:  ['ingress_port_mapping_MATCH', 'ingress_port_mapping_ACTION', 'port_vlan_mapping_MATCH', 'port_vlan_mapping_ACTION', 'ipsg_MATCH', 'ipsg_ACTION', 'native_packet_over_fabric_ACTION', 'mpls_ACTION', 'tunnel_MATCH', 'tunnel_lookup_miss_ACTION', 'ingress_l4_src_port_MATCH', 'ingress_l4_src_port_ACTION', 'ipv6_acl_MATCH', 'ipv6_acl_ACTION', 'ipv6_racl_ACTION', 'fwd_result_MATCH', 'fwd_result_ACTION', 'nexthop_MATCH', 'nexthop_ACTION', 'lag_group_MATCH', 'lag_group_ACTION', 'fabric_lag_MATCH', 'fabric_lag_ACTION']
 18 | Critical path length = 203 cycles
 19 | Upper bound on throughput =  0.06666666666666667
 20 | ***************************** Scheduling PRMT fine *****************************
 21 | *************************** Running greedy heuristic ***************************
 22 | ****************************** Running ILP solver ******************************
 23 | Number of pipeline stages: 18.000000
 24 | *********************************** Schedule************************************
 25 | |                t=0                |                t=1                |                t=2                |                t=3                |
 26 | |        int_terminate_MATCH        |       int_terminate_ACTION        |     ipsg_permit_special_MATCH     |    ipsg_permit_special_ACTION     |
 27 | |    ingress_port_mapping_MATCH     |    ingress_port_mapping_ACTION    |    switch_config_params_MATCH     |     port_vlan_mapping_ACTION      |
 28 | |                                   |           _condition_8            |         int_source_MATCH          |           _condition_7            |
 29 | |                                   |                                   |      port_vlan_mapping_MATCH      |           _condition_9            |
 30 | |                                   |                                   |                                   |    switch_config_params_ACTION    |
 31 | |                                   |                                   |                                   |         int_source_ACTION         |
 32 | 
 33 | |                t=4                |                t=5                |                t=6                |                t=7                |
 34 | |            ipsg_MATCH             |   fabric_ingress_dst_lkp_ACTION   |         outer_rmac_MATCH          | native_packet_over_fabric_ACTION  |
 35 | |        sflow_ingress_MATCH        |       sflow_ingress_ACTION        |   ingress_port_properties_MATCH   |           _condition_16           |
 36 | | validate_outer_ipv4_packet_MATCH  |           _condition_1            |    outer_ipv4_multicast_MATCH     |  ingress_port_properties_ACTION   |
 37 | |   validate_outer_ethernet_MATCH   |           _condition_0            |  native_packet_over_fabric_MATCH  |           _condition_10           |
 38 | |   fabric_ingress_dst_lkp_MATCH    | validate_outer_ipv4_packet_ACTION |    validate_mpls_packet_MATCH     |           _condition_12           |
 39 | |                                   |           _condition_2            |        spanning_tree_MATCH        |           _condition_11           |
 40 | |                                   |           _condition_4            |                                   |       spanning_tree_ACTION        |
 41 | |                                   |           _condition_3            |                                   |           _condition_14           |
 42 | |                                   |  validate_outer_ethernet_ACTION   |                                   |         outer_rmac_ACTION         |
 43 | |                                   |            ipsg_ACTION            |                                   |           _condition_15           |
 44 | |                                   |                                   |                                   |           _condition_13           |
 45 | |                                   |                                   |                                   |    validate_mpls_packet_ACTION    |
 46 | |                                   |                                   |                                   |    outer_ipv4_multicast_ACTION    |
 47 | |                                   |                                   |                                   |           _condition_18           |
 48 | |                                   |                                   |                                   |           _condition_17           |
 49 | 
 50 | |                t=8                |                t=9                |               t=10                |               t=11                |
 51 | |    outer_ipv6_multicast_MATCH     | validate_outer_ipv6_packet_ACTION |       ipv6_dest_vtep_MATCH        |           _condition_6            |
 52 | | validate_outer_ipv6_packet_MATCH  |       ipv6_src_vtep_ACTION        | outer_ipv6_multicast_star_g_MATCH |outer_ipv6_multicast_star_g_ACTION |
 53 | |        ipv6_src_vtep_MATCH        |           _condition_53           |       ipv4_dest_vtep_MATCH        |       ipv6_dest_vtep_ACTION       |
 54 | |    sflow_ing_take_sample_MATCH    |           _condition_20           |        ipv4_src_vtep_MATCH        |            mpls_ACTION            |
 55 | |                                   |           _condition_52           |            mpls_MATCH             |           _condition_5            |
 56 | |                                   |   sflow_ing_take_sample_ACTION    | outer_ipv4_multicast_star_g_MATCH |       ipv4_dest_vtep_ACTION       |
 57 | |                                   |    outer_ipv6_multicast_ACTION    |                                   |       ipv4_src_vtep_ACTION        |
 58 | |                                   |           _condition_21           |                                   |outer_ipv4_multicast_star_g_ACTION |
 59 | 
 60 | |               t=12                |               t=13                |               t=14                |               t=15                |
 61 | |     tunnel_lookup_miss_MATCH      |     tunnel_lookup_miss_ACTION     |ipv4_multicast_bridge_star_g_MATCH |          ipv4_fib_ACTION          |
 62 | |           tunnel_MATCH            |           tunnel_ACTION           |          ipv4_fib_MATCH           |           _condition_28           |
 63 | |      adjust_lkp_fields_MATCH      |     adjust_lkp_fields_ACTION      |    ingress_qos_map_dscp_MATCH     |    ingress_l4_dst_port_ACTION     |
 64 | |                                   |           _condition_19           |     ingress_l4_dst_port_MATCH     |           _condition_24           |
 65 | |                                   |                                   |     ingress_l4_src_port_MATCH     |ipv4_multicast_bridge_star_g_ACTION|
 66 | |                                   |                                   |    ipv4_multicast_route_MATCH     |           _condition_33           |
 67 | |                                   |                                   |            rmac_MATCH             |           _condition_39           |
 68 | |                                   |                                   |    ipv4_multicast_bridge_MATCH    |    ipv4_multicast_route_ACTION    |
 69 | |                                   |                                   |                                   |           _condition_34           |
 70 | |                                   |                                   |                                   |   ipv4_multicast_bridge_ACTION    |
 71 | |                                   |                                   |                                   |           _condition_37           |
 72 | |                                   |                                   |                                   |    ingress_qos_map_dscp_ACTION    |
 73 | |                                   |                                   |                                   |           _condition_26           |
 74 | |                                   |                                   |                                   |           _condition_23           |
 75 | |                                   |                                   |                                   |           _condition_31           |
 76 | |                                   |                                   |                                   |           _condition_38           |
 77 | |                                   |                                   |                                   |           _condition_32           |
 78 | |                                   |                                   |                                   |    ingress_l4_src_port_ACTION     |
 79 | |                                   |                                   |                                   |           _condition_40           |
 80 | |                                   |                                   |                                   |            rmac_ACTION            |
 81 | |                                   |                                   |                                   |           _condition_22           |
 82 | 
 83 | |               t=16                |               t=17                |               t=18                |               t=19                |
 84 | |           nat_dst_MATCH           |          nat_dst_ACTION           |    ipv6_multicast_bridge_MATCH    |           _condition_41           |
 85 | |     ingress_qos_map_pcp_MATCH     |        ipv6_fib_lpm_ACTION        |        storm_control_MATCH        |   ipv6_multicast_bridge_ACTION    |
 86 | |          nat_twice_MATCH          |           _condition_44           |           nat_src_MATCH           |          nat_flow_ACTION          |
 87 | |          ipv6_fib_MATCH           |           _condition_29           |          nat_flow_MATCH           |       storm_control_ACTION        |
 88 | |        ipv6_fib_lpm_MATCH         |           _condition_35           |                                   |          nat_src_ACTION           |
 89 | |                                   |    ingress_qos_map_pcp_ACTION     |                                   |                                   |
 90 | |                                   |          ipv6_fib_ACTION          |                                   |                                   |
 91 | |                                   |         nat_twice_ACTION          |                                   |                                   |
 92 | 
 93 | |               t=20                |               t=21                |               t=22                |               t=23                |
 94 | | ipv4_multicast_route_star_g_MATCH |           _condition_45           |    compute_non_ip_hashes_MATCH    |            dmac_ACTION            |
 95 | |          ipv6_acl_MATCH           |           _condition_30           |     compute_ipv6_hashes_MATCH     |           ip_acl_ACTION           |
 96 | |       validate_packet_MATCH       |ipv4_multicast_route_star_g_ACTION |           ip_acl_MATCH            |   compute_non_ip_hashes_ACTION    |
 97 | |                                   |           _condition_25           |ipv6_multicast_bridge_star_g_MATCH |ipv6_multicast_bridge_star_g_ACTION|
 98 | |                                   |      validate_packet_ACTION       |            dmac_MATCH             |           _condition_43           |
 99 | |                                   |          ipv6_acl_ACTION          |                                   |    compute_ipv6_hashes_ACTION     |
100 | 
101 | |               t=24                |               t=25                |               t=26                |               t=27                |
102 | |     compute_ipv4_hashes_MATCH     |    ipv6_multicast_route_ACTION    | ipv6_multicast_route_star_g_MATCH |ipv6_multicast_route_star_g_ACTION |
103 | |    ipv6_multicast_route_MATCH     |           _condition_27           |          ipv6_racl_MATCH          |         ipv6_racl_ACTION          |
104 | |           mac_acl_MATCH           |        ipv4_fib_lpm_ACTION        |          ipv4_racl_MATCH          |         ipv4_racl_ACTION          |
105 | |        ipv4_fib_lpm_MATCH         |    compute_ipv4_hashes_ACTION     |                                   |                                   |
106 | |                                   |          mac_acl_ACTION           |                                   |                                   |
107 | |                                   |           _condition_36           |                                   |                                   |
108 | 
109 | |               t=28                |               t=29                |               t=30                |               t=31                |
110 | |    compute_other_hashes_MATCH     |         ipv4_urpf_ACTION          |           nexthop_MATCH           |           _condition_49           |
111 | |            smac_MATCH             |       ipv4_urpf_lpm_ACTION        |         ecmp_group_MATCH          |          nexthop_ACTION           |
112 | |         meter_index_MATCH         |      ingress_bd_stats_ACTION      |          ipv6_urpf_MATCH          |         ipv6_urpf_ACTION          |
113 | |         fwd_result_MATCH          |           _condition_46           |        ipv6_urpf_lpm_MATCH        |       ipv6_urpf_lpm_ACTION        |
114 | |          ipv4_urpf_MATCH          |         acl_stats_ACTION          |                                   |           _condition_54           |
115 | |   fabric_ingress_src_lkp_MATCH    |    compute_other_hashes_ACTION    |                                   |         ecmp_group_ACTION         |
116 | |    int_sink_update_outer_MATCH    |   int_sink_update_outer_ACTION    |                                   |                                   |
117 | |        ipv4_urpf_lpm_MATCH        |           _condition_47           |                                   |                                   |
118 | |                                   |           _condition_48           |                                   |                                   |
119 | |                                   |        meter_index_ACTION         |                                   |                                   |
120 | |                                   |            smac_ACTION            |                                   |                                   |
121 | |                                   |         fwd_result_ACTION         |                                   |                                   |
122 | |                                   |   fabric_ingress_src_lkp_ACTION   |                                   |                                   |
123 | 
124 | |               t=32                |               t=33                |               t=34                |               t=35                |
125 | |          bd_flood_MATCH           |           _condition_50           |     storm_control_stats_MATCH     |         system_acl_ACTION         |
126 | |        traffic_class_MATCH        |       traffic_class_ACTION        |        meter_action_MATCH         |         drop_stats_ACTION         |
127 | |          lag_group_MATCH          |           _condition_42           |         system_acl_MATCH          |    storm_control_stats_ACTION     |
128 | |           urpf_bd_MATCH           |          urpf_bd_ACTION           |        learn_notify_MATCH         |           _condition_51           |
129 | |                                   |         lag_group_ACTION          |         fabric_lag_MATCH          |        learn_notify_ACTION        |
130 | |                                   |          bd_flood_ACTION          |                                   |         fabric_lag_ACTION         |
131 | |                                   |                                   |                                   |        meter_action_ACTION        |
132 | 
133 |  
134 | 
135 | 
136 | Match units usage (max = 8 units) on one processor
137 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |t=10|t=11|t=12|t=13|t=14|t=15|
138 | | 2  | 0  | 5  | 0  | 8  | 0  | 7  | 0  | 8  | 0  | 8  | 0  | 3  | 0  | 8  | 0  |
139 | 
140 | |t=16|t=17|t=18|t=19|t=20|t=21|t=22|t=23|t=24|t=25|t=26|t=27|t=28|t=29|t=30|t=31|
141 | | 8  | 0  | 8  | 0  | 8  | 0  | 7  | 0  | 8  | 0  | 8  | 0  | 8  | 0  | 6  | 0  |
142 | 
143 | |t=32|t=33|t=34|t=35|
144 | | 4  | 0  | 6  | 0  |
145 | 
146 | 
147 | Action fields usage (max = 32 fields) on one processor
148 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |t=10|t=11|t=12|t=13|t=14|t=15|
149 | | 0  | 32 | 0  | 31 | 0  | 23 | 0  | 31 | 0  | 14 | 0  | 25 | 0  | 31 | 0  | 29 |
150 | 
151 | |t=16|t=17|t=18|t=19|t=20|t=21|t=22|t=23|t=24|t=25|t=26|t=27|t=28|t=29|t=30|t=31|
152 | | 0  | 19 | 0  | 10 | 0  | 20 | 0  | 19 | 0  | 21 | 0  | 20 | 0  | 25 | 0  | 17 |
153 | 
154 | |t=32|t=33|t=34|t=35|
155 | | 0  | 8  | 0  | 12 |
156 | 
157 | 
158 | Match packets (max = 1 match packets) on one processor
159 | empty dictionary
160 | Action packets (max = 1 action packets) on one processor
161 | empty dictionary
162 | 


--------------------------------------------------------------------------------
/experiment_results/prmt_coarse_switch_ingress_subset.txt:
--------------------------------------------------------------------------------
  1 | ********************************** Input DAG ***********************************
  2 | # of nodes =  146
  3 | # of edges =  421
  4 | # of matches =  53
  5 | # of actions =  93
  6 | Match unit size =  80
  7 | # of match units =  62
  8 | match_unit_limit =  8
  9 | max size of match key in program =  153
 10 | max size of match key in hw =  640
 11 | # of action fields =  226
 12 | action_fields_limit =  32
 13 | max number of action fields in program =  21
 14 | max number of action fields in hw =  32
 15 | match_proc_limit = 1
 16 | action_proc_limit = 1
 17 | Critical path:  ['ingress_port_mapping_MATCH', 'ingress_port_mapping_ACTION', 'port_vlan_mapping_MATCH', 'port_vlan_mapping_ACTION', 'ipsg_MATCH', 'ipsg_ACTION', 'native_packet_over_fabric_ACTION', 'ingress_l4_src_port_MATCH', 'ingress_l4_src_port_ACTION', 'ip_acl_MATCH', 'ip_acl_ACTION', 'ipv4_racl_ACTION', 'fwd_result_MATCH', 'fwd_result_ACTION', 'nexthop_MATCH', 'nexthop_ACTION', 'lag_group_MATCH', 'lag_group_ACTION', 'fabric_lag_MATCH', 'fabric_lag_ACTION']
 18 | Critical path length = 181 cycles
 19 | Upper bound on throughput =  0.12903225806451613
 20 | ***************************** Scheduling PRMT fine *****************************
 21 | *************************** Running greedy heuristic ***************************
 22 | ****************************** Running ILP solver ******************************
 23 | Number of pipeline stages: 12.000000
 24 | *********************************** Schedule************************************
 25 | |                t=0                |                t=1                |                t=2                |                t=3                |
 26 | |   validate_outer_ethernet_MATCH   |     adjust_lkp_fields_ACTION      |    switch_config_params_MATCH     |     port_vlan_mapping_ACTION      |
 27 | | validate_outer_ipv4_packet_MATCH  |           _condition_0            |      port_vlan_mapping_MATCH      |           _condition_33           |
 28 | |   ingress_port_properties_MATCH   |  validate_outer_ethernet_ACTION   |    ingress_qos_map_dscp_MATCH     |    ingress_qos_map_dscp_ACTION    |
 29 | |      adjust_lkp_fields_MATCH      |           _condition_3            |                                   |           _condition_4            |
 30 | |    ingress_port_mapping_MATCH     |           _condition_32           |                                   |    switch_config_params_ACTION    |
 31 | |                                   |  ingress_port_properties_ACTION   |                                   |                                   |
 32 | |                                   | validate_outer_ipv4_packet_ACTION |                                   |                                   |
 33 | |                                   |           _condition_30           |                                   |                                   |
 34 | |                                   |    ingress_port_mapping_ACTION    |                                   |                                   |
 35 | 
 36 | |                t=4                |                t=5                |                t=6                |                t=7                |
 37 | |   fabric_ingress_dst_lkp_MATCH    |           _condition_5            |        storm_control_MATCH        |           _condition_9            |
 38 | |     ingress_qos_map_pcp_MATCH     |           _condition_34           |     ipsg_permit_special_MATCH     | native_packet_over_fabric_ACTION  |
 39 | |                                   |           _condition_18           |            ipsg_MATCH             |           _condition_11           |
 40 | |                                   |           _condition_12           |        spanning_tree_MATCH        |    ipsg_permit_special_ACTION     |
 41 | |                                   |           _condition_39           |   fabric_ingress_src_lkp_MATCH    |   fabric_ingress_src_lkp_ACTION   |
 42 | |                                   |           _condition_16           |  native_packet_over_fabric_MATCH  |           _condition_31           |
 43 | |                                   |           _condition_13           |                                   |            ipsg_ACTION            |
 44 | |                                   |           _condition_8            |                                   |           _condition_6            |
 45 | |                                   |           _condition_37           |                                   |       storm_control_ACTION        |
 46 | |                                   |           _condition_38           |                                   |           _condition_10           |
 47 | |                                   |           _condition_15           |                                   |           _condition_2            |
 48 | |                                   |           _condition_19           |                                   |       spanning_tree_ACTION        |
 49 | |                                   |   fabric_ingress_dst_lkp_ACTION   |                                   |                                   |
 50 | |                                   |    ingress_qos_map_pcp_ACTION     |                                   |                                   |
 51 | |                                   |           _condition_7            |                                   |                                   |
 52 | |                                   |           _condition_17           |                                   |                                   |
 53 | |                                   |           _condition_14           |                                   |                                   |
 54 | 
 55 | |                t=8                |                t=9                |               t=10                |               t=11                |
 56 | |          nat_twice_MATCH          |           _condition_23           |           mac_acl_MATCH           |   compute_non_ip_hashes_ACTION    |
 57 | |     ingress_l4_src_port_MATCH     |           _condition_26           |    compute_non_ip_hashes_MATCH    |          mac_acl_ACTION           |
 58 | |            rmac_MATCH             |           _condition_25           |           ip_acl_MATCH            |          nat_dst_ACTION           |
 59 | |       validate_packet_MATCH       |    ingress_l4_dst_port_ACTION     |    ipv4_multicast_route_MATCH     |      ingress_bd_stats_ACTION      |
 60 | |     ingress_l4_dst_port_MATCH     |   ipv4_multicast_bridge_ACTION    |     compute_ipv4_hashes_MATCH     |    ipv4_multicast_route_ACTION    |
 61 | |    ipv4_multicast_bridge_MATCH    |           _condition_22           |           nat_dst_MATCH           |           ip_acl_ACTION           |
 62 | |                                   |           _condition_27           |                                   |    compute_ipv4_hashes_ACTION     |
 63 | |                                   |         nat_twice_ACTION          |                                   |                                   |
 64 | |                                   |           _condition_21           |                                   |                                   |
 65 | |                                   |      validate_packet_ACTION       |                                   |                                   |
 66 | |                                   |            rmac_ACTION            |                                   |                                   |
 67 | |                                   |    ingress_l4_src_port_ACTION     |                                   |                                   |
 68 | 
 69 | |               t=12                |               t=13                |               t=14                |               t=15                |
 70 | |            smac_MATCH             |         ipv4_racl_ACTION          |            dmac_MATCH             |        learn_notify_ACTION        |
 71 | |          nat_flow_MATCH           |          nat_src_ACTION           |          ipv4_fib_MATCH           |ipv4_multicast_route_star_g_ACTION |
 72 | |    compute_other_hashes_MATCH     |    compute_other_hashes_ACTION    |        ipv4_fib_lpm_MATCH         |         acl_stats_ACTION          |
 73 | |           nat_src_MATCH           |          nat_flow_ACTION          | ipv4_multicast_route_star_g_MATCH |            dmac_ACTION            |
 74 | |          ipv4_racl_MATCH          |            smac_ACTION            |ipv4_multicast_bridge_star_g_MATCH |ipv4_multicast_bridge_star_g_ACTION|
 75 | |                                   |                                   |        learn_notify_MATCH         |        meter_index_ACTION         |
 76 | |                                   |                                   |         meter_index_MATCH         |          ipv4_fib_ACTION          |
 77 | |                                   |                                   |                                   |        ipv4_fib_lpm_ACTION        |
 78 | 
 79 | |               t=16                |               t=17                |               t=18                |               t=19                |
 80 | |        traffic_class_MATCH        |       traffic_class_ACTION        |           urpf_bd_MATCH           |           _condition_35           |
 81 | |          ipv4_urpf_MATCH          |    storm_control_stats_ACTION     |           nexthop_MATCH           |         drop_stats_ACTION         |
 82 | |     storm_control_stats_MATCH     |        meter_action_ACTION        |         ecmp_group_MATCH          |           _condition_40           |
 83 | |        ipv4_urpf_lpm_MATCH        |         fwd_result_ACTION         |                                   |          urpf_bd_ACTION           |
 84 | |         fwd_result_MATCH          |         ipv4_urpf_ACTION          |                                   |         ecmp_group_ACTION         |
 85 | |        meter_action_MATCH         |       ipv4_urpf_lpm_ACTION        |                                   |           _condition_29           |
 86 | |                                   |                                   |                                   |          nexthop_ACTION           |
 87 | 
 88 | |               t=20                |               t=21                |               t=22                |               t=23                |
 89 | |          bd_flood_MATCH           |         lag_group_ACTION          |         system_acl_MATCH          |         system_acl_ACTION         |
 90 | |          lag_group_MATCH          |          bd_flood_ACTION          |         fabric_lag_MATCH          |         fabric_lag_ACTION         |
 91 | |                                   |           _condition_36           |                                   |                                   |
 92 | 
 93 |  
 94 | 
 95 | 
 96 | Match units usage (max = 8 units) on one processor
 97 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |t=10|t=11|t=12|t=13|t=14|t=15|
 98 | | 6  | 0  | 3  | 0  | 2  | 0  | 7  | 0  | 8  | 0  | 8  | 0  | 7  | 0  | 7  | 0  |
 99 | 
100 | |t=16|t=17|t=18|t=19|t=20|t=21|t=22|t=23|
101 | | 6  | 0  | 3  | 0  | 2  | 0  | 3  | 0  |
102 | 
103 | 
104 | Action fields usage (max = 32 fields) on one processor
105 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |t=10|t=11|t=12|t=13|t=14|t=15|
106 | | 0  | 27 | 0  | 30 | 0  | 27 | 0  | 17 | 0  | 18 | 0  | 32 | 0  | 17 | 0  | 17 |
107 | 
108 | |t=16|t=17|t=18|t=19|t=20|t=21|t=22|t=23|
109 | | 0  | 15 | 0  | 14 | 0  | 4  | 0  | 8  |
110 | 
111 | 
112 | Match packets (max = 1 match packets) on one processor
113 | empty dictionary
114 | Action packets (max = 1 action packets) on one processor
115 | empty dictionary
116 | 


--------------------------------------------------------------------------------
/experiment_results/prmt_fine_switch_combined_subset.txt:
--------------------------------------------------------------------------------
  1 | ********************************** Input DAG ***********************************
  2 | # of nodes =  192
  3 | # of edges =  508
  4 | # of matches =  69
  5 | # of actions =  123
  6 | Match unit size =  80
  7 | # of match units =  78
  8 | match_unit_limit =  8
  9 | max size of match key in program =  153
 10 | max size of match key in hw =  640
 11 | # of action fields =  291
 12 | action_fields_limit =  32
 13 | max number of action fields in program =  21
 14 | max number of action fields in hw =  32
 15 | match_proc_limit = 1
 16 | action_proc_limit = 1
 17 | Critical path:  ['ing_ingress_port_mapping_MATCH', 'ing_ingress_port_mapping_ACTION', 'ing_port_vlan_mapping_MATCH', 'ing_port_vlan_mapping_ACTION', 'ing_ipsg_MATCH', 'ing_ipsg_ACTION', 'ing_native_packet_over_fabric_ACTION', 'ing_ingress_l4_src_port_MATCH', 'ing_ingress_l4_src_port_ACTION', 'ing_ip_acl_MATCH', 'ing_ip_acl_ACTION', 'ing_ipv4_racl_ACTION', 'ing_fwd_result_MATCH', 'ing_fwd_result_ACTION', 'ing_nexthop_MATCH', 'ing_nexthop_ACTION', 'ing_lag_group_MATCH', 'ing_lag_group_ACTION', 'ing_fabric_lag_MATCH', 'ing_fabric_lag_ACTION']
 18 | Critical path length = 181 cycles
 19 | Upper bound on throughput =  0.10256410256410256
 20 | ***************************** Scheduling PRMT fine *****************************
 21 | *************************** Running greedy heuristic ***************************
 22 | ****************************** Running ILP solver ******************************
 23 | Number of pipeline stages: 12.000000
 24 | *********************************** Schedule************************************
 25 | |                  t=0                  |                  t=1                  |                  t=2                  |                  t=3                  |
 26 | |   ing_validate_outer_ethernet_MATCH   |    ing_ingress_port_mapping_ACTION    |    ing_switch_config_params_MATCH     |        egr_replica_type_ACTION        |
 27 | |     egr_egress_port_mapping_MATCH     |           _condition_ing_0            |      ing_adjust_lkp_fields_MATCH      |           _condition_ing_6            |
 28 | |    ing_ingress_port_mapping_MATCH     |           egr_mirror_ACTION           |         egr_egress_nat_MATCH          |    ing_switch_config_params_ACTION    |
 29 | | ing_validate_outer_ipv4_packet_MATCH  |           _condition_egr_41           |      ing_port_vlan_mapping_MATCH      |    egr_egress_port_mapping_ACTION     |
 30 | |             egr_rid_MATCH             |           _condition_egr_43           |           egr_rewrite_MATCH           |     ing_port_vlan_mapping_ACTION      |
 31 | |           egr_mirror_MATCH            |           _condition_egr_46           |        egr_replica_type_MATCH         |                                       |
 32 | |   ing_ingress_port_properties_MATCH   |           _condition_ing_3            |        ing_storm_control_MATCH        |                                       |
 33 | |                                       |           _condition_egr_44           |         egr_l3_rewrite_MATCH          |                                       |
 34 | |                                       |           _condition_egr_42           |                                       |                                       |
 35 | |                                       |            egr_rid_ACTION             |                                       |                                       |
 36 | |                                       |           _condition_ing_32           |                                       |                                       |
 37 | |                                       |  ing_ingress_port_properties_ACTION   |                                       |                                       |
 38 | |                                       | ing_validate_outer_ipv4_packet_ACTION |                                       |                                       |
 39 | |                                       |  ing_validate_outer_ethernet_ACTION   |                                       |                                       |
 40 | 
 41 | |                  t=4                  |                  t=5                  |                  t=6                  |                  t=7                  |
 42 | |   ing_fabric_ingress_dst_lkp_MATCH    |     ing_adjust_lkp_fields_ACTION      |             egr_mtu_MATCH             |       egr_egress_bd_map_ACTION        |
 43 | |       egr_egress_qos_map_MATCH        |   ing_fabric_ingress_dst_lkp_ACTION   |      egr_egress_vlan_xlate_MATCH      |    ing_ipsg_permit_special_ACTION     |
 44 | |  ing_native_packet_over_fabric_MATCH  |           _condition_ing_19           |        egr_egress_bd_map_MATCH        |           _condition_ing_31           |
 45 | |    ing_ingress_qos_map_dscp_MATCH     |           _condition_egr_45           |            ing_ipsg_MATCH             |           _condition_ing_37           |
 46 | |         egr_vlan_decap_MATCH          |           _condition_ing_13           |       egr_egress_bd_stats_MATCH       |           _condition_ing_10           |
 47 | |     ing_ingress_qos_map_pcp_MATCH     |           _condition_ing_15           |        ing_spanning_tree_MATCH        |       egr_egress_filter_ACTION        |
 48 | |                                       |           _condition_ing_12           |     ing_ipsg_permit_special_MATCH     | ing_native_packet_over_fabric_ACTION  |
 49 | |                                       |           _condition_ing_18           |                                       |         egr_vlan_decap_ACTION         |
 50 | |                                       |          egr_rewrite_ACTION           |                                       |           _condition_ing_8            |
 51 | |                                       |           _condition_ing_7            |                                       |    ing_ingress_qos_map_dscp_ACTION    |
 52 | |                                       |           _condition_ing_16           |                                       |    ing_ingress_qos_map_pcp_ACTION     |
 53 | |                                       |                                       |                                       |           _condition_egr_50           |
 54 | |                                       |                                       |                                       |       ing_spanning_tree_ACTION        |
 55 | |                                       |                                       |                                       |           _condition_ing_9            |
 56 | |                                       |                                       |                                       |           _condition_ing_5            |
 57 | |                                       |                                       |                                       |           _condition_ing_2            |
 58 | |                                       |                                       |                                       |            ing_ipsg_ACTION            |
 59 | |                                       |                                       |                                       |           _condition_ing_33           |
 60 | |                                       |                                       |                                       |           _condition_ing_4            |
 61 | 
 62 | |                  t=8                  |                  t=9                  |                 t=10                  |                 t=11                  |
 63 | |     ing_ingress_l4_dst_port_MATCH     |           _condition_egr_51           |           ing_mac_acl_MATCH           |           _condition_ing_14           |
 64 | |     ing_ingress_l4_src_port_MATCH     |           _condition_ing_30           |    ing_compute_non_ip_hashes_MATCH    |          ing_ipv4_fib_ACTION          |
 65 | |        egr_smac_rewrite_MATCH         |           _condition_ing_22           |ing_ipv4_multicast_bridge_star_g_MATCH |           ing_ip_acl_ACTION           |
 66 | |          ing_ipv4_fib_MATCH           |           _condition_ing_21           |           ing_ip_acl_MATCH            |   ing_ipv4_multicast_bridge_ACTION    |
 67 | |       ing_validate_packet_MATCH       |           _condition_ing_26           |        ing_ipv4_fib_lpm_MATCH         |          ing_mac_acl_ACTION           |
 68 | |            ing_rmac_MATCH             |            ing_rmac_ACTION            |           ing_nat_dst_MATCH           |      egr_egress_bd_stats_ACTION       |
 69 | |    ing_ipv4_multicast_bridge_MATCH    |           _condition_ing_25           |                                       |ing_ipv4_multicast_bridge_star_g_ACTION|
 70 | |                                       |           _condition_ing_27           |                                       |                                       |
 71 | |                                       |        egr_smac_rewrite_ACTION        |                                       |                                       |
 72 | |                                       |           _condition_egr_48           |                                       |                                       |
 73 | |                                       |    ing_ingress_l4_dst_port_ACTION     |                                       |                                       |
 74 | |                                       |       ing_storm_control_ACTION        |                                       |                                       |
 75 | |                                       |            egr_mtu_ACTION             |                                       |                                       |
 76 | |                                       |           _condition_ing_17           |                                       |                                       |
 77 | |                                       |           _condition_ing_34           |                                       |                                       |
 78 | |                                       |           _condition_egr_47           |                                       |                                       |
 79 | |                                       |      ing_validate_packet_ACTION       |                                       |                                       |
 80 | |                                       |     egr_egress_filter_drop_ACTION     |                                       |                                       |
 81 | |                                       |           _condition_ing_23           |                                       |                                       |
 82 | |                                       |    ing_ingress_l4_src_port_ACTION     |                                       |                                       |
 83 | |                                       |           _condition_ing_11           |                                       |                                       |
 84 | 
 85 | |                 t=12                  |                 t=13                  |                 t=14                  |                 t=15                  |
 86 | |          ing_nat_twice_MATCH          |        ing_ipv4_fib_lpm_ACTION        |          ing_nat_flow_MATCH           |     egr_egress_vlan_xlate_ACTION      |
 87 | |    ing_ipv4_multicast_route_MATCH     |          ing_nat_dst_ACTION           |          ing_ipv4_urpf_MATCH          |         ing_ipv4_urpf_ACTION          |
 88 | |     ing_compute_ipv4_hashes_MATCH     |           _condition_egr_49           |            ing_smac_MATCH             |           _condition_ing_38           |
 89 | |           ing_nat_src_MATCH           |         ing_nat_twice_ACTION          |        ing_traffic_class_MATCH        |       ing_traffic_class_ACTION        |
 90 | |            ing_dmac_MATCH             |    ing_compute_ipv4_hashes_ACTION     |    ing_compute_other_hashes_MATCH     |       egr_egress_qos_map_ACTION       |
 91 | |          ing_ipv4_racl_MATCH          |         ing_ipv4_racl_ACTION          |         ing_meter_index_MATCH         |    ing_compute_other_hashes_ACTION    |
 92 | |                                       |    ing_ipv4_multicast_route_ACTION    | ing_ipv4_multicast_route_star_g_MATCH |          ing_nat_flow_ACTION          |
 93 | |                                       |   ing_compute_non_ip_hashes_ACTION    |                                       |         ing_acl_stats_ACTION          |
 94 | |                                       |                                       |                                       |        ing_meter_index_ACTION         |
 95 | |                                       |                                       |                                       |           _condition_ing_39           |
 96 | |                                       |                                       |                                       |            ing_smac_ACTION            |
 97 | |                                       |                                       |                                       |            ing_dmac_ACTION            |
 98 | |                                       |                                       |                                       |ing_ipv4_multicast_route_star_g_ACTION |
 99 | 
100 | |                 t=16                  |                 t=17                  |                 t=18                  |                 t=19                  |
101 | |      egr_egress_system_acl_MATCH      |        ing_learn_notify_ACTION        |         ing_ecmp_group_MATCH          |           _condition_ing_29           |
102 | |        ing_ipv4_urpf_lpm_MATCH        |       ing_ipv4_urpf_lpm_ACTION        |           ing_urpf_bd_MATCH           |           _condition_egr_52           |
103 | |        ing_learn_notify_MATCH         |         ing_fwd_result_ACTION         |          ing_bd_flood_MATCH           |     egr_egress_system_acl_ACTION      |
104 | |         ing_fwd_result_MATCH          |        ing_meter_action_ACTION        |           ing_nexthop_MATCH           |          ing_nexthop_ACTION           |
105 | |        ing_meter_action_MATCH         |   ing_fabric_ingress_src_lkp_ACTION   |                                       |           _condition_ing_35           |
106 | |   ing_fabric_ingress_src_lkp_MATCH    |                                       |                                       |           _condition_ing_40           |
107 | |                                       |                                       |                                       |         ing_ecmp_group_ACTION         |
108 | |                                       |                                       |                                       |         ing_drop_stats_ACTION         |
109 | |                                       |                                       |                                       |          ing_urpf_bd_ACTION           |
110 | 
111 | |                 t=20                  |                 t=21                  |                 t=22                  |                 t=23                  |
112 | |      egr_rewrite_multicast_MATCH      |           _condition_ing_36           |         ing_fabric_lag_MATCH          |         egr_egress_nat_ACTION         |
113 | |         ing_system_acl_MATCH          |          ing_bd_flood_ACTION          |                                       |    ing_storm_control_stats_ACTION     |
114 | |     ing_storm_control_stats_MATCH     |     egr_rewrite_multicast_ACTION      |                                       |         ing_system_acl_ACTION         |
115 | |          ing_lag_group_MATCH          |          ing_nat_src_ACTION           |                                       |         ing_fabric_lag_ACTION         |
116 | |                                       |         ing_lag_group_ACTION          |                                       |         egr_l3_rewrite_ACTION         |
117 | |                                       |                                       |                                       |      ing_ingress_bd_stats_ACTION      |
118 | 
119 |  
120 | 
121 | 
122 | Match units usage (max = 8 units) on one processor
123 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |t=10|t=11|t=12|t=13|t=14|t=15|
124 | | 8  | 0  | 8  | 0  | 6  | 0  | 8  | 0  | 8  | 0  | 8  | 0  | 8  | 0  | 8  | 0  |
125 | 
126 | |t=16|t=17|t=18|t=19|t=20|t=21|t=22|t=23|
127 | | 6  | 0  | 4  | 0  | 5  | 0  | 1  | 0  |
128 | 
129 | 
130 | Action fields usage (max = 32 fields) on one processor
131 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |t=10|t=11|t=12|t=13|t=14|t=15|
132 | | 0  | 32 | 0  | 32 | 0  | 32 | 0  | 32 | 0  | 24 | 0  | 28 | 0  | 27 | 0  | 31 |
133 | 
134 | |t=16|t=17|t=18|t=19|t=20|t=21|t=22|t=23|
135 | | 0  | 11 | 0  | 18 | 0  | 6  | 0  | 18 |
136 | 
137 | 
138 | Match packets (max = 1 match packets) on one processor
139 | empty dictionary
140 | Action packets (max = 1 action packets) on one processor
141 | empty dictionary
142 | 


--------------------------------------------------------------------------------
/experiment_results/prmt_fine_switch_egress.txt:
--------------------------------------------------------------------------------
 1 | ********************************** Input DAG ***********************************
 2 | # of nodes =  104
 3 | # of edges =  291
 4 | # of matches =  41
 5 | # of actions =  63
 6 | Match unit size =  80
 7 | # of match units =  46
 8 | match_unit_limit =  8
 9 | max size of match key in program =  312
10 | max size of match key in hw =  640
11 | # of action fields =  197
12 | action_fields_limit =  32
13 | max number of action fields in program =  25
14 | max number of action fields in hw =  32
15 | match_proc_limit = 1
16 | action_proc_limit = 1
17 | Critical path:  ['rid_MATCH', 'rid_ACTION', 'replica_type_MATCH', 'replica_type_ACTION', 'rewrite_ACTION', 'egress_bd_map_MATCH', 'egress_bd_map_ACTION', '_condition_65', 'egress_nat_ACTION', 'egress_l4port_fields_ACTION', 'egress_l4_src_port_MATCH', 'egress_l4_src_port_ACTION', 'tunnel_encap_process_outer_ACTION', 'tunnel_rewrite_MATCH', 'tunnel_rewrite_ACTION', 'tunnel_smac_rewrite_MATCH', 'tunnel_smac_rewrite_ACTION', 'egress_mac_acl_MATCH', 'egress_mac_acl_ACTION', 'egress_system_acl_MATCH', 'egress_system_acl_ACTION']
18 | Critical path length = 165 cycles
19 | Upper bound on throughput =  0.16243654822335024
20 | ***************************** Scheduling PRMT fine *****************************
21 | *************************** Running greedy heuristic ***************************
22 | ****************************** Running ILP solver ******************************
23 | Number of pipeline stages: 11.000000
24 | *********************************** Schedule************************************
25 | |               t=0               |               t=1               |               t=2               |               t=3               |
26 | |tunnel_decap_process_outer_MATCH |          _condition_55          |       replica_type_MATCH        |tunnel_decap_process_outer_ACTION|
27 | |    egress_port_mapping_MATCH    |        vlan_decap_ACTION        |          mirror_MATCH           |          _condition_72          |
28 | |            rid_MATCH            |          _condition_58          |       int_inst_0811_MATCH       |          _condition_60          |
29 | |          int_bos_MATCH          |          _condition_74          |       int_inst_0003_MATCH       |          mirror_ACTION          |
30 | |        int_insert_MATCH         |           rid_ACTION            |tunnel_decap_process_inner_MATCH |       replica_type_ACTION       |
31 | |       int_inst_0407_MATCH       |          _condition_56          |                                 |        int_insert_ACTION        |
32 | |        vlan_decap_MATCH         |          _condition_62          |                                 |                                 |
33 | |       int_inst_1215_MATCH       |          _condition_59          |                                 |                                 |
34 | |                                 |          _condition_57          |                                 |                                 |
35 | 
36 | |               t=4               |               t=5               |               t=6               |               t=7               |
37 | |     rewrite_multicast_MATCH     |      int_inst_0003_ACTION       |        egress_nat_MATCH         |  int_meta_header_update_ACTION  |
38 | |          rewrite_MATCH          |          _condition_70          |      egress_bd_stats_MATCH      |         int_bos_ACTION          |
39 | |  int_meta_header_update_MATCH   |      int_inst_0407_ACTION       |            mtu_MATCH            |      egress_qos_map_ACTION      |
40 | |        l3_rewrite_MATCH         |          _condition_64          |      egress_qos_map_MATCH       |        egress_vni_ACTION        |
41 | |                                 |         rewrite_ACTION          |        egress_vni_MATCH         |      int_inst_1215_ACTION       |
42 | |                                 |   egress_port_mapping_ACTION    |tunnel_encap_process_outer_MATCH |          _condition_63          |
43 | |                                 |          _condition_61          |     egress_vlan_xlate_MATCH     |          _condition_71          |
44 | |                                 |                                 |       egress_bd_map_MATCH       |      egress_bd_map_ACTION       |
45 | |                                 |                                 |                                 |          _condition_67          |
46 | |                                 |                                 |                                 |    rewrite_multicast_ACTION     |
47 | |                                 |                                 |                                 |tunnel_decap_process_inner_ACTION|
48 | |                                 |                                 |                                 |      int_inst_0811_ACTION       |
49 | |                                 |                                 |                                 |          _condition_66          |
50 | |                                 |                                 |                                 |           mtu_ACTION            |
51 | 
52 | |               t=8               |               t=9               |              t=10               |              t=11               |
53 | |   egress_l4port_fields_MATCH    |       smac_rewrite_ACTION       |                                 |tunnel_encap_process_inner_ACTION|
54 | |       smac_rewrite_MATCH        |        egress_nat_ACTION        |                                 |   egress_l4port_fields_ACTION   |
55 | |tunnel_encap_process_inner_MATCH |          _condition_65          |                                 |                                 |
56 | |                                 |        l3_rewrite_ACTION        |                                 |                                 |
57 | 
58 | |              t=12               |              t=13               |              t=14               |              t=15               |
59 | |    egress_l4_dst_port_MATCH     |    egress_l4_dst_port_ACTION    |        tunnel_mtu_MATCH         |          _condition_68          |
60 | |    egress_l4_src_port_MATCH     |     egress_bd_stats_ACTION      |      tunnel_rewrite_MATCH       |          _condition_69          |
61 | |                                 |tunnel_encap_process_outer_ACTION|      int_outer_encap_MATCH      |      tunnel_rewrite_ACTION      |
62 | |                                 |    egress_l4_src_port_ACTION    |                                 |        tunnel_mtu_ACTION        |
63 | |                                 |                                 |                                 |     int_outer_encap_ACTION      |
64 | 
65 | |              t=16               |              t=17               |              t=18               |              t=19               |
66 | |    tunnel_smac_rewrite_MATCH    |      egress_filter_ACTION       |      egress_mac_acl_MATCH       |    egress_filter_drop_ACTION    |
67 | |    tunnel_dmac_rewrite_MATCH    |   tunnel_dmac_rewrite_ACTION    |       egress_ip_acl_MATCH       |     egress_ipv6_acl_ACTION      |
68 | |    tunnel_dst_rewrite_MATCH     |    tunnel_src_rewrite_ACTION    |      egress_ipv6_acl_MATCH      |      egress_mac_acl_ACTION      |
69 | |    tunnel_src_rewrite_MATCH     |    tunnel_dst_rewrite_ACTION    |                                 |          _condition_73          |
70 | |                                 |   tunnel_smac_rewrite_ACTION    |                                 |      egress_ip_acl_ACTION       |
71 | |                                 |                                 |                                 |    egress_vlan_xlate_ACTION     |
72 | 
73 | |              t=20               |              t=21               |
74 | |     egress_system_acl_MATCH     |    egress_system_acl_ACTION     |
75 | 
76 |  
77 | 
78 | 
79 | Match units usage (max = 8 units) on one processor
80 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |t=10|t=11|t=12|t=13|t=14|t=15|
81 | | 8  | 0  | 5  | 0  | 4  | 0  | 8  | 0  | 3  | 0  | 0  | 0  | 2  | 0  | 3  | 0  |
82 | 
83 | |t=16|t=17|t=18|t=19|t=20|t=21|
84 | | 4  | 0  | 8  | 0  | 1  | 0  |
85 | 
86 | 
87 | Action fields usage (max = 32 fields) on one processor
88 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |t=10|t=11|t=12|t=13|t=14|t=15|
89 | | 0  | 18 | 0  | 32 | 0  | 32 | 0  | 16 | 0  | 11 | 0  | 8  | 0  | 27 | 0  | 28 |
90 | 
91 | |t=16|t=17|t=18|t=19|t=20|t=21|
92 | | 0  | 7  | 0  | 15 | 0  | 3  |
93 | 
94 | 
95 | Match packets (max = 1 match packets) on one processor
96 | empty dictionary
97 | Action packets (max = 1 action packets) on one processor
98 | empty dictionary
99 | 


--------------------------------------------------------------------------------
/experiment_results/prmt_fine_switch_egress_subset.txt:
--------------------------------------------------------------------------------
 1 | ********************************** Input DAG ***********************************
 2 | # of nodes =  46
 3 | # of edges =  87
 4 | # of matches =  16
 5 | # of actions =  30
 6 | Match unit size =  80
 7 | # of match units =  16
 8 | match_unit_limit =  8
 9 | max size of match key in program =  43
10 | max size of match key in hw =  640
11 | # of action fields =  65
12 | action_fields_limit =  32
13 | max number of action fields in program =  8
14 | max number of action fields in hw =  32
15 | match_proc_limit = 1
16 | action_proc_limit = 1
17 | Critical path:  ['rid_MATCH', 'rid_ACTION', 'replica_type_MATCH', 'replica_type_ACTION', 'rewrite_ACTION', 'egress_bd_map_MATCH', 'egress_bd_map_ACTION', 'smac_rewrite_MATCH', 'smac_rewrite_ACTION']
18 | Critical path length = 81 cycles
19 | Upper bound on throughput =  0.49230769230769234
20 | ***************************** Scheduling PRMT fine *****************************
21 | *************************** Running greedy heuristic ***************************
22 | ****************************** Running ILP solver ******************************
23 | Number of pipeline stages: 5.000000
24 | *********************************** Schedule************************************
25 | |           t=0            |           t=1            |           t=2            |           t=3            |
26 | |     vlan_decap_MATCH     |      _condition_46       |    replica_type_MATCH    |egress_port_mapping_ACTION|
27 | |       mirror_MATCH       |        rid_ACTION        |                          |   replica_type_ACTION    |
28 | |egress_port_mapping_MATCH |      mirror_ACTION       |                          |      _condition_50       |
29 | |        rid_MATCH         |      _condition_41       |                          |                          |
30 | |     egress_nat_MATCH     |      _condition_52       |                          |                          |
31 | |     l3_rewrite_MATCH     |    vlan_decap_ACTION     |                          |                          |
32 | | rewrite_multicast_MATCH  |      _condition_43       |                          |                          |
33 | |                          |      _condition_44       |                          |                          |
34 | |                          |      _condition_42       |                          |                          |
35 | 
36 | |           t=4            |           t=5            |           t=6            |           t=7            |
37 | |      rewrite_MATCH       |      rewrite_ACTION      |  egress_bd_stats_MATCH   |   egress_filter_ACTION   |
38 | |                          |      _condition_49       |        mtu_MATCH         |        mtu_ACTION        |
39 | |                          |      _condition_45       |   egress_qos_map_MATCH   |   egress_bd_map_ACTION   |
40 | |                          |                          |   egress_bd_map_MATCH    | rewrite_multicast_ACTION |
41 | |                          |                          |                          |  egress_qos_map_ACTION   |
42 | |                          |                          |                          |      _condition_47       |
43 | 
44 | |           t=8            |           t=9            |
45 | |    smac_rewrite_MATCH    |    egress_nat_ACTION     |
46 | | egress_system_acl_MATCH  |egress_filter_drop_ACTION |
47 | | egress_vlan_xlate_MATCH  |    l3_rewrite_ACTION     |
48 | |                          |      _condition_48       |
49 | |                          | egress_vlan_xlate_ACTION |
50 | |                          |   smac_rewrite_ACTION    |
51 | |                          | egress_system_acl_ACTION |
52 | |                          |  egress_bd_stats_ACTION  |
53 | |                          |      _condition_51       |
54 | 
55 |  
56 | 
57 | 
58 | Match units usage (max = 8 units) on one processor
59 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |
60 | | 7  | 0  | 1  | 0  | 1  | 0  | 4  | 0  | 3  | 0  |
61 | 
62 | 
63 | Action fields usage (max = 32 fields) on one processor
64 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |
65 | | 0  | 18 | 0  | 6  | 0  | 8  | 0  | 10 | 0  | 23 |
66 | 
67 | 
68 | Match packets (max = 1 match packets) on one processor
69 | empty dictionary
70 | Action packets (max = 1 action packets) on one processor
71 | empty dictionary
72 | 


--------------------------------------------------------------------------------
/experiment_results/prmt_fine_switch_ingress_subset.txt:
--------------------------------------------------------------------------------
  1 | ********************************** Input DAG ***********************************
  2 | # of nodes =  146
  3 | # of edges =  421
  4 | # of matches =  53
  5 | # of actions =  93
  6 | Match unit size =  80
  7 | # of match units =  62
  8 | match_unit_limit =  8
  9 | max size of match key in program =  153
 10 | max size of match key in hw =  640
 11 | # of action fields =  226
 12 | action_fields_limit =  32
 13 | max number of action fields in program =  21
 14 | max number of action fields in hw =  32
 15 | match_proc_limit = 1
 16 | action_proc_limit = 1
 17 | Critical path:  ['ingress_port_mapping_MATCH', 'ingress_port_mapping_ACTION', 'port_vlan_mapping_MATCH', 'port_vlan_mapping_ACTION', 'ipsg_MATCH', 'ipsg_ACTION', 'native_packet_over_fabric_ACTION', 'ingress_l4_src_port_MATCH', 'ingress_l4_src_port_ACTION', 'ip_acl_MATCH', 'ip_acl_ACTION', 'ipv4_racl_ACTION', 'fwd_result_MATCH', 'fwd_result_ACTION', 'nexthop_MATCH', 'nexthop_ACTION', 'lag_group_MATCH', 'lag_group_ACTION', 'fabric_lag_MATCH', 'fabric_lag_ACTION']
 18 | Critical path length = 181 cycles
 19 | Upper bound on throughput =  0.12903225806451613
 20 | ***************************** Scheduling PRMT fine *****************************
 21 | *************************** Running greedy heuristic ***************************
 22 | ****************************** Running ILP solver ******************************
 23 | Number of pipeline stages: 12.000000
 24 | *********************************** Schedule************************************
 25 | |                t=0                |                t=1                |                t=2                |                t=3                |
 26 | |   fabric_ingress_dst_lkp_MATCH    |    ingress_port_mapping_ACTION    |        storm_control_MATCH        |           _condition_6            |
 27 | |    switch_config_params_MATCH     |     adjust_lkp_fields_ACTION      |      port_vlan_mapping_MATCH      |     port_vlan_mapping_ACTION      |
 28 | |    ingress_port_mapping_MATCH     |           _condition_30           |     ingress_qos_map_pcp_MATCH     |           _condition_4            |
 29 | |   ingress_port_properties_MATCH   |           _condition_3            |     ipsg_permit_special_MATCH     |           _condition_14           |
 30 | |   validate_outer_ethernet_MATCH   |  validate_outer_ethernet_ACTION   |  native_packet_over_fabric_MATCH  |           _condition_12           |
 31 | |      adjust_lkp_fields_MATCH      |           _condition_32           |    ingress_qos_map_dscp_MATCH     |    switch_config_params_ACTION    |
 32 | | validate_outer_ipv4_packet_MATCH  |  ingress_port_properties_ACTION   |                                   |           _condition_5            |
 33 | |                                   |           _condition_0            |                                   |                                   |
 34 | |                                   | validate_outer_ipv4_packet_ACTION |                                   |                                   |
 35 | 
 36 | |                t=4                |                t=5                |                t=6                |                t=7                |
 37 | |            ipsg_MATCH             |           _condition_8            |   fabric_ingress_src_lkp_MATCH    | native_packet_over_fabric_ACTION  |
 38 | |        spanning_tree_MATCH        |           _condition_34           |                                   |           _condition_31           |
 39 | |                                   |           _condition_33           |                                   |            ipsg_ACTION            |
 40 | |                                   |           _condition_19           |                                   |           _condition_9            |
 41 | |                                   |           _condition_15           |                                   |           _condition_37           |
 42 | |                                   |           _condition_7            |                                   |           _condition_10           |
 43 | |                                   |    ipsg_permit_special_ACTION     |                                   |    ingress_qos_map_pcp_ACTION     |
 44 | |                                   |           _condition_39           |                                   |                                   |
 45 | |                                   |   fabric_ingress_dst_lkp_ACTION   |                                   |                                   |
 46 | |                                   |           _condition_2            |                                   |                                   |
 47 | |                                   |       spanning_tree_ACTION        |                                   |                                   |
 48 | |                                   |           _condition_13           |                                   |                                   |
 49 | |                                   |    ingress_qos_map_dscp_ACTION    |                                   |                                   |
 50 | |                                   |           _condition_18           |                                   |                                   |
 51 | |                                   |           _condition_17           |                                   |                                   |
 52 | |                                   |           _condition_11           |                                   |                                   |
 53 | |                                   |           _condition_38           |                                   |                                   |
 54 | |                                   |           _condition_16           |                                   |                                   |
 55 | 
 56 | |                t=8                |                t=9                |               t=10                |               t=11                |
 57 | |        ipv4_urpf_lpm_MATCH        |           _condition_22           |          nat_flow_MATCH           |          mac_acl_ACTION           |
 58 | |     ingress_l4_dst_port_MATCH     |    ipv4_multicast_route_ACTION    |ipv4_multicast_bridge_star_g_MATCH |           _condition_29           |
 59 | |          ipv4_urpf_MATCH          |    ingress_l4_dst_port_ACTION     |           ip_acl_MATCH            |           ip_acl_ACTION           |
 60 | |            rmac_MATCH             |           _condition_25           | ipv4_multicast_route_star_g_MATCH |                                   |
 61 | |     ingress_l4_src_port_MATCH     |           _condition_26           |          nat_twice_MATCH          |                                   |
 62 | |    ipv4_multicast_route_MATCH     |         ipv4_urpf_ACTION          |                                   |                                   |
 63 | |           mac_acl_MATCH           |       storm_control_ACTION        |                                   |                                   |
 64 | |                                   |            rmac_ACTION            |                                   |                                   |
 65 | |                                   |           _condition_23           |                                   |                                   |
 66 | |                                   |           _condition_21           |                                   |                                   |
 67 | |                                   |       ipv4_urpf_lpm_ACTION        |                                   |                                   |
 68 | |                                   |           _condition_27           |                                   |                                   |
 69 | |                                   |   fabric_ingress_src_lkp_ACTION   |                                   |                                   |
 70 | |                                   |    ingress_l4_src_port_ACTION     |                                   |                                   |
 71 | 
 72 | |               t=12                |               t=13                |               t=14                |               t=15                |
 73 | |           nat_src_MATCH           |ipv4_multicast_bridge_star_g_ACTION|     compute_ipv4_hashes_MATCH     |            dmac_ACTION            |
 74 | |        ipv4_fib_lpm_MATCH         |      validate_packet_ACTION       |           urpf_bd_MATCH           |          ipv4_fib_ACTION          |
 75 | |            dmac_MATCH             |          nat_flow_ACTION          |            smac_MATCH             |         acl_stats_ACTION          |
 76 | |    ipv4_multicast_bridge_MATCH    |         ipv4_racl_ACTION          |          ipv4_fib_MATCH           |   ipv4_multicast_bridge_ACTION    |
 77 | |          ipv4_racl_MATCH          |                                   |        traffic_class_MATCH        |   compute_non_ip_hashes_ACTION    |
 78 | |       validate_packet_MATCH       |                                   |           nat_dst_MATCH           |        ipv4_fib_lpm_ACTION        |
 79 | |                                   |                                   |    compute_non_ip_hashes_MATCH    |       traffic_class_ACTION        |
 80 | |                                   |                                   |                                   |          nat_dst_ACTION           |
 81 | |                                   |                                   |                                   |      ingress_bd_stats_ACTION      |
 82 | |                                   |                                   |                                   |    compute_ipv4_hashes_ACTION     |
 83 | |                                   |                                   |                                   |          nat_src_ACTION           |
 84 | |                                   |                                   |                                   |ipv4_multicast_route_star_g_ACTION |
 85 | |                                   |                                   |                                   |            smac_ACTION            |
 86 | |                                   |                                   |                                   |         nat_twice_ACTION          |
 87 | 
 88 | |               t=16                |               t=17                |               t=18                |               t=19                |
 89 | |         fwd_result_MATCH          |    compute_other_hashes_ACTION    |        meter_action_MATCH         |           _condition_35           |
 90 | |          bd_flood_MATCH           |        meter_index_ACTION         |     storm_control_stats_MATCH     |          urpf_bd_ACTION           |
 91 | |         meter_index_MATCH         |         fwd_result_ACTION         |           nexthop_MATCH           |    storm_control_stats_ACTION     |
 92 | |        learn_notify_MATCH         |                                   |         ecmp_group_MATCH          |         ecmp_group_ACTION         |
 93 | |    compute_other_hashes_MATCH     |                                   |                                   |          nexthop_ACTION           |
 94 | 
 95 | |               t=20                |               t=21                |               t=22                |               t=23                |
 96 | |         system_acl_MATCH          |         lag_group_ACTION          |         fabric_lag_MATCH          |         fabric_lag_ACTION         |
 97 | |          lag_group_MATCH          |           _condition_36           |                                   |         system_acl_ACTION         |
 98 | |                                   |           _condition_40           |                                   |        learn_notify_ACTION        |
 99 | |                                   |          bd_flood_ACTION          |                                   |        meter_action_ACTION        |
100 | |                                   |                                   |                                   |         drop_stats_ACTION         |
101 | 
102 |  
103 | 
104 | 
105 | Match units usage (max = 8 units) on one processor
106 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |t=10|t=11|t=12|t=13|t=14|t=15|
107 | | 8  | 0  | 6  | 0  | 3  | 0  | 1  | 0  | 8  | 0  | 8  | 0  | 8  | 0  | 7  | 0  |
108 | 
109 | |t=16|t=17|t=18|t=19|t=20|t=21|t=22|t=23|
110 | | 5  | 0  | 4  | 0  | 3  | 0  | 1  | 0  |
111 | 
112 | 
113 | Action fields usage (max = 32 fields) on one processor
114 | |t=0 |t=1 |t=2 |t=3 |t=4 |t=5 |t=6 |t=7 |t=8 |t=9 |t=10|t=11|t=12|t=13|t=14|t=15|
115 | | 0  | 27 | 0  | 31 | 0  | 28 | 0  | 13 | 0  | 21 | 0  | 21 | 0  | 17 | 0  | 32 |
116 | 
117 | |t=16|t=17|t=18|t=19|t=20|t=21|t=22|t=23|
118 | | 0  | 9  | 0  | 11 | 0  | 5  | 0  | 11 |
119 | 
120 | 
121 | Match packets (max = 1 match packets) on one processor
122 | empty dictionary
123 | Action packets (max = 1 action packets) on one processor
124 | empty dictionary
125 | 


--------------------------------------------------------------------------------
/expt_times.txt:
--------------------------------------------------------------------------------
 1 | rm: cannot remove '*.pyc': No such file or directory
 2 | drmt_ipc_1 switch_combined
 3 | 33823.93user 18167.76system 52:19.69elapsed 1655%CPU (0avgtext+0avgdata 4409204maxresident)k
 4 | 0inputs+1008outputs (0major+16758762minor)pagefaults 0swaps
 5 | drmt_ipc_2 switch_combined
 6 | 47004.03user 31931.84system 48:39.34elapsed 2703%CPU (0avgtext+0avgdata 2934640maxresident)k
 7 | 0inputs+2424outputs (0major+10545012minor)pagefaults 0swaps
 8 | prmt_fine switch_combined
 9 | 2951.08user 2237.46system 2:50.50elapsed 3043%CPU (0avgtext+0avgdata 765568maxresident)k
10 | 0inputs+112outputs (0major+437318minor)pagefaults 0swaps
11 | prmt_coarse switch_combined
12 | 13237.08user 5680.24system 9:59.64elapsed 3154%CPU (0avgtext+0avgdata 1240508maxresident)k
13 | 0inputs+200outputs (0major+4584399minor)pagefaults 0swaps
14 | 
15 | 
16 | rm: cannot remove '*.pyc': No such file or directory
17 | drmt_ipc_1 switch_combined_subset
18 | 12386.00user 7549.10system 15:58.98elapsed 2078%CPU (0avgtext+0avgdata 3959412maxresident)k
19 | 0inputs+472outputs (0major+8860284minor)pagefaults 0swaps
20 | drmt_ipc_2 switch_combined_subset
21 | 13398.57user 6947.04system 15:55.11elapsed 2130%CPU (0avgtext+0avgdata 6729632maxresident)k
22 | 0inputs+384outputs (0major+28133447minor)pagefaults 0swaps
23 | prmt_fine switch_combined_subset
24 | 6.31user 6.13system 0:02.77elapsed 449%CPU (0avgtext+0avgdata 66480maxresident)k
25 | 0inputs+48outputs (0major+19356minor)pagefaults 0swaps
26 | prmt_coarse switch_combined_subset
27 | 11.52user 8.54system 0:03.12elapsed 642%CPU (0avgtext+0avgdata 68528maxresident)k
28 | 0inputs+32outputs (0major+26394minor)pagefaults 0swaps
29 | 
30 | 
31 | rm: cannot remove '*.pyc': No such file or directory
32 | drmt_ipc_1 switch_egress
33 | 36256.95user 21229.54system 34:05.80elapsed 2809%CPU (0avgtext+0avgdata 3488544maxresident)k
34 | 0inputs+1240outputs (0major+18878157minor)pagefaults 0swaps
35 | drmt_ipc_2 switch_egress
36 | 315.15user 45.61system 3:56.51elapsed 152%CPU (0avgtext+0avgdata 476640maxresident)k
37 | 0inputs+224outputs (0major+264430minor)pagefaults 0swaps
38 | prmt_fine switch_egress
39 | 1.27user 1.70system 0:00.99elapsed 298%CPU (0avgtext+0avgdata 49936maxresident)k
40 | 0inputs+24outputs (0major+12901minor)pagefaults 0swaps
41 | prmt_coarse switch_egress
42 | 1.25user 1.50system 0:01.11elapsed 246%CPU (0avgtext+0avgdata 45880maxresident)k
43 | 0inputs+40outputs (0major+12098minor)pagefaults 0swaps
44 | 
45 | 
46 | rm: cannot remove '*.pyc': No such file or directory
47 | drmt_ipc_1 switch_egress_subset
48 | 12164.84user 7194.63system 13:35.17elapsed 2374%CPU (0avgtext+0avgdata 991484maxresident)k
49 | 0inputs+288outputs (0major+1921568minor)pagefaults 0swaps
50 | drmt_ipc_2 switch_egress_subset
51 | 214.91user 2.46system 3:34.61elapsed 101%CPU (0avgtext+0avgdata 60952maxresident)k
52 | 0inputs+136outputs (0major+43770minor)pagefaults 0swaps
53 | prmt_fine switch_egress_subset
54 | 0.79user 1.56system 0:00.60elapsed 392%CPU (0avgtext+0avgdata 39724maxresident)k
55 | 0inputs+8outputs (0major+10029minor)pagefaults 0swaps
56 | prmt_coarse switch_egress_subset
57 | 0.75user 1.82system 0:00.60elapsed 429%CPU (0avgtext+0avgdata 39536maxresident)k
58 | 0inputs+8outputs (0major+10011minor)pagefaults 0swaps
59 | 
60 | 
61 | rm: cannot remove '*.pyc': No such file or directory
62 | drmt_ipc_1 switch_ingress
63 | 35278.28user 17223.55system 34:36.20elapsed 2528%CPU (0avgtext+0avgdata 5846204maxresident)k
64 | 0inputs+616outputs (0major+41030985minor)pagefaults 0swaps
65 | drmt_ipc_2 switch_ingress
66 | 8451.34user 5386.64system 12:44.37elapsed 1810%CPU (0avgtext+0avgdata 2168764maxresident)k
67 | 0inputs+408outputs (0major+6181006minor)pagefaults 0swaps
68 | prmt_fine switch_ingress
69 | 209.38user 140.02system 0:14.86elapsed 2350%CPU (0avgtext+0avgdata 570268maxresident)k
70 | 0inputs+48outputs (0major+192257minor)pagefaults 0swaps
71 | prmt_coarse switch_ingress
72 | 183.88user 136.05system 0:15.36elapsed 2082%CPU (0avgtext+0avgdata 264972maxresident)k
73 | 0inputs+56outputs (0major+97848minor)pagefaults 0swaps
74 | 
75 | 
76 | rm: cannot remove '*.pyc': No such file or directory
77 | drmt_ipc_1 switch_ingress_subset
78 | 12092.46user 7045.73system 14:42.58elapsed 2168%CPU (0avgtext+0avgdata 3868488maxresident)k
79 | 0inputs+344outputs (0major+10062002minor)pagefaults 0swaps
80 | drmt_ipc_2 switch_ingress_subset
81 | 1176.96user 613.83system 5:02.82elapsed 591%CPU (0avgtext+0avgdata 1089208maxresident)k
82 | 0inputs+232outputs (0major+452970minor)pagefaults 0swaps
83 | prmt_fine switch_ingress_subset
84 | 4.12user 3.72system 0:01.81elapsed 432%CPU (0avgtext+0avgdata 55816maxresident)k
85 | 0inputs+32outputs (0major+14431minor)pagefaults 0swaps
86 | prmt_coarse switch_ingress_subset
87 | 3.30user 3.23system 0:01.75elapsed 372%CPU (0avgtext+0avgdata 58136maxresident)k
88 | 0inputs+32outputs (0major+15506minor)pagefaults 0swaps
89 | 
90 | 
91 | 


--------------------------------------------------------------------------------
/figures/switch_combined.pdf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/anirudhSK/drmt/b287d31d50f371284cfb3a1f810990ae26637ae1/figures/switch_combined.pdf


--------------------------------------------------------------------------------
/figures/switch_combined_subset.pdf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/anirudhSK/drmt/b287d31d50f371284cfb3a1f810990ae26637ae1/figures/switch_combined_subset.pdf


--------------------------------------------------------------------------------
/figures/switch_egress.pdf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/anirudhSK/drmt/b287d31d50f371284cfb3a1f810990ae26637ae1/figures/switch_egress.pdf


--------------------------------------------------------------------------------
/figures/switch_egress_subset.pdf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/anirudhSK/drmt/b287d31d50f371284cfb3a1f810990ae26637ae1/figures/switch_egress_subset.pdf


--------------------------------------------------------------------------------
/figures/switch_ingress.pdf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/anirudhSK/drmt/b287d31d50f371284cfb3a1f810990ae26637ae1/figures/switch_ingress.pdf


--------------------------------------------------------------------------------
/figures/switch_ingress_subset.pdf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/anirudhSK/drmt/b287d31d50f371284cfb3a1f810990ae26637ae1/figures/switch_ingress_subset.pdf


--------------------------------------------------------------------------------
/figures/threads.txt:
--------------------------------------------------------------------------------
1 | drmt thread count
2 |                       prog        ipc_1_lat         ipc_2_lat    ipc_1_period      ipc_2_period      ipc_1_thrs       ipc_2_thrs drmt:max(dM, dA)       prmt:dM+dA
3 |            switch_combined         (50%)505               243              21                21              25               12               22               20
4 |     switch_combined_subset              217               217              11                11              20               20               22               20
5 |              switch_egress         (10%)225               198              11                 7              21               29               22               20
6 |       switch_egress_subset               99                99               5                 3              20               33               22               20
7 |             switch_ingress         (40%)407               243              17                15              24               17               22               20
8 |      switch_ingress_subset              217               221              11                 8              20               28               22               20
9 | 


--------------------------------------------------------------------------------
/fine_to_coarse.py:
--------------------------------------------------------------------------------
 1 | import sys
 2 | import importlib
 3 | import networkx as nx
 4 | from   schedule_dag import ScheduleDAG
 5 | 
 6 | def contract_dag(input_spec, latency_spec):
 7 |   G = ScheduleDAG()
 8 |   G.create_dag(input_spec.nodes, input_spec.edges, latency_spec)
 9 |   
10 |   action_nodes = G.nodes(select='action')
11 |   match_nodes  = G.nodes(select='match')
12 |   
13 |   tables = []
14 |   found_table = dict()
15 |   
16 |   for m in match_nodes:
17 |     for a in action_nodes:
18 |       if (a.startswith("_condition")):
19 |         continue
20 |       assert(m.endswith('MATCH'))
21 |       assert(a.endswith('ACTION'))
22 |       m_table = m.strip('MATCH')
23 |       a_table = a.strip('ACTION')
24 |       if (m_table == a_table):
25 |         tables.append((m, a))
26 |         found_table[m] = True
27 |         found_table[a] = True
28 |   
29 |   for m in match_nodes:
30 |     if m not in found_table:
31 |       print ("Unpaired match, ERROR!!!")
32 |       exit(1)
33 |   
34 |   for a in action_nodes:
35 |     if a not in found_table:
36 |       pass
37 |   #    print ("Unpaired action or condition: ", a, file=sys.stderr)
38 |  
39 |   # Contract table edges
40 |   for table in tables:
41 |     match  = table[0]
42 |     action = table[1]
43 |     table_name = match.strip('MATCH') + 'TABLE'
44 |     key_width  = G.node[match]['key_width']
45 |     num_fields = G.node[action]['num_fields']
46 |     G = nx.contracted_edge(G, table, self_loops=False)
47 |     nx.relabel_nodes(G, {match: table_name}, False)
48 |     G.node[table_name]['type'] = 'table'
49 |     G.node[table_name]['key_width'] = key_width
50 |     G.node[table_name]['num_fields'] = num_fields
51 | 
52 |   # Create dummy tables for the rest
53 |   for v in G.nodes():
54 |     if (G.node[v]['type'] != 'table'):
55 |       G.node[v]['type'] = 'table'
56 |       G.node[v]['key_width'] = 0
57 |       assert(G.node[v]['num_fields'] >= 0)
58 |       # leave num_fields unchanged
59 | 
60 |   return G
61 | 


--------------------------------------------------------------------------------
/graph_generator.py:
--------------------------------------------------------------------------------
 1 | import sys
 2 | import math
 3 | import matplotlib
 4 | import importlib
 5 | matplotlib.use('Agg')
 6 | matplotlib.rcParams.update({'font.size':18})
 7 | import matplotlib.pyplot as plt
 8 | if (len(sys.argv) != 5):
 9 |   print("Usage: ", sys.argv[0], " <result folder> <drmt latencies> <prmt latencies> <folder for figs>")
10 |   exit(1)
11 | else:
12 |   result_folder = sys.argv[1]
13 |   drmt_latencies = importlib.import_module(sys.argv[2], "*")
14 |   prmt_latencies = importlib.import_module(sys.argv[3], "*")
15 |   fig_folder    = sys.argv[4]
16 | 
17 | PROCESSORS=range(1, 51)
18 | 
19 | progs = ["switch_egress"]
20 | d_archs = ["drmt_ipc_1", "drmt_ipc_2"]
21 | p_archs = ["prmt_coarse", "prmt_fine"]
22 | 
23 | labels = dict()
24 | labels["drmt_ipc_1"] = "dRMT (IPC=1)"
25 | labels["drmt_ipc_2"] = "dRMT (IPC=2)"
26 | labels["prmt_coarse"]= "RMT"
27 | labels["prmt_fine"]  = "RMT fine"
28 | labels["upper_bound"] = "Upper bound"
29 | 
30 | pipeline_stages  = dict()
31 | drmt_min_periods = dict()
32 | drmt_thread_count= dict()
33 | 
34 | for prog in progs:
35 |   for arch in d_archs + p_archs:
36 |      fh = open(result_folder + "/" + arch + "_" + prog + ".txt", "r")
37 |      for line in fh.readlines():
38 |        if arch.startswith("prmt"):
39 |          if "stages" in line:
40 |            pipeline_stages[(prog, arch)] = float(line.split()[4])
41 |        elif arch.startswith("drmt"):
42 |          if "achieved throughput" in line:
43 |            drmt_min_periods[(prog, arch)] = int(line.split()[7])
44 |          if "thread count" in line:
45 |            drmt_thread_count[(prog, arch)] = int(line.split()[5])
46 |          if "Searching between limits" in line:
47 |            drmt_min_periods[(prog, "upper_bound")] = int(line.split()[3])
48 |        else:
49 |          print ("Unknown architecture")
50 |          assert(False)
51 | 
52 | for prog in progs:
53 |   plt.figure()
54 |   plt.title("Throughput vs. Processors")
55 |   plt.xlabel("Processors", fontsize = 26)
56 |   plt.ylabel("Packets per cycle", fontsize = 26)
57 |   
58 |   plt.step(PROCESSORS, [min(1.0, 1.0 / math.ceil(pipeline_stages[(prog, "prmt_coarse")]/n)) for n in PROCESSORS], label = labels["prmt_coarse"], linewidth=4, linestyle = '-')
59 |   plt.step(PROCESSORS, [min(1.0, 1.0 / math.ceil(pipeline_stages[(prog, "prmt_fine")]/n)) for n in PROCESSORS], label = labels["prmt_fine"], linewidth=4, linestyle = ':')
60 | 
61 |   plt.step(PROCESSORS, [min(1.0, (n * 1.0) / drmt_min_periods[(prog, "drmt_ipc_1")]) for n in PROCESSORS], label = labels["drmt_ipc_1"], linewidth=4, linestyle = '-.')
62 | 
63 |   plt.step(PROCESSORS, [min(1.0, (n * 1.0) / drmt_min_periods[(prog, "drmt_ipc_2")]) for n in PROCESSORS], label = labels["drmt_ipc_2"], linewidth=4, linestyle = '--')
64 | 
65 |   plt.legend(loc = "lower right")
66 |   plt.xlim(0, 15)
67 |   plt.tight_layout()
68 |   plt.savefig(fig_folder + "/" + prog + ".pdf")
69 | 
70 | print("drmt thread count")
71 | print("%26s %16s %16s %16s %16s %16s %16s %16s %16s"%(\
72 |         "prog", "ipc_1_lat", "ipc_1_period", "ipc_1_thrs", "ipc_2_lat", "ipc_2_period", "ipc_2_thrs",  "drmt:max(dM, dA)", "prmt:dM+dA"))
73 | for prog in progs:
74 |   print("%26s %16d %16d %16d %16d %16d %16d %16d %16d" %(\
75 |           prog,\
76 |           int(drmt_thread_count[(prog, "drmt_ipc_1")]), \
77 |           int(drmt_min_periods[(prog, "drmt_ipc_1")]),\
78 |           int(math.ceil(drmt_thread_count[(prog, "drmt_ipc_1")] / drmt_min_periods[(prog, "drmt_ipc_1")])),\
79 |           int(drmt_thread_count[(prog, "drmt_ipc_2")]), \
80 |           int(drmt_min_periods[(prog, "drmt_ipc_2")]),\
81 |           int(math.ceil(drmt_thread_count[(prog, "drmt_ipc_2")] / drmt_min_periods[(prog, "drmt_ipc_2")])),\
82 |           max(drmt_latencies.dM, drmt_latencies.dA),
83 |           prmt_latencies.dM + prmt_latencies.dA))
84 | 


--------------------------------------------------------------------------------
/greedy_prmt_solver.py:
--------------------------------------------------------------------------------
 1 | import networkx as nx
 2 | import math
 3 | import collections
 4 | 
 5 | class GreedyPrmtSolver:
 6 |     def __init__(self, dag,
 7 |                  input_spec):
 8 |         self.G = dag
 9 |         self.input_spec = input_spec
10 | 
11 |     def solve(self):
12 |         dist = {}  # stores distance of every node from root
13 |         for node in nx.topological_sort(self.G): # TODO: Aren't all delays here either 0 or 1?
14 |             distances = [(dist[v] + int(self.G[v][u]['delay'] > 0)) for v,u in self.G.in_edges(node)]
15 |             if distances:
16 |                 dist[node] = max(distances)
17 |             else:
18 |                 dist[node] = 0
19 |         self.length = max(dist.values()) + 1 # one extra cycle for final operation
20 | 
21 |         # now get nodes at each distance
22 |         nodes_at_dist = [0] * self.length
23 |         for i in range(self.length):
24 |           nodes_at_dist[i] = []
25 |         for node in dist:
26 |           nodes_at_dist[dist[node]] += [node]
27 | 
28 |         # Find start stage of each node/table
29 |         current_stage = 0
30 |         nodes_at_current_stage = []
31 |         schedule = {}
32 |         for i in range(self.length):
33 |           # topo. sort subgraph induced by nodes_at_dist to ensure it meets 0-length dependencies
34 |           work_list = nx.topological_sort(self.G.subgraph(nodes_at_dist[i]))
35 |           for node in work_list:
36 |             if (self.check_usage(nodes_at_current_stage + [node])):
37 |               schedule[node] = current_stage
38 |               nodes_at_current_stage += [node]
39 |             else: # need a new stage for resource reasons
40 |               assert(self.check_usage([node])) # otherwise problem is infeasible
41 |               current_stage += 1
42 |               schedule[node] = current_stage
43 |               nodes_at_current_stage = [node]
44 |           current_stage += 1 # This is a dependency relationship
45 |           nodes_at_current_stage = [] # Reset nodes
46 | 
47 |         # Now inflate self.length to real value
48 |         self.length = current_stage # we already added one in the last iteration of the previous loop
49 | 
50 |         # Compute ops on every time slot
51 |         self.ops_at_time = collections.defaultdict(list)
52 |         self.match_units_usage = dict()
53 |         for time_slot in range(self.length): self.match_units_usage[time_slot] = 0
54 |         self.action_fields_usage = dict()
55 |         for time_slot in range(self.length): self.action_fields_usage[time_slot] = 0
56 |         for v in self.G.nodes():
57 |           tv = schedule[v]
58 |           self.ops_at_time[tv].append(v)
59 |           assert(self.G.node[v]['type'] == 'table')
60 |           self.match_units_usage[tv] += math.ceil((1.0 * self.G.node[v]['key_width'])/self.input_spec.match_unit_size)
61 |           self.action_fields_usage[tv] += self.G.node[v]['num_fields']
62 |         return schedule
63 |  
64 |     def check_usage(self, work_list):
65 |       match_units_usage = 0
66 |       action_fields_usage = 0
67 |       for v in work_list:
68 |         assert(self.G.node[v]['type'] == 'table')
69 |         match_units_usage += math.ceil((1.0 * self.G.node[v]['key_width'])/self.input_spec.match_unit_size)
70 |         action_fields_usage += self.G.node[v]['num_fields']
71 |       return (match_units_usage <= self.input_spec.match_unit_limit) and \
72 |              (action_fields_usage <= self.input_spec.action_fields_limit)
73 | 


--------------------------------------------------------------------------------
/large_hw.py:
--------------------------------------------------------------------------------
1 | action_fields_limit = 32
2 | match_unit_limit = 8
3 | match_unit_size  = 80
4 | action_proc_limit = 1
5 | match_proc_limit = 1
6 | 


--------------------------------------------------------------------------------
/large_hw_ipc2.py:
--------------------------------------------------------------------------------
1 | action_fields_limit = 32
2 | match_unit_limit = 8
3 | match_unit_size  = 80
4 | action_proc_limit = 2
5 | match_proc_limit = 2
6 | 


--------------------------------------------------------------------------------
/printers.py:
--------------------------------------------------------------------------------
  1 | import collections
  2 | import math
  3 | from functools import *
  4 | 
  5 | def timeline_str(objs_at_time, white_space=2, timeslots_per_row=8):
  6 |   """ Returns a string representation of the schedule in the
  7 |   objs_at_time argument
  8 | 
  9 |   Parameters
 10 |   ----------
 11 |   objs_at_time : dict
 12 |       List of objects for each timeslot
 13 | 
 14 |   white_space : int
 15 |       Amount of white space per timeslot
 16 | 
 17 |   timeslots_per_row : int
 18 |       Number of timesteps in each row
 19 | 
 20 |   Returns
 21 |   -------
 22 |   timeline : string
 23 |       Printable string representation of schedule
 24 |   strlen : int
 25 |       Length of string for each timeslot
 26 |   """
 27 |   assert((type(objs_at_time) is dict) or (type(objs_at_time) is collections.defaultdict))
 28 | 
 29 |   # Handle empty dictionary right away
 30 |   if not objs_at_time : return 'empty dictionary'
 31 | 
 32 |   strs_at_time = dict()
 33 |   for time_slot in objs_at_time:
 34 |     if type(objs_at_time[time_slot]) is list:
 35 |       strs_at_time[time_slot] = [str(o) for o in objs_at_time[time_slot]]
 36 |     else:
 37 |       strs_at_time[time_slot] = [str(objs_at_time[time_slot])]
 38 | 
 39 |   num_strs = sum(len(strs) for strs in strs_at_time.values())
 40 |   strlen = max(max(len(s) for s in strs) for strs in strs_at_time.values()) + white_space
 41 |   timeline_length = max(t for t in strs_at_time.keys()) + 1
 42 |   strlen = max(strlen, len(str(timeline_length))+2)
 43 | 
 44 |   K = int(timeline_length / timeslots_per_row)
 45 |   R = timeline_length % timeslots_per_row
 46 | 
 47 |   timeline = ''
 48 |   for k in range(K+1):
 49 |       if k < K:
 50 |           low = k * timeslots_per_row
 51 |           high = low + timeslots_per_row
 52 |       else:
 53 |           low = k * timeslots_per_row
 54 |           high = low + R
 55 | 
 56 |       maxstrs = 0
 57 |       for t in range(low, high):
 58 |           if t in strs_at_time:
 59 |               maxstrs = max(maxstrs, len(strs_at_time[t]))
 60 | 
 61 |       if maxstrs > 0:
 62 |           timeline += '|'
 63 |           for t in range(low, high):
 64 |               timeline += '{0: ^{1}}'.format('t=%d' % t, strlen) + '|'
 65 |           for i in range(maxstrs):
 66 |               timeline += '\n|'
 67 |               for t in range(low, high):
 68 |                   if (t in strs_at_time) and (i<len(strs_at_time[t])):
 69 |                       timeline += '{0: ^{1}}'.format(strs_at_time[t][i],strlen) + '|'
 70 |                   else:
 71 |                       timeline += ' ' * strlen + '|'
 72 |           timeline += '\n\n'
 73 | 
 74 |   return timeline
 75 | 
 76 | def print_problem(dag, input_spec, match_selector = 'match', action_selector = 'action'):
 77 |   cpath, cplat = dag.critical_path()
 78 |   print ('# of nodes = ', dag.number_of_nodes())
 79 |   print ('# of edges = ', dag.number_of_edges())
 80 |   print ('# of matches = ', len(dag.nodes(select='match')))
 81 |   print ('# of actions = ', len(dag.nodes(select='action')))
 82 |   print ('Match unit size = ', input_spec.match_unit_size)
 83 | 
 84 |   match_units = reduce(lambda acc, node: acc + math.ceil((1.0 * dag.node[node]['key_width']) / input_spec.match_unit_size),\
 85 |                        dag.nodes(select=match_selector), 0)
 86 |   print ('# of match units = ', match_units)
 87 |   print ('match_unit_limit = ', input_spec.match_unit_limit)
 88 | 
 89 |   max_match_key = reduce(lambda acc, node: max(acc, dag.node[node]['key_width']),dag.nodes(select=match_selector), 0)
 90 |   print ('max size of match key in program = ', max_match_key)
 91 |   print ('max size of match key in hw = ', input_spec.match_unit_size * input_spec.match_unit_limit)
 92 |   if (max_match_key > input_spec.match_unit_size * input_spec.match_unit_limit):
 93 |     print ('max match key in program is larger than can be supported by hardware')
 94 |     exit(1)
 95 | 
 96 |   action_fields = reduce(lambda acc, node: acc + dag.node[node]['num_fields'],\
 97 |                        dag.nodes(select=action_selector), 0)
 98 |   print ('# of action fields = ', action_fields)
 99 |   print ('action_fields_limit = ', input_spec.action_fields_limit)
100 | 
101 |   max_action_fields = reduce(lambda acc, node: max(acc, dag.node[node]['num_fields']),dag.nodes(select=action_selector), 0)
102 |   print ('max number of action fields in program = ', max_action_fields)
103 |   print ('max number of action fields in hw = ', input_spec.action_fields_limit)
104 |   if (max_action_fields > input_spec.action_fields_limit):
105 |     print ('max number of action fields in program is larger than can be supported by hardware')
106 |     exit(1)
107 | 
108 |   print ('match_proc_limit =',  input_spec.match_proc_limit)
109 |   print ('action_proc_limit =', input_spec.action_proc_limit)
110 | 
111 |   print ('Critical path: ', cpath)
112 |   print ('Critical path length = %d cycles' % cplat)
113 | 
114 |   throughput_upper_bound = \
115 |         min((1.0 * input_spec.action_fields_limit) / action_fields,\
116 |             (1.0 * input_spec.match_unit_limit   ) / match_units)
117 |   print ('Upper bound on throughput = ', throughput_upper_bound)
118 |   return throughput_upper_bound
119 | 
120 | def print_resource_usage(input_spec, solution):
121 |   print ('Match units usage (max = %d units) on one processor' % input_spec.match_unit_limit)
122 |   print (timeline_str(solution.match_units_usage, white_space=0, timeslots_per_row=16))
123 | 
124 |   print ('Action fields usage (max = %d fields) on one processor' % input_spec.action_fields_limit)
125 |   print (timeline_str(solution.action_fields_usage, white_space=0, timeslots_per_row=16))
126 | 
127 |   print ('Match packets (max = %d match packets) on one processor' % input_spec.match_proc_limit)
128 |   print (timeline_str(solution.match_proc_usage, white_space=0, timeslots_per_row=16))
129 | 
130 |   print ('Action packets (max = %d action packets) on one processor' % input_spec.action_proc_limit)
131 |   print (timeline_str(solution.action_proc_usage, white_space=0, timeslots_per_row=16))
132 | 


--------------------------------------------------------------------------------
/prmt.py:
--------------------------------------------------------------------------------
  1 | from gurobipy import *
  2 | import numpy as np
  3 | import collections
  4 | import importlib
  5 | import math
  6 | from schedule_dag import ScheduleDAG
  7 | from greedy_prmt_solver import GreedyPrmtSolver
  8 | from fine_to_coarse import contract_dag
  9 | from printers import *
 10 | from solution import Solution
 11 | 
 12 | class PrmtFineSolver:
 13 |     def __init__(self, dag,
 14 |                  input_spec, latency_spec, seed_greedy):
 15 |         self.G = dag
 16 |         self.input_spec          = input_spec
 17 |         self.latency_spec        = latency_spec
 18 |         self.seed_greedy         = seed_greedy
 19 | 
 20 |     def solve(self, solve_coarse):
 21 |         """ Returns the optimal schedule
 22 | 
 23 |         Returns
 24 |         -------
 25 |         time_of_op : dict
 26 |             Timeslot for each operation in the DAG
 27 |         ops_at_time : defaultdic
 28 |             List of operations in each timeslot
 29 |         length : int
 30 |             Maximum latency of optimal schedule
 31 |         """
 32 |         if self.seed_greedy:
 33 |           print ('{:*^80}'.format(' Running greedy heuristic '))
 34 |           gsolver = GreedyPrmtSolver(contract_dag(self.input_spec, self.latency_spec), self.input_spec)
 35 |           gschedule = gsolver.solve()
 36 |           # gschedule was obtained as a solution to the coarse-grained model.
 37 |           # it needs to be modified to support the fine-grained model
 38 |           # although any solution to prmt_coarse is a solution to prmt_fine
 39 |           fine_grained_schedule = dict()
 40 |           for v in gschedule:
 41 |             if v.endswith('TABLE'):
 42 |               fine_grained_schedule[v.strip('TABLE') + 'MATCH'] = gschedule[v] * 2;
 43 |               fine_grained_schedule[v.strip('TABLE') + 'ACTION'] = gschedule[v] * 2 + 1;
 44 |             else:
 45 |               assert(v.startswith('_condition') or v.endswith('ACTION')) # No match
 46 |               fine_grained_schedule[v] = gschedule[v] * 2 + 1;    
 47 | 
 48 |         print ('{:*^80}'.format(' Running ILP solver '))
 49 |         nodes = self.G.nodes()
 50 |         match_nodes = self.G.nodes(select='match')
 51 |         action_nodes = self.G.nodes(select='action')
 52 |         edges = self.G.edges()
 53 |         (_, cplen) = self.G.critical_path()
 54 | 
 55 |         # Set T_MAX as the max of initial schedule + 1
 56 |         if (self.seed_greedy):
 57 |           T_MAX = max(fine_grained_schedule.values()) + 1
 58 |         else:
 59 |           T_MAX = 3 * cplen
 60 | 
 61 |         m = Model()
 62 |         m.setParam("LogToConsole", 0)
 63 | 
 64 |         # Create variables
 65 |         # t is the start substage (one match and one action substage make an RMT stage) for each DAG node
 66 |         t = m.addVars(nodes, lb=0, ub=T_MAX, vtype=GRB.INTEGER, name="t")
 67 | 
 68 |         # k is the even/odd quotient for each DAG node, i.e., t = 2*k + 1 or 2*k
 69 |         k = m.addVars(nodes, lb=0, ub=T_MAX, vtype=GRB.INTEGER, name="k")
 70 | 
 71 |         # indicator[v, t] = 1 if v is at substage t 
 72 |         indicator  = m.addVars(list(itertools.product(nodes, range(T_MAX))),\
 73 |                                vtype=GRB.BINARY, name="indicator")
 74 | 
 75 |         # The length of the schedule
 76 |         length = m.addVar(lb=0, ub=T_MAX, vtype=GRB.INTEGER, name="length")
 77 | 
 78 |         # Set objective: minimize length of schedule
 79 |         m.setObjective(length, GRB.MINIMIZE)
 80 | 
 81 |         # Set constraints
 82 | 
 83 |         # The length is the maximum of all t's
 84 |         m.addConstrs((t[v]  <= length for v in nodes), "constr_length_is_max")
 85 | 
 86 |         # Given v, indicator[v, t] is 1 for exactly one t
 87 |         m.addConstrs((sum(indicator[v, t] for t in range(T_MAX)) == 1 for v in nodes),\
 88 |                      "constr_unique_time")
 89 | 
 90 |         # t is T * indicator
 91 |         m.addConstrs(((t[v] == sum(time * indicator[v, time] for time in range(T_MAX)))\
 92 |                      for v in nodes),\
 93 |                      "constr_equality")
 94 | 
 95 |         # Respect dependencies in DAG, threshold delays at 0
 96 |         m.addConstrs((t[v] - t[u] >= int(self.G.edge[u][v]['delay'] > 0) for (u,v) in edges),\
 97 |                      "constr_dag_dependencies")
 98 | 
 99 |         # matches can only happen at even time slots
100 |         for v in match_nodes:
101 |           m.addConstr(t[v] == 2 * k[v])
102 | 
103 |         # actions can only happen at odd time slots
104 |         for v in action_nodes:
105 |           m.addConstr(t[v] == 2 * k[v] + 1)
106 | 
107 |         # Further, if this is coarse-grained PRMT
108 |         # then match and actions from the same table need
109 |         # to happen at the same k
110 |         if (solve_coarse):
111 |           for match in match_nodes:
112 |             for action in action_nodes:
113 |               if (action.startswith("_condition")):
114 |                 continue
115 |               assert(match.endswith('MATCH'))
116 |               assert(action.endswith('ACTION'))
117 |               m_table = match.strip('MATCH')
118 |               a_table = action.strip('ACTION')
119 |               if (m_table == a_table):
120 |                 m.addConstr(k[match] == k[action])
121 | 
122 |         # Number of match units does not exceed match_unit_limit
123 |         m.addConstrs((sum(math.ceil((1.0 * self.G.node[v]['key_width']) / self.input_spec.match_unit_size) * indicator[v, t]\
124 |                       for v in match_nodes)\
125 |                       <= self.input_spec.match_unit_limit for t in range(T_MAX)),\
126 |                       "constr_match_units")
127 | 
128 |         # The action field resource constraint (similar comments to above)
129 |         m.addConstrs((sum(self.G.node[v]['num_fields'] * indicator[v, t]\
130 |                       for v in action_nodes)\
131 |                       <= self.input_spec.action_fields_limit for t in range(T_MAX)),\
132 |                       "constr_action_fields")
133 | 
134 |         # Initialize schedule
135 |         if (self.seed_greedy):
136 |           for v in nodes:
137 |             t[v].start = fine_grained_schedule[v]
138 | 
139 |         # Any time slot (r) can have match or action operations
140 |         # from only match_proc_limit/action_proc_limit packets
141 |         # TODO
142 | 
143 |         # Solve model
144 |         m.optimize()
145 | 
146 |         # Construct length of schedule
147 |         # and usage in every time slot
148 |         solution = Solution()
149 |         solution.ops_at_time = collections.defaultdict(list)
150 |         solution.length = int(length.x + 1)
151 |         assert(solution.length == length.x + 1)
152 |         for time_slot in range(solution.length):
153 |           solution.match_units_usage[time_slot] = 0
154 |           solution.action_fields_usage[time_slot] = 0
155 |         for v in nodes:
156 |             tv = int(t[v].x)
157 |             solution.ops_at_time[tv].append(v)
158 |             if self.G.node[v]['type'] == 'match':
159 |                solution.match_units_usage[tv] += math.ceil((1.0 * self.G.node[v]['key_width'])/self.input_spec.match_unit_size)
160 |             elif self.G.node[v]['type'] == 'action':
161 |                solution.action_fields_usage[tv] += self.G.node[v]['num_fields']
162 |             else:
163 |                print ("Found unexpected node type ", self.G.node[v]['type'])
164 |                assert(False)
165 |         return solution
166 | 
167 | if __name__ == "__main__":
168 |   # Cmd line args
169 |   if (len(sys.argv) != 5):
170 |     print ("Usage: ", sys.argv[0], " <DAG file> <HW file> <latency file> <coarse/fine>")
171 |     exit(1)
172 |   elif (len(sys.argv) == 5):
173 |     input_file = sys.argv[1]
174 |     hw_file = sys.argv[2]
175 |     latency_file = sys.argv[3]
176 |     assert((sys.argv[4] == "coarse") or (sys.argv[4] == "fine"))
177 |     solve_coarse = bool(sys.argv[4] == "coarse")
178 | 
179 |   # Input example
180 |   input_spec = importlib.import_module(input_file, "*")
181 |   hw_spec    = importlib.import_module(hw_file, "*")
182 |   latency_spec=importlib.import_module(latency_file, "*")
183 |   input_spec.action_fields_limit = hw_spec.action_fields_limit
184 |   input_spec.match_unit_limit    = hw_spec.match_unit_limit
185 |   input_spec.match_unit_size     = hw_spec.match_unit_size
186 |   input_spec.action_proc_limit   = hw_spec.action_proc_limit
187 |   input_spec.match_proc_limit    = hw_spec.match_proc_limit
188 | 
189 |   G = ScheduleDAG()
190 |   G.create_dag(input_spec.nodes, input_spec.edges, latency_spec)
191 |   
192 |   print ('{:*^80}'.format(' Input DAG '))
193 |   print_problem(G, input_spec)
194 |   
195 |   print ('{:*^80}'.format(' Scheduling PRMT fine '))
196 |   solver = PrmtFineSolver(G, input_spec, latency_spec, seed_greedy = True)
197 |   solution = solver.solve(solve_coarse)
198 |   print ('Number of pipeline stages: %f' % (math.ceil(solution.length / 2.0)))
199 |   print ('{:*^80}'.format(' Schedule'))
200 |   print (timeline_str(solution.ops_at_time, white_space=0, timeslots_per_row=4), '\n\n')
201 |   print_resource_usage(input_spec, solution)
202 | 


--------------------------------------------------------------------------------
/prmt_latencies.py:
--------------------------------------------------------------------------------
1 | dM = 18
2 | dA = 2
3 | dS = 0
4 | 


--------------------------------------------------------------------------------
/random_odg_generator.py:
--------------------------------------------------------------------------------
  1 | 
  2 | import networkx as nx
  3 | import numpy as np
  4 | 
  5 | 
  6 | def digraph_generator(n):
  7 |     
  8 |     G = nx.DiGraph()
  9 |      
 10 |     # We want c*n edges. 
 11 |     c = 5
 12 |     
 13 |     # We have (n^2-n)/2 possible edges. We want c*n edges. p = c*n / (n^2-n)/2.
 14 |     p = np.ceil(1/(float(2*c*n)/(n*n-n)))
 15 |     
 16 |     # create DAG.
 17 |     for i in range(0,n):
 18 |         for j in range(i+1,n):
 19 |             if not (np.random.random_integers(0, p)):
 20 |                 G.add_edge(i,j)
 21 |                 
 22 |     # nx.draw(G)
 23 |     
 24 |     return G
 25 |     
 26 | def odg_attr_generator(G, delays):
 27 |     
 28 |     nodes = {}
 29 |     edges = {}
 30 |     
 31 |     dm = delays['m']
 32 |     da = delays['a']
 33 |     ds = delays['c']   
 34 | 
 35 |     # Create nodes.    
 36 |     for node in nx.topological_sort(G):
 37 |       
 38 |       # conditional nodes are not leaves.
 39 |       successors = G.successors(node)
 40 |         
 41 |       if successors:
 42 |         
 43 |           node_type = np.random.choice(['_condition_','MATCH_ACTION','P_ACTION'], p=[0.25, 0.6, 0.15])
 44 |           
 45 |       else:
 46 |           
 47 |           node_type = np.random.choice(['MATCH_ACTION','P_ACTION'], p=[0.85, 0.15])
 48 |           
 49 |       # match then action nodes.    
 50 |       if node_type == 'MATCH_ACTION':
 51 |           
 52 |           
 53 |         # Geometric
 54 |         key_width = 80*int(min(np.random.geometric(.75, 1),8))
 55 |         
 56 |         # uniform
 57 |         # key_width = 80*np.random.random_integers(1, 8)
 58 |                 
 59 |         nodes[str(node)+'_MATCH'] = {'key_width': key_width, 'type': 'match', 'ID': node}
 60 |         
 61 |         # Geometric
 62 |         num_fields = int(min(np.random.geometric(.25, 1),32))
 63 |         
 64 |         # uniform
 65 |         # num_fields = np.random.random_integers(1, 32)
 66 |         
 67 |         nodes[str(node)+'_ACTION'] = {'num_fields': num_fields, 'type': 'action', 'ID': node}
 68 |         
 69 |         # Create corresponding edge
 70 |         edges[(str(node)+'_MATCH', str(node)+'_ACTION')] = {'delay': dm, 'dep_type': 'new_match_to_action'}
 71 |         
 72 |       # Action with no corresponding match.                         
 73 |       elif node_type == 'P_ACTION':
 74 |           
 75 |         # Geometric
 76 |         num_fields = int(min(np.random.geometric(.25, 1),32))
 77 |         
 78 |         # uniform
 79 |         # num_fields = np.random.random_integers(1, 32)
 80 |             
 81 |         nodes[str(node)+node_type] = {'num_fields': num_fields, 'type': 'action', 'ID': node}
 82 |       
 83 |       # Condition.          
 84 |       else:
 85 |             
 86 |         nodes[node_type + str(node)] = {'num_fields': 1, 'type': 'condition', 'ID': node}
 87 | 
 88 |         
 89 |     # Create edges.        
 90 |     for node in nx.topological_sort(G):
 91 |         
 92 |       # name according to ID
 93 |       n_node = [name for name in nodes if nodes[name]['ID']==node][0]
 94 |       
 95 |       successors = G.successors(node)
 96 |         
 97 |       for dest in successors:
 98 |           
 99 |           # name according to ID                        
100 |           n_dest = [name for name in nodes if nodes[name]['ID']==dest][0] 
101 | 
102 |           # match-action edges allready exist.  
103 |           if  (n_node, n_dest) not in edges:            
104 | 
105 |               # TODO: fill correct 'dep_type'.                         
106 |                                         
107 |               if nodes[n_node]['type'] == 'match' and nodes[n_dest]['type'] == 'match':
108 |                                 
109 |                 edges[(n_node, n_dest)] = {'delay': dm, 'dep_type': 'new_match_to_action'}
110 |     
111 |               if nodes[n_node]['type'] == 'match' and nodes[n_dest]['type'] == 'action':
112 |                                 
113 |                 edges[(n_node, n_dest)] = {'delay': dm, 'dep_type': 'new_match_to_action'}
114 |                 
115 |               if nodes[n_node]['type'] == 'match' and nodes[n_dest]['type'] == 'condition':
116 |                                 
117 |                 edges[(n_node, n_dest)] = {'delay': dm, 'dep_type': 'new_match_to_action'}
118 |     
119 |                 
120 |                 
121 |               if nodes[n_node]['type'] == 'action' and nodes[n_dest]['type'] == 'match':
122 |                                 
123 |                 edges[(n_node, n_dest)] = {'delay': da, 'dep_type': 'rmt_match'}
124 |     
125 |               if nodes[n_node]['type'] == 'action' and nodes[n_dest]['type'] == 'action':
126 |                                 
127 |                 edges[(n_node, n_dest)] = {'delay': da, 'dep_type': 'rmt_match'}
128 |     
129 |               if nodes[n_node]['type'] == 'action' and nodes[n_dest]['type'] == 'condition':
130 |                                 
131 |                 edges[(n_node, n_dest)] = {'delay': da, 'dep_type': 'rmt_match'}
132 |                 
133 |                 
134 |     
135 |               if nodes[n_node]['type'] == 'condition' and nodes[n_dest]['type'] == 'match':
136 |                                 
137 |                 edges[(n_node, n_dest)] = {'delay': ds, 'dep_type': 'rmt_successor'}
138 |     
139 |               if nodes[n_node]['type'] == 'condition' and nodes[n_dest]['type'] == 'action':
140 |                                 
141 |                 edges[(n_node, n_dest)] = {'delay': ds, 'dep_type': 'rmt_successor'}
142 |     
143 |               if nodes[n_node]['type'] == 'condition' and nodes[n_dest]['type'] == 'condition':
144 |                                 
145 |                 edges[(n_node, n_dest)] = {'delay': ds, 'dep_type': 'rmt_successor'}
146 |                             
147 |                        
148 |     return nodes, edges
149 |     
150 |             
151 | def odg_generator(n, file_name):   
152 |              
153 |     # generate DAG    
154 |     G = digraph_generator(n)
155 |                 
156 |     # delays
157 |     delays = {'m': 22, 'a': 2, 'c': 0} 
158 |     
159 |     # generate ODG
160 |     nodes, edges = odg_attr_generator(G, delays)
161 |   
162 |     with open(file_name+'.py', 'w') as f: f.write('nodes = ')
163 |     with open(file_name+'.py', 'a') as f: f.write(repr(nodes))
164 |     with open(file_name+'.py', 'a') as f: f.write('\n')
165 |     
166 |     with open(file_name+'.py', 'a') as f: f.write('edges = ')
167 |     with open(file_name+'.py', 'a') as f: f.write(repr(edges))
168 |     with open(file_name+'.py', 'a') as f: f.write('\n')
169 |         
170 |       
171 | # print odg_generator(10)
172 |       
173 | 


--------------------------------------------------------------------------------
/randomized_sieve.py:
--------------------------------------------------------------------------------
  1 | from random import shuffle
  2 | import time as tm
  3 | import numpy as np
  4 | import math
  5 | import queue
  6 | 
  7 | def random_topological_sort_recursive(dag):
  8 |   # This is basically taken from networkx's topological_sort_recursive.
  9 |   # The differences are: 
 10 |   # 1. Randomization of the order we explore node's sucsessors.
 11 |   # 2. Removed cycle detection checks.
 12 |   def _dfs(v):
 13 |     keys=list(dag[v].keys())
 14 |     shuffle(list(keys))
 15 |     for w in keys:   
 16 |         if w not in explored:
 17 |             _dfs(w)
 18 |     explored.add(v)
 19 |     order.append(v)
 20 |               
 21 |   explored = set()
 22 |   order = []
 23 | 
 24 |   for v in dag.nodes_iter():
 25 |     if v not in explored:
 26 |       _dfs(v)
 27 | 
 28 |   return list(reversed(order))
 29 | 
 30 | def index_dag_sieve(input_spec, dag, index, bound, period_duration):
 31 |   # final schedule           
 32 |   schedule = []
 33 |   
 34 |   period_duration
 35 |       
 36 |   # wild card intensity
 37 |   rf_m = 10**4
 38 |   rf_a = 10**4
 39 |   
 40 |   # upper bound on nulls for each wild card
 41 |   m_nulls = 2
 42 |   a_nulls = 2
 43 |   
 44 |   # limit on keys of matches rounded to unit_size - match_unit_limit
 45 |   match_limit = {}
 46 |       
 47 |   # concurrent number of packets that can be matched
 48 |   concurrent_match_limit = {}
 49 |   
 50 |   # limit on bits of actions - action_fields_limit
 51 |   action_limit = {}
 52 |   
 53 |   # concurrent number of packets for actions
 54 |   concurrent_action_limit = {}
 55 |   
 56 |   # Init resource usage
 57 |   for i in range(period_duration):
 58 |       
 59 |       # total resources at cycle
 60 |       match_limit[i] = 0
 61 |       action_limit[i] = 0
 62 |       
 63 |       # number of different packets
 64 |       concurrent_match_limit[i] = []
 65 |       concurrent_action_limit[i] = []
 66 |       
 67 |   # Init time for each node                         
 68 |   for i in dag.nodes():
 69 |       dag.node[i]['time'] = 0
 70 |   
 71 |   # topological sort of DAG    
 72 |   ts = random_topological_sort_recursive(dag) 
 73 |       
 74 | 
 75 |   ts_ff_queue = queue.Queue()
 76 |   ts_rw_queue = queue.Queue()
 77 |           
 78 |   for i in ts[index:]:
 79 |       ts_ff_queue.put(i)
 80 |           
 81 |   for i in reversed(ts[:index]):
 82 |       ts_rw_queue.put(i)
 83 |       
 84 |       
 85 |   while not (ts_ff_queue.empty() and ts_rw_queue.empty()):
 86 |       
 87 |       coin = bool(np.random.choice(2))
 88 |       
 89 |       if ts_ff_queue.empty():
 90 |           coin = False
 91 |       elif ts_rw_queue.empty():
 92 |           coin = True
 93 |           
 94 |           
 95 |       # loop until all nodes are treated            
 96 |       if coin:
 97 |           
 98 |           # exctact nect node in DAG according to topological sort
 99 |           curr_node = ts_ff_queue.get()
100 |           
101 |           # the immediate predecessors of the current node                    
102 |           pred = dag.predecessors(curr_node)
103 |                   
104 |           # lower bound on time of current node                
105 |           if pred: 
106 |               time = max([dag.node[i]['time']+\
107 |               dag.edge[i][curr_node]['delay'] for i in pred])
108 |           else:
109 |               time = dag.node[curr_node]['time']
110 |               
111 |           # determine node type            
112 |           MA = dag.node[curr_node]['type']
113 |   
114 |           
115 |           # treat MATCH
116 |           if MA == 'match': 
117 |   
118 |              flag = True
119 |              
120 |              # loop until success
121 |              while flag:
122 |                                                                                                       
123 |                 # check resources availability at time%period_duration
124 |                                                                                                       
125 |                 match_limit_cond = match_limit[time%period_duration] + \
126 |                 math.ceil((1.0 * dag.node[curr_node]['key_width']) / input_spec.match_unit_size)\
127 |                 <= input_spec.match_unit_limit
128 |               
129 |                 con_match_limit_cond = \
130 |                 len(set(concurrent_match_limit[time%period_duration])) < input_spec.match_proc_limit                                                                                      
131 |                 
132 |                 same_con_match_limit_cond = \
133 |                 time in concurrent_match_limit[time%period_duration]
134 |                 
135 |                 wild_card = np.random.choice(rf_m) > 0
136 |                 
137 |                 if match_limit_cond and wild_card and \
138 |                 (con_match_limit_cond or same_con_match_limit_cond):
139 |   
140 |                     # node time
141 |                     dag.node[curr_node]['time'] = time
142 |                     
143 |                     # update resource usage
144 |                     match_limit[time%period_duration] += \
145 |                     math.ceil((1.0 * dag.node[curr_node]['key_width']) / input_spec.match_unit_size)
146 |                     
147 |                     # update different packet matches at that cycle
148 |                     concurrent_match_limit[time%period_duration].append(time)
149 |                     
150 |                     # add to final schedule
151 |                     schedule.append((curr_node, time))
152 |                     
153 |                     # break loop
154 |                     flag = False
155 |                  
156 |                 # coalition or lack of resources 
157 |                 else: 
158 |                     
159 |                     if not wild_card:
160 |                         time += np.random.choice(m_nulls)
161 |                         time += 1
162 |                         
163 |                     else:
164 |                         # advance time in case of failure
165 |                         time += 1
166 |                     
167 |                     # in case solution is not feasible
168 |                     if time > bound:
169 |                         return None
170 |                     
171 |                 
172 |           # treat Action      
173 |           if MA == 'action': 
174 |               
175 |              flag = True
176 |              
177 |              # loop until success
178 |              while flag:
179 |                                                                       
180 |                 # check resources availability at time%period_duration
181 |                                                                       
182 |                 action_limit_cond = action_limit[time%period_duration] + \
183 |                 dag.node[curr_node]['num_fields'] <= input_spec.action_fields_limit
184 |   
185 |                 con_action_limit_cond = \
186 |                 len(set(concurrent_action_limit[time%period_duration])) < input_spec.action_proc_limit
187 |                 
188 |                 same_con_action_limit_cond = \
189 |                 time in concurrent_action_limit[time%period_duration]
190 |                 
191 |                 wild_card = np.random.choice(rf_a) > 0
192 |                                           
193 |                 if action_limit_cond and wild_card and \
194 |                 (con_action_limit_cond or same_con_action_limit_cond):
195 |                     
196 |                     # node time
197 |                     dag.node[curr_node]['time'] = time
198 |                     
199 |                     # update resource usage
200 |                     action_limit[time%period_duration] += dag.node[curr_node]['num_fields']
201 |                     
202 |                     # update different packet actions at that cycle
203 |                     concurrent_action_limit[time%period_duration].append(time) 
204 |                                               
205 |                     # add to final schedule
206 |                     schedule.append((curr_node, time))
207 |                     
208 |                     # break loop
209 |                     flag = False
210 |                     
211 |                 # coalition or lack of resources    
212 |                 else:  
213 |   
214 |                     if not wild_card:
215 |                         time += np.random.choice(a_nulls) 
216 |                         time += 1
217 |                         
218 |                     else:
219 |                         # advance time in case of failure
220 |                         time += 1
221 |                    
222 |                     # in case solution is not feasible
223 |                     if time > bound:
224 |                         return None
225 |                            
226 |           
227 |       else:
228 |           
229 |           # exctact nect node in DAG according to topological sort
230 |           curr_node = ts_rw_queue.get()
231 |           
232 |           # the immediate successors of the current node                    
233 |           succ = dag.successors(curr_node)
234 |                   
235 |           # upper bound on time of current node                
236 |           if succ: 
237 |               time = min([dag.node[i]['time']-\
238 |               dag.edge[curr_node][i]['delay'] for i in succ])
239 |           else:
240 |               time = dag.node[curr_node]['time']
241 |               
242 |           # determine node type            
243 |           MA = dag.node[curr_node]['type']
244 |   
245 |           
246 |           # treat MATCH
247 |           if MA == 'match': 
248 |   
249 |              flag = True
250 |              
251 |              # loop until success
252 |              while flag:
253 |                                                                                                       
254 |                 # check resources availability at time%period_duration
255 |                                                                                                       
256 |                 match_limit_cond = match_limit[time%period_duration] + \
257 |                 math.ceil((1.0 * dag.node[curr_node]['key_width']) / input_spec.match_unit_size)\
258 |                 <= input_spec.match_unit_limit
259 |               
260 |                 con_match_limit_cond = \
261 |                 len(set(concurrent_match_limit[time%period_duration])) < input_spec.match_proc_limit                                                                                      
262 |                 
263 |                 same_con_match_limit_cond = \
264 |                 time in concurrent_match_limit[time%period_duration]
265 |                 
266 |                 wild_card = np.random.choice(rf_m) > 0
267 |                 
268 |                 if match_limit_cond and wild_card and \
269 |                 (con_match_limit_cond or same_con_match_limit_cond):
270 |   
271 |                     # node time
272 |                     dag.node[curr_node]['time'] = time
273 |                     
274 |                     # update resource usage
275 |                     match_limit[time%period_duration] += \
276 |                     math.ceil((1.0 * dag.node[curr_node]['key_width']) / input_spec.match_unit_size)
277 |                     
278 |                     # update different packet matches at that cycle
279 |                     concurrent_match_limit[time%period_duration].append(time)
280 |                     
281 |                     # add to final schedule
282 |                     schedule.append((curr_node, time))
283 |                     
284 |                     # break loop
285 |                     flag = False
286 |                  
287 |                 # coalition or lack of resources 
288 |                 else: 
289 |                     
290 |                     if not wild_card:
291 |                         time -= np.random.choice(m_nulls)
292 |                         time -= 1
293 |                         
294 |                     else:
295 |                         # advance time in case of failure
296 |                         time -= 1
297 |                     
298 |                     # in case solution is not feasible
299 |                     if time < -bound:
300 |                         return None
301 |                     
302 |                 
303 |           # treat Action      
304 |           if MA == 'action': 
305 |               
306 |              flag = True
307 |              
308 |              # loop until success
309 |              while flag:
310 |                                                                       
311 |                 # check resources availability at time%period_duration
312 |                                                                       
313 |                 action_limit_cond = action_limit[time%period_duration] + \
314 |                 dag.node[curr_node]['num_fields'] <= input_spec.action_fields_limit
315 |   
316 |                 con_action_limit_cond = \
317 |                 len(set(concurrent_action_limit[time%period_duration])) < input_spec.action_proc_limit
318 |                 
319 |                 same_con_action_limit_cond = \
320 |                 time in concurrent_action_limit[time%period_duration]
321 |                 
322 |                 wild_card = np.random.choice(rf_a) > 0
323 |                                           
324 |                 if action_limit_cond and wild_card and \
325 |                 (con_action_limit_cond or same_con_action_limit_cond):
326 |                     
327 |                     # node time
328 |                     dag.node[curr_node]['time'] = time
329 |                     
330 |                     # update resource usage
331 |                     action_limit[time%period_duration] += dag.node[curr_node]['num_fields']
332 |                     
333 |                     # update different packet actions at that cycle
334 |                     concurrent_action_limit[time%period_duration].append(time) 
335 |                                               
336 |                     # add to final schedule
337 |                     schedule.append((curr_node, time))
338 |                     
339 |                     # break loop
340 |                     flag = False
341 |                     
342 |                 # coalition or lack of resources    
343 |                 else:  
344 |   
345 |                     if not wild_card:
346 |                         time -= np.random.choice(a_nulls) 
347 |                         time -= 1
348 |                         
349 |                     else:
350 |                         # advance time in case of failure
351 |                         time -= 1
352 |                    
353 |                     # in case solution is not feasible
354 |                     if time < -bound:
355 |                         return None
356 |                               
357 |   return schedule
358 |     
359 |     
360 | def rnd_sieve(input_spec, dag, time_limit, period_duration):
361 |   star_time = tm.time()
362 |   curr_time = tm.time()
363 |   greedy_initial = {}
364 |   path, delay = dag.critical_path() 
365 |   best = 2 * delay
366 |   best_schedule = None 
367 |   index = 0 
368 | 
369 |   nodes = dag.number_of_nodes() 
370 |   print ('Looking for greedy feasible solution for %d seconds' % time_limit)
371 |  
372 |   while curr_time - star_time < time_limit:
373 |       schedule = index_dag_sieve(input_spec, dag, index%nodes, 2*delay, period_duration)
374 |       index += 1
375 |       if schedule != None:
376 |           max_val = max([k[1] for k in schedule])
377 |           min_val = min([k[1] for k in schedule])
378 |           if max_val - min_val < best:
379 |               best = max_val - min_val
380 |               best_schedule = schedule
381 |               print ('Found Feasible Solution With Latency', best)
382 |               
383 |       curr_time = tm.time()
384 |   if (best_schedule == None):
385 |     return None
386 | 
387 |   min_val = min([k[1] for k in best_schedule])
388 |   for i in best_schedule:
389 |     greedy_initial[i[0]] = i[1] - min_val
390 |   return greedy_initial
391 | 


--------------------------------------------------------------------------------
/run_experiments.sh:
--------------------------------------------------------------------------------
 1 | #! /bin/bash
 2 | 
 3 | if [ $# -ne 1 ]; then
 4 |   echo "Usage: ./run_experiments.sh result_folder"
 5 |   exit
 6 | fi
 7 | 
 8 | for prog in switch_combined switch_combined_subset switch_egress switch_egress_subset switch_ingress switch_ingress_subset;
 9 | do
10 |   rm *.pyc
11 |   echo "drmt_ipc_1 $prog"
12 |   /usr/bin/time python -u drmt.py $prog large_hw      drmt_latencies 10 > $1/drmt_ipc_1_${prog}.txt
13 |   echo "drmt_ipc_2 $prog"
14 |   /usr/bin/time python -u drmt.py $prog large_hw_ipc2 drmt_latencies 10 > $1/drmt_ipc_2_${prog}.txt
15 |   echo "prmt_fine $prog"
16 |   /usr/bin/time python -u prmt.py $prog large_hw      prmt_latencies fine> $1/prmt_fine_${prog}.txt
17 |   echo "prmt_coarse $prog"
18 |   /usr/bin/time python -u prmt.py $prog large_hw      prmt_latencies coarse> $1/prmt_coarse_${prog}.txt
19 |   echo -e "\n"
20 | done
21 | 


--------------------------------------------------------------------------------
/schedule_dag.py:
--------------------------------------------------------------------------------
  1 | import networkx as nx
  2 | import math
  3 | 
  4 | # For now, assume conditions cost 1 action field
  5 | CONDITION_COST = 1
  6 | 
  7 | # A DAG to represent fine-grained match-action scheduling constraints in dRMT and pRMT
  8 | class ScheduleDAG(nx.DiGraph):
  9 |     def __init__(self):
 10 |         nx.DiGraph.__init__(self)
 11 | 
 12 |     def create_dag(self, nodes, edges, latency_spec):
 13 |         """ Returns a DAG of match/action nodes
 14 | 
 15 |         Parameters
 16 |         ----------
 17 |         nodes : dict
 18 |                 Annotated nodes
 19 |         edges : dict
 20 |                 Annotated edges
 21 | 
 22 |         Returns
 23 |         -------
 24 |         G : NetworkX.DiGraph
 25 |             DAG
 26 | 
 27 |         Raises
 28 |         ------
 29 |         ValueError
 30 |             If graph is not a DAG
 31 | 
 32 |         """
 33 |         # add_nodes_from and add_edges_from
 34 |         # are inherited from nx.DiGraph
 35 |         self.add_nodes_from(nodes)
 36 |         self.add_edges_from(edges)
 37 | 
 38 |         if nx.is_directed_acyclic_graph(self) is False:
 39 |             raise ValueError('Input is not a DAG!')
 40 | 
 41 |         # Annotate nodes
 42 |         for u in self.nodes():
 43 |             self.node[u]['type'] = nodes[u]['type']
 44 |             if self.node[u]['type'] == 'match':
 45 |                 self.node[u]['key_width'] = nodes[u]['key_width']
 46 |             elif self.node[u]['type'] == 'action':
 47 |                 self.node[u]['num_fields'] = nodes[u]['num_fields']
 48 |             elif self.node[u]['type'] == 'condition':
 49 |                 # TODO: At some later point, we might handle conditions more carefully
 50 |                 # For now, we treat them as actions with 1 action field
 51 |                 self.node[u]['num_fields'] = CONDITION_COST
 52 |                 self.node[u]['type'] = 'action'
 53 |             else:
 54 |                 print ("Found unexpected node type ", self.node[u]['type'])
 55 |                 assert(False)
 56 | 
 57 |         # Annotate edges
 58 |         for (u,v) in self.edges():
 59 |             # assign delay based on dependency type
 60 |             # see https://github.com/jafingerhut/p4-hlir#sched_data-dependency-graphs
 61 |             dep_type = edges[(u,v)]['dep_type']
 62 |             if (dep_type == 'new_match_to_action') or (dep_type == 'new_successor_conditional_on_table_result_action_type'):
 63 |               # minimum match latency
 64 |               self.edge[u][v]['delay'] = latency_spec.dM
 65 |             elif (dep_type == 'rmt_reverse_read') or (dep_type == 'rmt_successor'):
 66 |               # latency of dS, for now zero
 67 |               self.edge[u][v]['delay'] = latency_spec.dS
 68 |             elif (dep_type == 'rmt_action') or (dep_type == 'rmt_match'):
 69 |               # minimum action latency
 70 |               self.edge[u][v]['delay'] = latency_spec.dA
 71 |             else:
 72 |               print ("Unexpected dependency type: ", dep_type)
 73 |               assert(False)
 74 | 
 75 |     def critical_path(self):
 76 |         """Returns the critical (longest) path in the DAG, and its latency
 77 | 
 78 |         Parameters
 79 |         ----------
 80 |         G : NetworkX DiGraph
 81 |             DAG
 82 | 
 83 |         Returns
 84 |         -------
 85 |         path : list
 86 |             Longest path
 87 |         latency : int
 88 |             Latency of longest path
 89 | 
 90 |         """
 91 |         dist = {}  # stores [distance, node] pair.
 92 |         # distance is distance from root and node is predecessor on path from root
 93 |         for node in nx.topological_sort(self):
 94 |             # pairs of dist,node for all incoming edges
 95 |             pairs = [(dist[v][0] + self[v][u]['delay'], v) for v,u in self.in_edges(node)]
 96 |             if pairs:
 97 |                 dist[node] = max(pairs)
 98 |             else:
 99 |                 dist[node] = (0, node)
100 |         node, (length, _) = max(dist.items(), key=lambda x: x[1])
101 |         latency = length + 1 # one extra cycle for final operation
102 |         path = []
103 |         while length > 0:
104 |             path.append(node)
105 |             length, node = dist[node]
106 |         return list(reversed(path)), latency
107 | 
108 |     def nodes(self, data=False, select='*'):
109 |         """Returns list of nodes with optional data values and selection filter
110 | 
111 |         Parameters
112 |         ----------
113 |         data : bool
114 |             Include annotation data per node
115 |         select : string
116 |             type of nodes ('*', 'match', or 'action')
117 | 
118 | 
119 |         Returns
120 |         -------
121 |         nodelist : list
122 |             List of nodes
123 | 
124 |         """
125 |         nodelist = []
126 |         for (u, d) in nx.DiGraph.nodes(self, data=True):
127 |             if (select == '*') or (d['type'] == select):
128 |                 if data is False:
129 |                     nodelist.append(u)
130 |                 else:
131 |                     nodelist.append((u,d))
132 |         return nodelist
133 | 


--------------------------------------------------------------------------------
/sieve_rotator.py:
--------------------------------------------------------------------------------
 1 | # The sieve/rotator algorithm
 2 | # Take a fine-grained PRMT schedule and
 3 | # turn it into a DRMT schedule for period_duration slots
 4 | 
 5 | class SlotOccupancy:
 6 |   def __init__(self):
 7 |     self.match_slot = False
 8 |     self.action_slot = False
 9 |   def __str__(self):
10 |     return "\nmatch: " + str(self.match_slot) + "\n" + "action: " + str(self.action_slot)
11 |   def __repr__(self):
12 |     return "\nmatch: " + str(self.match_slot) + "\n" + "action: " + str(self.action_slot)
13 | 
14 | def sieve_rotator(pipe_schedule, period_duration, dM, dA):
15 |   # For each processor is the match, action slot taken already?
16 |   proc_occupied = [SlotOccupancy() for i in range(period_duration)]
17 | 
18 |   # Current time (starting from 0) after scheduling a certain number of nodes
19 |   current_time = 0
20 | 
21 |   # Construct drmt schedule as a dictionary
22 |   drmt_schedule = dict()
23 | 
24 |   # Check that pipeline depth (max_time + 1) is at most half the number of processors
25 |   max_time=max(pipe_schedule)
26 |   #assert((max_time + 1) <= (2 * period_duration)) # otherwise reject it outright
27 | 
28 |   # Now schedule match and actions alternatively
29 |   for t in range(max_time + 1):
30 |     # schedule match column in table
31 |     if (t%2 == 0):
32 |       termination_counter = 0
33 |       while (proc_occupied[current_time%period_duration].match_slot):
34 |         termination_counter += 1
35 |         if (termination_counter > period_duration):
36 |           print("Can't find a solution in rotator, match const. violated")
37 |           return None
38 |         current_time += 1
39 | #        print ("Incurred one match no-op")
40 |       for v in pipe_schedule[t]: drmt_schedule[v] = current_time
41 |       proc_occupied[current_time%period_duration].match_slot = True
42 |       current_time += dM
43 | 
44 |     # schedule action column in table
45 |     else:
46 |       termination_counter = 0
47 |       while (proc_occupied[current_time%period_duration].action_slot):
48 |         termination_counter += 1
49 |         if (termination_counter > period_duration):
50 |           print("Can't find a solution in rotator, action const. violated")
51 |           return None
52 |         current_time += 1
53 | #        print ("Incurred one action no-op")
54 |       for v in pipe_schedule[t]: drmt_schedule[v] = current_time
55 |       proc_occupied[current_time%period_duration].action_slot = True
56 |       current_time += dA
57 | 
58 |   return drmt_schedule
59 | 


--------------------------------------------------------------------------------
/simple_dag_generator.py:
--------------------------------------------------------------------------------
1 | import numpy
2 | print "digraph {\n"
3 | for i in range(0, 10):
4 |   for j in range(i + 1, 10):
5 |     if (numpy.random.random_integers(0, 1)):
6 |       print i," -> ",j
7 | print "}\n"
8 | 


--------------------------------------------------------------------------------
/small_hw.py:
--------------------------------------------------------------------------------
1 | action_fields_limit = 30
2 | match_unit_limit    = 5
3 | match_unit_size     = 80
4 | action_proc_limit   = 1
5 | match_proc_limit    = 1
6 | 


--------------------------------------------------------------------------------
/solution.py:
--------------------------------------------------------------------------------
1 | class Solution:
2 |   def __init__(self):
3 |     self.match_key_usage     = dict()
4 |     self.action_fields_usage = dict()
5 |     self.match_units_usage   = dict()
6 |     self.match_proc_usage    = dict()
7 |     self.action_proc_usage   = dict()
8 | 


--------------------------------------------------------------------------------
/switch_egress_subset.py:
--------------------------------------------------------------------------------
  1 | nodes = \
  2 | {'_condition_41': {'num_fields': 0, 'type': 'condition'},
  3 |  '_condition_42': {'num_fields': 0, 'type': 'condition'},
  4 |  '_condition_43': {'num_fields': 0, 'type': 'condition'},
  5 |  '_condition_44': {'num_fields': 0, 'type': 'condition'},
  6 |  '_condition_45': {'num_fields': 0, 'type': 'condition'},
  7 |  '_condition_46': {'num_fields': 0, 'type': 'condition'},
  8 |  '_condition_47': {'num_fields': 0, 'type': 'condition'},
  9 |  '_condition_48': {'num_fields': 0, 'type': 'condition'},
 10 |  '_condition_49': {'num_fields': 0, 'type': 'condition'},
 11 |  '_condition_50': {'num_fields': 0, 'type': 'condition'},
 12 |  '_condition_51': {'num_fields': 0, 'type': 'condition'},
 13 |  '_condition_52': {'num_fields': 0, 'type': 'condition'},
 14 |  'egress_bd_map_ACTION': {'num_fields': 3, 'type': 'action'},
 15 |  'egress_bd_map_MATCH': {'key_width': 16, 'type': 'match'},
 16 |  'egress_bd_stats_ACTION': {'num_fields': 0, 'type': 'action'},
 17 |  'egress_bd_stats_MATCH': {'key_width': 19, 'type': 'match'},
 18 |  'egress_filter_ACTION': {'num_fields': 3, 'type': 'action'},
 19 |  'egress_filter_drop_ACTION': {'num_fields': 1, 'type': 'action'},
 20 |  'egress_nat_ACTION': {'num_fields': 6, 'type': 'action'},
 21 |  'egress_nat_MATCH': {'key_width': 14, 'type': 'match'},
 22 |  'egress_port_mapping_ACTION': {'num_fields': 4, 'type': 'action'},
 23 |  'egress_port_mapping_MATCH': {'key_width': 9, 'type': 'match'},
 24 |  'egress_qos_map_ACTION': {'num_fields': 1, 'type': 'action'},
 25 |  'egress_qos_map_MATCH': {'key_width': 13, 'type': 'match'},
 26 |  'egress_system_acl_ACTION': {'num_fields': 3, 'type': 'action'},
 27 |  'egress_system_acl_MATCH': {'key_width': 43, 'type': 'match'},
 28 |  'egress_vlan_xlate_ACTION': {'num_fields': 7, 'type': 'action'},
 29 |  'egress_vlan_xlate_MATCH': {'key_width': 32, 'type': 'match'},
 30 |  'l3_rewrite_ACTION': {'num_fields': 3, 'type': 'action'},
 31 |  'l3_rewrite_MATCH': {'key_width': 5, 'type': 'match'},
 32 |  'mirror_ACTION': {'num_fields': 1, 'type': 'action'},
 33 |  'mirror_MATCH': {'key_width': 16, 'type': 'match'},
 34 |  'mtu_ACTION': {'num_fields': 1, 'type': 'action'},
 35 |  'mtu_MATCH': {'key_width': 10, 'type': 'match'},
 36 |  'replica_type_ACTION': {'num_fields': 1, 'type': 'action'},
 37 |  'replica_type_MATCH': {'key_width': 17, 'type': 'match'},
 38 |  'rewrite_ACTION': {'num_fields': 6, 'type': 'action'},
 39 |  'rewrite_MATCH': {'key_width': 16, 'type': 'match'},
 40 |  'rewrite_multicast_ACTION': {'num_fields': 1, 'type': 'action'},
 41 |  'rewrite_multicast_MATCH': {'key_width': 6, 'type': 'match'},
 42 |  'rid_ACTION': {'num_fields': 8, 'type': 'action'},
 43 |  'rid_MATCH': {'key_width': 16, 'type': 'match'},
 44 |  'smac_rewrite_ACTION': {'num_fields': 1, 'type': 'action'},
 45 |  'smac_rewrite_MATCH': {'key_width': 9, 'type': 'match'},
 46 |  'vlan_decap_ACTION': {'num_fields': 3, 'type': 'action'},
 47 |  'vlan_decap_MATCH': {'key_width': 2, 'type': 'match'}}
 48 | 
 49 | edges = \
 50 | {('_condition_41', '_condition_42'): {'delay': 0, 'dep_type': 'rmt_successor'},
 51 |  ('_condition_41', '_condition_49'): {'delay': 0, 'dep_type': 'rmt_successor'},
 52 |  ('_condition_41', '_condition_50'): {'delay': 0, 'dep_type': 'rmt_successor'},
 53 |  ('_condition_41', 'egress_filter_ACTION'): {'delay': 0,
 54 |                                              'dep_type': 'rmt_successor'},
 55 |  ('_condition_41', 'egress_port_mapping_ACTION'): {'delay': 0,
 56 |                                                    'dep_type': 'rmt_successor'},
 57 |  ('_condition_42', '_condition_43'): {'delay': 0, 'dep_type': 'rmt_successor'},
 58 |  ('_condition_42', 'mirror_ACTION'): {'delay': 0, 'dep_type': 'rmt_successor'},
 59 |  ('_condition_43', 'replica_type_ACTION'): {'delay': 0,
 60 |                                             'dep_type': 'rmt_successor'},
 61 |  ('_condition_43', 'rid_ACTION'): {'delay': 0, 'dep_type': 'rmt_successor'},
 62 |  ('_condition_44', 'vlan_decap_ACTION'): {'delay': 0,
 63 |                                           'dep_type': 'rmt_successor'},
 64 |  ('_condition_45', 'rewrite_ACTION'): {'delay': 0,
 65 |                                        'dep_type': 'rmt_successor'},
 66 |  ('_condition_45', 'rewrite_multicast_ACTION'): {'delay': 0,
 67 |                                                  'dep_type': 'rmt_successor'},
 68 |  ('_condition_46', 'egress_qos_map_ACTION'): {'delay': 0,
 69 |                                               'dep_type': 'rmt_successor'},
 70 |  ('_condition_47', 'l3_rewrite_ACTION'): {'delay': 0,
 71 |                                           'dep_type': 'rmt_successor'},
 72 |  ('_condition_47', 'smac_rewrite_ACTION'): {'delay': 0,
 73 |                                             'dep_type': 'rmt_successor'},
 74 |  ('_condition_48', 'egress_nat_ACTION'): {'delay': 0,
 75 |                                           'dep_type': 'rmt_successor'},
 76 |  ('_condition_49', 'egress_vlan_xlate_ACTION'): {'delay': 0,
 77 |                                                  'dep_type': 'rmt_successor'},
 78 |  ('_condition_50', '_condition_51'): {'delay': 0, 'dep_type': 'rmt_successor'},
 79 |  ('_condition_51', 'egress_filter_drop_ACTION'): {'delay': 0,
 80 |                                                   'dep_type': 'rmt_successor'},
 81 |  ('_condition_52', 'egress_system_acl_ACTION'): {'delay': 0,
 82 |                                                  'dep_type': 'rmt_successor'},
 83 |  ('egress_bd_map_ACTION', '_condition_48'): {'delay': 1,
 84 |                                              'dep_type': 'rmt_match'},
 85 |  ('egress_bd_map_ACTION', 'smac_rewrite_MATCH'): {'delay': 1,
 86 |                                                   'dep_type': 'rmt_match'},
 87 |  ('egress_bd_map_MATCH', 'egress_bd_map_ACTION'): {'delay': 9,
 88 |                                                    'dep_type': 'new_match_to_action'},
 89 |  ('egress_bd_stats_MATCH', 'egress_bd_stats_ACTION'): {'delay': 9,
 90 |                                                        'dep_type': 'new_match_to_action'},
 91 |  ('egress_filter_ACTION', '_condition_51'): {'delay': 1,
 92 |                                              'dep_type': 'rmt_match'},
 93 |  ('egress_nat_MATCH', 'egress_nat_ACTION'): {'delay': 9,
 94 |                                              'dep_type': 'new_match_to_action'},
 95 |  ('egress_port_mapping_ACTION', '_condition_49'): {'delay': 1,
 96 |                                                    'dep_type': 'rmt_match'},
 97 |  ('egress_port_mapping_ACTION', '_condition_51'): {'delay': 1,
 98 |                                                    'dep_type': 'rmt_match'},
 99 |  ('egress_port_mapping_ACTION', 'egress_filter_ACTION'): {'delay': 1,
100 |                                                           'dep_type': 'rmt_action'},
101 |  ('egress_port_mapping_ACTION', 'egress_qos_map_MATCH'): {'delay': 1,
102 |                                                           'dep_type': 'rmt_match'},
103 |  ('egress_port_mapping_ACTION', 'egress_vlan_xlate_MATCH'): {'delay': 1,
104 |                                                              'dep_type': 'rmt_match'},
105 |  ('egress_port_mapping_MATCH', '_condition_44'): {'delay': 9,
106 |                                                   'dep_type': 'new_successor_conditional_on_table_result_action_type'},
107 |  ('egress_port_mapping_MATCH', '_condition_45'): {'delay': 9,
108 |                                                   'dep_type': 'new_successor_conditional_on_table_result_action_type'},
109 |  ('egress_port_mapping_MATCH', '_condition_46'): {'delay': 9,
110 |                                                   'dep_type': 'new_successor_conditional_on_table_result_action_type'},
111 |  ('egress_port_mapping_MATCH', '_condition_47'): {'delay': 9,
112 |                                                   'dep_type': 'new_successor_conditional_on_table_result_action_type'},
113 |  ('egress_port_mapping_MATCH', '_condition_48'): {'delay': 9,
114 |                                                   'dep_type': 'new_successor_conditional_on_table_result_action_type'},
115 |  ('egress_port_mapping_MATCH', 'egress_bd_map_ACTION'): {'delay': 9,
116 |                                                          'dep_type': 'new_successor_conditional_on_table_result_action_type'},
117 |  ('egress_port_mapping_MATCH', 'egress_bd_stats_ACTION'): {'delay': 9,
118 |                                                            'dep_type': 'new_successor_conditional_on_table_result_action_type'},
119 |  ('egress_port_mapping_MATCH', 'egress_port_mapping_ACTION'): {'delay': 9,
120 |                                                                'dep_type': 'new_match_to_action'},
121 |  ('egress_port_mapping_MATCH', 'mtu_ACTION'): {'delay': 9,
122 |                                                'dep_type': 'new_successor_conditional_on_table_result_action_type'},
123 |  ('egress_qos_map_ACTION', 'l3_rewrite_ACTION'): {'delay': 1,
124 |                                                   'dep_type': 'rmt_action'},
125 |  ('egress_qos_map_MATCH', 'egress_qos_map_ACTION'): {'delay': 9,
126 |                                                      'dep_type': 'new_match_to_action'},
127 |  ('egress_system_acl_MATCH', 'egress_system_acl_ACTION'): {'delay': 9,
128 |                                                            'dep_type': 'new_match_to_action'},
129 |  ('egress_vlan_xlate_MATCH', 'egress_vlan_xlate_ACTION'): {'delay': 9,
130 |                                                            'dep_type': 'new_match_to_action'},
131 |  ('l3_rewrite_ACTION', 'egress_nat_ACTION'): {'delay': 0,
132 |                                               'dep_type': 'rmt_reverse_read'},
133 |  ('l3_rewrite_MATCH', 'l3_rewrite_ACTION'): {'delay': 9,
134 |                                              'dep_type': 'new_match_to_action'},
135 |  ('mirror_ACTION', '_condition_45'): {'delay': 1, 'dep_type': 'rmt_match'},
136 |  ('mirror_ACTION', 'egress_bd_map_MATCH'): {'delay': 1,
137 |                                             'dep_type': 'rmt_match'},
138 |  ('mirror_ACTION', 'egress_bd_stats_MATCH'): {'delay': 1,
139 |                                               'dep_type': 'rmt_match'},
140 |  ('mirror_ACTION', 'egress_filter_ACTION'): {'delay': 1,
141 |                                              'dep_type': 'rmt_action'},
142 |  ('mirror_ACTION', 'egress_system_acl_ACTION'): {'delay': 0,
143 |                                                  'dep_type': 'rmt_reverse_read'},
144 |  ('mirror_ACTION', 'egress_vlan_xlate_MATCH'): {'delay': 1,
145 |                                                 'dep_type': 'rmt_match'},
146 |  ('mirror_ACTION', 'rewrite_MATCH'): {'delay': 1, 'dep_type': 'rmt_match'},
147 |  ('mirror_MATCH', 'mirror_ACTION'): {'delay': 9,
148 |                                      'dep_type': 'new_match_to_action'},
149 |  ('mtu_ACTION', 'egress_system_acl_MATCH'): {'delay': 1,
150 |                                              'dep_type': 'rmt_match'},
151 |  ('mtu_MATCH', 'mtu_ACTION'): {'delay': 9, 'dep_type': 'new_match_to_action'},
152 |  ('replica_type_ACTION', '_condition_45'): {'delay': 1,
153 |                                             'dep_type': 'rmt_match'},
154 |  ('replica_type_ACTION', '_condition_47'): {'delay': 1,
155 |                                             'dep_type': 'rmt_match'},
156 |  ('replica_type_ACTION', 'rewrite_ACTION'): {'delay': 1,
157 |                                              'dep_type': 'rmt_action'},
158 |  ('replica_type_MATCH', 'replica_type_ACTION'): {'delay': 9,
159 |                                                  'dep_type': 'new_match_to_action'},
160 |  ('rewrite_ACTION', '_condition_47'): {'delay': 1, 'dep_type': 'rmt_match'},
161 |  ('rewrite_ACTION', '_condition_51'): {'delay': 1, 'dep_type': 'rmt_match'},
162 |  ('rewrite_ACTION', 'egress_bd_map_MATCH'): {'delay': 1,
163 |                                              'dep_type': 'rmt_match'},
164 |  ('rewrite_ACTION', 'egress_bd_stats_MATCH'): {'delay': 1,
165 |                                                'dep_type': 'rmt_match'},
166 |  ('rewrite_ACTION', 'egress_filter_ACTION'): {'delay': 1,
167 |                                               'dep_type': 'rmt_action'},
168 |  ('rewrite_ACTION', 'egress_vlan_xlate_MATCH'): {'delay': 1,
169 |                                                  'dep_type': 'rmt_match'},
170 |  ('rewrite_ACTION', 'l3_rewrite_ACTION'): {'delay': 1,
171 |                                            'dep_type': 'rmt_action'},
172 |  ('rewrite_ACTION', 'mtu_MATCH'): {'delay': 1, 'dep_type': 'rmt_match'},
173 |  ('rewrite_MATCH', 'rewrite_ACTION'): {'delay': 9,
174 |                                        'dep_type': 'new_match_to_action'},
175 |  ('rewrite_multicast_ACTION', 'egress_nat_ACTION'): {'delay': 0,
176 |                                                      'dep_type': 'rmt_reverse_read'},
177 |  ('rewrite_multicast_ACTION', 'l3_rewrite_ACTION'): {'delay': 1,
178 |                                                      'dep_type': 'rmt_action'},
179 |  ('rewrite_multicast_MATCH', 'rewrite_multicast_ACTION'): {'delay': 9,
180 |                                                            'dep_type': 'new_match_to_action'},
181 |  ('rid_ACTION', '_condition_45'): {'delay': 1, 'dep_type': 'rmt_match'},
182 |  ('rid_ACTION', '_condition_47'): {'delay': 1, 'dep_type': 'rmt_match'},
183 |  ('rid_ACTION', '_condition_50'): {'delay': 1, 'dep_type': 'rmt_match'},
184 |  ('rid_ACTION', '_condition_51'): {'delay': 1, 'dep_type': 'rmt_match'},
185 |  ('rid_ACTION', 'egress_bd_map_MATCH'): {'delay': 1, 'dep_type': 'rmt_match'},
186 |  ('rid_ACTION', 'egress_bd_stats_MATCH'): {'delay': 1,
187 |                                            'dep_type': 'rmt_match'},
188 |  ('rid_ACTION', 'egress_filter_ACTION'): {'delay': 1,
189 |                                           'dep_type': 'rmt_action'},
190 |  ('rid_ACTION', 'egress_port_mapping_ACTION'): {'delay': 1,
191 |                                                 'dep_type': 'rmt_action'},
192 |  ('rid_ACTION', 'egress_vlan_xlate_MATCH'): {'delay': 1,
193 |                                              'dep_type': 'rmt_match'},
194 |  ('rid_ACTION', 'replica_type_MATCH'): {'delay': 1, 'dep_type': 'rmt_match'},
195 |  ('rid_ACTION', 'rewrite_ACTION'): {'delay': 1, 'dep_type': 'rmt_action'},
196 |  ('rid_MATCH', 'rid_ACTION'): {'delay': 9, 'dep_type': 'new_match_to_action'},
197 |  ('smac_rewrite_MATCH', 'smac_rewrite_ACTION'): {'delay': 9,
198 |                                                  'dep_type': 'new_match_to_action'},
199 |  ('vlan_decap_ACTION', 'egress_vlan_xlate_ACTION'): {'delay': 1,
200 |                                                      'dep_type': 'rmt_action'},
201 |  ('vlan_decap_MATCH', 'vlan_decap_ACTION'): {'delay': 9,
202 |                                              'dep_type': 'new_match_to_action'}}
203 | 


--------------------------------------------------------------------------------