How do we categorize scheduling algorithms in all respect for distributed computing environment?
There isn't a "best" categorization. Depending on your goal, different categorization schemes/taxonomies may useful. Frequently used categories are, e.g., the process model a scheduling algorithm applies to (e.g. preemptable/nonpreemtable), or the scheduling goal (e.g., fairness, performance, etc.).
@Muhammad Zakarya: this categorization is quite poor, since it is not discriminating. E.g., real-time scheduler could be both, static and dynamic. Taking global vs. local as one dimension would make sense, since we talking about distributed systems. However, frequently you need both, a global assignment and a local uniprocessor scheduling, within one approach.
Then how can one categorize and characterize the individual scheduler in a unique way? How will one can choose by considering proper parameters a best suitable scheduling approach?
Scheduling is related to queueing. Mathematical queuing models or disciplines may be divided into:
- M/G/1 queue
- M/M/1 queue
- M/M/c queue
- Generalized queueing network (G-network)
- Bulk queue
- Fluid queue
My area is data communications, where the scheduling may involve fair scheduling algorithms, differentiated quality-of-service and other forms of teletrafic engineering, for example:
- First-in first-out / first-come first-served discipline
- Shortest remaining time
- Fixed priority pre-emptive scheduling
- Weighted fair queuing, with or withour differentiated priorities (multilevel scheduling)
- Optimized scheduling
- Round robin, Deficit round robin
- Leaky bucket
- Token bucket
Following paper might give you some insights.
10.1109/ACCT.2014.32
Search it in google
i think and agree a new taxonomy of scheduling algorithms for scheduling preemptive
real-time tasks on multiprocessors.this algorithm described some new classes of scheduling algorithms
and considered the relationship of these classes to the existing well-studied classes
- Badges
- Science method