The aim of this is to produce a simple simulation of a printer queue within a UNIX or Linux environment.
The simulation will consist of two communicating processes, a producer and a consumer.
Functional Requirements
First process
This process will be required to run to create a series of child processes that will represent each of the printer jobs. The PID number of each child is to be inserted / spooled within a priority queue.
The queue will be made available to the second process to allow de-spooling.
The process should be configurable using command line arguments.
Second Process
This process will be separate from the first and running within a separate console window and will simulate the de-spooling process.
The process should be configurable using command line arguments.
It should perform the following functions:
- Find and delete a number of printer jobs by priority order.
- Print a message to notify the user of the deletion.
- Kill the corresponding process.
It will be necessary to develop a communication mechanism to transfer data between the two main processes.
It should be possible to configure the maximum number of jobs allowed within the whole system.
It should also be possible to configure the consumer and / or the producer to specify how many jobs they will de-spool or spool during each cycle.
The code must be explained using comments.
Additional information submitted:
The program needs to be written in C, not C# or C++.
Bidding will be anything under $30. Let me know if you intend to bid under $30 and I can arrange other forms of contact.
Hi
I can do this project as I am working on C. But, I do not want to commit without knowing the no of days you are going to allow. Just for the sake of compulsion I entered the number of days.
Let me know if you are interested.
Thanks & Regards
Sathish Kumar
This is a few days project. Our team have already done a lot of similar projects, and now we
offer our experience for you. We shall do your project with highest quality and speed. Please
read PMB for detailed information.