Please use this identifier to cite or link to this item:
http://dspace.aiub.edu:8080/jspui/handle/123456789/2610
Title: | Performance Evaluation of Extended Latency Time Algorithm |
Authors: | Gomes, Dipta Rupai, A.A.A. Barid, Mimun Sufian, Abu |
Keywords: | Latency time Scheduling Algorithm Optimization |
Issue Date: | Nov-2018 |
Publisher: | International Journal of New Technology And Research (IJNTR) |
Citation: | Gomes, D. et al. (2018) ‘Performance evaluation of extended latency time algorithm in different linux based operating systems’, International Journal of New Technology and Research, 4(11). doi:10.31871/ijntr.4.11.5. |
Abstract: | Extended Latency Time (ELT) algorithm is an extension of the Latency time (LT) algorithm. Unlike LT, its extended version allows a system to assign tasks containing arbitrary time into the different processors. In doing so each task is assigned a time frame which decreases as each time unit passes. This report provides detailed information on the performance of ELT on different Linux based operating systems. The algorithm was implemented and the runtime was measured by providing graphs as input, in three different operation systems of Linux which are Ubuntu, Mint and Kali where average execution time in Kali Linux has been the highest which is close to 2.284 time units. From the three Ubuntu showed the most promising result which has shown an execution time of 2.198 time units. After some close observation it was found that the algorithm showed the best performance in Ubuntu. |
URI: | https://www.ijntr.org/performance-evaluation-of-extended-latency-time-algorithm-in-different-linux-based-operating-systems http://dspace.aiub.edu:8080/jspui/handle/123456789/2610 |
ISSN: | 2454-4116 |
Appears in Collections: | Publications: Journals |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Performance Evaluation of Extended Latency Time.pdf | The first page of the paper. | 922.7 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.