Name
Abstract | ||
|---|---|---|
Quality of Service (QoS) provisioning for divisible loads incluster computing has attracted more attention recently. To enhance QoSand provide performance guarantees in cluster computing environmentsfor divisible loads, in this paper, we integrate a Simplified Multi-Round (SMR) strategy into the design of real-time scheduling algorithms for divisibleload applications. Four contributions are made in this paper. First,we present algorithm SMR and extend it to compute a closed form formulafor minimum number of processors required to meet an applicationdeadline. Second, we derived a closed form solution for execution timeof the optimized SMR. Third, we formally prove that optimized SMRresults in better completion time than the single round strategy. Finally,we integrate SMR with our algorithm framework and propose two setsof efficient algorithms. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-89894-8_20 | HiPC |
Keywords | Field | DocType |
setsof efficient algorithm,algorithm smr,closed form solution,optimized smrresults,incluster computing,cluster computing environmentsfor divisible,closed form formulafor minimum,optimized smr,algorithm framework,real-time scheduling algorithm,multi-round real-time divisible load,real time,cluster computing,quality of service,real time computing | Cluster (physics),Computer science,Scheduling (computing),Parallel computing,Open framework,Closed-form expression,Quality of service,Provisioning,Load scheduling,Computer cluster,Distributed computing | Conference |
Volume | ISSN | Citations |
5374 | 0302-9743 | 3 |
PageRank | References | Authors |
0.42 | 14 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xuan Lin | 1 | 61 | 4.02 |
| Jitender S. Deogun | 2 | 1231 | 250.79 |
| Ying Lu | 3 | 196 | 13.79 |
| Steve Goddard | 4 | 653 | 44.90 |