Cloud computing is a distributed computing model; which refers to manipulating, configuring, and accessing the applications online. It offers online data storage, infrastructure and application. Task scheduling is one of the most important issues in cloud environment, such as the tasks must be affected to the appropriate virtual machines considering different factors at the same time, which leads to considering the task scheduling problem an NP-complete problem. This article presents an improved ROUND ROBIN (RR) CPU scheduling algorithm with varying time quantum. The appropriate algorithm proven better than traditional RR and IRRVQ algorithms. The results show that the waiting time and turnaround time have been reduced in the proposed approach compared to traditional RR and IRRVQ

Improved Round Robin Scheduling Algorithm With Varying Time Quantum

Any source code can be modified in several ways to confuse plagiarism detection systems. Such diverse modifications require the usage of systems which can handle different types of plagiarism. The usage of automatic source code plagiarism detectors has implications for computing education. This paper extends Pedersen’s work, a Bioinformatics method, by performing the application of this method on programming plagiarism domain, and by analyzing the usage of such tools through a discussion associated with the support for professors in assessing students’ assignments. The application results are compared to a commonly used solution for the same purpose, the JPLAG tool. As a result of the evaluating study, the applied method showed a higher rate of similarity for specific types of plagiarism. Also, as a result of the analysis involving the use of an automatic tool for plagiarism in programming showed the benefits for computing education.

Contributions of Bioinformatics for Computing Education in the Detection of Programming Assignment Plagiarism

In this journal, discussion is given to analyse the improved round robin algorithm more thoroughly. Round robin algorithm plays a significant role to be used in embedded systems. Round robin algorithm usually applied in real-time systems. Here, three case studies are given, and also the analysis of each case study. Comparisons are given about the average turn around time and average waiting time, also number of context switching between the three case studies. Improved round robin algorithm, is a modification from the generic round robin algorithm. In improved round robin algorithm if the remaining burst time is less than the time slice that is allocated, then the currently running process is continue to be executed. Then finish the currently running process from ready queue and execute the next ready queue. Three case studies are given with three different time quantum, which are 3, 4, and 5 ms. The result of this case study analysis is that, the efficiency of the quantum 5 ms is the most effective one. There is an increase of 50% context switching from quantum 3 to quantum 5. And for average turn around time we get 13.13% reduction in efficiency. While in average waiting time we get reduction 12.08% efficiency.

Case Study: Improved Round Robin Algorithm

—Job Scheduling is the process of allocating operating system resources to do several different jobs. The problem that arises is how to manage the work of the system to complete a lot of existing work in a timely and optimal time. To solve the problem, several heuristics and metaheuristics are used. The goal is to minimize the total time that all work has been executed. In this paper, the researcher will compare the Round Robin algorithm and the Highest Response Ratio Next algorithm to find which algorithm is the most optimal for completing all work on time. In this research, a comparison test was conducted with three cases, and judging from the 3 cases that have been compared between the Round Robin algorithm and High Response Ratio Next, it was found that the High Response Ratio Next algorithm is more optimal than the process carried out using the Round Robin algorithm. Due to the waiting time for each process that is run by the CPU, the High Response Ratio Next algorithm is less than the waiting time in the Round Robin algorithm.

Comparison Analysis of Round Robin Algorithm with Highest Response Ratio Next Algorithm for Job Scheduling Problems

Quite a number of scheduling algorithms have been implemented in the past, including First Come First Served (FCFS), Shortest Job First (SJF), Priority and Round Robin (RR). However, RR seems better than others because of its impartiality during the usage of its quantum time. Despite this, there is a big challenge with respect to the quantum time to use. This is because when the quantum time is too large, it leads to FCFS, and if the quantum time is too short, it increases the number of switches from the processes. As a result of this, this paper provides a descriptive review of various algorithms that have been implemented in the past 10 years, for various quantum time in order to optimize the performance of CPU utilization. This attempt will open more research areas for researchers, serve as a reference source and articulate various algorithms that have been used in the previous years – and as such, the paper will serve as a guide for future work. This research work further suggests novel hybridization and ensemble of two or more techniques so as to improve CPU performance by decreasing the number of context switch, turnaround time, waiting time and response time and in overall increasing the throughput and CPU utilization.

/pdf/a-survey-of-variants-of-round-robin-cpu-scheduling-b792rdy0y6.pdf

A survey of variants of round robin cpu scheduling algorithms

DNA (deoxyribonucleic acid), is the hereditary material in humans and almost all other organisms. Nearly every cell in a person's body has the same DNA. The information in DNA is stored as a code made up of four chemical bases: adenine (A), guanine (G), cytosine (C), and thymine (T). With continuous technology development and growth of sequencing data, large amount of biological data is generated. This large amount of generated data causes difficulty to store, analyses and process DNA sequences. Therefore, a wide need of reducing the size, for this reason, DNA Compression is employed to reduce the size of DNA sequence. Therefore, there is a huge need of compressing the DNA sequence. In this paper, we have proposed an efficient and fast DNA sequence compression algorithm based on differential direct coding and variable look up table (LUT).

An improved method for DNA sequence compression

The most important and integral part of a computer system is its operating system. Scheduling various resources is one of the most critical tasks an operating system needs to perform. Process scheduling being one of those tasks, involves various techniques that define how more than one processes can be executed simultaneously. The primary aim here is to the system more efficient and faster. The fundamental scheduling algorithms are: First Come First Serve (FCFS), Round Robin, Priority Based Scheduling, and Shortest Job First (SJF). This paper focuses on Round Robin Scheduling algorithm and various issues related to it. One major issue in RR scheduling is determining the length of Time Quantum. If the Time Quantum is too large RR scheduling behaves as FCFS. On the other hand, if it is too small it forces considerable increase in the number of context switches. Our main objective is to overcome this limitation of traditional RR scheduling algorithm and maximize CPU utilization, further, leading to more efficient and faster system. Here we propose an algorithm that categorizes available processes into High Priority processes and Low Priority process. The proposed algorithm reduces the average waiting time of High Priority processes in all cases and of Low Priority processes in not all but some cases. The overall waiting time changes on the basis of set of processes considered. The simulation results justify that the proposed schemes reduces the overall average waiting time when compared to the existing schemes. 

/pdf/an-improved-round-robin-cpu-scheduling-algorithm-based-on-3xk1b2jazd.pdf

An Improved Round Robin CPU Scheduling Algorithm based on Priority of Process

The compression is required to reduce the size of data to store in computer storage as well as to transmit data over the internet with limited bandwidth. The genomic sequences DNA or RNA contain billions of nucleotide bases (A, G, T, C) resulting large sized file to store in computer. In the previous compression algorithms the authors use direct coding technique where two bits are used to code a nucleotide base resulting compression ratio of 2 bits per byte (bpb). Some authors achieve a compression ratio less than 2 bpb after coding repeated bases differently. In this paper we proposed an improvement over direct coding technique that will compress both repeated and non-repeated sequences. The proposed algorithm provides better result as compared to existing algorithms. The existing direct coding algorithm compresses the non-repeated base (B) by prefixing a 0 followed by 2 bits code assigned for that base (i.e. 0B) whereas the repeated bases are compressed by prefixing 1 followed by 2 bits code assigned for that base (B) followed by 3 bits code to represent the number of repetitions (N) (i.e. 1BN). The non-repeated bases are coded by 3 bits and repeated bases by 6 bits but the existing algorithm is limited to compress the repeated sequence till 9 because of 3 bits coding. If the repeated sequence is greater than 9 then it requires a number of bits in multiple of 6 (i.e. 6, 12, and 18, so on). The propped algorithm compress the repeated base by making an improvement over existing one that will code a repeated sequence greater than 9 but less than 15 by prefixing 1 followed by base (B) followed by 111 followed by N (i.e. 1B111N) in 9 bits in place of 12 bits in existing algorithm hence the proposed algorithm provide better compression ratio.

An Improvement over direct coding technique to compress repeated & non-repeated nucleotide data

DNA (deoxyribonucleic acid), is the hereditary material in humans and almost all other organisms. Nearly every cell in a person’s body has the same DNA. The information in DNA is stored as a code made up of four chemical bases: adenine (A), guanine (G), cytosine (C), and thymine (T). With continuous technology development and growth of sequencing data, large amount of biological data is generated. This large amount of generated data causes difficulty to store, analyse and process DNA sequences. So there is a wide need of reducing the size, for this reason, DNA Compression is employed to reduce the size of DNA sequence. Therefore there is a huge need of compressing the DNA sequence. In this paper, we have proposed an efficient and fast DNA sequence compression algorithm based on differential direct coding and variable look up table (LUT).

/pdf/design-and-analysis-of-an-improved-nucleotide-sequences-mpmiaygumg.pdf

Design and Analysis of an Improved Nucleotide Sequences Compression Algorithm Using Look up Table (LUT)

The computer programmer write programming codes of any length without keeping in mind the available primary memory. This is possible if we use the concept of virtual memory. As the name suggests, virtual memory is a concept of executing a programming code of any size even having a primary memory of smaller size than the size of program to be executed. The virtual memory can be implemented using the concept of paging. The operating system allocates a number of memory frames to each program while loading into the memory. The programming code is equally divided into pages of same size as frame size. The size of pages and memory frames are retained equal for the better utilization of the memory. During the execution of program, every process is allocated limited number of memory frames; hence there is  a need of page replacements. To overcome this limitation, a number of page replacement techniques had suggested by the researchers. In this paper, we have proposed an modified page replacement technique, which is based on the concept of block reading of pages from the secondary storage. The disc access is very slow as compared to the access from primary memory. Whenever there is a page fault, the required page is retrived from the secondary storage. The numerous page faults increase the execution time of process. In the proposed methodology, a number of pages, which is equal to the allotted memory frames, are read every time when there is a page fault instead of reading a single page at a time. If a block of pages has fetched from secondary storage, it will definitely increases the possibilities of page hit and as a result, it will improve the hit ratio for the processes.  

/pdf/an-improved-page-replacement-algorithm-using-block-retrieval-51er14fbqm.pdf

An Improved Page Replacement Algorithm Using Block Retrieval of Pages

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Devendra Prasad

Author Tools

Chat about Author