Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: speedup

Sortuj według:

Ogranicz wyniki do:

A Simulation of Natural Deduction and Gentzen Sequent Calculus

100%

Kozhemiachenko D.

tom 27

nr 1

67–84

We consider four natural deduction systems: Fitch-style systems, Gentzen-style systems (in the form of dags), general deduction Frege systems and nested deduction Frege systems, as well as dag-like Gentzen-style sequent calculi. All these calculi soundly and completely formalize classical propositional logic. We show that general deduction Frege systems and Gentzen-style natural calculi provide at most quadratic speedup over nested deduction Frege systems and Fitch-style natural calculi and at most cubic speedup over Gentzen-style sequent calculi.

Parallel FDTD simulation using Task Parallel Library (TPL)

58%

Bolesta I. , Demchuk A.

tom Vol. 24, nr 2

7--16

The finite-difference time-domain (FDTD) is a numerical analysis technique used for solving computational electrodynamic problems. The nature of the FDTD method is that simulation of big and complicated electromagnetic field problems requires a vast amount of computer operational memory and runtime. Parallel-processing techniques have been broadly applied to FDTD to accelerate the simulations. The parallelism of the FDTD algorithm is based on a fact that the computational domain can be divided into parts (sub-domains), and each processor in a parallel system deals with one or several sub-domains. The FDTD algorithm belongs to data parallelism model and can be effectively implemented on shared memory system architecture. The parallel FDTD method was implemented using TPL library. The Task Parallel Library (TPL) is a library for .NET that makes easy to parallelize the program using the advantages of .NET Framework. The speedup metrics of parallel FDTD algorithm were calculated and compared with Amdahl’s estimated speedup.