Allocating Non-Real-Time and Soft Real-Time Jobs in Multiclusters
IEEE Transactions on Parallel and Distributed Systems
A novel approach to allocating QoS-constrained workflow-based jobs in a multi-cluster grid
Proceedings of the 4th international workshop on Middleware for grid computing
A Novel Stochastic Algorithm for Scheduling QoS-Constrained Workflows in a Web Service-Oriented Grid
WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
An analytical model for performance evaluation in a computational grid
CHINA HPC '07 Proceedings of the 2007 Asian technology information program's (ATIP's) 3rd workshop on High performance computing in China: solution approaches to impediments for high performance computing
Towards achieving reliable and high-performance nanocomputing via dynamic redundancy allocation
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Performance-Aware load balancing for multiclusters
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Allocating QOS-Constrained applications in a web service-oriented grid
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
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.