<XML><RECORDS><RECORD><REFERENCE_TYPE>0</REFERENCE_TYPE><REFNUM>7968</REFNUM><AUTHORS><AUTHOR>O'Donnell,J.T.</AUTHOR></AUTHORS><YEAR>2005</YEAR><TITLE>Supporting tasks with adaptive groups in data parallel programming</TITLE><PLACE_PUBLISHED>International Journal of Computational Science and Engineering (IJCSE), Vol. 1, Nos. 2/3/4, Inderscience Publishers.</PLACE_PUBLISHED><PUBLISHER>N/A</PUBLISHER><PAGES>86-98</PAGES><ISBN>1742-7185</ISBN><LABEL>O'Donnell:2005:7968</LABEL><KEYWORDS><KEYWORD>Data parallel</KEYWORD></KEYWORDS<ABSTRACT>A set of communication operations is defined which allows a form of task parallelism to be achieved in a data parallel architecture. The set of processors can be subdivided recursively into groups, and a communication operation inside a group never conflicts with communications taking place in other groups. The groups may be subdivided and recombined at any time, allowing the task structure to adapt to the needs of the data. The algorithms implementing the grouping and communications are defined using parallel scans and folds which can be executed efficiently in an abstract tree machine. This approach is best suited for massively parallel systems with fine grain processors.</ABSTRACT></RECORD></RECORDS></XML>