A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
It identifies the commonalities of the family of hierarchical multiresource allocation systems and proposes the concept of multisorted tree-algebra for the modeling of these problems. ... The research presented here is not yet an in-depth descriptive research study of the mathematical theory of multisorted tree-algebra, but a formal study on modelling hierarchical multiresource allocation ... Definition 28 ((Σ, Θ, Δ)-multisorted tree terms). Let A = ⟨Σ, Θ, Δ, , ⟩ be a -multisorted tree-algebra. Let be an -set of variables ⟨Δ, Θ⟩. ...doi:10.1155/2015/820430 fatcat:ovvxcchabbgjhpzlsgzk67lmum
With increasing application complexity, there is a growing need for addressing irregular parallelism in the presence of complicated control structures. ... The comparison shows that the OpenMP tasking model provides expressiveness, flexibility, and huge potential for performance and scalability. ... This is a serious limitation that affects the coding of hierarchical algorithms such as tree data structure traversal, multiblock grid solvers, adaptive mesh refinement  , and dense linear algebra ...doi:10.1109/tpds.2008.105 fatcat:kbfeh3kxjzaddlknavazuowlzu
In this paper, we motivate the need of having such a benchmarks suite, for irregular and/or recursive task parallelism. ... Strassen: algorithm uses hierarchical decomposition of a matrix for multiplication of large dense matrices  . ... We hierarchically generate tasks for each branch of the solution space. The state of the algorithm needs to be copied into each newly created task so they can proceed. ...doi:10.1109/icpp.2009.64 dblp:conf/icpp/DuranTFMA09 fatcat:osdrpdeebvbqxovhorszp33naq