Features Multiprogramming | Multitasking Basic It allows multiple | A supplementary of the programs to utilize | multiprogramming the CPU | system also allows for simultaneously. user interaction. Mechanis | Based on the context} Based on the time- m switching sharing mechanism. mechanism. Objective | It is useful for It is useful for running reducing/decreasing multiple processes at theCPU idle time and| same time, effectively increasing increasing CPU and throughput as much | system throughput. as possible. Execution | When one job or/In a _ multiprocessing process completes its | system, multiple execution or switches | processes can operate to an I/O task in a | simultaneously by multi-programmed allocating the CPU for a system, the system | fixed amount of time. momentarily suspends that process. It selects another process from the process scheduling pool (waiting queue) to run. CPU In a multiuser | In a single-user Switching | environment, the | environment, the CPU CPU switches | switches between the between processes of various programs/processes | programs. quickly. Timing It takes maximum | It takes minimum time to time to execute the process. execute the process.Parameters Paging Segmentation Individual In Paging, we break a [In the case of Memory process address space | Segmentation, we break into blocks known as | a process address space pages. into blocks known as sections/segments. Memory Size |The pages are blocks | The _ sections/segments of fixed size. are blocks of varying sizes. Accountability The OS divides the available memory into individual pages. The compiler _ mainly calculates the size of individual segments, their actual address as well as virtual address. ‘Speed This technique is comparatively much faster in accessing memory. This technique is comparatively much slower in ing memory than Paging. Size The available memory determines the individual page sizes. The user determines the individual segment sizes. Fragmentation The Paging technique may underutilize some of the pages- thus The Segmentation technique may not use some_of the memoryProcess Thread Definition A process is a A thread is a lightweight program under process that can be execution i.e, an active | managed independently program. by a scheduler, Running Processes run in Threads within the same mechanism | separate memory process run in a shared spaces. memory space. Process is heavy It is a lightweight process Concept weight and any and a segment of a program is in process. execution. PCB The process has its Thread has Parents’ PCB, own Process Control | its own Thread Control Block, Stack, and Block, and Stack and Address Space. common Address space. Context Context switching Context switching Switching between the process between threads of the is more expensive same process is less expensive Dependency | Processes are Threads are dependent independent. Controlling | Process is controlled Threads are controlled by by the operating system. programmer in a programSr. Long Term Scheduler Short Term Scheduler No 1 It is job scheduler Itis CPU scheduler 2 It selects processes from job | It sclects processes from pool and loads them into | ready queue which are ready memory for execution to execute and allocates CPU to one of them 3. | Access job pool and ready} Access ready queue and queue CPU 4 |It executes much less| It executes frequently. It frequently. It executes when | executes when CPU is memory has space to | available for allocation accommodate new process. 5 Speed is less than short term | Speed is fast scheduler 6 | It controls the degree of It provides lesser control multiprogramming over degree of multiprogramming 7 It chooses a good process It chooses a new process for that is a mix-up of input/output bound and CPU bound. a processor quite frequently.Parameter Command Line Graphic User Interface(CLI) Interface(GUI) Definition | Interaction is by | Interaction with devices is by typingcommands | graphics and —_visual components and icons Understan | Commands need to | Visual indicators and icons ding be memorized are easy to understand Memory | Less memory is | More memory is required as required for storage | visual components are involved. Working | Use of keyboard for | Use of mouse for interaction Speed commands makes | makes it slow CLI quicker. Resources | Only keyboard Mouse and keyboard both used can be used Accuracy | High Comparatively low Flexibility | Command line | Structure and design can interface does not | change with updates change, remains same over timeShort Job First (SJF) Shortest Remaining Time (SRTN) It is anon-preemptive algorithm. It is a preemptive algorithm. It involves less overhead than SRJF. Tt involves more overheads than SJF. It leads to comparatively lower throughput. It leads to increased throughput as execution time is less. It minimizes the average waiting time for each process. It may or may not minimize the average waiting time for each process. It involves lesser number of context switching. It involves higher number of context switching. Short processes are executed Shorter processes run fast and first and then followed by longer processes show poor longer processes. response time. Linux Unix Linux is an example of Open | Unix is an operating system that is very ‘What is it? | Source software development and| popular in universities, companies, big Free Operating System (OS). | enterprises etc. Linu can be freely distributed, downloaded frecly, distributed Cost through magazines, Books etc. | Different flavors of Unix have different * ‘There are priced versions for cost structures according to vendors Linux also, but they are normally ‘cheaper than Windows. Unix operating systems were developed mainly for mainframes, servers and Everyone. From home usersio | Workstations except OSX, Which is User developers and computer designed for everyone. The Unix nals He environment and the client-server enthusiasts all program model were essential elements in the development of the InternetLinux kemel is developed by the Three bigest distributions are Solaris (Oracle), AIX (IBM) & HP-UX Hewlett Manufacturer | community. Linus Torvalds Packard. And Apple Makes OSX, an oversees things. unix based os.. Tink can Be installed on a Wide |r par operating eystem is used in Variety of computer hardware, | 7 Operating systerm “ internet servers, workstations & PCs. ranging from mobile phones, thle tcrcand video game | Backbone of the majority of finance Usage comput infastructure and many 24x365 high consoles, to mainframes and al ccluts supercomputers. ty solutions. Tinux is developed By Open Source development ie. through : ‘into-various Development | sharing and collaboration of code Ueix epstems ore vetlowe oy and and features through forums ete * favors, mostly developed by Distribution | and itis distributed by various | ATT s well as various commercial oe vendors and non-profit organizations, Linux typically provides wo GUIs, KDE and Gnome. But there} Initially Unix was a command based OS, cut ‘are millions of alternatives such | but later a GUI was created called as LXDE, Xfce, Unity, Mate, | Common Desktop Environment. Most tw, ect. distributions now ship with Gnome, Fie Ext, Ee, Exid, is, ReiserFS, ie system Xfs, Burfs, FAT, FAT32, NTFS | jf, gpfs, hfs, hfs*, ufs, xfs, zfs format BASH (Bourne Again Selyis | __ - Text mode the Linux default shell. It can Originally the Bourne Shell. Now it's compatible with many others including interface BASH, Kom &C. ba |, | Some free for development use (Solarisy Price Free but support is available for a | 9 support is available for a price. Tinux has had about 60-100 Viruses listed till date. None of | A rough estimate of UNIX viruses is Security them actively spreading between 85 -120 viruses reported till nowadays. date.Paging ‘Paging divides the computers primary memory into fixed-size units called page frames, and the program's address space ‘into pages of the same size. Segmentation Segmentation is the only memory management technique that does not provide the user's program with a ‘linear and contiguous address space.” The — hardware memory ‘unit maps pages to frames. management ‘Segments are areas of memory that usually correspond to a logical grouping of information such as a code procedure or a data array. ‘The physical memory ean be allocated om a page basis while the address space appears ‘contiguous, Segments require hardware support im the form of asegment tablewhich usually contains the physical address of the segment in memory, its size, and other data such as access pratection bits and status ‘Pages are used for swapping or managing memory. ‘Small pieces called segments are used for memory management. ‘Page is indicated by its number and offset, Segment is indicated by segment number and its offset ‘Page table is formed ‘Segment table is formed, ‘Do not support user's view of memory. CRITERIA LINUX, User interface Linux typically provides Jnitially Unix was a command two GUIs, KDE and OS, but later a GUI was Gnome. But there are Common millions of alternatives Environment. Most such as LXDE, Xfee, istributions now ship with Unity, Mate, twm, ect. JName of Provider | Redhat, Ubantuu, Fedora sx, Solaris, All LINUX Low: AS it is GUI based [Migh: As it is command based processing time is more as irect interpretation —_of | JProcessing speed | compare to UNIX. is done so it takes [None of than actively & spreading nowadays,Multitasking ‘Multiprogramming, T [The process of executing multiple numbers of tasks simultaneously or concurrently is known as multitasking. The process of exccuting multiple numbers of Programs simultaneously or concurrently is ‘known as multiprogramming. ‘2 | Task is smallest unit of operation. ‘Program is larger unit of operation. 3 _| Tasks de not contain programs. Program may contain muliple numbers oF tasks. 7 _| User interaction i= provided. Thee is no wer Gnlevaction to individual program. 3 [lim multitasking there are two types of labels, i. Foreground and Background, Tn muliiprogramming there are only programs. © | Wutihzes CPU ctiicicatly. Tr wllizes CPU as well as UO devices ‘Contiguous memory allocation faked memory allocation ‘Contiguous allocation requires that cach file ‘occupy a set of contiguous blacks on the disk. ‘Data structures are coanevied by a seties oF nades. Directory contains filename, starting block number and offset Dircclory contains filename, pointer to starting block and ending block Suffers from external fragmentation There isno external fragmentation ‘Very dififtclt to find contiguous blocks af space “Any free blocks can be added to a chain: ‘Support direct access ‘Cannot suppor direct access Size of fie declared at sat Size of file need not be declared atsiart. Tnsertions and deletions are difficult. Tnsertions and deletions can be done easily.‘Memory space required for pointer Iedivides the physical memoryinto frames and program's address space into same size pages. Segmentati It divides the Computer's physical memory and program's address space into segments. Page is always of fixed block size. Segments of variable size. The size of the page is specified by the hardware. The size of the segment is specified by the user. It may lead to internal fragmentation as the page is of fixed block size. It may lead to External fragmentation as the memory is filled with the variable sized blocks. Page table is used to map pages with frames from memory. Segment table is used to map segments with physical memory. Page table contains page number | Segment table contains segment and frame number. number, length of segment and base address of segment from memory. Invisible to Programmer Visible to programmer Paging consist of Staticlinking & | Segment consist of Dynamic dynamic loading Linking & Dynamic Loading ‘A page is of physical unit A page is of logical unitPre-emptive Scheduling Non Pre-emptive Scheduling Even if CPU is allocated to one process, CPU can be preempted to other process if other process is having higher priority or some other fulfilling criteria. ‘Once the CPU has been allocated to a process the process keeps the CPU until it releases CPU either by terminating or by switching to waiting state. Throughput is less Throughput is high. ‘Only the processes having higher Processes having any priority can get scheduled. Ittreats all process as equal Algorithm design is complex. Algorithm design is simple Circumstances for preemptive (i) Process switch from running to ready state {ii) Process switch from waiting to ready state Circumstances for Non-preemptive Process switches from running to waiting state Process terminates For eg: Round Robin, Priority Algorithms For e.g.: FCFS AlgorithmMonolithic OS Microkeme!l OS ‘The entire 0.5. is placed inside the kernel ‘Only bare minimum code is placed inside the kernel (only basic memory management and Inter Process Communication code) It runs asa single large process. Here the kernel is broken down into processes called as servers As all the services are placed inside the kemel, they have a single address space ‘As services (Servers provide services) are separated they have different address spaces itis easy to implement/code itis tough to implement/code Performance is high (As kernel can invoke any function directly as everything is placed in the keel} Less Secure (if one service fails, entire system crashes) Jowers the performance) Performance is low (AS servers are separated, so to invoke services from other servers IPClInter Process Communication) is needed which requires kernel's permission and thus increases access time and More Secure (Even if one service crashes, others can function properly because of separation) aSr. Monolithic operating Microkernel operating No. system structure system structure L_| Kernel size is large Kemel size is small 2 | OS is complex to design OS is easy to design, install and implement 3_| Fast execution Slow execution: 4° ‘| All operating system services [Kemel provides only IPC are included in kernel and low level 5 [No message passing, no |It requires message passing context switching required | and context switching while kemel is performing jobs. 6 | Ttis hard to extend Itis easy to extend