Programming作业代写 Assignment代写 Code代写

CIS 657 Programming Assignment 1

Programming作业代写 Create your Assignment 1 document (doc or pdf), follow the instruction and then submit it to the Turnitin link on the blackboard.

Submit two files:

• Create your Assignment 1 document (doc or pdf), follow the instruction and then submit it to the Turnitin link on the blackboard (under Assignments).Programming作业代写
  • You can submit multiple times before the due.
  • After the due, you cannot resubmit newer version.
• Do a “make clean” in code/build.linux, then compress your Nachos folder on the VM, download the compressed file into your local machine and name the compressed file zip (Note: Zip only!!). Submit the zipped file to the Assignment Code Submission link of Blackboard.
• You have to make sure your submission is correctly made
  • If you don’t have a confirm email, you should check again.
• You should raise an appeal within a week after grade is posted.

Due: March  29 (Friday, end of the day)

Late submission: you will have 2^d penalty of your late days.

Follow the Lab1 instruction and create a new fresh Nachos folder.

Overview

The original distribution of Nachos uses the round-robin scheduling of 100 time-ticks. In this project you are asked to implement the multiple level feedback queue scheduling with your own simulated I/O. You need to implement at least 4 levels of ready queues with different amount of time quantum. You need to add new flags such as “-q1” or “-q2” that are used to set the size of time quantum for each level of ready queue.

Task 1 (40pts): You need to design your own I/O simulating input(read)/output(write) operations. These IO operation routines can be used by Nachos threads.Programming作业代写

• Write operation: when a thread calls this routine, a new I/O request event is created and set with random amount of waiting time for blocked state. Then the event will be added to the internal I/O queue. Afterwards this request blocks the calling thread (current thread) until your output message is displayed on the screen.
• Read operation: like Write operation, this also creates and sets a new I/O request event with random amount of waiting time. Then the event will be added to the internal I/O queue. The calling thread will be blocked until the parameter of buffer is filled with your own content, and at this moment, you can display a simple message.
• Write waiting(blocking) time << Read waiting(blocking) time
• I/O request event structure: you can define your own data structure including I/O type, calling thread, buffer holding data between call and completion of the request, parameters used by I/O routines, completion time (decided by random waiting time), and so on.
• I/O request queue: you can keep this as a Kernel’s internal I/O event queue using sorted list by the completion time. You can simulate I/O events using Alarm.
• I/O Simulation can be periodically invoked by Alarm. If completion time of a pending I/O is less than or equal to current time, it raises I/O interrupt and then I/O interrupt handler will be invoked.

• I/O interrupt handler: You need to implement your own simulated I/O interrupt. When a I/O completes (simulated with Alarm), I/O interrupt is raised.

  • Write operation: this interrupt indicates that the request is done and requesting thread should be inserted into a corresponding ready queue because I/O request increments the priority of the thread. You have to make sure that the thread state as Ready-to-Run.
  • Read operation: this interrupt handler will copy your content to the calling thread’s buffer. The thread should be inserted into a corresponding ready queue because I/O request increments the priority of the thread. You have to make sure that the thread state as Ready-to-Run.
  • At the end of interrupt handling, there should be scheduling.
  • You need to display appropriate messages.
• Kernel can have a new simulated I/O component, so thread functions can call the simulated I/O operations and they will be simulated.
• Implement your design of simulated I/O in threads directory and update Makefile.

Task 2 (40pts): Make your Nachos system run with MLFQ scheduling. Each thread will take the CPU according to its priority. In this assignment, every thread starts with the highest priority.Programming作业代写

• Multi-level Feedback Queue scheduler
  • Every thread begins with the highest priority.
  • If a thread calls one of simulated I/O operations (read/write) before time quantum, it will be blocked (with random amount of time) and gives up the CPU.
  • After the random amount of time, the simulated I/O interrupt is invoked, the blocked thread will be ready with a higher priority (if it was already in highest priority, it will have the same priority and) and inserted into the ready queue.
  • In order to avoid starvation, you need to combine your scheduler with aging. If a thread has not been on the CPU for a certain amount of time, increase its priority and move it up to a higher level queue. This waiting time is not related to I/O blocking time.
  • If a time quantum expires, the threads gives up the CPU, its priority will be decremented and inserted into a lower level queue. If the thread was already in the lowest level queue, it will stay at the same queue.
• Add a Nachos flag -q1 xxxxthat sets how long the time quantum will be for each thread at level 1 ready queue.
  • xxxx (q1) < yyyy (q2) < zzzz (q3) < …

Task 3 (20pts): Write your own threadtest.cc to prove your implementation working correctly. Quality of your testing cases will be graded.Programming作业代写

• You need to set random seed (current time is usually used) for simulation.
• You need to create meaningful number (> 10) of Nachos threads in your testing routine.
  • CPU-bound threads, IO-bound threads, mixed
• You need to display meaningful information to prove your scheduling: context switching from expiring time quantum, simulated I/O requests, simulated I/O interrupt; dynamic priority changes with I/O requests and aging.

Your document must include the followings:

• Cover Page
• Disclosure Form
• Design/your solution for each requirement

1. We are looking for your own answers

• Implementation of your solution (Code snippet with good comments)

1. Do not include Nachos original code
2. We want to see your own code/modification
3. Should be text (no image/photo of code)

• Testing
  1. How to run your tests
  2. What each test case is testing (you need to prove your implementation of each requirement in the following output snapshots)
• Output Snapshots

Testing:

We will build and run your Nachos on the VM. You must test your program on the VM and also should provide proper test scenario in your document.Programming作业代写

Grading:

• Syntax/Runtime/Logic Errors with proper Makefile [-50, -15]
• Simulated IO design/class definition/declaration respectively [-40, -10]
• Quality of your report/comments [-20, -5]
• Satisfy all implementation requirements [-50, -5]
• Garbage collection (handle all objects at the end) [-10, -5]
• Appropriate thread manipulation (CPU-bound/IO-bound threads) [-30,-5]
• Input/output design (meaningful messages to prove your implementation) [-30, -10]
• Output(by Students)/Test(by TAs) [-50]

更多其他：代写CS  数据分析代写  Assignment代写  Case study代写  Report代写 计算机论文代写 代写案例 润色修改

合作平台：天才代写 幽灵代写  写手招聘