You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Smaller version of #199 , where we want to replace all usage of the tpie library with the C++ standard library, std. Here, we will accept the fact, that the sorter and priority_queue break when hitting the end of RAM (i.e. we always will run with internal memory).
Similar to part 1 and 2 of #444 , this investigates how much of an overhead we have by reading, resp. writing, the input, resp. output, from, resp. to, the disk . Question is, whether any speed-up is dominated by algorithmic optimisations from TPIE that are lost, e.g. it's faster sorting algorithm.
The text was updated successfully, but these errors were encountered:
Smaller version of #199 , where we want to replace all usage of the
tpie
library with the C++ standard library,std
. Here, we will accept the fact, that thesorter
andpriority_queue
break when hitting the end of RAM (i.e. we always will run with internal memory).Similar to part 1 and 2 of #444 , this investigates how much of an overhead we have by reading, resp. writing, the input, resp. output, from, resp. to, the disk . Question is, whether any speed-up is dominated by algorithmic optimisations from TPIE that are lost, e.g. it's faster sorting algorithm.
The text was updated successfully, but these errors were encountered: