uppose that a multiprogrammed system has a load of N processes with individual execution times of t1, t2, ...,tN. Answer the following questions: a) How would it be possible that the time to complete the N processes could be as small as: maximum (t1, t2, ...,tN)? b) How would it be possible that the total execution time, T > t1+ t2+ ...+tN? In other words, what would cause the total execution time to exceed the sum of individual process execution times?

uppose that a multiprogrammed system has a load of N processes with individual execution times of t1, t2, ...,tN. Answer the following questions: a) How would it be possible that the time to complete the N processes could be as small as: maximum (t1, t2, ...,tN)? b) How would it be possible that the total execution time, T > t1+ t2+ ...+tN? In other words, what would cause the total execution time to exceed the sum of individual process execution times?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 2PE: If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the...

See similar textbooks

Similar questions

If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the fetch cycle is 40% of the processor cycle time, what memory access speed is required to implement load operations with zero wait states and load operations with two wait states?
In a distributed system, each process' memory may hold shared structures, which can be accessed by interprocess communication. Is the execution of this idea flawed in any way?
How can we stop a central processing unit from squandering processing cycles by carrying out the processing of a large number of instructions simultaneously? To what degree does the successful execution of this plan rely on particular components being present or absent? Give an example of one of the consequences that result from their actions.
How can we prevent a central processing unit from squandering processing cycles by executing a high number of instructions concurrently? How dependent is the implementation of this plan on the existence or absence of certain elements? Give an example of one of the results they create.
There are a number of benefits that come from the practise of first delegating the execution of a process to an input/output queue and then, once the CPU is ready, handing control back to it. Who knows what may occur if the input/output is suddenly stopped? Will there be an impact on the burst of the central processing unit? How exactly does this hold true?
How can we stop a central processing unit from squandering cycles by processing a huge number of instructions all at once? How much does the availability of certain resources affect the viability of carrying out this strategy? Provide an instance of one of the results they generate.
Principle of locality is defined by Stallings as the tendency of a processor to access the same set of memory locations repetitively over a short period of time. Locality is a universal behavior of all computational processes: They tend to refer repeatedly to subsets of their resources over extended time intervals. Use your own words to answer the following questions: What is the distinction between spatial locality and temporal locality? In general, what are strategies for exploiting spatial locality and temporal locality? How does the principle of locality relate to the use of multiple memory levels?
Investigate the impact of dynamic multithreading on software development. How should software be optimized to take full advantage of the capabilities of a dynamically multithreaded processor?
56. In the multiprogramming system, a set of processes is deadlock if each process in the set is waiting for an event to occur that can be initialized only by another process in the set. Which of the following is not one of the four conditions that are necessary for deadlock to occur? a. nonpreemption b. process suspension c. partial assignment of resources d. circular wait
In what circumstances is it necessary to combine sets of applications or processes into subsystems that run on a large computer system? What are the advantages of logically partitioning this system?
What is the most significant factor to consider while transitioning from a serial processing system to a batch processing system?Your response must be supported by a justification.
Talk about the benefits as well as the cons of using concurrent programming. Think about the dynamic relationship that exists between the processes and the scheduling of them.