HomeworkLib
Question

8) 
With the __________ approach the number of threads in a process can be altered during...

8) 
With the __________ approach the number of threads in a process can be altered during the

        course of execution.

        A) 
dynamic scheduling 
            B) 
load sharing

        C) 
gang scheduling 
                    D) 
dedicated processor assignment

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1


A) dynamic scheduling

0 0
Add a comment
Know the answer?
Add Answer to:
8) 
With the __________ approach the number of threads in a process can be altered during...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • 1). The _____ supports only those services that are necessary to allow other system services (executed...

    1). The _____ supports only those services that are necessary to allow other system services (executed in user space) to run. a. max-kernel b. micro-kernel c. mini-kernel d. macro-kernel 2). _____ means having multiple programs (processes) running on one processor, whereas multiprocessing means having multiple processors. _____ typically refers to multiple processes from multiple users, whereas multithreading generally refers to multiple threads from one user process. a. Multi-GUI b. Multi-programming c. Multi-flow d. Multi-CPU 3). _____ saves disk space, results...

  • During the course of execution, process moves from one state to another state in the state...

    During the course of execution, process moves from one state to another state in the state diagram. The only state transition that is initiated by the user process itself is none of the options admit dispatch release Question 4 A scheduler controls the running sequence of processes. The algorithm used by the scheduler is called the scheduling algorithm. Which of the following features is not possible to achieve? Ensuring that each process gets its fair share of the CPU Keeping...

  • Suppose we have developed new versions of a processor with the following characteristics: Version Voltage 1.5 V 1.2V Clock rate 2.4 GHz 3GHZ a) How much has the capacitive load varied between version...

    Suppose we have developed new versions of a processor with the following characteristics: Version Voltage 1.5 V 1.2V Clock rate 2.4 GHz 3GHZ a) How much has the capacitive load varied between versions if the dynamic power has been reduced by 15%? Assuming that the capacitive load of version 2 is 70% the capacitive load of version 1, find the new voltage value for version 2 if the dynamic power of version 2 is reduced by 35% from version 1....

  • Answer this question Properly Please find out how many processes and how many threads are created:...

    Answer this question Properly Please find out how many processes and how many threads are created:                              pid_t pid;             pid = fork();             if (pid == 0) { /* child process */                   fork();                   thread_create(...); } fork(); a) Write working codes from the pseudo-code above. Add appropriate codes to ensure that you have time to observe processes and threads using ‘top’ and ‘H’ keystroke. b) Draw a simple diagram showing the processes and threads in their parent/child...

  • 16. Consider a single-processor system that uses the round-robin (RR) process scheduling algorithm. Assume that the...

    16. Consider a single-processor system that uses the round-robin (RR) process scheduling algorithm. Assume that the time quantum is 10 milliseconds. Consider the five processes with the arrival time and the burst time, in milliseconds, shown in the table below Arrival Time Burst Time (milliseconds) (milliseconds) Process Pl P2 P3 P4 P5 0 24 20 23 24 Which of the five processes is the last to finish its execution? (A) P (B) P2 (C) P3 (D) P4 (E) P5

  • 1. The first task in this assignment creates the pid manager whose implementation can simply be...

    1. The first task in this assignment creates the pid manager whose implementation can simply be a single class. Of course, you can create any other classes you might need to implement the pid manager. You may use any data structure of your choice to represent the availability of process identifiers. One strategy adopts Linux’s approach of a bitmap in which a value of 0 at position i indicates that a process id of value i is available and a...

  • - Question 3. [25 marks] Consider the execution of the following function (written in the C...

    - Question 3. [25 marks] Consider the execution of the following function (written in the C language). void test() { int a=1; fork(); a=a+2; if (fork()==0) H a=2*3;4 printf("la: %d\nma); 3(a) Draw the process graph for the execution of “test”. [10 marks] 3(b) Give an example of infeasible output of “test”. Explain why it is infeasible output. [8 marks] 3(c) The output of “test” depends on the scheduling of processes on CPU. There can be many feasible output of “test”....

  • 1. The maximum number of customers that can be serviced at a bank is known as...

    1. The maximum number of customers that can be serviced at a bank is known as the bank’s (a) Customer Service (b) Queue Service Level (c) The Capacity (d) Facility Output 2. The decisions that are related to how a product is manufactured is known as (a) Facility Location (b) Capacity Management (c) Scheduling Management (d) Process Design 3. The set of decisions that deal with managing relationships with a firm’s suppliers is known as (a) Logistics Management (b) Supply...

  • 1. The exergy change of a system can be a) Only positive during a process b)...

    1. The exergy change of a system can be a) Only positive during a process b) Only negative during a process c) Positive or negative during a process d) None of the above 2. Which of the following air standard heat engine cycles can have a 100% second law efficiency a) Otto cycle b) Ericsson cycle c) Diesel cycle d) Brayton cycle 3. Both energy and exergy can be transferred by a) Heat and work b) Mass and heat c)...

  • QUESTION 3 Consider the following set of processes: Priority Process Arrival Time A 0 B 1...

    QUESTION 3 Consider the following set of processes: Priority Process Arrival Time A 0 B 1 C 6 * Lower number means higher priority Burst Time (ms) 5 3 4 Draw in a paper sheet 4 Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, Non-Preemptive SJF, Shortest-Remaining-Time-First (SRTF), Non-Preemptive Priority (NPP), and RR (quantum time = 2) scheduling algorithms, then fill the following tabic accordingly. (Note: If a new process arrives at the...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT