CodeNext | Bal World Technologies

T he banker’s algorithm is a resource allocation and deadlock avoidance algorithm that tests for safety by simulating the allocation for predetermined maximum possible amounts of all resources, then makes an “s-state” check to test for possible activities, before deciding whether allocation should be allowed to continue. Developer:  Anirudh TP Licence:  OpenSource Platform/Language:  C   Download

Paging is a memory management scheme that eliminates the need for contiguous allocation of physical memory. This scheme permits the physical address space of a process to be non – contiguous. Developer:  Anirudh TP Licence:  OpenSource Platform/Language: C Download

In the two level directory structures, each user has her own user file directory (UFD). When a user job starts or a user logs in, the system’s master file directory (MFD) is searched. The MFD is indexed by user name or account number, and each entry points to the UFD for that user.  When a user refers to a particular file, only his own UFD is searched. Developer:  Anirudh TP Licence:  OpenSource Platform/Language: C Download

Simplest directory structure.All files in the same directory.Easy to Understand.To avoid name collision problem each file should have unique name. Developer:  Anirudh TP Licence:  OpenSource Platform/Language: C Download

In this scheme, a special block known as the Index block contains the pointers to all the blocks occupied by a file. Each file has its own index block. The ith entry in the index block contains the disk address of the ith file block. Developer:  Anirudh TP Licence:  OpenSource Platform/Language: C Download

In this scheme, each file is a linked list of disk blocks which need not be contiguous. The disk blocks can be scattered anywhere on the disk. The directory entry contains a pointer to the starting and the ending file block. Each block contains a pointer to the next block occupied by the file. Developer:  Anirudh TP Licence:  OpenSource Platform/Language: C Download

Each file occupies a set of contiguous block on the disk. Allocation using first fit/best fit. Only starting block and length of file in blocks are needed to work with the file. Allows random access Developer:  Anirudh TP Licence:  OpenSource Platform/Language: C Download