A fundamental issue affecting the performance of a parallel application running on a heterogeneous computing system is the assignment of tasks to the processors in the system. The task assignment problem for more than three processors is known to be NP-hard, and therefore satisfactory suboptimal solutions obtainable in an acceptable amount of time are generally sought. This paper proposes a simple and effective iterative greedy Nike Basket Blazer Mid Femme algorithm to deal with the problem with goal of minimizing the total sum of execution and communication costs. The main idea in this algorithm is to improve the quality of the assignment in an iterative manner using results from previous iterations. The algorithm first uses a constructive heuristic to find an initial assignment and iteratively Blazer Nike improves it in a greedy way. Through simulations over a wide range of parameters, we have demonstrated the effectiveness of our algorithm by comparing it with recent competing task assignment algorithms in the literature.
An abelian category with arbitrary coproducts and a small projective generator is equivalent to a module category (Mitchell (1964) ). A tilting object in an abelian category is a natural generalization of a small projective generator. Moreover, any abelian category with a tilting object admits arbitrary coproducts (Colpi et al. (2007) ). It naturally arises the question when an abelian category with a tilting object is equivalent to a module category. By Colpi et al. (2007) , the Chaussure Nike Blazer Basse problem simplifies in understanding when, given an associative ring RR and a faithful torsion pair (X,Y)(X,Y) in the category of right RR-modules, the heart H(X,Y)H(X,Y)of the t-structure associated with (X,Y)(X,Y) is equivalent to a category of modules. In this paper, we give a complete answer to this question, proving necessary and sufficient conditions on (X,Y)(X,Y) for H(X,Y)H(X,Y) to be equivalent to a module category. We analyze in detail the case when RR is right artinian.
Speak Your Mind