Tutorial 2 by Azlina Ahmadi Julaihi

67174

2019-09-30 02:10:23 UTC

No support for multiprogramming or networking

66115

661152 — 2019-09-30 02:10:40 UTC

This memory scheme operates on the first come, first serve basis; meaning that as newer jobs enter the system that are not the same size as those that just vacated memory, they are fit into available spaces on a priority basis.

64885

2019-09-30 02:11:00 UTC

External fragmentation. One way is to suffle memory content to place all free memory together in one large block

66164

2019-09-30 02:11:14 UTC

No support for multiprogramming and no cost effective.

isdevoice — 2019-09-30 02:11:26 UTC

68848 Mahmoud Kassab

kassab3m — 2019-09-30 02:11:41 UTC

allpros61 — 2019-09-30 02:11:49 UTC

65834
External fragmentation

66381 Khoo Pei Ling

2019-09-30 02:11:53 UTC

Full memory utilization only during loading of first jobs.
Subsequence allocation causes memory waste and external fragmentation occurs.

67718 Sim

2019-09-30 02:11:55 UTC

Compaction is a process in which the free space is collected in a large memory chunk to make some space available for processes. In memory management, swapping creates multiple fragments in the memory because of the processes moving in and out. Compaction refers to combining all the empty spaces together and processes. Compaction helps to solve the problem of fragmentation, but it requires too much of CPU time. It moves all the occupied areas of store to one end and leaves are large free space for incoming jobs, instead of numerous small area. In compaction, the system also maintains relocation information and it must be performed on each new allocation at job to the memory or completion of job from memory.

64619

a1700099 — 2019-09-30 02:11:56 UTC

Number of partitions is predefined and limits the total number of active processes in the system
Partition sizes are preset and small jobs do not run efficiently
Too small a partition size results in large jobs having longer turnaround time
Too large a partition size results in internal fragmentation

66148 Husna

661481 — 2019-09-30 02:11:58 UTC

External fragmentation. Compaction takes all of the free memory and puts it all in one place so as to be usable for the next process(es) which are waiting for memory.

64571

645713 — 2019-09-30 02:12:21 UTC

1) number of partitions is predefined and limits the total number of active processes in the system
2) partition sizes are preset and small jobs do not run efficiently
3) arbitrary partition sizes lead to undesired results
4) a partition size too small results in having longer turnaround time
5) a partition sizs too large results in internal fragmentation

2019-09-30 02:12:31 UTC

65351
-Doesn't support multiprogramming.
-Program must be less than memory block size to be able to execute

2019-09-30 02:12:38 UTC

67049

One of the first problems with this type of memory allocation scheme is that it doesn't support multiprogramming or networking, it can only handle one job at a time.

65986

fionagjs — 2019-09-30 02:12:38 UTC

-Internal fragmentation is the wasted space within each allocated block because of rounding up from the actual requested allocation to the allocation granularity.
-External fragmentation is the various free spaced holes that are generated in either your memory or disk space.

ching980301 — 2019-09-30 02:12:58 UTC

(68083)
Internal fragmentation - The memory must be partitioned into variable sized blocks and assign the best fit block to process
External fragmentation -compaction, paging and segmentation

68121 Yeo voon look

vyeoyeo — 2019-09-30 02:13:04 UTC

This memory scheme operates on the first come, first serve basis : meaning that as newer jobs enter the system that are not the same size as those just vacated memory, they are fit into available spaces on the priority basis.

64915- Alif Aziz

alifaziz70 — 2019-09-30 02:13:05 UTC

Multiprogramming is the allocation of more than one concurrent program on a computer system and its resources. Multiprogramming allow using the CPU effectively by allowing various users to use the CPU and I/O devices effectively

2019-09-30 02:13:08 UTC

Hazim (66721)

The type of fragmentation which is reduced by compaction is external fragmentation. Compaction takes all of the free memory and put it all in one place for the next process which are waiting for memory.

66745 Mohd Alif Amirullah

2019-09-30 02:13:09 UTC

External fragmentation. Because compaction takes all free memory and compacts all of the in one so it will be usable for next process which are waiting for memory

LO XIANG YUAN 66508

2019-09-30 02:13:13 UTC

