Search Results - (( web application kano algorithm ) OR ( some applications scheduling algorithm ))*

COMPARATIVE PERFORMANCE OF SOME HYBRID HEURISTICS SCHEDULING ALGORITHMS BASED ON SLTR AND DEADLINE FOR COMPUTATIONAL GRID by AHMED ABBA, HARUNA

Get full text
Get full text

Development of heuristic task scheduling algorithm in cloud computing by Diallo, Laouratou, Hassan Abdalla Hashim, Aisha, Olanrewaju, Rashidah Funke

“…To this direction, in this paper we make a summary of some scheduling algorithms and propose an Enhanced Greedy Heuristic Scheduling Algorithm (EGHSA) for task scheduling adapted for big data applications. …”
Get full text
Get full text

A priority based job scheduling algorithm in cloud computing by Shamsollah, Ghanbari, Othman, Mohamed

“…Some intensive researches have been done in the area of job scheduling of cloud computing. …”
Get full text
Get full text

DESIGN AND EVALUATION OF RESOURCE ALLOCATION AND JOB SCHEDULING ALGORITHMS ON COMPUTATIONAL GRIDS by MEHMOOD SHAH, SYED NASIR

“…Thus, overall aim of this research is to introduce new grid scheduling algorithms for resource allocation as well as for job scheduling for enabling a highly efficient and effective utilization of the resources in executing various applications. …”
Get full text
Get full text

Survey on job scheduling mechanisms in grid environment by S. M., Argungu, Che Mohamed Arif, Ahmad Suki, Omar, Mohd Hasbullah

“…Grid systems provide geographically distributed resources for both computational intensive and data-intensive applications.These applications generate large data sets.However, the high latency imposed by the underlying technologies; upon which the grid system is built (such as the Internet and WWW), induced impediment in the effective access to such huge and widely distributed data.To minimize this impediment, jobs need to be scheduled across grid environments to achieve efficient data access.Scheduling multiple data requests submitted by grid users onto the grid environment is NP-hard.Thus, there is no best scheduling algorithm that cuts across all grids computing environments.Job scheduling is one of the key research area in grid computing.In the recent past many researchers have proposed different mechanisms to help scheduling of user jobs in grid systems.Some characteristic features of the grid components; such as machines types and nature of jobs at hand means that a choice needs to be made for an appropriate scheduling algorithm to march a given grid environment.The aim of scheduling is to achieve maximum possible system throughput and to match the application needs with the available computing resources.This paper is motivated by the need to explore the various job scheduling techniques alongside their area of implementation.The paper will systematically analyze the strengths and weaknesses of some selected approaches in the area of grid jobs scheduling.This helps researchers better understand the concept of scheduling, and can contribute in developing more efficient and practical scheduling algorithms.This will also benefit interested researchers to carry out further work in this dynamic research area.…”
Get full text
Get full text
Get full text

Two objectives big data task scheduling using swarm intelligence in cloud computing by Diallo, Laouratou, Hassan Abdalla Hashim, Aisha, Olanrewaju, Rashidah Funke, Islam, Shayla, Zarir, Abdullah Ahmad

“…In this direction, this paper first gives review of some previous scheduling algorithms used in cloud. …”
Get full text
Get full text
Get full text

Fair Traffic Scheduling and Shaping Algorithms for Diffserv Networks by Mohamed, Mohamed Awad Elshaikh

“…Per Hob Behavoiurs (PHBs) are implemented at DiffServ networks nodes using some scheduling and queuing mechanisms that are predecessor by markers and shaper. …”
Get full text
Get full text

A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm by Mohammed, Maysoon A., Mazlina, Abdul Majid, Balsam, A. Mustafa

Get full text
Get full text
Get full text
Get full text

Performance evaluation of LTE scheduling techniques for heterogeneous traffic and different mobility scenarios by Sukeran, Lukmanhakim, Habaebi, Mohamed Hadi, Zyou, Al-Hareth, Ahmed, Musse Mohamud, Hameed, Shihab A, Azman, Amelia Wong, Islam, Md Rafiqul

Get full text
Get full text
Get full text
Get full text
Get full text

Task scheduling in cloud computing using hybrid genetic algorithm and bald eagle search (GA-BES) by Kamal Khairi Supaprhman

“…This Study proposes task scheduling in cloud computing using a hybrid genetic algorithm, and bald eagle search proposed to solve the task scheduling problem. …”
Get full text
Get full text
Get full text

