Sentence examples for implementation variant from inspiring English sources

The complexity of these architectures makes it difficult to find the best implementation variant by manual tuning.

Adaptive program optimizations, such as automatic selection of the expected fastest implementation variant for a computation component depending on hardware architecture and runtime context, are important especially for heterogeneous computing systems but require good performance models.

Finding an efficient implementation variant for the numerical solution of problems from computational science and engineering involves many implementation decisions that are strongly influenced by the specific hardware architecture.

For some numerical methods, auto-tuning at installation time cannot be applied directly, since the best implementation variant may strongly depend on the specific numerical problem to be solved.

For example, Rajan et al. have shown that full MCDC coverage at the non-inlined implementation variant yielded only about 13.6% MCDC coverage at the inlined implementation variant [20].

In the inlined implementation variant we get a single decision: Out1  =  (In1 (In2 && In3); Actually, achieving structural code coverage on the non-inlined implementation variant requires in general a smaller number of test data.

Different implementation variants have been evaluated in experimental scenarios.

These techniques generate different implementation variants at installation time and select one of these implementation variants either at installation time or at runtime, before the computation starts.

Different implementation variants of such structures are compared by using accurate simulation models of various parts of the system.

Our framework relies on a component-based approach that accommodates for different implementation variants of tasks, customized for different parts of a heterogeneous platform, and utilizes an advanced runtime system for exploiting parallelism through dynamic task scheduling.

The performance of parallel multi-threaded implementation variants of these methods depends on various factors only known at runtime, for example, the coupling structure of the ODE system to be solved, the memory access pattern resulting from this coupling structure, and the number of threads executing the program.