Disadvantage of relocatable dynamic partition is time consumption is very high due to compaction. Every program in memory must relocated so they are contiguous

Paul Chia Chieng Xiang 67469

2019-09-30 02:13:15 UTC

1)Time consumption is very high.

2)Due to compaction Every program in memory must be relocated so they are contiguous

3)Operating system must distinguish between addresses and data values which consumes a lot of time

zzulhaziq21 — 2019-09-30 02:13:18 UTC

66874 Zulhaziq😉

Tasks take longer time to complete

68016

2019-09-30 02:13:21 UTC

- Does not support multiprogramming or networking
- Program size must be less than memory size to execute.

2019-09-30 02:13:32 UTC

Rachel (67526)

The type of fragmentation which is reduced by compaction is external fragmentation. Compaction takes all the free memory and puts it all in one place so as to be usable for next processes which are waiting for memory. This is only done with dynamic and relocatable dynamic memory systems.

rebeccayii98 — 2019-09-30 02:13:32 UTC

67557
Internal Fragmentation block assigned to process is in fixed-sized memory while external fragmentation is in variable-sized memory. Internal fragmentation occurred when the process is larger than memory while external fragmentation occurred when the process is removed.

64843 (Mohamad Amir Irman)

namrivegeta — 2019-09-30 02:13:33 UTC

Multiprogramming is
1. The capability of an operation system to run multiple task in the same time.
2. Used to shorten the time for the operation system to finish the task compared to a single task system

2019-09-30 02:13:44 UTC

64887
Can concentrate on one task at a time.

65904 Ester

2019-09-30 02:13:44 UTC

External fragmentation. Compaction takes all of the free memory and puts it all in one place so as to be usable for the next process which are waiting for memory. This is only done with dynamic and relocatable dynamic memory system.

67687

Sharon0429 — 2019-09-30 02:13:45 UTC

Internal fragmentation is the wasted space when each allocated block because of rounding up from the actual requested allocation to the allocation granularity.
External fragmentation is the various free spaced holes that are generated in either memory or disk space.

2019-09-30 02:13:50 UTC

External fragmentation.
Compaction moves memory around until it is all placed together in one big block.

66642 Midori.

67822

2019-09-30 02:13:55 UTC

external fragmentation. It can be reduce by shuffle memory content to place all free memory together in one large block

65391 Alvin Choo Ming Siang

alvincms98 — 2019-09-30 02:13:56 UTC

Compaction is the reclaiming fragmented section of memory space.
Compaction helps to solve the problem of fragmentation. It moves all the occupied areas to store to one end and leaves one large free space for incoming jobs, instead of numerous small ones

66403 KUAH LEK HOW

lekhow98 — 2019-09-30 02:14:00 UTC

Multiprogramming is a task to execute multiple jobs by the same computer. It is use to overcome the problem of underutilization of CPU & main memory. It provide serving several jobs to share the time of CPU. But multiprogramming is not defined to be execution of jobs at the same instance of time.

67790

2019-09-30 02:14:06 UTC

No cost effective

azzierahelik — 2019-09-30 02:14:14 UTC

68641

Internal fragmentation-wasted space within each allocated block because of roundung up from the actual requested allocation
External fragmentation- various spaced holes that are generated in either your memory or disk space

66132

minhong_98 — 2019-09-30 02:14:25 UTC

Internal fragmentation occurs when the amount of main memory requested by a program is less than the size of the fixed partition allocated. While external fragmentation is the development of unusable portions of memory in a dynamic partition memory management schemes

67889 Tan Pei Wen

tanpwei98 — 2019-09-30 02:14:28 UTC

•Full memory utilization only during loading of first job
•Subsequent allocation cause memory waste

syaiffudin_sai — 2019-09-30 02:14:31 UTC

67857 Syaiffudin bin Salleh

- Ability of an OS to execute more than one job/program on a single processor
- it increases CPU utilization
- maximize total job throughput of a computer

66710(Mohd Harith Syazwan)

harithsyazwan69 — 2019-09-30 02:14:46 UTC

Multiprogramming is executing a few job at a time on a system. It is used because it is efficient and less time needed which single use scheme do not have.

jongyonee94 — 2019-09-30 02:14:49 UTC

66304 Jong

