Modifying reduce decision function for large, single element reduces (again).

Binary algorithm without segmentation tends to outperform binomial algorithm 
in this case.

This commit was SVN r15226.

ompi/mca/coll/tuned/coll_tuned_decision_fixed.c

@@ -351,12 +351,12 @@ int ompi_coll_tuned_reduce_intra_dec_fixed( void *sendbuf, void *recvbuf,
     if ((communicator_size < 8) && (message_size < 512)){
         /* Linear_0K */
         return ompi_coll_tuned_reduce_intra_basic_linear (sendbuf, recvbuf, count, datatype, op, root, comm); 
-    } else if (((communicator_size < 8) && (message_size < 20480)) || 
+    } else if ((communicator_size < 8) && (message_size < 20480)) {
-               (count <= 1)){
         /* Binomial_0K */
         segsize = 0;
         return ompi_coll_tuned_reduce_intra_binomial(sendbuf, recvbuf, count, datatype, op, root, comm, segsize, max_requests);
-    } else if (message_size < 2048) {
+    } else if ((message_size < 2048) ||
+               (count <= 1)){
         /* Binary_0K */
         segsize = 0;
         return ompi_coll_tuned_reduce_intra_binary(sendbuf, recvbuf, count, datatype, op, root, comm, segsize, max_requests);