How JustAnswer Works:
  • Ask an Expert
    Experts are full of valuable knowledge and are ready to help with any question. Credentials confirmed by a Fortune 500 verification firm.
  • Get a Professional Answer
    Via email, text message, or notification as you wait on our site.
    Ask follow up questions if you need to.
  • 100% Satisfaction Guarantee
    Rate the answer you receive.
Ask Mr. Gregory White Your Own Question
Mr. Gregory White
Mr. Gregory White, Professor
Category: Homework
Satisfied Customers: 5240
Experience:  M.A., M.S. Education / Educational Administration
46856550
Type Your Homework Question Here...
Mr. Gregory White is online now
A new question is answered every 9 seconds

Write a scheduling simulator which tests the effectiveness

Customer Question

Write a scheduling simulator which tests the effectiveness of 1) first-come-first-served, 2) round-robin, and 3) longest-job-first.  The program should read a list of integers from a file.  Each entry represents the duration of the associated process in time quanta.  Each process is assumed to enter the system on the quanta equal to its position in the file.  Assume 1<= N <= 16 processors (cores) in powers of 2.  The OS should stop accepting new processes when the number of processes in the system reaches M.  What M produces the most effective scheduling?  How was effectiveness determined?  Document your program with comments. Write a report about you code, the results, and your experiences.  Include information about how to compile, link, and execute your program.  Include screen captures showing the compilation and execution of your code.  Upload your code, the results file, and your report to eLearning.
Submitted: 1 year ago.
Category: Homework
Expert:  Mr. Gregory White replied 1 year ago.
THIS ANSWER IS LOCKED!

You need to spend $3 to view this post. Add Funds to your account and buy credits.

Related Homework Questions