Professional Documents
Culture Documents
U1 Actividad 2 de Aprendizaje para RA Analisis de Procesos
U1 Actividad 2 de Aprendizaje para RA Analisis de Procesos
BOGOTA COLOMBIA
03 DE AGOSTO DEL 2023
U1. Actividad 2 de aprendizaje para RA: Análisis de procesos
EJERCICIO 1
PowerShell y el símbolo del sistema (cmd) son dos interfaces de línea de comandos
PowerShell.
es tratado como un objeto. Esto implica que los resultados de los comandos son
manera más sencilla. Por otro lado, CMD generalmente devuelve texto sin una
obtenidos.
En relación a la "compatibilidad y compatibilidad con versiones anteriores",
PowerShell es una tecnología más reciente que ha sido diseñada para ser
operaciones y procesos.
Mostrar IP
TOP 5 Procesos con más consumo
actual
EJERCICIO 2
FIFO is a memory management technique in which the oldest process that entered the
memory is the first one to be removed when the system needs to free up space. When a
new process requires memory allocation and there is not enough space, the system selects
the oldest process in memory and swaps it out to make room for the new process. This
method is relatively straightforward to implement but may suffer from the "Belady's
Anomaly," where increasing the number of frames allocated does not guarantee a reduction
in page faults.
SRT is a variation of the Shortest-Job-First (SJF) algorithm and is used in dynamic priority
systems. In memory management, it refers to selecting the process with the shortest
remaining time for execution. When a new process needs memory space,
the system compares the remaining execution time of all processes in memory and selects
the one with the shortest time. The chosen process is given priority access to memory. This
approach can lead to better memory utilization and faster execution times for shorter
processes, but it requires frequent scheduling decisions and may suffer from increased
Shortest-Job-First (S.J.F.):
The SJF algorithm allocates memory to processes based on their estimated execution times.
When a new process requires memory, the system selects the process with the shortest
estimated execution time and allocates memory to it. This technique aims to minimize the
average waiting time and turnaround time for all processes. However, it requires accurate
predictions of execution times, and if the estimates are inaccurate, longer processes may face
Round Robin:
The Round Robin algorithm is commonly used for CPU scheduling, but it can also be
adapted for memory management. In this method, each process is allocated a fixed amount
of memory (known as a "frame") in a cyclic manner. When a process exceeds its allocated
frame size, it is moved to the back of the queue, and the next process in line gets a turn to
execute. This method ensures fair allocation of memory to all processes, making it suitable
First In First Out (FIFO) - Simple and easy to - May lead to "Belady's
implement Anomaly" (increasing the
number of frames doesn't
- Ensures all processes get a guarantee reduced page faults)
chance to run
-May suffer from suboptimal
memory utilization
First In First Out (FIFO) - The FIFO algorithm is a process scheduling method where
processes are executed in the order they arrived in the ready queue. In other words, the
process that arrived first will be the first to receive CPU time. FIFO is easy to implement
and ensures that all processes are executed, but it may lead to the phenomenon known as
"priority inversion," where a high-priority process must wait for low-priority processes that
Shortest Remaining Time (S.R.T.) - The SRT algorithm is a variant of the Shortest- Job-
First (SJF) algorithm and prioritizes the process with the shortest remaining execution
time. When a new process arrives in the ready queue, its remaining time is compared with
the remaining time of the process currently running. If the new process has a shorter
remaining time, it is given priority and executed. This can result in better CPU utilization
but requires more frequent scheduling and may increase system overhead due to
continuous comparisons.
Shortest-Job-First (S.J.F.) - The SJF algorithm schedules processes based on their estimated
execution time. When a process enters the ready queue, the system
selects the process with the shortest execution time and executes it first. This leads to
processes are waiting for shorter ones, the longer processes may experience excessive
waiting time.
Round Robin (RR) - The Round Robin algorithm is a process scheduling method in which
each process receives a fixed amount of CPU time called a "quantum." If the process has
not finished when its quantum is exhausted, it is moved to the end of the ready queue and
given a new opportunity for execution later. This approach ensures that all processes
receive equal CPU time, making it especially useful in time-sharing systems. However, it
may lead to increased latency due to frequent context switches as processes change rapidly.
Additionally, the performance of the algorithm heavily depends on the chosen quantum
size.