COMPARATIVE PERFORMANCE OF SOME HYBRID HEURISTICS SCHEDULING ALGORITHMS BASED ON SLTR AND DEADLINE FOR COMPUTATIONAL GRID
Grid computing can be described as form of distributed computing that involves collection ofindependent computers coordinating and sharing computing, application, data storage or network resources using high speed networks across dynamic and geographically distributed environment. Grid scheduling...
Saved in:
Main Author: | AHMED ABBA, HARUNA |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | http://utpedia.utp.edu.my/22457/1/209354~1.PDF http://utpedia.utp.edu.my/22457/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Performance Comparison of Some Hybrid Deadline Based Scheduling Algorithms for Computational Grid
Published: (2012) -
Dynamic Multilevel Hybrid Scheduling Algorithms for Grid Computing
by: Shah, S.N.M., et al.
Published: (2011) -
Deadline-based algorithms for dynamic scheduling in soft real-time systems
by: Chuprat, Suriayati, et al.
Published: (2008) -
A deadline-based algorithm for dynamic task scheduling with precedence constraints
by: Chuprat, Suriayati, et al.
Published: (2007) -
Heuristic Algorithm For Nurse Scheduling Problem
by: Wee, Sze Ming
Published: (2023)