Форум программистов, компьютерный форум CyberForum.ru

Answer to this questions, in the Operation Systems! - C++

Восстановить пароль Регистрация
 
michelan
0 / 0 / 0
Регистрация: 02.04.2013
Сообщений: 6
27.06.2013, 20:47     Answer to this questions, in the Operation Systems! #1
1.Five batch jobs, A through E, arrive at a computer center at essentially the same time. They have an estimated running time of 15, 9, 3, 6, and 12 minutes, respectively. Their (externally defined) priorities are 6, 3, 7, 9, and 4 respectively, with a lower value corresponding to a higher priority. For each of the following scheduling algorithms, determine the turnaround time for each process and the average turnaround for all jobs. Ignore process switching overhead. Explain how you arrived at your answers. In the last three cases, assume that only one job at a time runs until it finishes and that all jobs are completely processor bound.
a. round robin with a time quantum of 1 minute
b. shortest job first
Similar
Эксперт
41792 / 34177 / 6122
Регистрация: 12.04.2006
Сообщений: 57,940
27.06.2013, 20:47     Answer to this questions, in the Operation Systems!
Посмотрите здесь:

Questions на собеседованиях по с++ C++
Visual C++ Questions C++
Questions about C++ C++
C++ Two questions about C++
invalid pointer operation C++
C++ Invalid pointer operation
Acm.timus Wrong answer C++
Acm.timus Wrong answer C++

Искать еще темы с ответами

Или воспользуйтесь поиском по форуму:
После регистрации реклама в сообщениях будет скрыта и будут доступны все возможности форума.
vxg
Модератор
 Аватар для vxg
2669 / 1680 / 158
Регистрация: 13.01.2012
Сообщений: 6,281
28.06.2013, 13:03     Answer to this questions, in the Operation Systems! #2
Maybe...
----
a
----
Turnaround time for each process:
B 9 (higher priority - submit at 0 and running 9 minutes)
E 9 + 12 = 21 (next priority - submit at 0 and wait for previous job and running 12 minutes)
A 9 + 12 + 15 = 36 (next priority - submit at 0 and wait for previous jobs and running 15 minutes)
C 9 + 12 + 15 + 3 = 39 (next priority - submit at 0 and wait for previous jobs and running 3 minutes)
D 9 + 12 + 15 + 3 + 6 = 45 (next priority - submit at 0 and wait for previous jobs and running 6 minutes)
Average turnaround for all jobs:
(9 + 21 + 36 + 39 + 45) / 5 = 30
----
b
----
Turnaround time for each process:
C 3 (submit at 0 and running 3 minutes)
D 3 + 6 = 9 (submit at 0 and wait for previous job and running 6 minutes)
B 3 + 6 + 9 = 18 (submit at 0 and wait for previous jobs and running 9 minutes)
E 3 + 6 + 9 + 12 = 30 (submit at 0 and wait for previous jobs and running 12 minutes)
A 3 + 6 + 9 + 12 + 15 = 45 (submit at 0 and wait for previous jobs and running 15 minutes)
Average turnaround for all jobs:
(3 + 9 + 18 + 30 + 45) / 5 = 21
Yandex
Объявления
28.06.2013, 13:03     Answer to this questions, in the Operation Systems!
Ответ Создать тему
Опции темы

Текущее время: 04:09. Часовой пояс GMT +3.
КиберФорум - форум программистов, компьютерный форум, программирование
Powered by vBulletin® Version 3.8.9
Copyright ©2000 - 2016, vBulletin Solutions, Inc.
Рейтинг@Mail.ru