loading...
An Efficient Workload Allocation to Improve Scheduling Real-Time Tasks
Cagliari, Sardinia, Italy June 26-June 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCC.2006.3411th IEEE Symposium on Computers and ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Abeer Hamdy, Electronic Research Institute, Egypt
Ahmed Hussein, University of Connecticut, USA
Reda Ammar, University of Connecticut, USA
Cluster computing systems are currently used to execute high performance applications that exhibit real time characteristics. A high-speed communication networks are used to interconnect the nodes of a cluster. Also, special software is used to allocate and manage the execution of the parallel tasks of the applications on cluster's processors to satisfy real-time requirements and achieve high throughput. In this paper, we present a new algorithm to allocate tasks? workloads in a way that improves the utilization of each cluster's processor. Consequently, a cluster's processor can accept more tasks and results in higher throughput. The idea of the algorithm depends on assigning a variable processing power to the task under consideration to satisfy its deadline instead of rejecting it if a constant processing power cannot be guaranteed. Simulation results reveal that the acceptance rate of submitted tasks to a cluster's processor using the new approach is superior to previous approaches.
Index Terms:
Workload allocation, Processing power, Processor utilization, scheduling real-time tasks.
Citation:
Abeer Hamdy, Ahmed Hussein, Reda Ammar, "An Efficient Workload Allocation to Improve Scheduling Real-Time Tasks," iscc, pp.863-869, 11th IEEE Symposium on Computers and Communications (ISCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions