代写COMP604 Operating Systems Assignment 2代做留学生SQL语言

COMP604 Operating Systems

Assignment 2

Deadline: 4 October 2024, 9:00pm

This is an individual assignment. You must submit your own work and you are solely responsible for your submission. Make sure you understand what are required for each question. There are 3 questions in this assignment.

This assignment will contribute 40% towards your overall course marks.

Question 1: Page Replacement Algorithms (Max Mark: 12 / 100)

Consider the following page reference string:

7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1

(a) Assuming demand paging with three available frames, how many page faults would occur for the following replacement algorithms? Complete the following diagrams below to show your workings.

• LRU replacement

• FIFO replacement

• Optimal replacement (OPT)

LRU:

FIFO:

OPT:

(b) Now assuming demand paging with four available frames, how many page faults would occur for the following replacement algorithms?

LRU:

FIFO:

OPT:

Submission Requirement: Submit your answer with your workings in a Microsoft Word or PDF file named Assign2-Q1-.docx or Assign2-Q1-.pdf where is your student ID number. Note that answers not supported with workings will not receive any mark.

Question 2: Memory Management (Max Mark: 20 / 100)

It is sometimes useful to know which pages in a user program’s virtual address space have been accessed (read or write or both). This assignment requires you to write a system call for xv6 that checks which page in a process’s virtual address space has been accessed. Note that a good understanding of Task 6.2 will be helpful. The kernel function ptableprint() could be useful for debugging the code for this assignment. Therefore you may want to use the same copy of xv6 that you have used for Task 6.2 for this question.

Task: Write a system call named pageAccess() that will modify a bitmap that indicates which of the 64 physical memory pages have been accessed. The function prototype of this system call for user programs will be:

int pageAccess(char* buf, unsigned int npages, unsigned int* bmp);

This function should return a negative value if unsuccessful (for any reason). Any other returned value indicates success.

buf points to the start address of the virtual address space that needs to be checked for access.

npages gives the number of pages that should be examined. It should be not larger than 64.

bmp is a pointer to an unsigned integer that acts as a bitmap which indicates if a page has been accessed. Each bit of the unsigned integer corresponds to a page. Since an unsigned integer is 64 bits in size, npages is limited to 64.

As an example, if pages 1, 2, and 30 have been accessed, the lower 32 bits of this integer should have 1’s only for bits 1, 2 and 30 (the rest are 0’s), giving a decimal value of 230+22 +21 = 1073741830 (hexadecimal $40000006) as shown below.

This function should return a negative value if unsuccessful (for any reason). Any other returned value indicates success.

An example test program for your system call has been provided in the file pgaccess_test.c. This program should be compiled as a user program in xv6. It also serves as an example of how the system call is to be used. The bitmap should be set to the above value for this example test program. But you should check that your system call returns the values correspondingly if other pages have been accessed.

A skeleton code of your kernel function of this system call, sys_pageAcess(), can be found in the file sys_pageAccess.c. Note that sys_pageAcess() does not take any arguments. This is because the call to pageAccess is made in the user program (in user mode). Therefore, these arguments cannot be passed directly to a kernel function (in kernel mode) in the usual way. Instead, you will need to access the arguments in sys_pageAcess() using argaddr and argint as demonstrated in the skeleton code. With the bitmap pointer, it is easier to store it in a variable in this function and then copy it to the user space before returning using copyout(). The code to do this has also been provided. The remaining code to implement this kernel function will need to be supplied by you.

Submission Requirements: Clean up (remove) all the object files and executable files using the command make clean (in the directory where the Makefile is located). Then, in the parent directory of xv6-riscv, run the tar command to archive the whole xv6- riscv directory (with its sub-directories including user, kernel, and mkfs). Name this tar file q2-.tar where is your student ID.

Question 3: CPU Scheduling Policies (Max Mark: 16 / 100)

(a) Assume that you have the following processes all arriving at time 0:

For each of the following CPU scheduling algorithms, determine the average turnaround time (= finish – arrival time) and average waiting time (time spent waiting for execution).

• First Come First Serve

• Shortest Job First

• Preemptive Priority Scheduling

• Round Robin (assume a quantum of 1 ms)

With the numbers computed, answer the following questions:

• Which of the four algorithms has the shortest wait time?

• Which has the fastest average turnaround time?

(b) Repeat part (a) above for the following processes (with different arrival times).

Submission Requirements: Submit your answer with your workings in a Microsoft Word or PDF file named Assign2-Q3-.docx or Assign2-Q3-.pdf where is your student ID number. Note that answers not supported with workings will not receive any mark.

Question 4: CPU Scheduling Implementation (Max Mark: 40 / 100)

In this lab assignment, you will be implementing a Priority Scheduler for xv6. The default process scheduling policy of xv6 is Round Robin. In Lab 7, you have gone through the process of implementing a First-Come-First-Served (FCFS) scheduler. You will need to start with the code you have from Lab 7.

Task 1: To implement priority scheduling, you will first need to do the following:

(1) Add a variable in struct proc to indicate the nice level of a process. Use a range of 0 to 20, with 20 being the lowest and 0 the highest priority.

(2) Determine the default priority of a process when it is created and add the code to do so. Usually, it is somewhere in the middle of the range.

(3) Implement a system call:

int setnice(int pid, int n);

to change the nice value of process pid to n. The returned value should be the original nice value of this process.

(4) Implement a second system call:

int getnice(int pid);

that returns the nice value of a process.

Task 2: Add code to implement priority scheduling if PRIORITY (rather than RR or FCFS) is defined. Do not remove the RR and FCFS codes from Lab 7. Use #ifdef to determine which code should be compiled from the compiler command line as you have done in Lab 7. Use schedtest2.c provided to test your implementation.

Task 3: Obtain the average run time, waiting time and sleep times with Round Robin, FCFS, and Priority scheduling for 1, 2, and 3 CPUs. You will be compiling xv6-riscv with, for example,

make qemu SCHEDULER=PRIORITY CPUS=2

for Priority scheduling and 2 CPUs. You should use SCHEDULER=RR and SCHEDULER=FCFS to compile for Round Robin and FCFS respectively (same as what was done in Lab 7).

Tabulate your results and answer the following questions:

(a) Comparing these average timings you have obtained, are they what you would expect?

(b) Provide justifications for your answer to (a) above.

Note that you will need to use the user program schedtest for Round Robin and FCFS, and schedtest2 for Priority scheduling.

Submission Requirements: Clean up (remove) all the object files and executable files using the command make clean (in the directory where the Makefile is located). Then, in the parent directory of xv6-riscv, run the tar command to archive the whole xv6-riscv directory (with its sub-directories including user, kernel, and mkfs). Name this tar file q4-.tar where is your student ID.

The code you added/modified should be documented with appropriate comments.

Your tabulated timing results and answers to the questions should be provided in a Microsoft Word or PDF file separate from the tar file.

Question 5: Pipes (Max Mark: 12 / 100)

This question requires you to implement a user program in xv6-riscv. This program will make use of system calls fork, pipe, read, and write.

Task: Write a user program in xv6, name it pingpong. It should do the following:

(a) Create a child process.

(b) The parent will send an integer to this child process.

(c) Upon receiving this integer, the child process prints its PID followed by the value of the integer it received.

(d) The child process should multiply the received integer by 4 and send the resulting integer back to the parent.

(e) The parent prints its PID followed by the value of the integer it received from the child.

Example of usage:

$ pingpong

4 Integer from parent = 4

3 Integer from child = 16

Requirements: Communication between the parent and child process should be through pipe. Your implementation must only establish a single pipe. Marks could be deducted for lack of comments in your program.

Submission Requirements: Clean up (remove) all the object files and executable files using the command make clean (in the directory where the Makefile is located). Then, in the parent directory of xv6-riscv, run the tar command to archive the whole xv6- riscv directory (with its sub-directories including user, kernel, and mkfs). Name this tar file q5-.tar where is your student ID.




热门主题

课程名

mktg2509 csci 2600 38170 lng302 csse3010 phas3226 77938 arch1162 engn4536/engn6536 acx5903 comp151101 phl245 cse12 comp9312 stat3016/6016 phas0038 comp2140 6qqmb312 xjco3011 rest0005 ematm0051 5qqmn219 lubs5062m eee8155 cege0100 eap033 artd1109 mat246 etc3430 ecmm462 mis102 inft6800 ddes9903 comp6521 comp9517 comp3331/9331 comp4337 comp6008 comp9414 bu.231.790.81 man00150m csb352h math1041 eengm4100 isys1002 08 6057cem mktg3504 mthm036 mtrx1701 mth3241 eeee3086 cmp-7038b cmp-7000a ints4010 econ2151 infs5710 fins5516 fin3309 fins5510 gsoe9340 math2007 math2036 soee5010 mark3088 infs3605 elec9714 comp2271 ma214 comp2211 infs3604 600426 sit254 acct3091 bbt405 msin0116 com107/com113 mark5826 sit120 comp9021 eco2101 eeen40700 cs253 ece3114 ecmm447 chns3000 math377 itd102 comp9444 comp(2041|9044) econ0060 econ7230 mgt001371 ecs-323 cs6250 mgdi60012 mdia2012 comm221001 comm5000 ma1008 engl642 econ241 com333 math367 mis201 nbs-7041x meek16104 econ2003 comm1190 mbas902 comp-1027 dpst1091 comp7315 eppd1033 m06 ee3025 msci231 bb113/bbs1063 fc709 comp3425 comp9417 econ42915 cb9101 math1102e chme0017 fc307 mkt60104 5522usst litr1-uc6201.200 ee1102 cosc2803 math39512 omp9727 int2067/int5051 bsb151 mgt253 fc021 babs2202 mis2002s phya21 18-213 cege0012 mdia1002 math38032 mech5125 07 cisc102 mgx3110 cs240 11175 fin3020s eco3420 ictten622 comp9727 cpt111 de114102d mgm320h5s bafi1019 math21112 efim20036 mn-3503 fins5568 110.807 bcpm000028 info6030 bma0092 bcpm0054 math20212 ce335 cs365 cenv6141 ftec5580 math2010 ec3450 comm1170 ecmt1010 csci-ua.0480-003 econ12-200 ib3960 ectb60h3f cs247—assignment tk3163 ics3u ib3j80 comp20008 comp9334 eppd1063 acct2343 cct109 isys1055/3412 math350-real math2014 eec180 stat141b econ2101 msinm014/msing014/msing014b fit2004 comp643 bu1002 cm2030
联系我们
EMail: 99515681@qq.com
QQ: 99515681
留学生作业帮-留学生的知心伴侣!
工作时间:08:00-21:00
python代写
微信客服:codinghelp
站长地图