Uses And Working Of Linux Mint 18

Reviews about Linux Mint 18

Discuss and Describe the uses and working of Linux Mint 18.

1. This is the article review about Linux Mint 18. In this article the new features of Linux Mint 18 are explored in very effective manner. The operating system was launched in the June end of 2016 with the in-house built Cinnamon desktop and GNOME 2 fork MATE desktop options. Two other versions will also launched named Xfce and KDE. This operating system is based on Ubuntu 16.04 and number of new significant features introduced. Earlier the Linux Mint 17 series was also launched in 2014 and it has proved itself as an alternative to Canonical’s Ubuntu. (“Operating Systems”, 2016)

It has a very impressive look and feel with a huge collection of background images. The new introduced features of Linux Mint 18 are:

• It runs Linux kernel 4.4, Cinnamon 3.0 and MATE 1.14
• It supports exFAT file system and by default is the Btrfs file system.
• It has an enhanced update manager that provides support for the installation of different versions of Linux kernel.
• Whatever the changes will be done in the update manager will be received successfully by the user.
• It provides easier configuration to manage safety, security and stability for system updates.
• It supports a new syntax of Debian “apt” with some enhancements and changes.
• We can use a terminal command to clean up the junk repository.
• Whenever the terminal commands “apt install”, “apt remove” or “sudo apt autoremove” run it displays a progress bar.

In Linux Mint 18 there are windows management improvements available on tilling, mapping and unmapping windows. (“An Everyday Linux User Review Of Linux Mint 18 – Back To Its Very Best « Everyday Linux User”, 2016)

Window can be easily snapped by dragging it into position

In Linux Mint 18, there is option available for disabling the favorites and system options related with menu applet. Animation effects can also be seen on menus and dialogs. It has enhanced touchpad support. More options are available for choosing default applications for different file types. It has improved support for Spotify 0.27, Viber and GTK 3.20

Linux Mint 18 has a stylish dark background theme with some enhanced options related with documentation, apps, drivers, forums, chat room etc. While comparing Linux Mint 18 from the hardware point of view, we saw that USB devices such as mobile phones, MP3 audio and sony Walkman are preinstalled on Linux Mint 18. Setting up a network printer is also a very simple process in this version of Linux. One more very advance feature of Linux Mint 18 is network storage capability with even the device those were failed in other operating systems.

Some of the issues in Linux Mint 18 operating system are such as wireless issues that were the same in earlier versions of Linux.

Summary

Linux Mint 18 is very nice and fresh operating system with very impressive themes and pretty much improved processing of kernel. It is very easy to use and install. So I recommend this for all Linux users.

2.

Issues in Linux Mint 18

Memory allocation as per best-fit algorithm

Best-fit algorithm is used to make the best use of memory space. This algorithm is slower as compare to other algorithms. (“Best-Fit Allocation Algorithm”, 2016)

As per First fit algorithm the jobs will be allocated memory in which the first hole is enough large to accommodate the process. The advantage of this process is that it is fast and the disadvantage is that it leads lots of memory space. (“Operating System Scheduling algorithms”, 2016)

3. The difference between internal and external fragmentation can be explained in following points:

At the time of memory allocation to a process, if the allocated space is larger than the required memory, the unused space at the end of partition is called internal fragmentation. Whereas if the enough memory is allocated to a process but it may exist in fragmented manner it will create small unused space in between these fragments and is called external fragmentation.

Internal fragmentation exists in fixed sized blocks of physical memory. External fragmentation can be found in variable sized partitions as per the amount needed by process. (“Differences between Internal and External fragmentation”, 2016)

In case of internal fragmentation the operating system must maintain a partition table along with the starting address of each process and the number of partitions. In external fragmentation more information is needed such as starting and ending address and the data for which the memory locations are free.

Internal fragmentation can be minimized by using external fragmentation, whereas external fragmentation can be minimized by using compaction method or by providing logical address space to the processes.

When the wasted memory created in internal fragmentation can be reused in form of new blocks, in this situation the internal fragmentation is preferred.

4. Given: Program size= 471 bytes,        Page frame size= 100 bytes, instruction to be accessed is at= 132 byte

Number of pages required to store the entire job= 471/100 +1 = 5 pages

