Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping
IEEE/ACM Transactions on Networking (TON)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
An Efficient RMS Admission Control and its Application to Multiprocessor Scheduling
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Toward best-effort services over WDM networks with fair access and minimum bandwidth guarantee
IEEE Journal on Selected Areas in Communications
Efficient task replication and management for adaptive fault tolerance in mobile Grid environments
Future Generation Computer Systems - Special section: Information engineering and enterprise architecture in distributed computing environments
Fair Scheduling Algorithms in Grids
IEEE Transactions on Parallel and Distributed Systems
IEEE/ACM Transactions on Networking (TON)
Preemptive scheduling with simple linear deterioration on a single machine
Theoretical Computer Science
A task replication and fair resource management scheme for fault tolerant grids
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
| Hi-index | 4.10 |
Scheduling problems are characterizedby a system's processor typesand tasks and the scheduling constraintsimposed on them. For a giventask set, a number of processors greaterthan or equal to one, and a set of constraints,scheduling must determine theexistence of a feasible schedule and whatalgorithms can produce it.Many algorithms described in this surveycan be applied directly in a networkcontext. Existing multiprocessor schedulingalgorithms do not address certainaspects of packet scheduling, however,and this research area will likely becomeessential in the future.