ACTIVIDAD 2 ANÁLISIS DE PROCESOS

Asignatura:
SISTEMAS OPERATIVOS

Presentado por:
Eduard Andres Castellanos Torres

2020
Actividad 2
Análisis de procesos

¿Qué competencias desarrollará a través de esta actividad?

Compara el uso de comandos y su ejecución en diferentes S.O por medio del trabajo
colaborativo y valoración por pares asignados por el docente.

¿Qué debe hacer? (paso a paso)

Exercise 1:

A. Explain the differents methods for memory management

• First In First Out – FIFO:

The processes are dispatched according to their arrival, the first processes to reach
the processor will be the first to finish.

FIFO policy is not currently used as the main scheme of a system, but if, for example,
when a priority policy is used and there are processes with the same priority, FIFO
could be applied to them.

Esta foto de Autor desconocido está bajo licencia CC BY-SA

• Shortest Remaining Time (S.R.T.)

Shortest Remaining Time First Is a scheduling algorithm used in Operating

Systems, which can also be called as the preemptive version of the SJF scheduling
algorithm.

The process which has the least processing time remaining is executed first. As it is a
preemptive type of schedule, it is claimed to be better than SJF scheduling
Algorithm.
 Esta foto de Autor desconocido está bajo licencia CC BY-SA

• Shortest-Job-First (S.J.F.)

Shortest Job First (SJF) is an algorithm in the process that has the shortest execution
time is chosen for the next execution. This method of programming can be
preventive or non-preventive.

Non-preventive

In non-preventive scheduling, once the CPU cycle is assigned to the process, the
process holds it until it reaches a wait or end state.

Preventive

In preventive SJF scheduling, jobs are placed on the waiting list as they appear. A
process with the shortest burst time begins execution.

Esta foto de Autor desconocido está bajo licencia CC BY-SA

• Round Robin

Round-robin (RR) is one of the algorithms used by process and network planners in
computing.
 As the term is generally used, time slots (also known as time quanta) are assigned to
each process in equal parts and in circular order, handling all processes without
priority (also known as cyclic executive).

Esta foto de Autor desconocido está bajo licencia CC BY-SA

B. Make a comparative table between the different algorithms of memory

management, explaining the advantages and disadvantages of each of them

Algorithms of
memory ADVANTAGES
management
First In First Out – • It is not such a complex
FIFO: algorithm, it is simple and easy
to understand and implement.
• It is very efficient for processes
that have the same level of
complexity
Shortest Remaining • Excellent average service time.
Time (S.R.T.) • It balances tasks very well and
performance tends to be much
better.
Shortest-Job-First • Among all the programming
(S.J.F.) algorithms it has a minimum
average waiting time
• SJF is used frequently for long-
term programming.
• It is appropriate for jobs running
in batch, where the execution
times are known in advance.
Round Robin • It works very well for all kinds of
processes, since they will all run
DISADVANTAGES
• Has poor performance when
processes do not have the
same level of complexity.
• Tends to be slow with a lot of
load.
• It requires making estimates of
the runtime of each process
and this is another burden on
the processor
• Long processes can be delayed
indefinitely if short processes
are added continuously.
• Job completion time must be
known before but is difficult to
predict.
• It is difficult to know the
duration of the next CPU
request.
• Priorities cannot be set for the
processes.
 • There is justice since each
process gets the same portion
of CPU.
• The newly created process is
added to the end of the waiting
list.
• Its performance is highly
dependent on quantum time.
• If slicing time of OS is low, the
processor output will be
reduced.

Exercise 2:

A. Make a comparative table between the different options of mobile operating systems,
which must be different from Android and IOS.

Sailfish OS Ubuntu Touch PureOS KaiOS Tizen

Feature

Sailfish
Linux
Alliance, Mer, Jolla UBports and Ubuntu community KaiOS
Foundation, Tizen
Developed by and Sailfish contributors (previously Canonical Purism Technologies
Association, Samsung,
community Ltd.) Inc., Google
Intel
contributors

Market share Unknown Unknown Unknown ? Unknown

Current version 3.3.0.16 16.04 OTA-11 9.0 2.6.0 4.0.0.7

Development
Unknown Unknown Unknown 5.5 M1
version

26 Septemb
Current version April 28, 2020; er 2019; November 16, 2018;
May 13, 2020; 2 months ago
release dates 2 months ago 9 months 20 months ago
ago

Proprietary exc
Free and open- Free and ept for open
Partial; both
source, but the UI open- source kernel
Free and open-source, mainly proprietary and open-
License and the SDK are
the GPL
source, patches
source components,
proprietary and mainly (formerly
assorted licenses
closed source the GPL the MPL
2.0 B2G OS)

Linux (based on
Linux (base
Combination of Linux
OS family Linux Linux (based on Ubuntu) d Unix-based
MeeGo and Samsung
on Debian)
Bada)
 Convergenc
Supported CPU
ARM, x86-64 ARM, x86-64 e operating ARM ARM, x86, x86-64
architecture system

Apps: HTML5, QML, Go, JavaScript

C++, Xamarin.Forms
Programmed in C++, QML, Python , C++
(.NET C#, F#, VB)
System: C, C++, QML

Public issues list Yes Yes Yes No Yes

DRM-free Yes Yes Yes ? Yes

Device For feature

phones,
independent Yes Yes
not smart
No
system updates phones

Wireless system
Yes Yes No
updates

GPU accelerated
Yes Yes ?
GUI

B. Make the analysis of four different processes initiated and the operation of each
algorithm

First In First Out – FIFO

Arrival time Completion Response

CPU runtime time time Wasted time Penalty rate
Process
TLL t TF T = TF - TLL W=T-t P=T/t

A 0 4 5 5 0 1

B 3 4 9 6 2 1,5

C 4 2 11 7 5 3,50

Averages 6 2.3 2

L A B C

U 0 1 2 3 4 5 6 7 8 9

E A A A A B B B B C C
Shortest-Job-First (S.J.F.)

Arrival time Completion Response

time time
Process CPU runtime Wasted time Penalty rate
TLL t TF T = TF - TLL W=T-t P=T/t

A 0 5 5 5 0 1

B 3 4 11 8 4 2

C 4 2 7 3 1 1,50

D 8 4 15 7 3 1,75

E 10 5 20 10 5 2

Averages 6,6 2,6 1,65

L A B C D

U 0 1 2 3 4 5 6 7 8 9

E A A A A A C C B B B

L E

U 10 11 12 13 14 15 16 17 18 19

E B D D D D E E E E E

Shortest Remaining Time (S.R.T.)

Completion Response
Process Arrival time CPU runtime time time Wasted time Penalty rate
TLL t TF T = TF - TLL W=T-t P=T/t

A 0 5 5 5 0 1

B 3 4 11 8 4 2

C 4 2 7 3 1 1,50

D 8 4 15 7 3 1,75
E 10 5 20 10 5 2
Averages 6,6 2,6 1,65
L A B C D

U 0 1 2 3 4 5 6 7 8 9

E A A A A A C C B B B

L E

U 10 11 12 13 14 15 16 17 18 19

E B D D D D E E E E E

Round Robin

Arrival time Completion Response

time time
Process CPU runtime Wasted time Penalty rate
TLL t TF T = TF - TLL W=T-t P=T/t

A 0 5 10 10 5 2

B 3 4 15 12 8 3

C 4 2 8 4 2 2,00

D 8 4 18 10 6 2,5

E 10 5 20 10 5 2

Averages 9,2 5,2 2,30

L A B C D

U 0 1 2 3 4 5 6 7 8 9

E A A A B C A B C D A

L E

U 10 11 12 13 14 15 16 17 18 19

E E B D E B D E D E E
Bibliographic references
Round Robin Scheduling https://yourbusiness.azcentral.com/disadvantages-round-robin-scheduling-17493.html

Shortest Job First (SJF) https://www.guru99.com/shortest-job-first-sjf-scheduling.html

CPU Scheduling Algorithms in Operating Systems https://www.guru99.com/cpu-schedulingalgorithms.html

Mobile operating system https://en.wikipedia.org/wiki/Mobile_operating_system

Comparison of Scheduling Algorithms https://www.studytonight.com/operatingsystem/comparision-scheduling-

algorithms