Solaris multithreaded programming guide
Solaris multithreaded programming guide
Programming with POSIX threads
Programming with POSIX threads
Real-Time Systems
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Visualization and Performance Prediction of Multithreaded Solaris Programs by Tracing Kernel Threads
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
WildFire: A Scalable Path for SMPs
HPCA '99 Proceedings of the 5th International Symposium on High Performance Computer Architecture
VPPB -- A Visualization and Performance Prediction Tool for Multithreaded Solaris Programs
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Evaluating the Performance Implications of Binding Threads to Processors
HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
| Hi-index | 0.00 |
Many multiprocessor systems are based on distributed shared memory. It is often important to statically bind threads to processors in order to avoid remote memory access, due to performance. Finding a good allocation takes long time and it is hard to know when to stop searching for a better one. It is sometimes impossible to run the application on the target machine. The developer needs a tool that finds the good allocations without the target multiprocessor. We present a tool that uses a greedy algorithm and produces allocations that are more than 40% faster (in average) than when using a binpacking algorithm. The number of allocations to be evaluated can be reduced by 38% with a 2% performance loss. Finally, an algorithm is proposed that is promising in avoiding local maxima.