Paper Info
Title
Performance Evaluation of Soft Real-Time Scheduling for Multicomputer Cluster
Abstract
We consider scheduling soft real-time tasks for a cluster, which consists of multiple servers. Each server provides identical services where an incoming task can be assigned to one of the servers.The question we investigate is which assignment produces the best performance given two alternative approaches to queue the arriving tasks: a centralized approach or a distributed one. A missed deadline criterion is used to evaluated these approaches. The influence of dispatching policies on the performance of the distributed approach is also considered.
Year
DOI
Venue
2000
10.1109/ICDCS.2000.840977
ICDCS
Keywords
Field
DocType
performance evaluation,multicomputer cluster,deadline criterion,soft real-time task,centralized approach,alternative approach,best performance,soft real-time scheduling,multiple server,incoming task,identical service,hardware,real time systems,scheduling,computer science,games,computer architecture
Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Scheduling (computing),Queue,Server,Computer network,Dynamic priority scheduling,Workstation clusters,Earliest deadline first scheduling,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-0601-1
14
0.85
References 
Authors
8
2
Name
Order
Citations
PageRank
Weiping Zhu1140.85
Brett D. Fleisch220941.08