2018
15
2
16
0
https://jcse.ir/article/4
Progressive sorting in the external memory model
0
Executing all steps of an algorithm that faces with massive input data may take a long time. A progressive algorithm solves the problem step by step, and produces a partial solution in each step which approximates the final solution. Therefore, the user can decide to stop the algorithm or continue to get better solutions. In this paper, we consider the problem of sorting a set of N real numbers, and design a progressive algorithm with O(log M/B (N/B)) steps that takes O(N/B) I/O operations in each step in the external memory model. The upper bound for the error of the partial solution in step r is O( N/[(M/B)^(r/2)]).
1
10
Amir
Mesrikhani
ایران
Mohammad
Farshi
ایران
Progressive algorithm
Partial solution
Sorting problem
External memory algorithm
http://jcse.ir/ow_userfiles/plugins/base/attachments/5bf26b6a87622_5bf26b6a872ed.pdf
Computer Society of Iran
Journal on Computer Science and Engineering (JCSE)
15
2