Do you want to publish a course? Click here

In this research, We introduce two probabilistic mechanisms to certificate parallel applications on distribute architecture supposing that there are no oracles on which we depend on certification, in addition to introducing cost model of two mecha nisms and compare them. In this research, we are interested in parallel applications, which are represented by data-flow graph that is built dynamically during the execution and which are executed in a wide distributed heterogeneous and dynamic environment and these applications use the principle of work stealing to distribute the tasks among the processors.
We introduce an auto adaptive strategy enables to write a parallel algorithm adapts to the number of available resources at allocated parallel environment to execute the parallel program. The parallel applications we are studying which are represe nted by data-flow graph which built dynamically during the execution. The new suggested strategy is based on coupling of a sequential algorithm and a parallel one and relies on the principle of work stealing in the tasks scheduling. We offer a study of the complexity of the adaptive algorithm and analyze its performance on processors and compare it with a performance of a classic parallel algorithm.
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا