代写Assignment #5代写Java程序

Assignment #5

Assignment Overview

Black Friday is almost here! You are managing the local electronics store, and you know that Black Friday is always a crazy day in your store. You want to ensure that the shopping experience is a safe one for everyone. To that end, you've decided to control the flow of customers into and within your store. Customers will be grouped at one of two entryways, and then will be escorted to the area of the store they wish to shop in to maintain some semblance of order.

● Escort Team O can accommodate up to 100 shoppers.

Escort Team 1 can accommodate up to 50 shoppers.

There are 500 shoppers lined up at the main entrance (Zone O), and they all want to get to one of the other four zones.

50 shoppers want to get to Zone 1 (Appliances).

100 shoppers want to get to Zone 2 (TVs).

250 shoppers want to get to Zone 3 (Smartphones).

100 shoppers want to get to Zone 4 (Video Games).

The 500 shoppers waiting at the main entrance (Zone O) will need to be escorted to the other four zones by one of the two escort teams. However, only one escort team can be in any zone at one time to avoid confusion.

For this assignment, write a C program which will simulate this activity.

Purpose

Learn how to use multi-threading and mutual exclusion to safely update shared values.

Get experience with either

o pthread_mutex_init(), pthread_mutex_lock(), pthread_mutex_unlock() and pthread_mutex_destroy () system functions; OR

o sem_init (), sem_wait (), sem_post () and sem_destroy () system functions.

Gain more experience with the C programming language from an OS perspective.

Instructions

Attached to this assignment is a tarball with the following files in it. None of these files should be modified:

Makefile <—- A pre-packaged Makefile. This tells you how your progran should be structured.

un-assignnent. sh <—- A shell script. that will autonatically run your progran.

Download this tarball and upload it to GAUL. Extract the tarball (tar -xvfassignment-5. tar). Change to the assignment-5 directory.

You will write a program called assignment-5. c. This program will:

Initialize 5 shopping zones with requested shoppers and 2 escort teams with capacities as defined above.

Create two threads (one for each escort team).

o Starting at Zone O, attempt to enter a zone. When the escort team has permission to enter:

■ If there are shoppers waiting to enter the store (Zone O), the escort team will gather as many shoppers as possible.

If there are shoppers to drop off at a zone and the escort team's group already has shoppers in it:

Escort as many shoppers as possible to Zones 1, 2, 3, and 4.

If there are more shoppers in the group to escort but the zone has no more shoppers to add, move to the next zone.

If there are no more shoppers in the group to escort, the escort team will move back (zone-by-zone) to Zone O to gather more shoppers.

o When all shoppers have been escorted to their chosen zones, the thread can simply quit.

Important notes and requirements:

Gathering and escorting shoppers takes a bit of time. Simulate this with the sleep () function. Gathering or escorting 100 shoppers takes 10 minutes (which can be simulated as 10 seconds). Gathering or escorting 50 shoppers takes 5 minutes (which can be simulated as 5 seconds). And so on. Since we have 500 shoppers, the whole program should take ~50-90 seconds to run with some potential variance depending on how often the threads need to wait on one another. (You can relax this requirement to speed up your testing, but the final version should include the sleep () function to help ensure some variance between Escort Team O and Escort Team 1.)

There are 6 resources that cannot be shared in this project:

o STDOUT Zone 0

o Zone 1

o Zone 2

o Zone 3

o Zone 4

If an escort team is in a zone, the other escort team cannot be in the same zone.

If a thread is printing information to the screen, the other thread cannot print to the screen. This will ensure threads do not print out on top of one another and creates a smooth print out to the screen.

As long as an escort team is in a zone, it should also have full control of STDOUT. This means that, for example, if Escort Team O is ready to enter Zone O and Escort Team 1 is ready to enter Zone 1, then only one of the threads gets to print to the screen. The other thread must wait until it can get control of STDOUT.




热门主题

课程名

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
站长地图