EssayGhost Assignment代写,Essay代写,网课代修,Quiz代考

EssayGhost-Essay代写,作业代写,网课代修代上,cs代写代考

一站式网课代修,论文代写

高质量的Assignment代写、Paper代写、Report代写服务

EG1hao
网课代修代上,cs代写代考
C语言代写
您的位置: 主页 > 编程案例 > C语言代写 >
代写C语言:os c代写 CSCI3120 operating system - C语言代写
发布时间:2021-07-25 20:02:28浏览次数:
A response is sent for each of the requests, indicating if the request has beengranted or  (Hint: the sample solution uses two mailboxes per airport. One to recieve requests and one to receive responses to requests. This avoids some race conditions.)Flightsthat were granted landing permission can then proceed to taxi and take-off.Flightsthat were not granted landing permission must wait until the next time-step (minute) to make the requestThe rest of the simulation is the same as in Assignment 3.To implement this functionality, it is recommended that a simple asynchronous message passing system be implemented (or used) to communicate between the threads. You will also need to have another list at each originating airport of flights waiting for permission to land.Note: the sample solution to this assignment required an additional 80 lines of code in airport2.c and two additional source files comm.h and comm.c where the asynchronous message passing system was implemented. The latter was about 140 lines of code and implemented the following functions:int comm_allocate() : allocate a new mailbox and returns the id of the mailbox. int comm_send(int id, void *buf) : asynchronously send a pointer to a buffer to mailbox id. (hint: the same solution passes around pointers to flight structs.void  *  comm_recv_any(int  id) :  receive a pointer that was sent to mailboxid.intcomm_size(int id) : return the number of messages waiting in mailbox id.Extend your (or the provided) solution to Assignment 3 to perform the above specified functionality. Simulator InputThe input is the same as Assignment 3. Please see examples as shown in the provided test suite (tests_4.zip).Processing and SemanticsProcessing rules are the same as in Assignment 3 in addition to behaviour described above.Expected OutputThe output format is the same as Assignment 3. Please see examples as shown in the provided test suite (tests_4.zip).Nonfunctional RequirementsSame nonfunctional requirements as Assignment 3. Note: the starting code is either your solution to Assignment 3 or the sample solution, found on Brightspace.Test Your Code!To test your code, a test suite (tests_4.zip) is provided. Same test procedures as those in Assignment 3 are recommended.Hints and SuggestionsPleasesee the hints in the backgroundRememberto protect the shared data structures in you communication system with mutex locks and use condition variable to suspend threads waiting to receive aThesample solution to Assignment 4 only required 80 lines of additional code added to c and additional source files comm.h and comm.c, of 140 lines of code..The Java OptionSame conditions apply as in Assignment 3. A penalty of 10% will be applied if the assignment is done in Java or C++ instead of C.What to Hand InYou need only submit an electronic of your assignment. Submission must be done by 11:59 AM of the due date. Submission is done via Brightspace.The assignment submission should be a single zip file (.zip) comprising the source code files that implement the simulator as well as the makefile and the runme.sh file.Grading SchemeThe assignment will be graded on four criteria:Concurrency “Is the solution maximally concurrent?”. This is determined by inspecting the code and ensuring for appropriate use of threads and locks. Concurrency is used as a multiplier for the rest of the code. Concurrency is graded on a 4 point scale:(4) Solution is maximally concurrent e.g., uses threads appropriately and uses indi- vidual locks for each instance of a data structures.(3) Solution is mostly concurrent e.g., uses threads appropriately but uses a single lock for all instances of a data structure.(2) Solution is somewhat concurrent e.g., does not use threads appropriately or uses a single lock for all data structures.(1) Solution is not very concurrent e.g., does not use threads appropriately and uses a single lock for all data structures.(0) Solution is not concurrent.The concurrency factor is multiplied by Functionality score because the base solution passes all tests.Functionality “Does it work according to specifications?”. This is determined in an auto- mated fashion by running your program on a number of inputs and ensuring that the outputs match the expected outputs. The score is determined based on the numberof tests that your program passes. So, if your program passes ttests, you will receivethat proportion of the marks.Quality of Solution “Is it a good solution?” This considers whether the solution is correct, efficient, covers boundary conditions, does not have any obvious bugs, etc. This is determined by visual inspection of the code. Initially full marks are given to each solution and marks are deducted based on faults found in the solution.Code Clarity “Is it well written?” This considers whether the solution is properly format- ted, well documented, and follows coding style guidelines.If your program does not compile, it is considered non-functional and of extremely poor quality, meaning you will receive 0 for the solution.

所有的编程代写范围:essayghost为美国、加拿大、英国、澳洲的留学生提供C语言代写、代写C语言、C语言代做、代做C语言、数据库代写、代写数据库、数据库代做、代做数据库、Web作业代写、代写Web作业、Web作业代做、代做Web作业、Java代写、代写Java、Java代做、代做Java、Python代写、代写Python、Python代做、代做Python、C/C++代写、代写C/C++、C/C++代做、代做C/C++、数据结构代写、代写数据结构、数据结构代做、代做数据结构等留学生编程作业代写服务。