Design and programming

Assignment Help Operating System
Reference no: EM131268

Consider a small take-out food restaurant called Burrito Brothers. This very popular establishment offers a VERY-TASTY burrito. There are three servers that own a private beef area, a cheese area, and a tortilla area (IE. Each server has their own ingredients in an infinite supply). Additionally there are three shared counter locations, a shared cash register and a shared waiting area that can accommodate up to 15 customers. By law the shop has a maximum customer capacity of 15.

A customer cannot enter the shop if it is filled to capacity. If the there is room a customer will gain access to the shop. Each customer will enter the shop with an order of one to 20 burritos. As soon as a server is free, the customer that has the shortest order is served next A server is either servicing a customer or waiting. Each server will make (at most) three 'burritos at time for a given customer. Once a server has obtained all ingredients, a burrito can be made. When a customer's entire order is finished, the customer pays a cashier and leaves the shop. Since there is only one cash register, only one patron may pay at a time. However, in the event that a customer's entire order has not been filled by the server at the completion of the current counter visit the customer must reenter the waiting area. The waiting area is organized by the shortest order next. Implement a solution to this problem as a Java application using the Java semaphore class for synchronization.

Each customer is represented by a corresponding thread and each server in your implementation is also represented by a unique Java thread. All customers and servers exist within a single application.

A detailed design document fully describing work. This must be a clear and concise document that rigorously addresses the decisions and design elements that support your solution to this concurrency and synchronization problem. See the Methodology, Design, and design elements. Use citation to provide evidence of your analysis. Citations and references should be in APA format.

  • The Java Burrito Brothers Implementation
  • The Java Source Code
  • Class files
  • The system must compile using the command: javac *.java. The system must run using the command: java Burrito <optional parameters>.
  • Output from a run of your application.

Reference no: EM131268

Questions Cloud

State of the company’s industry and associated risk factors : Audit partner is concerned about his lack of knowledge of the industry the company is operating in, state of the company's industry and associated risk factors
Avon calls on foreign markets : Avon Calls on Foreign Markets
Build an equation for a hyperboloid of two sheets : A function y = f(x) whose graph in the xy-plane, when rotated around the x-axis
Impacts on the quality of accounting information : Why is measurement in the context of accounting so important
Design and programming : Use the semaphore methods to control the concurrency of the solution
Taxation – law and practice : Show the tax issues that are raised and the relevant sections of the legislation.
Compare the essential characteristics of partnerships : Compare the essential characteristics of partnerships
Guest services techniques : Customer service is all about building relationships with your customer base
Develop a value chain for the airline industry : Develop a value chain for the airline industry

Reviews

Write a Review

 

Operating System Questions & Answers

  Write a multi-threaded program

Write a multi-threaded program to solve producer and consumer problem

  Memory allocation in operating system

Analysis and implementation of algorithms for memory allocation in operating system, Explain First- t and best- t methods are used in memory allocation in operating systems.

  Issues with trusted platform module

Research paper discussing the issues with Trusted Platform Module (TPM)

  Threads

Explain a complication that concurrent processing adds to an operating system.

  Stand alone child process

Forking the child process

  Implementation of algorithms for process management

The Shortest Job Next (SJN) algorithm queues processes in a way that the ones that use the shortest CPU cycle will be selected for running rst.

  Marginal and average cost curves

n a competitive market place (pure competition) is it possible to continually sell your product at a price above the average cost of production.

  Simulating operating systems scheduling

Simulate the long-term scheduler, the short-term scheduler and the I/O scheduler of the computer using the First-Come-First-Serve algorithm.

  Develop a user mode command interpreter

Develop a user mode command interpreter which support list-short.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd