Search Results - (( its application system algorithm ) OR ( some applications scheduling algorithm ))*

Refine Results
  1. 1

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

    Published 2012
    “…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
    Thesis
  2. 2

    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

    Published 2016
    “…Although many scheduling algorithms have been implemented for cloud computing, it has been realized that most of the applications nowadays require different objectives that simple scheduling algorithms fail to achieve. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

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

    Published 2022
    “…The genetic algorithm was widely used because of its accuracy and simplicity. …”
    Get full text
    Get full text
    Get full text
    Academic Exercise
  4. 4

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

    Published 2011
    “…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
    Article
  5. 5
  6. 6
  7. 7
  8. 8

    Runtime pluggable CPU scheduler for linux operating system by Al-Maweri, Nasr Addin Ahmed Salem

    Published 2010
    “…Each scheduling policy has its own properties and suits specific applications or a specific environment. …”
    Get full text
    Get full text
    Thesis
  9. 9

    A Voice Priority Queue (VPQ) Fair Scheduler for the VoIP over WLANs by Nisar, Kashif, Md Said, Abas, Hasbullah, Halabi

    Published 2011
    “…The objective of this research is to propose a new scheduler system model for the VoIP application named Voice Priority Queue (VPQ) scheduler. …”
    Get full text
    Get full text
    Citation Index Journal
  10. 10
  11. 11
  12. 12
  13. 13

    High-throughput and energy-efficient Contiki MAC layer scheme in IEEE 802.15.4 for structural health monitoring by Al-Mekhlafi, Mohamed Abdulkarem Taher

    Published 2021
    “…L-TDMA shows a remarkable ability to conserve power in comparison to other protocols in different operating systems. Finally, the implementation of the developed embedded algorithms for strain-based applications resulted in a power consumption reduction of 77% compared to centralized processing.…”
    Get full text
    Get full text
    Thesis
  14. 14

    Semantic-Based Scalable Decentralized Resource Discovery by Mahamat Issa , Hassan, Azween, Abdullah

    Published 2010
    “…DA describes resource capabilities, and RA carries resource requests that are needed for some applications. We develop a RD algorithm that optimizes the search of the resources on the network. …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    Semantic-Based Scalable Decentralized Grid Resource Discovery by Mahamat Issa , Hassan, Azween, Abdullah

    Published 2009
    “…DA describes resource capabilities, and RA carries resource requests that are needed for some applications. We develop a RD algorithm that optimizes the search of the resources on the network. …”
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16
  17. 17

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

    Published 2016
    “…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
    Proceeding Paper
  18. 18

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

    Published 2012
    “…Some intensive researches have been done in the area of job scheduling of cloud computing. …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Backhaul load and performance optimality of partial joint processing schemes in LTE-A networks by Kousha, Mohammad

    Published 2014
    “…The proposed algorithm also leverages the location dependency of the joint processing. …”
    Get full text
    Get full text
    Thesis
  20. 20

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

    Published 2015
    “…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
    Article