In this dynamic partition technique, the partition size is not declared initially. It is declared at the time of process loading.this improve the internal fragmentation but in other hand it still have disadvantage on external fragmentation

rebeccayii98 — 2019-09-30 02:14:54 UTC

67557
When there is no job can access the memory contiguous lu.

64932 (MUHAMMAD EZRA BIN ROSLI)

2019-09-30 02:14:59 UTC

Multiprogramming is the allocation of more than one concurrent programs on a computer system and its resources. Multiprogramming allows usage of cpu effectively by allowing various users to use the cpu and I/O devices effectively.

68754

2019-09-30 02:15:06 UTC

Single user operating is that in which one user works on one interface. In these systems no other operating system is interrupting with the processing. Single user operating systems work on processing that require less resources. Today we will discuss some of advantages and disadvantages of these systems.

65111

nurikha177 — 2019-09-30 02:15:17 UTC

-Partition sizes are preset and small jobs do not run efficiently.
-Too small a partition size results in large jobs having longer turnaround time
-Sized of partitions could only be designated when the machine was powered on

65694

2019-09-30 02:15:35 UTC

-Requires contiguous loading of entire program.
-in order to reconfigure a partition size, the machine had to be shut down, reconfigured and powered back on.

Chua Ping Yi 65699

2019-09-30 02:15:39 UTC

Compaction is reclaiming fragmented sections of memory space. Compaction is used in order to process the information using fewer bits by using encoding schemes.

68103

2019-09-30 02:15:50 UTC

65165 PATTRICK ANAK PENGIRAN

pattrickpatt — 2019-09-30 02:16:25 UTC

A form of parallel processing where multiple programs are running at the same time in a uniprocessor.
It is used to utilize the CPU during downtime such as waiting for an I/O to finish.

68312 Peremma Sayini

2019-09-30 02:16:46 UTC

-Time consumption is very high.
-Due to compaction, every program in memory must be relocated so they are contigous.
-Operating system must distinguish between addresses and data values which consumes a lot of time.

2019-09-30 02:16:59 UTC

64887
Prevent data loss during power outage or software failure and increase the chances of data recovery in critical situation.

2019-09-30 02:17:01 UTC

66840 Muhd Nasharuddin bin Sufiyan
Can prevent data loss during software failure or power outages.

2019-09-30 02:17:07 UTC

Hazim (66721)

Relocation is the process of assigning load addresses for position-dependent code and data of a program and adjusting the code and data to reflect the assigned addresses. Relocation should be performed before the running of any program.

YanaNS — 2019-09-30 02:17:08 UTC

68680
Internal fragmentation - Occurs when a fixed sized memory allocation technique is used
External fragmentation - Occurs when dynamic memory allocation technique is used

68121 Yeo Voon Look

vyeoyeo — 2019-09-30 02:17:09 UTC

Rellocation should be performed before the running of any program. Compilers or assembles typically generate the executable with zero as the lower-most, starting address. Before the execution of object code, these addresses should be adjusted so that they denote correct runtime addresses.

EMMY ELMIRA

2019-09-30 02:17:17 UTC

65881

due to compaction, every program in memory must be relocated, so they are contiguous.

2019-09-30 02:17:27 UTC

Relocation moves a program from one area of memory to another.

- it should be performed before running any program

66642 Midori

64843 ( Mohamad Amir Irman )

namrivegeta — 2019-09-30 02:18:00 UTC

Relocation is the work that collect all external fragmentation and put it into one memory cache to be used by the future task.It should be done when the memory has been used by more than 50%.

47558

475583 — 2019-09-30 02:18:06 UTC

Internal fragmentation - Memory waste when the partition is too large.
External fragmentation - Memory waste at the fragments between blocks.

64619

a1700099 — 2019-09-30 02:18:09 UTC

Relocation moves programmes from one area of memory to another and should be performed before running any programme. It is done when unacceptable fragmentation characteristics are to be resolved.

64862

2019-09-30 02:18:15 UTC

easy to maintain=These systems uses less resources and complexity of them is less so it is easy to maintain and debug.

67889 Tan Pei Wen

tanpwei98 — 2019-09-30 02:18:19 UTC

Relocation means moving program from one place to another. Relocation should be performed before any program running .

66745 Mohd Alif Amirullah

