STAPL | Software & Systems | Parasol Laboratory

STAPL Parallel Algorithms (pAlgorithms)

A pAlgorithm is the parallel equivalent of an STL algorithm. The pRange class abstracts the pContainers of STAPL and provides pContainer access operations used by STAPL pAlgorithms in the same way the STL iterators abstract the STL containers and provide container access operations to the STL algorithms.

Example on how to call STL equivalent algorithms:

STL	STAPL
vector vec(100); sort(vec.begin(), vec.end());	pVector pvec(100); p_sort(pvec.get_prange());

STAPL provides parallel:

Adaptive Algorithm Selection Framework selects and tunes algorithm implementation based on input, architectural, and runtime characteristics.


Adaptive Sort Input size 120mil random integers	Adaptive Matrix Multiply Two matrices of size 4096x4096

If you have questions about STAPL, please email stapl-support@tamu.edu

Parasol Home | Research | People | General info | Seminars | Resources

Parasol Lab, 301 Harvey R. Bright Bldg, 3112 TAMU, College Station, TX 77843-3112
Contact Webmaster Phone 979.458.0722 Fax 979.458.0718

Department of Computer Science | Dwight Look College of Engineering | Texas A&M University
Privacy statement: Computer Science Engineering TAMU