MEMORY ALLOCATION

MEMORY ALLOCATION USING PAGING

Previous Next

#include
#include “conio.h”
struct pstruct
{
int fno;
int pbit;
}ptable[10];

int pmsize,lmsize,psize,frame,page,ftable[20],frameno;

void info()
{
printf("\t\tMEMORY ALLOCATION USING PAGING\n");
printf("\t\t~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\n");
printf("\n\nEnter the Size of Physical memory--> ");
scanf("%d",&pmsize);
printf("\n\nEnter the size of Logical memory--> ");
scanf("%d",&lmsize);
printf("\n\nEnter the partition size--> ");
scanf("%d",&psize);
frame = (int) pmsize/psize;
page = (int) lmsize/psize;
printf("\nThe Physical memory is divided into %d no.of frames\n",frame);
printf("\nThe Logical memory is divided into %d no.of pages",page);
}

void assign()
{
int i;
for (i=0;i {
ptable[i].fno = -1;
ptable[i].pbit= -1;
}
for(i=0; i ftable[i] = 32555;
for (i=0;i {
printf("\n\nEnter the Frame number where page %d must be placed: ",i);
scanf("%d",&frameno);
ftable[frameno] = i;
if(ptable[i].pbit == -1)
{
ptable[i].fno = frameno;
ptable[i].pbit = 1;
}
}
getch();
// clrscr();
printf("\t\tPAGE TABLE\n");
printf("\t\t~~~~~~~~~~\n");
printf("PageAddress FrameNo PresenceBit\n\n");
for (i=0;i printf("%d\t\t%d\t\t%d\n",i,ptable[i].fno,ptable[i].pbit);
/* printf("\n\n\n\tFRAME TABLE\n\n");
printf("FrameAddress PageNo\n\n");
for(i=0;i printf("%d\t\t%d\n",i,ftable[i]); */
}

void cphyaddr()
{
int laddr,paddr,disp,phyaddr,baddr;
getch();
// clrscr();
printf("\n\n\n\tProcess to create the Physical Address\n\n");
printf("\nEnter the Base Address: ");
scanf("%d",&baddr);
printf("\nEnter the Logical Address: ");
scanf("%d",&laddr);

paddr = laddr / psize;
disp = laddr % psize;
if(ptable[paddr].pbit == 1 )
phyaddr = baddr + (ptable[paddr].fno*psize) + disp;
printf("\nThe Physical Address where the instruction present: %d",phyaddr);
}
void main()
{
clrscr();
info();
assign();
cphyaddr();
getch();
}

MEMORY ALLOCATION
Memory Management
Output RW
READER – WRITER PROBLEM
DEKKER ‘S ALGORITHM
ROUND ROBIN SCHEDULING
SEGMENTATION
PRIORITY SCHEDULING
SHORTEST JOB FIRST SCHEDULING
SCHEDULING ALGORITHMS - FIFO