GitHub / jcksber / CMU_15-418_hw3

Parallel Computer Architecture and Programming - Assignment 3: Parallel VLSI Wire Routing via OpenMP. Given input files (format shown below), we route the optimal pathes that each wire should take on the (given) 2D grid, using Manhattan-style routes. In this exercise, an "optimal" solution is one where the fewest wires intersect at the same position on the grid.

JSON API: https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jcksber%2FCMU_15-418_hw3

Topics: openmp-parallelization, paragraph

Files

No dependencies found