Name
Abstract | ||
|---|---|---|
This paper describes a scheduling method focusing on exploiting the local access of a nonuniform storage-access file system. In our approach, the file access cost is calculated and combined with the CPU load average into a comprehensive value, which will be used as the standard for scheduling. We evaluated our approach in comparison with the original Torque scheduler using three benchmarks: thput-gfpio, readgf, and BLAST benchmarks. For thput-gfpio, the read throughput showed a 3.59 times boost, whereas for readgf, the total execution time was reduced to about 1/10th of the original value. Finally, using the BLAST benchmark, the total execution time was reduced by 33%. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/JSYST.2015.2471850 | IEEE Systems Journal |
Keywords | Field | DocType |
Batch queuing system,Gfarm,data-aware task scheduling,file locality,nonuniform storage-access (NUSA),scheduling | File system,Torque,Computer science,Scheduling (computing),Computer network,Real-time computing,Throughput,Queue management system,Benchmark (computing),Resource management,Central processing unit,Parallel computing,Operating system | Journal |
Volume | Issue | ISSN |
PP | 99 | 1932-8184 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xieming Li | 1 | 1 | 0.69 |
| Osamu Tatebe | 2 | 309 | 42.94 |