日本欧洲视频一区_国模极品一区二区三区_国产熟女一区二区三区五月婷_亚洲AV成人精品日韩一区18p

代寫GA.2250、Python/Java程序語言代做

時間:2024-08-14  來源:  作者: 我要糾錯



Programming Assignment #4 (Lab 4): IO Scheduling Professor Hubertus Franke 
Class CSCI-GA.2250-001 Summer 2024 
 
In this lab you will implement and simulate the scheduling and optimization of I/O operations for a hard disk. Applications 
submit their block IO requests (bio) to the IO subsystem [ Block Layer ] (potentially via the filesystem), where they are 
maintained in an IO-queue until the disk device is ready for servicing another request. The IO-scheduler then selects a request 
from the IO-queue and submits it to the disk device. This selection is commonly known as the strategy() routine in 
operating systems and shown in the figure below. On completion, another request can be taken from the IO-queue and 
submitted to the disk. The scheduling policies will allow for some optimization as to reduce disk head movement or overall 
wait time in the system. 
 
The schedulers that need to be implemented are FIFO (N), SSTF (S), LOOK (L), CLOOK (C), and FLOOK (F) 
(the letters in bracket define which parameter must be given in the –s program flag shown below). 
 
You are to implement these different IO-schedulers in C or C++ and submit the source code and Makefile as a *.zip, *.tar or 
*.tar.Z, which we will compile and run. Please test on linserv*.cims.nyu.edu before submission. 
 
 
Invocation is as follows: 
 ./iosched [ –s<schedalgo> | -v | -q | -f ] <inputfile> 
 
Only the “-s” option is required. The default scheduler is fifo is “-s” is not supplied. Options as usual can be in any order. 
The input file is structured as follows: Lines starting with ‘#’ are comment lines and should be ignored. 
Any other line describes an IO operation where the 1
st
 integer is the time step at which the IO operation is issued and the 2
nd
 
integer is the track that is accesses. Since IO operation latencies are largely dictated by seek delay (i.e. moving the head to the 
correct track), we ignore rotational and transfer delays for simplicity. The inputs are well formed. 
 
#io generator 
#numio=32 maxtracks=512 lambda=10.000000 
1 339 
131 401 
 
We assume that moving the head by one track will cost one time unit. As a result, your simulation can/should be done using 
integers. The disk can only consume/process one IO request at a time. Once a request is active on the disk it cannot be 
interrupted by any other incoming request. Hence these requests must be maintained in an IO queue and managed according 
to the scheduling policy. The initial direction of the LOOK algorithms is from 0-tracks to higher tracks. The head is initially 
positioned at track=0 at time=0. Note that you do not have to know the maxtrack (think SCAN vs. LOOK). Programming Assignment #4 (Lab 4): IO Scheduling Professor Hubertus Franke 
Class CSCI-GA.2250-001 Summer 2024 
 
Each simulation should print information on individual IO requests followed by a SUM line that has computed some statistics 
of the overall run. (see reference outputs). 
 
For each IO request create an info line (5 requests shown) in the order of appearance in the input file. 
 0: 1 1 431 
 1: 87 467 533 
 2: 280 431 467 
 3: 321 533 762 
 4: 505 762 791 
 
Created by 
 printf("%5d: %5d %5d %5dn", iop, req->arr_time, r->start_time, r->end_time); 
 
args: IO-op#, its arrival to the system (same as from inputfile), its disk service start time, its disk service end time 
 
Please remember “ %5d” is not “%6d” !!! For C++ formatting refer back to lab2 and lab3 where similar outputs were created. 
 
and for the statistics of the simulation provide a SUM line ( note variables printed as “%lf” are double floats ). 
 
Created by: printf("SUM: %d %d %.4lf %.2lf %.2lf %dn", 
 total_time, tot_movement, io_utilization, 
 avg_turnaround, avg_waittime, max_waittime); 
total_time: total simulated time, i.e. until the last I/O request has completed. 
tot_movement: total number of tracks the head had to be moved 
io_utilization: ratio of time_io_was_busy / total_time 
avg_turnaround: average turnaround time per operation from time of submission to time of completion 
avg_waittime: average wait time per operation (time from submission to issue of IO request to start disk operation) 
max_waittime: maximum wait time for any IO operation. 
 
10 sample inputs and outputs and runit/gradeit scripts are provided with the assignment on NYU brightspace. 
Please look at the sum results and identify what different characteristics the schedulers exhibit. 
 
You can make the following assumptions (enforced and caught by the reference program). 
- at most 10000 IO operations will be tested, so its OK (recommended) to first read all requests from file before processing. 
- all io-requests are provided in increasing time order (no sort needed) 
- you never have two IO requests arrive at the same time (so input is monotonically increasing) 
 
I strongly suggest, you do not use discrete event simulation this time. You can write a simple loop that increments simulation 
time by one and checks whether any action is to be taken. In that case you have to check in the following order. 
The code structure should look something like this (there are some edge conditions you have to consider, such as the next I/O 
is for the track the head currently is at, etc. ): 
 
 while (true) 
if a new I/O arrived at the system at this current time 
 → add request to IO-queue 
if an IO is active and completed at this time 
 → Compute relevant info and store in the IO request for final summary 
if no IO request active now 
 if requests are pending 
 → Fetch the next request from IO-queue and start the new IO. 
 else if all IO from input file processed 
 → exit simulation 
if an IO is active 
 → Move the head by one unit in the direction its going (to simulate seek) 
Increment time by 1 
 
When switching queues in FLOOK you always continue in the direction you were going from the current position, until the 
queue is empty. Then you switch direction until empty and then switch the queues continuing into that direction and so forth. 
While other variants are possible, I simply chose this one this time though other variants make also perfect sense. Programming Assignment #4 (Lab 4): IO Scheduling Professor Hubertus Franke 
Class CSCI-GA.2250-001 Summer 2024 
 
Additional Information: 
 
As usual, I provide some more detailed tracing information to help you overcome problems. Note your code only needs to 
provide the result line per IO request and the ‘SUM line’. 
 
The reference program under ~frankeh/Public/lab4/iosched on the cims machine implements three additional options: –v, -q, 
-f to debug deeper into IO tracing and IO queues. 
 
The –v execution trace contains 3 different operations (add a request to the IO-queue, issue an operation to the disk and 
finish a disk operation). Following is an example of tracking IO-op 18 through the times 1151..1307 from submission to 
completion. 
 
1151: 18 add 221 // 18 is the IO-op # (starting with 0) and 221 is the track# requested 
1239: 18 issue 221 289 // 18 is the IO-op #, 221 is the track# requested, 289 is the current track# 
1307: 18 finish 68 // 18 is the IO-op #, 68 is total length/time of the io from request to completion 
 
-q shows the details of the IO queue and direction of movement ( 1==up , -1==down) and 
–f shows additional queue information during the FLOOK. 
 
Here Queue entries are tuples during add [ ior# : #io-track ] or triplets during get [ ior# : io-track# : distance ], 
where distance is negative if it goes into the opposite direction (where applicable ). 
 
Please use these debug flags and the reference program to get more insights on debugging the ins and outs (no punt intended) 
of this assignment and answering certain “why” questions. 
 
Generating your own input for further testing: 
 
A generator program is available under ~frankeh/Public/lab4/iomake and can be used to create additional inputs if you like to 
expand your testing. You will have to run this against the reference program ~frankeh/Public/lab4/iosched yourself. 
 
Usage: iomake [-v] [-t maxtracks] [-i num_ios] [-L lambda] [-f interarrival_factor] 
 
maxtracks is the tracks the disks will have, default is 512 
num_ios is the number of ios to generate, default is 32 
lambda is parameter to create a poisson distribution, default is 1.0 ( consider ranges from 0.01 .. 10.0 ) 
interarrival_factor is time factor how rapidly IOs will arrive, default is 1.0 ( consider values 0.5 .. 1.5 ), too small and the 
system will be overloaded and too large it will be underloaded and scheduling is mute as often only one i/o is outstanding. 
 
Below are the parameters for the 10 inputs files provided in the assignment so you don’t pick the same. 
 
1. iomake -v -t 128 -i 10 -L0.11 -f 0.4 
2. iomake -v -t 512 -i 20 -L0.51 
3. iomake -v -t 128 -i 50 -L0.51 
4. iomake -v -t 512 -i 100 -L0.01 
5. iomake -v -t 256 -i 50 -L1.1 
6. iomake -v -t 256 -i 20 -L0.3 
7. iomake -v -t 512 -i 100 -L0.9 
8. iomake -v -t 300 -i 80 -L3.4 -f 0.6 
9. iomake -v -t 1000 -i 80 -L3.4 -f 0.6 
10. iomake -v -t 512 -i 500 -L2.4 -f 0.6 

請加QQ:99515681  郵箱:99515681@qq.com   WX:codinghelp





 

標簽:

掃一掃在手機打開當(dāng)前頁
  • 上一篇:代寫MTH5510、代做Matlab程序語言
  • 下一篇:CSCI 2600代做、代寫Java設(shè)計程序
  • 無相關(guān)信息
    昆明生活資訊

    昆明圖文信息
    蝴蝶泉(4A)-大理旅游
    蝴蝶泉(4A)-大理旅游
    油炸竹蟲
    油炸竹蟲
    酸筍煮魚(雞)
    酸筍煮魚(雞)
    竹筒飯
    竹筒飯
    香茅草烤魚
    香茅草烤魚
    檸檬烤魚
    檸檬烤魚
    昆明西山國家級風(fēng)景名勝區(qū)
    昆明西山國家級風(fēng)景名勝區(qū)
    昆明旅游索道攻略
    昆明旅游索道攻略
  • NBA直播 短信驗證碼平臺 幣安官網(wǎng)下載 歐冠直播 WPS下載

    關(guān)于我們 | 打賞支持 | 廣告服務(wù) | 聯(lián)系我們 | 網(wǎng)站地圖 | 免責(zé)聲明 | 幫助中心 | 友情鏈接 |

    Copyright © 2025 kmw.cc Inc. All Rights Reserved. 昆明網(wǎng) 版權(quán)所有
    ICP備06013414號-3 公安備 42010502001045

    日本欧洲视频一区_国模极品一区二区三区_国产熟女一区二区三区五月婷_亚洲AV成人精品日韩一区18p

              亚洲深夜福利| 欧美性猛交xxxx乱大交蜜桃 | 欧美一站二站| 亚洲黄色精品| 国产在线视频欧美| 欧美日韩一级视频| 久久久久久999| 亚洲欧美日韩精品久久久久| 亚洲精品久久久一区二区三区| 国产精品视频99| 欧美日韩精品欧美日韩精品| 久久人人爽人人爽爽久久| 亚洲欧美日韩精品综合在线观看| 亚洲国产日日夜夜| 含羞草久久爱69一区| 国产精品日韩欧美一区二区| 欧美日韩免费观看一区三区| 欧美激情一区二区三区四区| 久久精品二区三区| 午夜精品国产更新| 亚洲图片在线| 亚洲一区二区三区国产| 亚洲午夜av在线| 日韩亚洲欧美中文三级| 亚洲人体一区| 亚洲精品视频在线| 91久久亚洲| 亚洲日本va午夜在线影院| 亚洲第一免费播放区| 有码中文亚洲精品| 在线免费观看日本一区| 国语自产在线不卡| 国产乱子伦一区二区三区国色天香| 欧美色播在线播放| 欧美日韩一区在线观看| 欧美日韩视频第一区| 欧美福利视频在线| 欧美福利视频在线观看| 欧美理论电影在线观看| 欧美电影免费观看网站| 欧美jizzhd精品欧美巨大免费| 另类av一区二区| 免费在线视频一区| 欧美欧美全黄| 国产精品久久久久久久久久尿| 国产精品日韩高清| 激情综合久久| 99一区二区| 午夜亚洲福利| 免费亚洲网站| 国产精品日韩精品欧美精品| 国产一区高清视频| 亚洲黄色在线观看| 亚洲一区二区三区色| 午夜精品久久久久久久久久久久久| 欧美一二区视频| 欧美高清视频一区| 国产精品普通话对白| 国产一区亚洲| 亚洲午夜羞羞片| 久久午夜激情| 国产精品久久久久久久免费软件| 国产在线高清精品| 日韩一级欧洲| 久久在线免费观看视频| 国产精品第一区| 今天的高清视频免费播放成人| 亚洲午夜免费福利视频| 麻豆91精品91久久久的内涵| 欧美精品日韩一区| 国产一区二区三区直播精品电影| 一本色道久久99精品综合| 久久国产综合精品| 欧美色视频一区| 亚洲国产一区二区三区高清| 亚洲欧美日韩精品| 欧美日韩亚洲一区二区| 狠狠做深爱婷婷久久综合一区 | 狠狠色丁香婷婷综合影院| 亚洲免费av观看| 久久一区国产| 国内外成人在线| 午夜久久电影网| 欧美系列精品| 日韩一区二区免费高清| 欧美/亚洲一区| 亚洲缚视频在线观看| 欧美在线观看天堂一区二区三区| 国产精品白丝av嫩草影院| 亚洲黑丝在线| 欧美激情日韩| 亚洲人体1000| 欧美精品亚洲二区| 亚洲日本中文字幕区| 欧美肥婆bbw| 亚洲欧洲日本国产| 欧美国产在线观看| 亚洲精品一区久久久久久| 牛人盗摄一区二区三区视频| 极品尤物一区二区三区| 另类成人小视频在线| 亚洲激情网址| 欧美另类高清视频在线| 一道本一区二区| 欧美视频在线一区二区三区| 亚洲精品在线视频| 欧美激情bt| 99国产精品99久久久久久| 欧美国产高清| 99精品欧美| 国产精品久久久久久av福利软件 | 欧美日韩综合在线免费观看| 99热这里只有精品8| 欧美色图一区二区三区| 亚洲午夜影视影院在线观看| 国产精品你懂的在线| 午夜视频在线观看一区二区三区| 国产日韩欧美不卡| 久久久中精品2020中文| 亚洲黄一区二区| 国产精品久久久久久久一区探花 | 狠久久av成人天堂| 欧美日韩成人一区二区三区| 亚洲视频一区二区| 国产一区二区三区免费在线观看 | 欧美激情在线| 亚洲影视综合| 亚洲国产精品一区二区www在线| 欧美精品二区| 欧美在线www| 亚洲国产高清视频| 国产精品嫩草99av在线| 久久一区免费| 亚洲制服av| 亚洲国产精品第一区二区| 国产精品v日韩精品v欧美精品网站| 久久成年人视频| 亚洲最新视频在线| 极品少妇一区二区三区精品视频| 欧美日韩午夜精品| 久久久综合免费视频| 一区二区激情小说| 在线观看日韩av| 国产精品v片在线观看不卡| 老司机精品视频一区二区三区| 亚洲免费小视频| 亚洲成色最大综合在线| 国产精品一区免费视频| 欧美日韩亚洲国产一区| 噜噜爱69成人精品| 久久9热精品视频| 亚洲欧美日韩一区二区三区在线观看| 永久域名在线精品| 国产欧美日韩91| 国产精品亚洲аv天堂网| 欧美日本在线看| 免费一级欧美在线大片| 久久婷婷色综合| 久久久久国产精品www| 欧美一区二区免费视频| 亚洲一区二区欧美日韩| 99人久久精品视频最新地址| 亚洲精品视频二区| 亚洲激情在线激情| 亚洲国产日韩欧美在线99| 狠狠v欧美v日韩v亚洲ⅴ| 国产日韩欧美电影在线观看| 国产精品毛片a∨一区二区三区| 欧美日韩精品免费观看视一区二区 | 午夜精品亚洲| 午夜日韩av| 欧美一级二区| 午夜精品区一区二区三| 午夜视黄欧洲亚洲| 午夜免费在线观看精品视频| 亚洲综合电影| 亚洲女女女同性video| 亚洲一区二区视频在线| 欧美在线影院| 久久久久青草大香线综合精品| 久久久视频精品| 久久精品国产亚洲a| 久久九九热免费视频| 久久综合伊人77777蜜臀| 欧美/亚洲一区| 欧美日韩国产成人| 国产精品久久久久久久久久免费| 国产精品久久久久91| 国产欧美日韩一区| 黄色成人在线| 亚洲激情社区| 亚洲夜晚福利在线观看| 欧美在线视频二区| 久久久久久久久久久久久久一区 | 久久夜色精品国产| 欧美日韩免费观看一区三区| 国产精品国产| 精品99视频| 亚洲一区二区av电影| 久久影音先锋|