-
Category : VHDL-FPGA-Verilog
Tags :
- Update : 2012-11-26
- Size : 2kb
- Downloaded ：0次
- Author ：zhouk*****
- About ：
Nobody
- PS : If download it fails, try it again. Download again for free!
Introduction - If you have any usage issues, please Google them yourself
Given a scheduling problem with the operation period, n = 5, (p1, p2, p3, p4, p5) = (6,3,4,8,5), (t1, t2, t3, t4, t5) = (2,1,2,1,1), (d1, d2, d3, d4, d5) = (3,1,4,2,4), seeking to make a total fine of application FIFOBB the smallest possible number of job set J, requirements: to achieve the scheduling problem instances of different operating solving the problem instance of the input data is stored in the case.txt file。
Packet file list
(Preview for download)
paixu\case.txt
.....\kc.c
paixu
Related instructions
- We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
- The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
- Please use Winrar for decompression tools
- If download fail, Try it againg or Feedback to us.
- If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
- Before downloading, you can inquire through the uploaded person information