2019-09-30 02:18:31 UTC

Relocation is the process of assigning load addresses for position-dependent code and data of a program and adjusting the code and data to reflect the assigned addresses.It should be done before running any program

65280 Zulfadli Hazim Bin Zul Azlan

zulfadlihazim — 2019-09-30 02:18:31 UTC

Relocation is done by adjusting the addresses used by the processes. It should be performed before the running of any problem.

64885

2019-09-30 02:18:42 UTC

Reallocation should be performed before the running of any program.Compilers or assemblers typically generate the executable with zero as the lower most, starting address. Before the execution of object code, these addresses should be adjusted so that they denote the correct runtime addresses.

2019-09-30 02:18:46 UTC

66840 - Muhd Nasharuddin bin Sufiyan
Relocation is the action of moving free spaces in a memory and group them together so that it can accomodate to jobs that needed it. It should be performed everytime before a program started to run.

65155

65155 — 2019-09-30 02:19:09 UTC

-the number of partitions is predefined and limits the total number of active processes in the system

-partition sizes are preset and small jobs do not run efficiently

-arbitrary partition sizes lead to undesired results

-too small a partition size results in large jobs having longer turnaround time

-too large a partition size results in memory waste or internal fragmentation

68754

2019-09-30 02:19:23 UTC

This is the oldest and simplest technique used to put more than one processes in the main memory. In this partitioning, number of partitions (non-overlapping) in RAM are fixed but size of each partition may or may not be same. As it is contiguous allocation, hence no spanning is allowed.

66164

2019-09-30 02:19:26 UTC

Relocation move a program from one area of memory to another. It often performed before the running of any program.

Paul 67469

2019-09-30 02:19:41 UTC

Reallocation should be performed before the running of any program.

Compilers or assemblers typically generate the executable with zero as the

lower-most, starting address. Before the execution of object code, these addresses should be adjusted so that they denote the correct runtime addresses.

67174

2019-09-30 02:19:51 UTC

Relocation is move a program from one area of memory to another. Performed before running any program.

65986

fionagjs — 2019-09-30 02:19:59 UTC

Relocation is the process of assigning loaded address for position-dependent code and data of program and adjusting the code and data to reflect the assigned addresses. Reallocation should be performed before the running of any program.Compilers or assemblers typically generate the executable with zero as the lower-most , starting address. Before the execution of object code,these addresses should be adjusted so that they denote the correct runtime addresses.

2019-09-30 02:20:10 UTC

67526 - Rachel

Reallocation is the process of assigning load addresses for position- dependent code and data of a program and adjusting the code and data to reflect the assigned addresses. Reallocation should be perform before running of any program.

azzierahelik — 2019-09-30 02:20:13 UTC

68641
Compiler or assemblef typically generate the execute with zero as lower most starting address, before amexecution of obje t code, these addresses should be adjusted so that they denote the correct runtime addresses.
Reallocation should be performed before the running of any program.

66132

minhong_98 — 2019-09-30 02:20:14 UTC

Relocation is the process by which program are reposition in main memory to allow compaction of free memory areas. Reallocation should be performed before the running of any program.

65165 PATTRICK ANAK PENGIRAN

pattrickpatt — 2019-09-30 02:20:17 UTC

A process where a job/program has to be moved from its current address to a new one to create space for new jobs to be run.
When there are jobs in waiting list, a certain time had passed or certain percentage of memory is busy.

68083

ching980301 — 2019-09-30 02:20:17 UTC

Relocation is the process of assigning loaded address for position, dependent code and data of the program and adjusting the code and the data to reflect the assigned addresses. Reallocation should be performed before the running of any program.

YanaNS — 2019-09-30 02:20:19 UTC

68680
Relocation of memory is the process of reserving a partial or complete portion of computer memory for the execution of a program
Relocation should be performed before the running of program

66710(Mohd Harith Syazwan)

harithsyazwan69 — 2019-09-30 02:20:20 UTC

Relocation is the adjusting of addresses so that they denote the correct runtime addresses. This should be done before running any programme

66403 KUAH LEK HOW

lekhow98 — 2019-09-30 02:20:51 UTC

Relocation is the process to gather all the empty & wasted block and compact it into a memory block to accomodate some of all the jobs waiting to get in. The relocation of memory is low or when there are the jobs waiting to get in.