Page Number accessed to read instruction at byte 132= page 2          

5. In case of FIFO page removal algorithm the page fault will be count, if the page is not available in the memory and hit will be count if it available in memory. Here we are indicating page fault as (*) and hit as (h) (“4.4.4. Page Replacement Algoritms — Operating Systems Study Guide”, 2016)

Failure Ratio=10/12

Hit Ratio=2/12

(2)

Failure Ratio=6/12

Hit Ratio=6/12

Memory allocation as per best-fit algorithm

(3)

In the page replacement algorithm, the number of page frames are equal to the size of physical memory divided by the page size. If the page size will be increased it will reduce the number of frames. In first case there are only three frames, and it will tend to increase the number of page faults because the less number of pages are possible in memory. In FIFO page replacement algorithm whenever a page is to be brought in memory and it is not present in any frame it will be considered as Page fault and if the page is available in memory it will be considered as hit.

When the page size is increased, the number of page faults will decrease. The operating system will use the prefetching mechanism to reduce the number of page faults.

6.

(1)

Using FCFS: In FCFS scheduling algorithm, the processes will served in the sequence of arrival, so the sequence of processing jobs will be A->B->C->D->E

Total time required to process all the jobs will be = (0+12+14+29+32) = 87 ms

Average turnaround time = (0+12+14+29+32)/5 = 17.4 ms

(2)

USING SJN

It is also known as shortest job first algorithm. In this algorithm CPU will process the job having shortest burst time first. It can be of two types: Non preemptive and Preemptive. In non-preemptive scheduling process the process will continue until the end of its burst time. In preemptive as the new process will arrive it will be compared in the basis of burst timing with other processes and the process having smallest burst time will be chosen for the process. It is also known as shortest remaining time first algorithm. (“Scheduling Algorithms”, 2016)

Total time required to process all the jobs will be= (0+2+5+12+24+39) = 82 ms

Average turnaround time= 82/5= 16.4 ms

FCFS

(2)

SJN

SRT (Shortest remaining time) (“Shortest Job First (SJF), Shortest Remaining Time Next (SRTN) scheduling algorithm – More Process”, 2013)

RR (Round Robin algorithm) (“Round robin scheduling algorithm with Example | Java Hungry”, 2016)

References

An Everyday Linux User Review Of Linux Mint 18 – Back To Its Very Best « Everyday Linux User. (2016). Everydaylinuxuser.com. Retrieved 22 August 2016, from https://www.everydaylinuxuser.com/2016/07/an-everyday-linux-user-review-of-linux.html

Operating Systems. (2016). Technewsworld.com. Retrieved 22 August 2016, from https://www.technewsworld.com/perl/section/operating-systems/

Operating System Scheduling algorithms. (2016). www.tutorialspoint.com. Retrieved 22 August 2016, from https://www.tutorialspoint.com/operating_system/os_process_scheduling_algorithms.htm

Best-Fit Allocation Algorithm. (2016). Cs.rit.edu. Retrieved 22 August 2016, from https://www.cs.rit.edu/~ark/lectures/gc/03_03_03.html

Differences between Internal and External fragmentation. (2016). Enggpedia.com. Retrieved 22 August 2016, from https://www.enggpedia.com/computer-engineering-encyclopedia/dictionary/operating-systems/1902-internal-external-fragmentation-differences

4.4.4. Page Replacement Algoritms — Operating Systems Study Guide. (2016). Faculty.salina.k-state.edu. Retrieved 22 August 2016, from https://faculty.salina.k-state.edu/tim/ossg/Memory/virt_mem/page_replace.html

Round robin scheduling algorithm with Example | Java Hungry. (2016). Javahungry.blogspot.com. Retrieved 22 August 2016, from https://javahungry.blogspot.com/2013/09/round-robin-scheduling-algorithm-with-example-java-program-code.html

Shortest Job First (SJF), Shortest Remaining Time Next (SRTN) scheduling algorithm – More Process. (2013). More Process. Retrieved 22 August 2016, from https://www.moreprocess.com/process-2/shortest-job-first-sjf-shortest-remaining-time-next-srtn-scheduling-algorithm

Order an Essay Now & Get These Features For Free:

Turnitin Report

Formatting

Title Page

Citation

Outline

Place an Order