2019
DOI: 10.1016/j.sysarc.2019.05.001
|View full text |Cite
|
Sign up to set email alerts
|

Delay-based I/O request scheduling in SSDs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 24 publications
0
5
0
Order By: Relevance
“…(1) getTime_Energy_AVE_SD(P, NumGPU) (2) for i 0, NumGPU do//Filter feasible solutions (3) for j 0, P do (4) if e time of the jth task in the ith processor > Crit i (5) put task number j to _i [] array//Only store the task number (subscript) ( 6) else (7) put task number j to Tm_i array (8) end if (9) end for (10) end for (11) record the number in _i and Tm_i as NumIn , NumInTm (12) for i 0, NumGPU do//Sort (13) use sort( _i) function to sort each _i array and store the result to Sort_ _i[ ] (14) end for (15) for i ⟵ 0, i < P do//Filter K processor number with the smallest cumulative time ( 16) add time of ret_taskindex in Tm_ret_taskindex to AccumPer_ret_GPUIndex (25) assign the time of ret_taskindex in Tm_ret_taskindex in other GPU to 0 (26) end if (27) end for (28)…”
Section: Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…(1) getTime_Energy_AVE_SD(P, NumGPU) (2) for i 0, NumGPU do//Filter feasible solutions (3) for j 0, P do (4) if e time of the jth task in the ith processor > Crit i (5) put task number j to _i [] array//Only store the task number (subscript) ( 6) else (7) put task number j to Tm_i array (8) end if (9) end for (10) end for (11) record the number in _i and Tm_i as NumIn , NumInTm (12) for i 0, NumGPU do//Sort (13) use sort( _i) function to sort each _i array and store the result to Sort_ _i[ ] (14) end for (15) for i ⟵ 0, i < P do//Filter K processor number with the smallest cumulative time ( 16) add time of ret_taskindex in Tm_ret_taskindex to AccumPer_ret_GPUIndex (25) assign the time of ret_taskindex in Tm_ret_taskindex in other GPU to 0 (26) end if (27) end for (28)…”
Section: Methodsmentioning
confidence: 99%
“…The first is energy saving scheduling technology based on task characteristics. [ 9 , 10 ] point out that the storage requirements of tasks, task migration, and the improvement of scheduling strategy are helpful to the improvement of system performance. Based on this, Zhan et al [ 11 ] research the energy optimization of hybrid scratchpad memory which consists of SRAM and nonvolatile memory.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Mao et al [13] proposed a garbage collection aware request dispatching method to avoid GC conflicts. Chen et al [14] established a delay model to dispatch and schedule read/write requests separately according to the obtained delay value. Cui et al [15] proposed to schedule read requests according to retention time and write requests according to hotness, in order to be aware of device process variations.…”
Section: Introductionmentioning
confidence: 99%