routing under constraints
play

Routing under Constraints Alexander Nadel Intel, Israel FMCAD - PowerPoint PPT Presentation

Oct 30, 2023 •251 likes •2.02k views

Routing under Constraints Alexander Nadel Intel, Israel FMCAD Mountain View CA, USA October 4, 2016 Design and Technology Solutions 1 Design and Technology 2 "PhysicalDesign" by Linear77 - Own work. Licensed under CC BY 3.0

  1. SAT Solver ’ s Internals Decision Strategy (Conflict-driven) Design and Technology 20 Solutions 43

  2. SAT Solver ’ s Internals Boolean Constraint Propagation Decision Strategy (Conflict-driven) Design and Technology 20 Solutions 44

  3. SAT Solver ’ s Internals Boolean Constraint Propagation Decision Strategy Conflict Analysis & (Conflict-driven) Learning Design and Technology 20 Solutions 45

  4. SAT Solver ’ s Internals Boolean Constraint Propagation No conflict Decision Strategy Conflict Analysis & (Conflict-driven) Learning Backtracking Design and Technology 20 Solutions 46

  5. SAT Solver ’ s Internals Boolean Constraint Propagation No conflict Decision Strategy Conflict Analysis & (Conflict-driven) Learning Backtracking Design and Technology 20 Solutions 47

  6. SAT Solver ’ s Internals Boolean Constraint Propagation No conflict Decision Strategy Conflict Analysis & (Conflict-driven) Learning Time-to- restart? Backtracking Restarts Design and Technology 20 Solutions 48

  7. SAT  DRouter through Surgery Design and Technology 21 Solutions 49

  8. SAT  DRouter Boolean Constraint Propagation No conflict Decision Strategy Conflict Analysis & (Conflict-driven) Learning Time-to- restart? Backtracking Restarts Design and Technology 22 Solutions 50

  9. SAT  DRouter Boolean Constraint Propagation No conflict Conflict Analysis & Learning Time-to- restart? Backtracking Restarts Design and Technology 22 Solutions 51

  10. SAT  DRouter Boolean Constraint Propagation No conflict Conflict Analysis & A*-based Router Learning Time-to- restart? Backtracking Restarts Design and Technology 22 Solutions 52

  11. SAT  DRouter Boolean Constraint Propagation No conflict Conflict Analysis & A*-based Router Learning Graph-based Time-to- Learning restart? Backtracking Restarts Design and Technology 22 Solutions 53

  12. SAT  DRouter Boolean Constraint Propagation No conflict Conflict Analysis & A*-based Router Learning Graph-based Learning Backtracking Design and Technology 22 Solutions 54

  13. SAT  DRouter Boolean Constraint Propagation No conflict Conflict Analysis & A*-based Router Learning Graph-based Time-to- Time-to-flip? Learning restart? Backtracking Net Net Swapping Restarting Design and Technology 22 Solutions 55

  14. DRouter Boolean Constraint Propagation No conflict Decision Strategy Conflict Analysis & A*-based Router (Conflict-driven) Learning Graph-based Time-to- Time-to-flip? Learning restart? Backtracking Net Net Swapping Restarting Design and Technology 23 Solutions 56

  15. DRouter Encoded constraints: Boolean Constraint Propagation No conflict Decision Strategy Conflict Analysis & A*-based Router (Conflict-driven) Learning Graph-based Time-to- Time-to-flip? Learning restart? Backtracking Net Net Swapping Restarting Design and Technology 23 Solutions 57

  16. DRouter Encoded constraints: 1. Edge consistency • e=(v,u) is active  • v and u are active • nid(v) = nid(u) Boolean Constraint Propagation No conflict Decision Strategy Conflict Analysis & A*-based Router (Conflict-driven) Learning Graph-based Time-to- Time-to-flip? Learning restart? Backtracking Net Net Swapping Restarting Design and Technology 23 Solutions 58

  17. DRouter Encoded constraints: 1. Edge consistency • e=(v,u) is active  • v and u are active • nid(v) = nid(u) Boolean Constraint Propagation 2. User-provided constraints modelling design rules No conflict Decision Strategy Conflict Analysis & A*-based Router (Conflict-driven) Learning Graph-based Time-to- Time-to-flip? Learning restart? Backtracking Net Net Swapping Restarting Design and Technology 23 Solutions 59

  18. DRouter Encoded constraints: 1. Edge consistency • e=(v,u) is active  • v and u are active • nid(v) = nid(u) Boolean Constraint Propagation 2. User-provided constraints modelling design rules That ’ s it! What about disconnected No conflict Decision Strategy Conflict Analysis & terminals??? A*-based Router (Conflict-driven) Learning Routing correctness is guaranteed by the decision strategy! Graph-based Time-to- Time-to-flip? Learning restart? Backtracking Net Net Swapping Restarting Design and Technology 23 Solutions 60

  19. 1-Net Example Boolean Constraint Propagation No conflict Decision Strategy Conflict Analysis & A*-based Router (Conflict-driven) Learning Graph-based Time-to- Time-to-flip? Learning restart? Backtracking Net Net Swapping Restarting Design and Technology 24 Solutions 61

  20. 1-Net Example Boolean Constraint Propagation No conflict Decision Strategy Conflict Analysis & A*-based Router (Conflict-driven) Learning Graph-based Time-to- Time-to-flip? Learning restart? Backtracking Net Net Swapping Restarting Design and Technology 24 Solutions 62

  21. 1-Net Example s: (0, 0) 2 t: (3, 0) ¬( 1,0)  ¬( 2,0) ¬( 1,0)  ¬( 1,1) Design rules 1 ¬( 3,2)  ¬( 3,1) 0 1 2 3 Design and Technology Solutions 63

  22. 1-Net Example σ (sugg.) s: (0, 0) 2 t: (3, 0) ¬( 1,0)  ¬( 2,0) ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) Initial path: A* from s->t 0 1 2 3 Path Suggestion (not an actual SAT decision) Design and Technology Solutions 64

  23. 1-Net Example σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) Initial path: SAT A* from s->t Decision 0 1 2 3 Activate edge in sugg. Design and Technology Solutions 65

  24. 1-Net Example σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) Initial path: x A* from s->t 0 1 2 3 Activate edge in sugg. σ - violation Design and Technology Solutions 66

  25. 1-Net Example σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) Initial path: x A* from s->t 0 1 2 3 Activate edge in sugg. σ - violation A* search for new σ Design and Technology Solutions 67

  26. 1-Net Example σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) Initial path: x A* from s->t 0 1 2 3 Activate edge in sugg. Path found A* search for new σ Design and Technology Solutions 68

  27. 1-Net Example σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) Initial path: Repeat x A* from s->t 0 1 2 3 Activate edge in sugg. No  -violation Path found no Target is part of path? A* search for new σ Design and Technology Solutions 69

  28. 1-Net Example BCP σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) Initial path: Repeat x A* from s->t 0 1 2 3 Activate edge in sugg. No  -violation Path found no Target is part of path? A* search for new σ Design and Technology Solutions 70

  29. 1-Net Example BCP σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) Initial path: Repeat x A* from s->t 0 1 2 3 Activate edge in sugg. No  -violation Path found no Target is part of path? A* search for new σ Design and Technology Solutions 71

  30. 1-Net Example σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) Initial path: Repeat x A* from s->t 0 1 2 3 Activate edge in sugg. σ - violation No  -violation no Target is part of path? A* search for new σ Design and Technology Solutions 72

  31. 1-Net Example σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) Initial path: Repeat x A* from s->t 0 1 2 3 Activate edge in sugg. No  -violation σ - violation no Target is part of path? A* search for new σ Design and Technology Graph conflict (s and t can ’ t be connected) Solutions 73

  32. 1-Net Example σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) Initial path: Repeat x A* from s->t 0 1 2 3 Activate edge in sugg. No  -violation Add conflicting clause: vertex cut (2,0)  (3,1) σ - violation no Target is part of path? A* search for new σ Design and Technology Graph conflict (s and t can ’ t be connected) Solutions 74

  33. 1-Net Example σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) Initial path: Repeat x A* from s->t 0 1 2 3 Activate edge in sugg. 1UIP conflict clause: (2,0)  ¬( 3,2) No  -violation Add conflicting clause: vertex cut (2,0)  (3,1) σ - violation no Target is part of path? A* search for new σ Design and Technology Graph conflict (s and t can ’ t be connected) Solutions 75

  34. 1-Net Example σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) Initial path: Repeat x A* from s->t 0 1 2 3 Activate edge in sugg. 1UIP conflict clause: (2,0)  ¬( 3,2) No  -violation Add conflicting clause: vertex cut (2,0)  (3,1) σ - violation no Target is part of path? A* search for new σ Design and Technology Graph conflict (s and t can ’ t be connected) Solutions 76

  35. 1-Net Example x σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) (2,0)  ¬( 3,2) Initial path: Repeat x A* from s->t 0 1 2 3 Activate edge in sugg. 1UIP conflict clause: (2,0)  ¬( 3,2) No  -violation Add conflicting clause: vertex cut (2,0)  (3,1) σ - violation no Target is part of path? A* search for new σ Learn & Backtrack Design and Technology Graph conflict (s and t can ’ t be connected) Solutions 77

  36. 1-Net Example x σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) (2,0)  ¬( 3,2) Initial path: Repeat x A* from s->t 0 1 2 3 Activate edge in sugg. No σ -violation σ - violation no Target is part of path? A* search for new σ Learn & Backtrack Design and Technology Solutions Graph conflict 78

  37. 1-Net Example x σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) (2,0)  ¬( 3,2) Initial path: Repeat x A* from s->t 0 1 2 3 Activate edge in sugg. No σ -violation σ - violation no Target is part of path? A* search for new σ Learn & Backtrack Design and Technology Solutions Graph conflict 79

  38. 1-Net Example x σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) (2,0)  ¬( 3,2) Initial path: Repeat x A* from s->t 0 1 2 3 Activate edge in sugg. No σ -violation σ - violation no Target is part of path? A* search for new σ (yes!) Learn & Backtrack Design and Technology DONE! Solutions Graph conflict 80

  39. 1-Net Example x σ (sugg.) s: (0, 0) 2 t: (3, 0) Real path ¬( 1,0)  ¬( 2,0) x ¬( 1,0)  ¬( 1,1) 1 ¬( 3,2)  ¬( 3,1) (2,0)  ¬( 3,2) Initial path: Repeat x A* from s->t 0 1 2 3 Activate edge in sugg. Result: Path that No σ -violation σ - violation Path found no follows Target is part of path? A* search constraints! for new σ (yes!) Learn & Backtrack Design and Technology DONE! Solutions Graph conflict 81

  40. Multiple Nets Handling Design and Technology 30 Solutions 82

  41. Multiple Nets Handling • Route the nets one-by-one – Order is critical! Design and Technology 30 Solutions 83

  42. Multiple Nets Handling • Route the nets one-by-one – Order is critical! Design and Technology 30 Solutions 84

  43. Multiple Nets Handling • Route the nets one-by-one – Order is critical! Design and Technology 30 Solutions 85

  44. Multiple Nets Handling • Route the nets one-by-one – Order is critical! • Example Order 1: – Red Design and Technology 30 Solutions 86

  45. Multiple Nets Handling • Route the nets one-by-one – Order is critical! • Example Order 1: – Red Design and Technology 30 Solutions 87

  46. Multiple Nets Handling • Route the nets one-by-one – Order is critical! • Example Order 1: – Red Design and Technology 30 Solutions 88

  47. Multiple Nets Handling • Route the nets one-by-one – Order is critical! • Example Order 1: – Red Design and Technology 30 Solutions 89

  48. Multiple Nets Handling • Route the nets one-by-one – Order is critical! • Example Order 1: – Red • Example Order 2: – Red Design and Technology 30 Solutions 90

  49. Multiple Nets Handling • Route the nets one-by-one – Order is critical! • Example Order 1: – Red • Example Order 2: – Red Design and Technology 31 Solutions 91

  50. Multiple Nets Handling • Route the nets one-by-one – Order is critical! • Example Order 1: – Red • Example Order 2: – Red Design and Technology 31 Solutions 92

  51. Multiple Nets Handling • Route the nets one-by-one – Order is critical! • Example Order 1: – Red • Example Order 2: – Red Design and Technology 31 Solutions 93

  52. Multiple Nets Handling - Graph conflict - black is blocked - Early conflict detection - Check for graph conflicts • Route the nets one-by-one after routing each terminal – Order is critical! - Learn a conflict clause & re-route • Example Order 1: – Red • Example Order 2: – Red Design and Technology 31 Solutions 94

  53. Multiple Nets Handling • Route the nets one-by-one – Order is critical! • Example Order 1: – Red • Example Order 2: – Red Design and Technology 31 Solutions 95

  54. Multiple Nets Handling • Route the nets one-by-one – Order is critical! • Example Order 1: – Red • Example Order 2: – Red Design and Technology 31 Solutions 96

  55. Multiple Nets Handling • Route the nets one-by-one – Order is critical! • Example Order 1: – Red • Example Order 2: – Red Design and Technology 31 Solutions 97

  56. Multiple Nets Handling • Route the nets one-by-one – Order is critical! • Example Order 1: – Red • Example Order 2: – Red Design and Technology 31 Solutions 98

  57. Multiple Nets Handling • Route the nets one-by-one – Order is critical! • Example Order 1: – Red • Example Order 2: – Red Design and Technology 31 Solutions 99

  58. Multiple Nets Handling • Route the nets one-by-one – Order is critical! • Example Order 1: – Red • Example Order 2: – Red Design and Technology 31 Solutions 100