Performance evaluation of LTE scheduling techniques for heterogeneous traffic and different mobility scenarios by Sukeran, Lukmanhakim, Habaebi, Mohamed Hadi, Zyoud, Al-Hareth, Musse, Mohamud Ahmed, Hameed, Shihab A., Azman, Amelia Wong, Islam, Md. Rafiqul

Get full text
Get full text
Get full text
Get full text
Get full text

Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python by Arifin, Samsul, Muktyas, Indra Bayu, Al Maki, Wikky Fawwaz, Mohd Khairul Bazli, Mohd Aziz

“…Graph coloring has a wide range of applications and is commonly used to solve scheduling issues. …”
Get full text
Get full text
Get full text

A novel Voice Priority Queue (VPQ) scheduler and algorithm for VOIP over WLAN network by Nizar, Kashif, Hassan, Suhaidi, M. Kadhum, Mohammed

“…The VoIP deployment on Wireless Local Area Networks (WLANs), which is based on IEEE 802.11 standards, is increasing.Currently, many schedulers have been introduced such as Weighted Fair Queueing (WFQ), Strict Priority (SP) General processor sharing (GPS), Deficit Round Robin (DRR), and Contention-Aware Temporally fair Scheduling(CATS).Unfortunately, the current scheduling techniques have some drawbacks on real-time applications and therefore will not be able to handle the VoIP packets in a proper way.The objective of this research is to propose a new scheduler system model for the VoIP application named final stage of Voice Priority Queue (VPQ) scheduler.The scheduler system model is to ensure efficiency by producing a higher throughput and fairness for VoIP packets.In this paper, only the final Stage of the VPQ packet scheduler and its algorithm are presented.Simulation topologies for VoIP traffic were implemented and analyzed using the Network Simulator (NS-2).The results show that this method can achieve a better and more accurate VoIP quality throughput and fairness index over WLANs. …”
Get full text
Get full text
Get full text

Urgency-aware scheduling algorithm for downlink cognitive long term evolution-advanced by Mohd Ramli, Huda Adibah, Mohd. Isa, Farah Nadia, Asnawi, Ani Liza, Jusoh, Ahmad Zamani, Azman, Amelia Wong

Get full text
Get full text
Get full text
Get full text

Scheduling of batch process plant / Aladin Awang Hamat by Hamat, Aladin Awang

“…For that reason, this research is done based on the development of scheduling, involving algorithm and hardware. The control algorithm approach for batch process plant is used as Dijekstra's algorithm. …”
Get full text
Get full text

University class timetable tool by Ang, Wen Jie

Get full text
Get full text

Interference avoidance routing and scheduling using multiple transceivers for IEEE 802.16 mesh network by Qasem, Yaaqob Ali Ahmed

“…Secondly, the algorithms reduce the length of scheduling, increase the channel utilization ratio (CUR) and improve the throughput of the system. …”
Get full text
Get full text

Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

“…This thesis studies multiobjective UTSP consisting of frequency setting, timetabling, simultaneous bus and driver scheduling by applying Multiple Tabu Search (MTS) algorithm. …”
Get full text
Get full text

Bee foraging behaviour techniques for grid scheduling problem by Alyaseri, Sana, Ku-Mahamud, Ku Ruhana

“…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.These resources are collected together to make a huge computing power.Job scheduling problem is one of the key issues in grid computing and failing to look into grid scheduling results in uncompleted view of the grid computing.Achieving optimized performance of grid system, and matching application requirements with available computing resources, are the objectives of grid job scheduling.Bee colony approaches are more adaptive to grid scheduling due to high heterogeneous and dynamic nature of resources and applications in grid.These algorithms have shown encouraging results in terms of time and cost.This paper presents some resent research activities inspired by bee foraging behavior for grid job scheduling especially ABC and BCO approaches.Different original studies related to this area are briefly described along with their comparisons against them and results.The review summary of their derived algorithms and research efforts is done.…”
Get full text
Get full text
Get full text

An Efficient Voice Priority Queue (VPQ) Schedular Architectures and Algorithm for VoIP over WLAN Networks by Nisar, Kashif, Md Said, Abas, Hasbullah, Halabi

“…Unfortunately, they have some drawbacks for real time application. The objective of this research, to propose a novel Voice Priority Queue (VPQ) packet scheduling algorithm to ensure more throughput, low latency and efficient packet scheduling for VoIP performance of queues and traffics. …”
Get full text
Get full text
Get full text