64571

645713 — 2019-09-30 02:21:18 UTC

relocation moves a program from one area of memory to another, it should be performed before running any program. this has to be done when unacceptable

fragmentations characteristics are to be resolved.

66579

isdevoice — 2019-09-30 02:21:27 UTC

Relocation occur when operating system adjusts the addresses in a process to reflect the memory position in memory or the hardware adds relocation register(base) to virtual address to get a physical address.
Reallocation should be performed before the running of any program as the compilers or assembles typically generate executable with zero at the lower-most. Therefore, the address be adjusted so they denote the correct runtime address

66508 Lo Xiang Yuan

2019-09-30 02:21:43 UTC

Relocation process start before running the program. This process done by the linker during compile time. Compiler generate the executable with zero as the lower-most.

ridhbutton — 2019-09-30 02:21:49 UTC

64895 ridhwan
Advantages to single-user, single-tasking operating systems are, the computer is dedicated to one particular task at a time.

65155

65155 — 2019-09-30 02:21:54 UTC

Relocation moves a program from one area of memory to another, it should be performed before running any program, this has to be done when unacceptable fragmentation characteristics are to be resolved. This way the empty blocks gathered together and compacted to make one block of memory large enough to accommodate some or all of the jobs waiting to get in.

65391 Alvin Choo Ming Siang

alvincms98 — 2019-09-30 02:22:17 UTC

Relocation process must be performed before running the program. This process is typically done by the linker during compilation, although it can be done at runtime by a relocating loader. Compilers or assemblers typically generate the executable with zero as the lower-most, starting address. Before the execution of the object code, these addresses should be adjusted so that they denote the correct runtime addresses.

68848

kassab3m — 2019-09-30 02:22:21 UTC

Memory manager relocates programs, gather together all empty blocks.
Compact the empty blocks: make one block of memory large to some or all jobs waiting.
It Should be performed before running of any program.

65351

2019-09-30 02:22:27 UTC

relocation is an act that gathers all empty block so that it is large enough to accomodate some or all of the waiting jobs.
Relocation should be performed before running any program

Jonita 66305

2019-09-30 02:22:43 UTC

Time consumption is very high. Due to compaction Every program in memory must be relocated so they are contiguous.

2019-09-30 02:22:47 UTC

66214

Concentrate on one task In modern operating system there are running multiple tasks at a time. Like many applications and tasks are running at a time but in single user OS only one task run at a time. So these systems are sometimes give less output result at a time.

65904

2019-09-30 02:23:08 UTC

Relocation is the process of assigning load addresses for position-dependent code and data of program and adjusting the code and data to reflect the assigned addresses. Reallocation should be performed before the running of any program

64918

aqilnukman30 — 2019-09-30 02:23:12 UTC

Support for multi –programming

• The jobs in other partitions are prevented from overriding the boundaries of other jobs. The partition intrusion does not exist in Single User Partition scheme as there is only one job present and executing at any point of time.

64862

2019-09-30 02:23:22 UTC

Easy to maintain=Algorithms needed to implement Fixed Partitioning are easy to implement.

68754

2019-09-30 02:23:31 UTC

Reallocation should be performed before the running of any program.

Compilers or assemblers typically generate the executable with zero as the

lower-most, starting address. Before the execution of object code, these addresses should be adjusted so that they denote the correct runtime addresses.

66115

661152 — 2019-09-30 02:23:33 UTC

Relocation is the process of assigning load addresses for position-dependent code and data of a program and adjusting the code and data to reflect the assigned addresses.

Relocation moves a program from one area of memory to another, it should be performed before running any program; this has to be done when unacceptable fragmentations characteristics are to be resolved. This way, the empty blocks are gathered together and compacted to make one block of memory large enough to accommodate some or all of the jobs waiting to get in.

65699 Chua Ping Yi

2019-09-30 02:23:55 UTC

Reallocation should be performed before the running of any program.Compilers or assemblers typically generate the executed with zero as the lower-most,starting address.Before the execution of object code, these addresses should be adjusted so that they denote the correct runtime addresses.

67718 Sim

2019-09-30 02:24:07 UTC