Recommend

An Algorithm for Routing With Capacitance/Distance Constraints for Clock Distribution in

An Algorithm for Routing With Capacitance/Distance Constraints for Clock Distribution in

An Algorithm for Routing With Capacitance/Distance Constraints for Clock Distribution in Microprocessors Rupesh S. Shelar Technology & Manufacturing Group Intel Corporation, Hillsboro, OR March 31 st 2009, ISPD 2009, San Diego Objective

936 views • 59 slides
Issues: Routing in Ad-hoc Networks Mobility Bandwidth constraint Error-prone and

Issues: Routing in Ad-hoc Networks Mobility Bandwidth constraint Error-prone and

Issues: Routing in Ad-hoc Networks Mobility Bandwidth constraint Error-prone and shared channel Location-dependent contention Other resource constraints TDDD36: Routing Issues: Multicas routing ... Robustness Efficiency

1.36k views • 81 slides
Routing, Geometric and Regulations Constraints Nicolas Beldiceanu SICS Lgerhyddsvgen 5

Routing, Geometric and Regulations Constraints Nicolas Beldiceanu SICS Lgerhyddsvgen 5

Routing, Geometric and Regulations Constraints Nicolas Beldiceanu SICS Lgerhyddsvgen 5 SE-75237 Uppsala, Sweden (nicolas@sics.se) The cycle constraint

