Chip Multiprocessors (CMPs)  
REST Reliability Estimation for CMPs This is a "pushbutton" tool for the estimation of lifetime reliability of networkonchip based chip multiprocessors. The tool integrates gem5 fullsystem simulator, McPAT power calculator, HotSpot thermal simulator, Monte Carlo algorithm for MTTF computation, and required scripts (gem5 to mcpat, mcpat to hotspot). Currently it supports TDDB and NBTI aging failure mechanisms. 

NetworkonChip (NoC)  

REMNOC Remapping
for NoC This tool implements an efficient bipartitematching based heuristic for application remapping to facilitate faulttolerance against processing element (PE) failures. It also includes a simulated annealing based implementation for comparison purposes. 
ReliableNOC Energy and
reliabilityaware mapping for regular NoC Branchandbound (BB) algorithm to solve the problem of energy and reliabilityaware mapping for regular NoCs. Reliability is estimated by an efficient Monte Carlo algorithm based on the destruction spectrum of the network. The tool is developed on top of "nocmap 1.2" from CMU. 


VNOC 2.0 Versatile
NoC simulator This is a flexible tracedriven cycleaccurate simulator for homogeneous NoCs. It has integrated Orion 2 power model as well as a simple GUI, useful for debugging and displaying routers congestion. In addition, it has frequency throttle and frequency boost based DVFS (dynamic voltage and frequency scaling) implemented at router level. It is meant to be used as either an NoC simulation tool or a platform for implementing and investigating DVFS ideas. 

VNOC3 VNOC
based framework for 3D NoC architectures This is a software framework to support the exploration of 3D NoC architectures with two and three layers: first and third layers host irregular floorplans and the middle layer is dedicated to implementing the communication infrastructure as a regular NoC. 

HNOC Heterogeneous
(or irregular) NoC topology synthesis Custom NoC topology synthesis tool. Main steps: simulated annealing based floorplanning (B*tree representation), bipartitematching based routers assignment, multicommodity flow based routing paths calculation (congestion minimization), and VNOC simulation (latency estimation). 
Power systems  
proNERDS (version 1.0): Network reconfiguration
of distribution systems Efficient network reconfiguration of distribution systems for loss minimization. It is based on a minimumcost maximumflow algorithm. The tool also includes the famous Baran's reconfiguration algorithm (for comparison purposes) as well as DistFlow loss estimation technique. 

proPART (version 1.0): Extreme event screening for
power systems This tool implements an efficient extreme event screening for power systems. It is based on cutsize and powerimbalance oriented partitioning. 


proDIRES (version 1.0): Minimum set of directional
relays This program implements a deterministic algorithm for the determination of the minimum break point set (MBPS) of directional relay networks based on ktrees of the network graphs. 


VLSI and FPGA circuits  
VPRGR
Net reordering and
multicommodity flow based global routing for FPGAs This is an enhanced routing algorithm implemented on top of the VPR 4.3 tool. It changes the order in which nets are rippedup and rerouted. Cost calculation is altered during wave expansions for twopin nets based on the global routing solution obtained by solving an equivalent multicommodity flow problem. 

parallelVPR Parallel placement for
FPGAs This is the multithreaded version of the simulated annealing based placement for FPGAs of VPR. The archive also includes all 20 testcases of VPR 4.3, and the largest testcases of VPR 5.0. 

TPR Threedimensional Place and Route for FPGAs This is a complete placement and routing tool for 3D FPGA architectures. The placer is partitioning based while the router is the 3D adaptation of the VPR 2D router. 
MCMF4 
Minimumcost
maximumflow This is an adapted version of the EdmondsKarp relabelling mcmf algorithm [1], originally implemented by Igor Naverniouk. This adapted version allocates memory dynamically in order to use memory as needed. [1] J. Edmonds, R.M. Karp, "Theoretical Improvements in Algorithmic Efficieincy for Network Flow Problems," J. ACM, vol. 19, pp. 248264, 1972. 
CS2 
Minimumcost
maximumflow This is a "ported to C++" version of the famous scaling pushrelabel CS2 mcmf algorithm of A.V. Goldberg [1]. This C++ implementation is developed from the original C code. [1] A.V. Goldberg, "An Efficient Implementation of a Scaling MinimumCost Flow Algorithm," J. Algorithms, vol. 22, pp. 129, 1997. 
MCF 
Multicommodity
flow This is an efficient C++ implementation of a polynomial time approximation algorithm [1]. It provides a clean and simple interface (for easy integration in bigger projects) for specifying the network (or graph) and the supplies and demands. [1] G. Karakostas, "Faster approximation schemes for fractional multicommodity flow problems," ACM/SIAM SODA, pp. 166173, 2002. 