Relocation is the process of assigning load addresses for position-dependent code and data of a program and adjusting the code and data to reflect the assigned addresses. Prior to the advent of multi-process systems, and still in many embedded systems, the addresses for objects were absolute starting at a known location, often zero. Since multiprocessing systems dynamically link and switch between programs it became necessary to be able to relocate objects using position-independent code. A linker usually performs relocation in conjunction with symbol resolution, the process of searching files and libraries to replace symbolic references or names of libraries with actual usable addresses in memory before running a program.

Relocation is typically done by the linker at link time, but it can also be done at load time by a relocating loader, or at run time by the running program itself. Some architectures avoid relocation entirely by deferring address assignment to run time; this is known as zero address arithmetic.

64915

2019-09-30 02:24:27 UTC

Reallocation should be performed before the running of any program. Compilers or assemblers typically generate the executable with zero as the most lower-most, starting address. Before the execution of the object code these address should be adjusted so that they denote the correct runtime address

64932 (MUHAMMAD EZRA BIN ROSLI)

2019-09-30 02:24:34 UTC

Relocation should be performed before running any program. Compilers or assemblers typically generate the executable with zero, as the lower-most, starting address. Before the execution of object code, these address should be adjusted so that they denote the correct runtime addresses.

nasharuharuka — 2019-09-30 02:24:44 UTC

66840 - Muhd Nasharuddin bin Sufiyan
All resources are dedicated to that one user only.

yien9898 — 2019-09-30 02:25:19 UTC

68078
1.requires contiguous loading of programs.
2.to work well all jobs must be same size and memory size known ahead of time.
3.arbitrary partition size leads to undesired results. If the partition too small, large jobs have longer turnaround time. If the partition too large, memory will be wasted.

64918

aqilnukman30 — 2019-09-30 02:25:56 UTC

Relocation is the process of assigning load addresses for position-dependent code and data of a program and adjusting the code and data to reflect the assigned addresses.It should be performed before running any program.

2019-09-30 02:26:00 UTC

ridhbutton — 2019-09-30 02:26:26 UTC

64895
Algorithms needed to implement Fixed Partitioning are easy to implement. It simply requires putting a process into certain partition without focussing on the emergence of Internal and External Fragmentation.

68103

2019-09-30 02:26:45 UTC

RELocation should be performed before running of any program .

64918

aqilnukman30 — 2019-09-30 02:27:43 UTC

Supports one user at a time

-In these systems one user is only active at a time. So there will be no other user interfering with the applications. And in these systems all computer resources are used by a user requests.

68016

2019-09-30 02:28:46 UTC

A relocation should be performed when a certain percentage of memory is busy

Mohd Faris Iskandar 63377

2019-09-30 02:29:11 UTC

External fragmentation. In compaction process, all free memory is gathered and put all in one place to be used in further waiting process. Only done in dynamic and relocatable dynamic memory system.

azjulaihi — 2019-09-30 02:29:22 UTC

internal fragmentation

67687

Sharon0429 — 2019-09-30 02:30:15 UTC

66378

663782 — 2019-09-30 02:31:23 UTC

•Full memory utilization only during loading of first job

•Subsequent allocation cause memory waste

alif257 — 2019-09-30 02:34:25 UTC

65377
Does not support multiprogramming or networking. It can only handle one job at a one time

66115

661152 — 2019-09-30 02:34:49 UTC

· Compaction is a process in which the free space is collected in a large memory chunk to make some space available for processes.

· In memory management, swapping creates multiple fragments in the memory because of the processes moving in and out.

· Compaction refers to combining all the empty spaces together and processes.

· Compaction helps to solve the problem of fragmentation, but it requires too much of CPU time.

· It moves all the occupied areas of store to one end and leaves one large free space for incoming jobs, instead of numerous small ones.

· In compaction, the system also maintains relocation information and it must be performed on each new allocation of job to the memory or completion of job from memory.

67790

2019-09-30 02:44:39 UTC

Relocation is move a program from one area of memory to another. It should be performed before running any program.

67049

2019-09-30 02:45:42 UTC

Relocation is move a program from one area of memory to another. It should be performed before running any program.

97830 - Adib

2024-11-05 06:12:39 UTC