1.13k views • 86 slides
4.3 Routing protocols We first look at Routing Tables and routing mechanisms. A routing table has

4.3 Routing protocols We first look at Routing Tables and routing mechanisms. A routing table has

4.3 Routing protocols We first look at Routing Tables and routing mechanisms. A routing table has columns for the destination network (or hosts) with the corresponding cost and the next router address to reach a destination. Additional

1.08k views • 84 slides
Global Constraints (continued) Nicolas Beldiceanu SICS Lgerhyddsvgen 5 SE-75237 Uppsala,

Global Constraints (continued) Nicolas Beldiceanu SICS Lgerhyddsvgen 5 SE-75237 Uppsala,

Global Constraints (continued) Nicolas Beldiceanu SICS Lgerhyddsvgen 5 SE-75237 Uppsala, Sweden (nicolas@sics.se) Describe other global constraints Except resource scheduling, routing, geometric, regulation and optimisation constraints

1.24k views • 87 slides
Landmark Landmark-based routing based routing Landmark Landmark-based routing based routing

Landmark Landmark-based routing based routing Landmark Landmark-based routing based routing

Landmark Landmark-based routing based routing Landmark Landmark-based routing based routing [Kleinberg04] J. Kleinberg, A. Slivkins, T. Wexler. Triangulation and Embedding using Small Sets of Beacons. Proc. 45th IEEE Symposium on Foundations of

450 views • 32 slides
Scalable Routing Outline Routing Algorithms Scalability 1 Overview Forwarding vs Routing

Scalable Routing Outline Routing Algorithms Scalability 1 Overview Forwarding vs Routing

Scalable Routing Outline Routing Algorithms Scalability 1 Overview Forwarding vs Routing forwarding: to select an output port based on destination address and routing table routing: process by which routing table is built

543 views • 13 slides
1 Routing Table Routing Table Destination network Next router

1 Routing Table Routing Table Destination network Next router

Lecture 12. Lecture 12. Introduction to Introduction to IP Routing IP Routing Giuseppe Bianchi Why introduction? Why introduction? Routing: very complex issue need in-depth study entire books on routing our scope: give a

552 views • 19 slides
Interplay between routing and forwarding routing algorithm Routing Algorithms and Routing local

Interplay between routing and forwarding routing algorithm Routing Algorithms and Routing local

Interplay between routing and forwarding routing algorithm Routing Algorithms and Routing local forwarding table header value output link in the Internet 0100 3 0101 2 0111 2 1001 1 value in arriving packets header 1 0111 2 3

403 views • 8 slides
Ad Hoc Wireless Routing CS 218- Fall 2003 Wireless multihop routing challenges Review of

Ad Hoc Wireless Routing CS 218- Fall 2003 Wireless multihop routing challenges Review of

