High-performance computing applications heavily rely on message-passing mechanisms for data sharing in cluster environments, and the MPI library stands as the default communication library for parallel applications. Significant efforts have been directed toward optimizing data distribution and buffering based on size. This optimization aims to enhance communication performance and prevent issues such as running out of memory on the target node. Furthermore, the emergence of multicore clusters with larger node sizes has stimulated the investigation of hierarchical collective algorithms that consider the placement of processes within the cluster and the memory hierarchy. This paper studies and compares the performance of the algorithm of the reduction collective from the literature, specifically several implementations that do not form part of the current MPI standard, which tackle this issue. We implement the algorithms on top of Intel MPI and OpenMPI libraries using the MPI profiling interface. Experimental results with the Intel MPI Benchmarks on a multicore cluster, Intel Platinum processor-based and OmniPath interconnection network show much room for improvement in the performance of collectives depending on the message sizes.