scholarly journals Designing of 2-Stage CPU Scheduler Using Vague Logic

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Supriya Raheja ◽  
Reena Dhadich ◽  
Smita Rajpal
Keyword(s):  
Fuzzy Theory ◽  
Scheduling Algorithm ◽  
Turnaround Time ◽  
Priority Scheduling ◽  
Performance Simulation ◽  
Inference System ◽  
Second Stage ◽  
Average Turnaround Time ◽  
Selection Of ◽  
Better Than

In operating system the CPU scheduler is designed in such a way that all the resources are fully utilized. With static priority scheduling the scheduler ensures that CPU time will be assigned according to the highest priority but ignores other factors; hence it affects the performance. To improve the performance, we propose a new 2-stage vague logic based scheduler. In first stage, scheduler handles the uncertainty of tasks using the proposed vague inference system (VIS). In second stage, scheduler uses a vague oriented priority scheduling (VOPS) algorithm for selection of next process. The goal of this work is to handle the uncertainty as well as to optimize both the average and the amount of variation with respect to performance matrices average waiting time, average turnaround time, and average normalized turnaround time. A simulation using MATLAB is also conducted to evaluate the performance. Simulation results show that the proposed scheduler using VOPS algorithm is better than the scheduler with traditional priority scheduling algorithm. Results are based on the dual concept of fuzzy theory and its generalization, vague theory. Additionally, this work comprises the evaluation of VOPS and shortest job first algorithm. The outcome of proposed VOPS algorithm is much closer to the result obtained by traditional shortest job first.

scholarly journals Super Smart Optimized Round Robin

2016 ◽  
Vol 2 (2) ◽  
pp. 19-21
Author(s):  
Achmad Teguh Wibowo
Keyword(s):  
Waiting Time ◽  
Turnaround Time ◽  
Round Robin ◽  
Priority Scheduling ◽  
Average Waiting Time ◽  
First Come First Serve ◽  
Time Average ◽  
Average Turnaround Time

Aspek penting dalam sistem operasi adalah multiprogramming. Multiprogramming adalah proses atau metode yang digunakan untuk mengekssekusi beberapa proses secara bersamaan dalam memori. Tujuan utamanya adalah untuk meminimalkan Average Waiting Time, Average Turnaround Time, dan memaksimalkan penggunaan CPU. Ada berbagai algoritma yang digunakan dalam multiprogramming seperti First Come First Serve (FCFS), Shortest Job First (SJF), Priority Scheduling (PS) dan Round Robin(RR). Diantara semua itu yang paling sering digunakan adalah Round Robin. Round Robin merupakan algoritma penjadwalan yang optimal dengn sistem timeshared. Dalam RR, waktu kuantum bersifat statis dan algoritma ini bergantung pada besarnya kuantum yang dipilih/digunakan. Kuantum inilah yang berpengaruh pada Average Waiting Time dan Average Turnaround Time nantinya. Tujuan dari makalah ini adalah mengusulkan algoritma yang lebih baik daripada Round Robin sederhana dan Smart Optimized Round Robin sebelumnya.

scholarly journals Schedulability of Rate Monotonic Algorithm using Improved Time Demand Analysis for Multiprocessor Environment

2018 ◽  
Vol 8 (1) ◽  
pp. 429
Author(s):  
Leena Das ◽  
Sourav Mohapatra ◽  
Durga Prasad Mohapatra
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Demand Analysis ◽  
Priority Scheduling ◽  
Task Set ◽  
Rate Monotonic ◽  
Test Algorithm ◽  
Task Sets ◽  
Number Of Iterations ◽  
Better Than

<p>Real-Time Monotonic algorithm (RMA) is a widely used static priority scheduling algorithm. For application of RMA at various systems, it is essential to determine the system’s feasibility first. The various existing algorithms perform the analysis by reducing the scheduling points in a given task set. In this paper we propose a schedubility test algorithm, which reduces the number of tasks to be analyzed instead of reducing the scheduling points of a given task. This significantly reduces the number of iterations taken to compute feasibility. This algorithm can be used along with the existing algorithms to effectively reduce the high complexities encountered in processing large task sets. We also extend our algorithm to multiprocessor environment and compare number of iterations with different number of processors. This paper then compares the proposed algorithm with existing algorithm. The expected results show that the proposed algorithm performs better than the existing algorithms.</p>

Multi-Objective Scheduling for Parallel Jobs on Grid

2010 ◽  
Vol 439-440 ◽  
pp. 1281-1286 ◽  
Author(s):  
Peng Fei Liu ◽  
Shou Bin Dong
Keyword(s):  
Large Scale ◽  
Job Scheduling ◽  
Scheduling Algorithm ◽  
Turnaround Time ◽  
Experimental Result ◽  
Parallel Job Scheduling ◽  
Multi Objective ◽  
Parallel Jobs ◽  
Parallel Job ◽  
Average Turnaround Time

Focused on the complexity of the parallel job scheduling on heterogeneous Grid, the paper proposes a multi-objective optimization based scheduling algorithm. The algorithm first splits the parallel job up into a series of independent processes with constraints, and then adopts particles to represent the mapping of job-resource. Multi-objective PSO is employed to simultaneously optimize the scheduling objectives of throughput and average turnaround time. Experimental result indicates that the proposed approach is effective while dealing with large scale parallel jobs scheduling on heterogeneous Grid and outperforms other conventional algorithms.

scholarly journals An approach to reduce turn around timeand waiting timeby the selection of round robin and shortest job first algorithm

2018 ◽  
Vol 7 (2.8) ◽  
pp. 667 ◽  
Author(s):  
Sarvesh Kumar ◽  
Gaurav Kumar ◽  
Komal Jain ◽  
Aditi Jain
Keyword(s):  
Operating System ◽  
Waiting Time ◽  
Scheduling Algorithm ◽  
Turnaround Time ◽  
Round Robin ◽  
Average Amount ◽  
Ready Queue ◽  
Multiple Processing ◽  
Different Levels ◽  
Selection Of

In this research,a study on operating system tells about its working,  how it helps as interface between user software and system  hardware .To implement this, different scheduling is used to provide multiple processing in a hardware. There are different levels of scheduler applied in different levels of process from ready queue to termination. This paper focuses on the average amount of waiting time and amount of turnaround time of processes. The proposed algorithm purely defines less waiting time and turnaround time as compared to the round robin scheduling and shortest job first scheduling algorithm.

Intelligent Randomize Round Robin for Cloud Computing

2013 ◽  
Vol 3 (1) ◽  
pp. 27-33
Author(s):  
Muneer O. Bani Yassein ◽  
Yaser M. Khamayseh ◽  
Ali M. Hatamleh
Keyword(s):  
Cloud Computing ◽  
Job Scheduling ◽  
Turnaround Time ◽  
Round Robin ◽  
Cloud Data Center ◽  
Cloud Data ◽  
Basic Infrastructure ◽  
Resources Sharing ◽  
Average Turnaround Time ◽  
Selection Of

Cloud computing is a recent scientific revolution in information technology, it is considered as the basic infrastructure of ubiquitous computing. It supports various features including, Internet based computing, and resources sharing. Delivery of services is provided to computers and other devices upon request. In other words, it is a technology based on the internet and central remote servers to maintain data and applications. This technology allows consumers and enterprises to use applications without the need of installing them or allowing access to their personal files at any computer with internet access. Among different users that may access the cloud data center, cloud computing must include job scheduling to organize and monitor these jobs, and to achieve fairness among all users. One of the most popular job scheduling algorithms is Round Robin (RR). This paper proposes an enhancement to the traditional RR, namely Randomized Round Robin (RRR). The enhanced version of RR algorithms is based on random selection for processes that come from different users to achieve near optimal selection of jobs to be served. A simulation has been carried out using CloudSim simulator V 3.0 to test the performance of the proposed scheme in terms of different evaluation metrics such as average throughput and average turnaround time.

scholarly journals Performance Evaluation of Hybrid Round Robin Algorithm and Modified Round Robin Algorithm in Cloud Computing

2019 ◽  
Vol 8 (2) ◽  
pp. 5047-5051
Keyword(s):  
Cloud Computing ◽  
Performance Evaluation ◽  
Scheduling Algorithm ◽  
Turnaround Time ◽  
Round Robin ◽  
Cloud Services ◽  
System Efficiency ◽  
Time Quantum ◽  
Average Turnaround Time ◽  
Burst Time

The scheduling Round Robin (RR) is an impartial algorithm that schedules cloud resources by giving static time quantum to all processes. Time quantum selection is very crucial as it determines performance of algorithms. This research paper suggests an approach to improve RR scheduling algorithm in cloud computing by considering the quantum to be equal to burst time of start request, which dynamically vary after each execution of a request. And also, if the remaining burst time of CPU for currently executing process is lesser than time quantum, then the CPU will be allocated again to the executing process for rest of CPU burst time. MatLAb was used to implement the planned algorithm and benchmarked against MRRA available in literature. In comparison with the planned algorithm, Average Turnaround Time (ATAT) and minimal Average Waiting Time (AWT) was recorded. Based on the obtained simulated outcome, the planned algorithm should be preferred over modified round robin algorithm as it significantly improves the system efficiency. Keywords: Cloud Computing, throughput, Cloud Services, Response Time, Turnaround Time.

Implementasi Voip Server Berbasis IPV6 Dengan Raspberry PI

2019 ◽  
Vol 9 (01) ◽  
pp. 47-54
Author(s):  
Rabbai San Arif ◽  
Yuli Fitrisia ◽  
Agus Urip Ari Wibowo
Keyword(s):  
Internet Protocol ◽  
Wireless Transmission ◽  
Raspberry Pi ◽  
Test Results ◽  
Average Delay ◽  
Ipv6 Network ◽  
Ip Network ◽  
Selection Of ◽  
Better Than

Voice over Internet Protocol (VoIP) is a telecommunications technology that is able to pass the communication service in Internet Protocol networks so as to allow communicating between users in an IP network. However VoIP technology still has weakness in the Quality of Service (QoS). VOPI weaknesses is affected by the selection of the physical servers used. In this research, VoIP is configured on Linux operating system with Asterisk as VoIP application server and integrated on a Raspberry Pi by using wired and wireless network as the transmission medium. Because of depletion of IPv4 capacity that can be used on the network, it needs to be applied to VoIP system using the IPv6 network protocol with supports devices. The test results by using a wired transmission medium that has obtained are the average delay is 117.851 ms, jitter is 5.796 ms, packet loss is 0.38%, throughput is 962.861 kbps, 8.33% of CPU usage and 59.33% of memory usage. The analysis shows that the wired transmission media is better than the wireless transmission media and wireless-wired.

IMPLEMENTASI PENENTUAN ARSITEKTUR MASJID MODERN DI ACEH MENGGUNAKAN PEMODELAN SISTEM CERDAS

2018 ◽  
Vol 2 (1) ◽  
Author(s):  
Soraya Masthura Hasan ◽  
T Iqbal Faridiansyah
Keyword(s):  
Fuzzy Inference System ◽  
Architectural Design ◽  
Fuzzy Inference ◽  
Intelligent System ◽  
Selection Process ◽  
System Modeling ◽  
Inference System ◽  
Normal Limits ◽  
Roof Structure ◽  
Selection Of

Mosque architectural design is based on Islamic culture as an approach to objects and products from the Islamic community by looking at their suitability and values and basic principles of Islam that explore more creative and innovative ideas. The purpose of this system is to help the team and the community in seeing the best mosque in the top order so that the system can be used as a reference for the team and the community. The variables used in the selection of modern mosques include facilities and infrastructure, building structure, roof structure, mosque area, level of security and facilities. The system model used is a fuzzy promethee model that is used for the modern mosque selection process. Fuzzy inference assessment is used to determine the value of each variable so that the value remains at normal limits. Fuzzy values will then be included in promethee assessment aspects. The highest promethee ranking results will be made a priority for the best mosque ranking. This fuzzy inference system and promethee system can help the management team and the community in determining the selection of modern mosques in aceh in accordance with modern mosque architecture. Intelligent System Modeling System In Determining Modern Mosque Architecture in the City of Aceh, this building will be web based so that all elements of society can see the best mosque in Aceh by being assessed by all elements of modern mosque architecture.Keywords: Fuzzy inference system, Promethe, Option of  Masjid

QoS aware Multi-Path Routing using Link Scheduling Algorithm

2019 ◽  
Vol 09 ◽  
Author(s):  
Satyasrikanth Palle ◽  
Shivashankar
Keyword(s):  
Cellular Networks ◽  
Scheduling Algorithm ◽  
Research Work ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Link Scheduling ◽  
Spatial Reuse ◽  
Mobile Cellular ◽  
Simulation Results ◽  
End To End

Objective: The demand for Cellular based multimedia services is growing day by day, in order to fulfill such demand the present day cellular networks needs to be upgraded to support excessive capacity calls along with high data accessibility. Analysis of traffic and huge network size could become very challenging issue for the network operators for scheduling the available bandwidth between different users. In the proposed work a novel QoS Aware Multi Path scheduling algorithm for smooth CAC in wireless mobile networks. The performance of the proposed algorithm is assessed and compared with existing scheduling algorithms. The simulation results show that the proposed algorithm outperforms existing CAC algorithms in terms of throughput and delay. The CAC algorithm with scheduling increases end-to-end throughput and decreases end-to-end delay. Methods: The key idea to implement the proposed research work is to adopt spatial reuse concept of wireless sensor networks to mobile cellular networks. Spatial reusability enhances channel reuse when the node pairs are far away and distant. When Src and node b are communicating with each other, the other nodes in the discovered path should be idle without utilizing the channel. Instead the other nodes are able to communicate parallelly the end-to-end throughput can be improved with acceptable delay. Incorporating link scheduling algorithms to this key concept further enhances the end-to-end throughput with in the turnaround time. So, in this research work we have applied spatial reuse concept along with link scheduling algorithm to enhance end-to-end throughput with in turnaround time. The proposed algorithm not only ensures that a connection gets the required bandwidth at each mobile node on its way by scheduling required slots to meet the QoS requirements. By considering the bandwidth requirement of the mobile connections, the CAC module at the BS not only considers the bandwidth requirement but also conforming the constrains of system dealy and jitter are met. Result: To verify the feasibility and effectiveness of our proposed work, with respect to scheduling the simulation results clearly shows the throughput improvement with Call Admission Control. The number of dropped calls is significantly less and successful calls are more with CAC. The percentage of dropped calls is reduced by 9 % and successful calls are improved by 91%. The simulation is also conducted on time constraint and ratio of dropped calls are shown. The total time taken to forward the packets and the ration of dropped calls is less when compared to non CAC. On a whole the CAC with scheduling algorithms out performs existing scheduling algorithms. Conclusion: In this research work we have proposed a novel QoS aware scheduling algorithm that provides QoS in Wireless Cellular Networks using Call Admission Control (CAC). The simulation results show that the end-to-end throughput has been increased by 91% when CAC is used. The proposed algorithm is also compared with existing link scheduling algorithms. The results reveal that CAC with scheduling algorithm can be used in Mobile Cellular Networks in order to reduce packet drop ratio. The algorithm is also used to send the packets within acceptable delay.

Sign in / Sign up

Export Citation Format

Share Document