Comparison of OpenMP 3.0 and Other Task Parallel Frameworks on Unbalanced Task Graphs

ISSN： 0885-7458

Source： International Journal of Parallel Programming, Vol.38, Iss.5-6, 2010-10, pp. : 341-360

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic Algorithm

By Kwok Y-K. Ahmad I.

Journal of Parallel and Distributed Computing, Vol. 47, Iss. 1, 1997-11 ,pp. : 58-77

Academic Press

Access to resources Recommend Favorite

SEParAT: scheduling support environment for parallel application task graphs

By Dümmler Jörg

Cluster Computing, Vol. 15, Iss. 3, 2012-09 ,pp. : 223-238

Springer Publishing Company

Access to resources Recommend Favorite

A COMPARISON OF LIST SCHEDULING HEURISTICS FOR COMMUNICATION INTENSIVE TASK GRAPHS

By Macey Benjamin S. Zomaya Albert Y.

Cybernetics and Systems, Vol. 28, Iss. 7, 1997-10 ,pp. : 535-546

Taylor & Francis Ltd

Access to resources Recommend Favorite

Parallel protein secondary structure prediction schemes using Pthread and OpenMP over hyper-threading technology

By Zhong Wei Altun Gulsah Tian Xinmin Harrison Robert Tai Phang Pan Yi

The Journal of Supercomputing, Vol. 41, Iss. 1, 2007-07 ,pp. : 1-16

Springer Publishing Company

Access to resources Recommend Favorite

OpenMP based parallel normalized direct methods for sparse finite element linear systems

By Gravvanis George

The Journal of Supercomputing, Vol. 47, Iss. 1, 2009-01 ,pp. : 44-52

Springer Publishing Company

Access to resources Recommend Favorite