合肥生活安徽新聞合肥交通合肥房產(chǎn)生活服務(wù)合肥教育合肥招聘合肥旅游文化藝術(shù)合肥美食合肥地圖合肥社保合肥醫(yī)院企業(yè)服務(wù)合肥法律

        代寫COMP 340 Operating Systems

        時間:2023-11-18  來源:合肥網(wǎng)hfw.cc  作者:hfw.cc 我要糾錯


        COMP 340 – Operating Systems

        Fall, 2023

        HW2: Bounded Buffer Problem

        PROBLEM STATEMENT:

        There are 3 generators and each produces a unique kind of material independently. All these

        materials are stored in an input buffer with size 10 before they are forwarded to the operators.

        We have 3 operators with same priority who are responsible for producing the products based on

        these materials. Each product needs 2 different kinds of materials. Each time an operator needs 2

        tools for this purpose. There are totally 3 tools provided for these operators. An operator can only

        process one product at one time. When an operator gets both the materials and tools, he can

        produce a product within a limited time varied from 0.01 second to 1 second. Otherwise, he has

        to wait until all the necessities are met. He can grab the materials or tools first, it does not matter,

        but he can only get one thing at one time. If an operator decides to make another product before

        he starts to make the current product, he can put the materials and tools back and re-get the new

        materials and tools. But he has to put the tools back after he finishes a product because other

        operators may need these tools. All the products are put into a size-unlimited output queue. An

        operator cannot start a new product before he puts the product into the output queue. Some

        restrictions may apply to these products: 1) No same products can be next to each other in this

        queue. We say that two products are same if they are made from the same kinds of materials. 2)

        The difference of the number of any two kinds of products produced should be less than 10, for

        example, we can have 10 of product A and 15 of product B, but it is not allowed if we have 10 of

        A and 21 of B because the difference is 11 which is larger than 10.

        SUBMISSION INSTRUCTIONS

        Your assignments must be both emailed and presented in class on the due date. You will submit

        a single .ZIP, .RAR or .TAR file that will contain:

        1) A soft copy of your source code.

        2) A Makefile to compile the code.

        3) A soft copy of a report documenting the internal design of your program.

        Your program must be in C/C++. It is your responsibility to make sure your program compiles

        and runs smoothly under Linux. Your program should not be stalled in a dead cycle at any time.

        This is the only submission method

        .

        DEADLINE

        The deadline for homework is 11:59:59 PM on Wednesday, December 1

        st, 2023. Submissions

        after this deadline will be considered late and will NOT be accepted. Do not present code in a

        PDF or Word document – it must be an executable .c file as in the case of the midterm. Email a

        zip file to steven.pearce@ufv.ca . Do not upload to Blackboard.

        GRADING

        Your homework assignment is worth 10 points (10%). During the execution of your program,

        you should provide these information dynamically:

        1) For each material, how many of them are generated?

        2) The status of the input buffer.

        3) For each kind of product, how many are produced?

        4) The status of the output queue.

        5) How many times the deadlock happens?

        Additional Notes:

        Students need to be careful to design their solution in a way that avoids any potential deadlocks

        that could be caused by these scenarios:

        • A glut of materials of the same type in the materials queue (solution: students should

        incorporate some mechanism to guarantee that there is sufficient variety in the materials

        queue)

        • Workers hogging tools (Possible solutions: workers attempt to grab PAIRS of tools

        instead of picking them up individually. Alternatively, when a worker is holding on to a

        single tool, there needs to be some mechanism like a counter that keeps track of attempts

        to grab the second tool. After a certain number of unsuccessful attempts, the worker

        should release the tool its holding, which would allow some other thread to grab it.)

        Also provide these functions

        1) Pause and resume the program at any time. 2) Make the number of operators and tools

        adjustable.

        Please feel free to provide additional information and functions that you consider useful.

        The most important thing is to make sure your program works correctly. Do not worry about

        your programming style or efficiency. But it does matter if you provide a smarter internal design

        (approach) and user-friendly interface.

        IMPORTANT: Your program must COMPILE AND RUN or you will get a mark of ZERO on

        your assignment.

        Assignment grades will be open for review for one week only.

        Finally, a reminder that plagiarism will result in an automatic failing grade for the course.

         

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

         

        掃一掃在手機打開當前頁
      1. 上一篇:代寫MATH36031、代做MATLAB編程設(shè)計
      2. 下一篇:代寫CSE 158、代做Python語言編程
      3. 無相關(guān)信息
        合肥生活資訊

        合肥圖文信息
        出評 開團工具
        出評 開團工具
        挖掘機濾芯提升發(fā)動機性能
        挖掘機濾芯提升發(fā)動機性能
        戴納斯帝壁掛爐全國售后服務(wù)電話24小時官網(wǎng)400(全國服務(wù)熱線)
        戴納斯帝壁掛爐全國售后服務(wù)電話24小時官網(wǎng)
        菲斯曼壁掛爐全國統(tǒng)一400售后維修服務(wù)電話24小時服務(wù)熱線
        菲斯曼壁掛爐全國統(tǒng)一400售后維修服務(wù)電話2
        美的熱水器售后服務(wù)技術(shù)咨詢電話全國24小時客服熱線
        美的熱水器售后服務(wù)技術(shù)咨詢電話全國24小時
        海信羅馬假日洗衣機亮相AWE  復(fù)古美學與現(xiàn)代科技完美結(jié)合
        海信羅馬假日洗衣機亮相AWE 復(fù)古美學與現(xiàn)代
        合肥機場巴士4號線
        合肥機場巴士4號線
        合肥機場巴士3號線
        合肥機場巴士3號線
      4. 上海廠房出租 短信驗證碼 酒店vi設(shè)計

        主站蜘蛛池模板: 无码一区二区三区老色鬼| 日韩免费一区二区三区在线播放 | 国产视频一区二区在线播放| 国产成人精品一区在线| 鲁丝片一区二区三区免费| AV天堂午夜精品一区二区三区| 成人精品一区久久久久| 亚洲日韩精品无码一区二区三区| 精品国产亚洲一区二区三区| 亚洲高清一区二区三区 | 91精品一区二区| 久久免费视频一区| 国产福利在线观看一区二区| 日本成人一区二区三区| 国产无人区一区二区三区| 亚洲av午夜福利精品一区| 国产一区二区三区播放| 亚洲高清毛片一区二区| 精品视频无码一区二区三区| 久久精品一区二区三区中文字幕 | 毛片无码一区二区三区a片视频| 国产精品 一区 在线| 成人国产精品一区二区网站| 精产国品一区二区三产区| 国产乱人伦精品一区二区| 久久亚洲AV午夜福利精品一区| 性盈盈影院免费视频观看在线一区| 国产一区三区三区| 免费萌白酱国产一区二区| 日韩毛片一区视频免费| 国产乱码精品一区二区三| 东京热无码av一区二区| 东京热人妻无码一区二区av| 国产伦理一区二区| 美女视频一区三区网站在线观看| 精品国产一区二区三区| 日本强伦姧人妻一区二区| 中文字幕色AV一区二区三区| 无码国产精品一区二区免费3p| 日韩精品一区二区三区老鸭窝| 中文字幕在线不卡一区二区|