search
Log In
0 votes
21 views
A process can be put into a round-robin queue more than once to give it a higher priority. Running multiple instances of a program each working on a different part of a data pool can have the same effect. First write a program that tests a list of numbers for primality. Then devise a method to allow multiple instances of the program to run at once in such a way that no two instances of the program will work on the same number. Can you in fact get through the list faster by running multiple copies of the program? Note that your results will depend upon what else your computer is doing; on a personal computer running only instances of this program you would not expect an improvement, but on a system with other processes, you should be able to grab a bigger share of the CPU this way.
in Operating System 21 views

Please log in or register to answer this question.

Related questions

0 votes
1 answer
1
82 views
A real-time system needs to handle two voice calls that each run every $6$ msec and consume $1$ msec of CPU time per burst, plus one video at $25$ frames/sec, with each frame requiring $20$ msec of CPU time. Is this system schedulable?
asked Oct 25, 2019 in Operating System Lakshman Patel RJIT 82 views
0 votes
2 answers
2
228 views
A soft real-time system has four periodic events with periods of $50, 100, 200,$ and $250$ msec each. Suppose that the four events require $35, 20, 10,$ and $x$ msec of CPU time, respectively. What is the largest value of $x$ for which the system is schedulable?
asked Oct 25, 2019 in Operating System Lakshman Patel RJIT 228 views
0 votes
1 answer
3
...