Please enable JavaScript.
Coggle requires JavaScript to display documents.
Операційні системи за листопад, images - Coggle Diagram
Операційні системи за листопад
Address space is the set of all possible addresses that a program or process can access during its execution.
Swapping is a memory management mechanism in operating systems that involves temporarily moving processes or parts of them from the main memory (RAM) to the hard disk.
Free memory management
Memory management using bitmaps is a method of organizing free and allocated main memory in which the entire memory is divided into equal blocks, and each block is represented by 1 bit of information.
Memory management using linked lists is a method in which free and allocated memory areas are tracked as a list of elements, where each element contains information about a memory block and a pointer to the next one.
Virtual memory is a mechanism in operating systems that allows programs to use more memory than is physically available in the main memory (RAM) by temporarily storing part of the data on the disk.
The main requirements for the physical organization of file systems
Support for different file types
Fast file access
Efficient use of memory
Reliability and data integrity
Contiguous file allocation is a method of organizing files on a disk in which all blocks of a file are stored consecutively, one after another.
File allocation using linked lists
Singly linked lists are a data structure in which elements (nodes) are stored sequentially, and each node contains data and a pointer to the next node, with the last node pointing to NULL (the end of the list).
Indexed file allocation is a method of organizing files on a disk in which a special table (index block) is created for each file, containing the addresses of all the file’s blocks.
Linked lists with a file allocation table (FAT) are a method of file storage in which each file is represented as a linked list of disk blocks, and the links between blocks are maintained in a separate table rather than within the blocks themselves.
Sparse files are files in which large regions containing only zeros or empty data are not physically stored on the disk, but are represented as filled with zeros when read.
Directory entries are records in a file system that store information about the files and subdirectories contained within a directory.
Free cluster management
A bitmap of clusters is a data structure in a file system used to track free and occupied clusters on a disk.
A linked list of free clusters is a data structure in a file system used to track free clusters on a disk.
