parsort(1)

1PARSORT(1)                         parallel                         PARSORT(1)
2
3
4

NAME

6       parsort - Sort (big files) in parallel
7

SYNOPSIS

9       parsort options for sort
10

DESCRIPTION

12       parsort uses GNU sort to sort in parallel. It works just like sort but
13       faster on inputs with more than 1 M lines, if you have a multicore
14       machine.
15
16       Hopefully these ideas will make it into GNU Sort in the future.
17

EXAMPLE

19       Sort files:
20
21         parsort *.txt > sorted.txt
22
23       Sort stdin (standard input) numerically:
24
25         cat numbers | parsort -n > sorted.txt
26

PERFORMANCE

28       parsort is faster on files, because these can be read in parallel.
29
30       On a 48 core machine you should see a speedup of 3x over sort.
31

AUTHOR

33       Copyright (C) 2020 Ole Tange, http://ole.tange.dk and Free Software
34       Foundation, Inc.
35

LICENSE

37       Copyright (C) 2012 Free Software Foundation, Inc.
38
39       This program is free software; you can redistribute it and/or modify it
40       under the terms of the GNU General Public License as published by the
41       Free Software Foundation; either version 3 of the License, or at your
42       option any later version.
43
44       This program is distributed in the hope that it will be useful, but
45       WITHOUT ANY WARRANTY; without even the implied warranty of
46       MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
47       General Public License for more details.
48
49       You should have received a copy of the GNU General Public License along
50       with this program.  If not, see <http://www.gnu.org/licenses/>.
51

DEPENDENCIES

53       parsort uses sort, bash, parallel, and mbuffer.
54