We consider scheduling soft real-time tasks on a cluster of multiple computers. An incoming task can be assigned to one of the computers for service since these computers provide the same services. If arrival tasks cannot be served immediately, these tasks must be queued. In this paper, we consider two queueing structures, the centralized structure and distributed one, and evaluate their performance based on the criterion of the fraction of tasks that miss their deadlines. For the distributed structure, we further investigate the influence of dispatching policies on performance.
展开▼
