1623 search results - page 43 / 325 » No Sorting |
100
Voted
DM
2007
15 years 2 months ago
2007
We consider the problem of determining the maximum number of moves required to sort a permutation of [n] using cut-and-paste operations, in which a segment is cut out and then pas...
104
Voted
GVD
2009
15 years 12 days ago
2009
Database management systems comprise various algorithms for efficiently retrieving and managing data. Typically, algorithm efficiency or performance is correlated with execution s...
117
Voted
ICSEA
2007
IEEE
15 years 9 months ago
2007
IEEE
— This paper demonstrates that the algorithmic performance of end user programs may be greatly affected by the two or three level caching scheme of the processor, and we introduc...
132
Voted
ESA
2005
Springer
15 years 8 months ago
2005
Springer
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
116
Voted
ISCAPDCS
2004
15 years 4 months ago
2004
Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamen...