- Description:
- N jobs are to be assigned to N workers, the JAM will find an optimal solution where the total cost is minimized.
- We will implement N=8 JAM in the Final Project.
- The input will be 64 cycles the cost of each job by different workers will be given each cycle.
- Input:
- clk, rst_n, in_valid
- [7-1:0] in_cost
- Output:
- out_valid
- [4-1:0] out_job
- [10-1:0] out_cost
- Hungarian Method: Hungarian Method using Python Hungarian Method explained