Wyniki wyszukiwania - BazTech

1

Parallel cache-efficient code for computing the McCaskill partition functions

Palkowski Marek, Bielecki Wlodzimierz

Annals of Computer Science and Information Systems

|

2019

|

Vol. 18

207--210

EN

We present parallel tiled optimized McCaskill's partition functions computation code. That CPU and memory intensive dynamic programming task is within computational biology. To optimize code, we use the authorial source-to-source TRACO compiler and compare obtained code performance with that generated with the state-of-the-art PluTo compiler based on the affine transformations framework (ATF). For the considered task, PluTo is able to generate only serial highly cache efficient code without any parallelism. A TRACO tiling and parallelizing strategy uses the transitive closure of a dependence graph to avoid affine function calculation. First, for each loop nest statement, rectangular tiles are formed. Then those tiles are corrected to be valid under lexicographical order if necessary. A correction is carried out by means of applying transitive closure. The validity of tiles guarantees that the inter-tile dependence graph is acyclic. So, a valid schedule for target tiles can be derived and applied to generate parallel tiled code. For this purpose, the ISL scheduler is used. An experimental study carried out on a multi-core computer demonstrates considerable speed-up of generated code for the larger number of threads. Generated parallel tiled code overcomes that generated with the PluTo compiler.

2

Accelerating multivariate cryptography with constructive affine stream transformations

Carenzo Michael, Polak Monika

Annals of Computer Science and Information Systems

|

2019

|

Vol. 18

221--225

EN

On December 20th, 2016, the National Institute of Standards and Technology (NIST) formally initiated a competition to solicit, evaluate, and standardize one or more quantum-resistant cryptographic algorithms. Among the current candidates is a cryptographic primitive which has shown much promise in the post-quantum age, Multivariate Cryptography. These schemes compose two affine bijections S and T with a system of multivariate polynomials. However, this composition of S and T becomes costly as the data encrypted grows in size. Here we present Constructive Affine Stream (CAS) Transformations, a set of algorithms which enable specialized, large-scale, affine transformations in O(n) space and O(n log n) time, without compromising security. The goal of this paper is to address the practical problems related to affine transformations common among almost all multivariate cryptographic schemes.

3

Reprezentacja kształtu 3D z użyciem współrzędnych sferycznych

Frejlichowski D.

Metody Informatyki Stosowanej

|

2011

|

nr 3

41-47

EN

The paper presents experimental results on three dimensional shape description and recognition using a simple approach. The method uses the transformation from Cartesian coordinates of the vertices belonging to an object to the three-dimensional spherical ones. The described algorithm is tested using the objects deformed by affine transforms.