How about the Schwartzian as an example?

my @sorted = 
    map   { $_->[0] }
    sort  { $a->[1] <=> $b->[1] }
    map   {[ $_, substr( $_, 2, 5 ) ]} @list;
[download]

The maps can be parellelized, and the sort can, too, if perl (lowercase) implemented it with a parellel sorting algorithm. The second map (in execution order) must come out in correct order--otherwise, why did you even bother sorting? Intrestingly, the first map does not need to come out in order, though there is a problem of letting perl in on this fact.