Ad Hoc Wireless Routing CS 218- Fall 2003 Wireless multihop routing challenges Review of conventional routing schemes Proactive wireless routing Hierarchical routing Reactive (on demand) wireless routing Geographic routing

893 views • 60 slides
Routing Algebras What are routing algebras? Created to study properties of routing protocols

Routing Algebras What are routing algebras? Created to study properties of routing protocols

Routing Algebras What are routing algebras? Created to study properties of routing protocols Does the routing protocol converge? Does the routing protocol compute optimal paths? Separates the routing data & algorithm Data

326 views • 11 slides
CS 557 ARPANet Routing Algorithms An Overview of the New Routing Algorithm for the ARPANET J.

CS 557 ARPANet Routing Algorithms An Overview of the New Routing Algorithm for the ARPANET J.

CS 557 ARPANet Routing Algorithms An Overview of the New Routing Algorithm for the ARPANET J. McQuillan, I. Richer, and E. Rosen, 1979 The Revised ARPANET Routing Metric Atul Khanna and John Zinky, 1989 Spring 2013 Routing Algorithm Basics

894 views • 29 slides
Requisition Routing In depth look into the structure of Requisition Routing Goals for this

Requisition Routing In depth look into the structure of Requisition Routing Goals for this

Requisition Routing In depth look into the structure of Requisition Routing Goals for this Presentation 1. Recreating manual routing and approval processes in QCC 2. Understanding the relationship between the various routing master files 3.

552 views • 33 slides
CS 557 Landmark Routing The Landmark Hierarchy: A New Hierarchy For Routing in Very Large

CS 557 Landmark Routing The Landmark Hierarchy: A New Hierarchy For Routing in Very Large

CS 557 Landmark Routing The Landmark Hierarchy: A New Hierarchy For Routing in Very Large Networks Paul Tsuchiya, 1988 Spring 2013 Landmark Routing Objective: Reduce the routing table size without increasing path length by a large

458 views • 15 slides
Internet routing is based on routing protocols that collect the input data No off-line route

Internet routing is based on routing protocols that collect the input data No off-line route

Introduction to Routing in Internet Internet basics IPv4 and ICMP Internet Addressing ARP - Address Resolution Protocol Routing Information (Distance Vector ) Protocol Principles 3-1 S-38.121 S-02 Rka, NB Internet routing is based on

214 views • 18 slides
NDN ROUTING SECURITY Lan Wang, Beichuan Zhang 2/9/2015 www.named-data.net 2 Routing Security

NDN ROUTING SECURITY Lan Wang, Beichuan Zhang 2/9/2015 www.named-data.net 2 Routing Security

NDN ROUTING SECURITY Lan Wang, Beichuan Zhang 2/9/2015 www.named-data.net 2 Routing Security Required: authenticity and integrity of routing information o Link state routing: LSAs are originated by the routing process authorized to do so

345 views • 10 slides
What is the difference between routing and forwarding? Routing protocols: Implemented

What is the difference between routing and forwarding? Routing protocols: Implemented

Routing What is the difference between routing and forwarding? Routing protocols: Implemented distributed algorithms (scalability) Routers should have mutually consistent view of the network. Can be classified into: Intradomain

510 views • 5 slides
Routing In Ad Hoc Networks 1. Introduction to Ad-hoc networks 2. Routing in Ad-hoc networks 3.

Routing In Ad Hoc Networks 1. Introduction to Ad-hoc networks 2. Routing in Ad-hoc networks 3.

Routing In Ad Hoc Networks 1. Introduction to Ad-hoc networks 2. Routing in Ad-hoc networks 3. Proactive routing protocols DSDV 4. Reactive routing protocols DSR, AODV 5. Non-uniform routing protocols ZRP, CEDAR 6. Other

392 views • 22 slides
Chapter 1: Constraints What are they, what do they do and what can I use them for. 1

Chapter 1: Constraints What are they, what do they do and what can I use them for. 1

Constraint Logic Programming Chapter 1: Constraints What are they, what do they do and what can I use them for. 1 Constraints What are constraints? Modelling problems Constraint solving Tree constraints Other constraint

205 views • 19 slides
Advanced routing topics Tuomas Launiainen Suboptimal routing Routing trees Measurement of

Advanced routing topics Tuomas Launiainen Suboptimal routing Routing trees Measurement of

Advanced routing topics Tuomas Launiainen Suboptimal routing Routing trees Measurement of routing trees Adaptive routing Problems Fault-tolerant tables Point-of-failure rerouting Point-of-failure shortest path rerouting Correctness

856 views • 46 slides
Grid Routing Introduction In the VLSI design cycle, routing follows cell placement .

Grid Routing Introduction In the VLSI design cycle, routing follows cell placement .

Grid Routing Introduction In the VLSI design cycle, routing follows cell placement . During routing, precise paths are defined on the layout surface, on which conductors carrying electrical signals are run. Routing takes up almost 30%

569 views • 43 slides
Yoshimura-Kuh Channel Routing Perform YK channel routing with K = 100 TOP =

Yoshimura-Kuh Channel Routing Perform YK channel routing with K = 100 TOP =

Yoshimura-Kuh Channel Routing Perform YK channel routing with K = 100 TOP = [1,1,4,2,3,4,3,6,5,8,5,9] BOT = [2,3,2,0,5,6,4,7,6,9,8,7] Practical Problems in VLSI Physical Design YK Channel Routing (1/16) Constrained Left-Edge Algorithm

184 views • 16 slides
A Branch-and-Price Approach for a Ship Routing Problem with Multiple Products and Inventory

A Branch-and-Price Approach for a Ship Routing Problem with Multiple Products and Inventory

A Branch-and-Price Approach for a Ship Routing Problem with Multiple Products and Inventory Constraints Rutger de Mare 1 Dennis Huisman 2,3 1. ORTEC, Gouda 2. Econometric Institute and ECOPT, Erasmus Univ. Rotterdam 3. Dept. of Logistics,

242 views • 21 slides
Routing Session 14 INST 346 Technologies, Infrastructure and Architecture Goals for Today

Routing Session 14 INST 346 Technologies, Infrastructure and Architecture Goals for Today

Routing Session 14 INST 346 Technologies, Infrastructure and Architecture Goals for Today Routing Routing Routing Internet approach to scalable routing aggregate routers into regions known as autonomous systems (AS)

650 views • 40 slides

More recommend