there is a property in the book saying:
block sorting on P processors using butcher's sort with merging comparators can sort N records in a bout (Log p)2/ 2 parallell sort.
and i have question depending in this property asking how many parellel steps would be required to sort 100,000 records using 32 processors?
my answer was (log32) = (1.5)2 = 2.26/2 =1.132
1.132 *100000= 113273.8
is what am doing correct? is it areasonable answer?
thank you
block sorting on P processors using butcher's sort with merging comparators can sort N records in a bout (Log p)2/ 2 parallell sort.
and i have question depending in this property asking how many parellel steps would be required to sort 100,000 records using 32 processors?
my answer was (log32) = (1.5)2 = 2.26/2 =1.132
1.132 *100000= 113273.8
is what am doing correct? is it areasonable answer?
thank you