Multiprogramming lets a computer run multiple programs at once by quickly switching between them. This keeps the CPU busy, reduces waiting time, and makes better use of resources like memory and processing power. It helps complete more tasks faster and improves system efficiency.

97930 Adib

2024-11-05 06:14:16 UTC

Internal fragmentation is wasted space inside allocated memory blocks when a process doesn’t use all the space given to it.

External fragmentation is wasted space outside allocated blocks, leaving small gaps between them that can’t be used by new processes easily.

Long story short, internal fragmentation is unused space inside blocks, while external fragmentation is unused space between blocks.

97930 Adib

2024-11-05 06:16:45 UTC

Single User Systems: Only one program runs at a time, so CPU and memory are underused, limiting multitasking and efficiency.

97930 Adib

2024-11-05 06:17:12 UTC

Fixed Partitions: Memory is divided into fixed sizes, leading to internal fragmentation if processes don’t use the entire partition. It also limits flexibility as partition sizes can’t change.

97930 Adib

2024-11-05 06:17:58 UTC

Dynamic Partitions: Partitions are created to fit the exact size of a process, but this can lead to external fragmentation, as gaps form between partitions over time.

97930 Adib

2024-11-05 06:18:07 UTC

Relocatable Dynamic Partitions: Memory blocks can move to reduce fragmentation, but this requires extra processing time and can slow down system performance due to frequent rearrangement.

97930 Adib

2024-11-05 06:19:15 UTC

Compaction is the process of moving memory contents to eliminate gaps (external fragmentation) between partitions. It’s needed to create larger continuous blocks of free memory, allowing new processes to fit into memory more easily and improving overall memory utilization.

97930 Adib

2024-11-05 06:20:05 UTC

Compaction reduces external fragmentation by shifting memory contents to remove gaps between allocated blocks. This creates larger, continuous free spaces, making it easier to allocate memory for new processes.

97930 Adib

2024-11-05 06:20:57 UTC

Single user systems are simple to use, as they focus on one user and one task at a time. This makes them easy to manage, with fewer security risks and minimal system resource conflicts, leading to a stable and efficient environment for the user.

97930

2024-11-05 06:21:27 UTC

Fixed partitions are easy to set up and manage, as memory is divided into fixed sizes. This allows for quick and simple allocation of memory to processes, reducing complexity. It also provides stability, as partitions are fixed and don’t change during runtime, minimizing memory management overhead.

97930 Adib

2024-11-05 06:22:18 UTC

Relocation is the process of moving a program or its data to a different memory location during execution. This helps manage memory efficiently and avoid fragmentation.

It should be performed only when needed, such as when there’s not enough continuous memory space, or during compaction to free up larger memory blocks.

101859 (MOHAMAD SHUKRI)

2024-11-06 13:46:36 UTC

Used to reduce processor busy time.
To improve sysem throughput.
Efficient utilization of system resources.

101859 (Shukri)

2024-11-06 13:49:38 UTC

Internal Fragmentation:

Is Fixed partitions.
Amount of memory requested by program is less than the size of fixed partition.

External Fragmentation:

Is Dynamic partitions.
Unusable partition of memoryin a dynamic partition memory.

101859 (Shukri)

2024-11-06 13:52:10 UTC

Not cost effective
Not support for multiprogramming.

101859 (Shukri)

2024-11-06 13:52:55 UTC

Require contigous loading in system.

101859 (Shukri)

2024-11-06 13:55:35 UTC

Used to consolidate all the external fragments into one contigous block. Sometime, It allowing more program to be active at the same time.

101859 (Shukri)

2024-11-06 13:56:09 UTC

External Fragmentation.

101859 (Shukri)

2024-11-06 14:07:15 UTC

Relation is a process which program are repositioned in main memory to allow compactionof free memory area.

Sh Farah_100983

2024-11-18 14:10:29 UTC

executing multiple programs concurrently on a computer system with a single CPU
maximize the utilization of the CPU by organizing jobs so that CPU always has one to execute

Sh Farah_100983

2024-11-18 16:52:32 UTC

Internal Fragmentation

occurs within allocated memory blocks
associated with fixed-size memory allocation
leads to wasted space within memory blocks

External Fragmentation

occurs among free memory blocks
associated with variable-size memory allocation
leads to inefficient use of memory due to scattered free space