Search Results - (( system application scheduling algorithm ) OR ( java application using algorithm ))

Refine Results
  1. 1

    A Toolkit for Simulation of Desktop Grid Environment by FOROUSHAN, PAYAM CHINI

    Published 2014
    “…In this type of environment it is nearly impossible to prove the effectiveness of a scheduling algorithm. Hence the main objective of this study is to develop a desktop grid simulator toolkit for measuring and modeling scheduler algorithm performance. …”
    Get full text
    Get full text
    Final Year Project
  2. 2
  3. 3

    Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO by Mohd. Zaki, Mohd. Salikon

    Published 2005
    “…This paper reports the powerful techniques using GA in scheduling. Examination timetabling problem is one of the applications in scheduling. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

    Published 2016
    “…For desirable use (application) of the capabilities of large distributed systems like Grid, an efficient and effective scheduling algorithm is required for reducing total completion time and advancement of load balancing. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9

    Smart student timetable planner by Wong, Xin Tong

    Published 2025
    “…The system is implemented using Node.js with Express for server-side development, HTML, CSS, and JavaScript for the frontend, and Socket.IO for real-time collaboration. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  10. 10

    Volunteer Management System by Muhammad Fazril Bin Mohd Amin, Muhammad Fazril

    Published 2012
    “…By creating and developing an intuitive system, VMS, the process will be streamlined, joining the availability list sign up and the weekly roster generator into one software application. …”
    Get full text
    Get full text
    Final Year Project
  11. 11
  12. 12

    Enhanced utility accrual scheduling algorithms for adaptive real time system. by Othman, Muhammad Fauzan, Ahmad, Idawaty

    Published 2009
    “…Problem statement: This study proposed two utility accrual real time scheduling algorithms named as Preemptive Utility Accrual Scheduling (PUAS) and Non-preemptive Utility Accrual Scheduling (NUAS) algorithms. …”
    Get full text
    Article
  13. 13
  14. 14
  15. 15
  16. 16

    A preemptive utility accrual scheduling algorithm in adaptive real time system. by Ahmad, Idawaty, Subramaniam, Shamala, Othman, Mohamed, Othman, Muhammad Fauzan

    Published 2008
    “…These scheduling algorithms are designed for adaptive real time system environment where undesirable effects such as overload and deadline misses are tolerable. …”
    Get full text
    Get full text
    Article
  17. 17

    Scalable workflow scheduling algorithm for minimizing makespan and failure probability by Abdul Aziz, Maslina, Ninggal, Izuan Hafez

    Published 2019
    “…The proposed algorithm discussed in this paper schedules parallel applications on homogeneous systems without sacrificing the two conflicting objectives: reliability and makespan. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  18. 18
  19. 19

    Improving utility accrual scheduling algorithm for adaptive real-time system by Ahmad, Idawaty, Othman, Mohamed, Ahmad Zukarnain, Zuriati, Othman, Muhammad Fauzan

    Published 2008
    “…In this paper, we proposed a preemptive utility accrual scheduling (or PUAS) algorithm to further extend the functionalities of General Utility Scheduling (or GUS) algorithm proposed by Peng Li [1]. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

    Published 2012
    “…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
    Get full text
    Get full text
    Monograph