a43eb4b43e
Keeping the cache misses as low as possible is always a good approach. The opal_list_t is widely used, it should be a highly optimized class. The same functionality can be reached with one one sentinel instead of 2 currently used. I don't have anything against the STL version, but so far nothing can compare with the Knuth algorithm. I replace the current implementation with a modified version of the Knuth algorithm (the one described in The Art of Computer Programming). As expected, the latency went down. This commit was SVN r10776. |
||
---|---|---|
.. | ||
attribute | ||
class | ||
communicator | ||
datatype | ||
debuggers | ||
errhandler | ||
etc | ||
file | ||
group | ||
include | ||
info | ||
mca | ||
mpi | ||
op | ||
peruse | ||
proc | ||
request | ||
runtime | ||
tools | ||
win | ||
Makefile.am | ||
README.dox |
/* * Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana * University Research and Technology * Corporation. All rights reserved. * Copyright (c) 2004-2005 The University of Tennessee and The University * of Tennessee Research Foundation. All rights * reserved. * Copyright (c) 2004-2005 High Performance Computing Center Stuttgart, * University of Stuttgart. All rights reserved. * Copyright (c) 2004-2005 The Regents of the University of California. * All rights reserved. * $COPYRIGHT$ * * Additional copyrights may follow * * $HEADER$ */ /** @mainpage @section mainpage_introduction Introduction This is the introduction. This is the introduction. This is the introduction. This is the introduction. This is the introduction. This is the introduction. This is the introduction. @section main_install Installation This is the installation section. This is the installation section. This is the installation section. This is the installation section. This is the installation section. This is the installation section. This is the installation section. */