Vector Computers Research Articles

Numerical modeling of dielectric barrier discharge actuators based on the properties of low-frequency plasmons

Electrohydrodynamic flow control systems have proven to be among the most promising flow control strategies within previous decades. Several methods for efficient evaluation and description of the effect of such systems are indeed available. Yet, due to these systems’ critical role in various applications, possible improvements are still investigated. A new phenomenological model is presented for the simulation of the plasma actuators based on the electrodynamic properties of low-frequency plasmons. The model simulates the plasmonic region as a dispersive medium. This dissipated energy is added to the flow by introducing a high-pressure region, calculated in terms of local body force vectors, requiring the distribution of the electric field and the polarization field. The model determines the electric field for the computation of the body force vector based on the Poisson equation and implements the simplified Lorentz model for the polarization field. To fully explore the performance of the presented model, an experiment has been conducted providing a comparison between the observed effect of plasma actuators on the fluid flow with the results predicted by the model. The model is then validated based on the results of other distinct experiments and exempted numerical models, based on the exchanging momentum with the ambient neutrally charged fluid, demonstrating that the model has improved adaptability and self-adjusting capability compared to the available models.

Active knowledge graph completion

Enterprise and public Knowledge Graphs (KGs) are known to be incomplete. Methods for automatic completion, sometimes by rule learning, scale well. While previous rule-based methods learn closed (non-existential) rules, we introduce Open Path (OP) rules that are constrained existential rules. We present a novel algorithm, OPRL, for learning OP rules.Closed rules complete a KG by answering queries of unclear origin, usually derived from a holdback test set in experimental settings. However, OP rules can generate relevant queries for KG completion. OPRL generates queries even when there is no closed rule to answer the query, or when the correct answer is a missing entity that is not present in the KG.For OPRL to scale well, we propose a novel embedding-based fitness function to efficiently estimate rule quality. Additionally, we introduce a novel, efficient vector computation to formally assess rule quality.We evaluate OPRL using adaptations of Freebase, YAGO2, Wikidata, and a synthetic Poker KG. We find that OPRL mines hundreds of accurate rules from massive KGs with up to 8 M facts. The OP rules generate queries with precision as high as 98% and recall of 62% on a complete KG, demonstrating the first solution for active knowledge graph completion.

Elastic reverse time migration angle gathers using a stabilized Poynting vector without zero points within the wave propagation ranges

Generation of PP and PS angle gathers for elastic reverse time migration (ERTM) has important applications in velocity model updating and subsurface parameter inversion. The Poynting-vector-based method provides a cost-effective way to extract angle gathers from ERTM. However, the estimated propagation directions or angles based on Poynting vectors at or near zero points are unstable, and the reflection energy at these points is likely to be placed in an incorrect angle bin. This instability problem severely limits its use in the generation of high-quality angle gathers. To overcome this problem, we add the conventional Poynting vector with an ancillary one of the Hilbert transformed wavefield, a 90° phase-shifted version of the original wavefield. The Poynting vector of the Hilbert transformed wavefield points in the same propagation direction as the conventional Poynting vector, but they have different zero-point distributions. Adding them together allows us to obtain a stabilized Poynting vector which thoroughly eliminates the zero points within the wave propagation range, and thus we obtain a stable algorithm to extract high-quality angle gathers from ERTM. The Hilbert transformed wavefield already exists in the P/S and up/down wavefield decomposition procedure, which has become a necessary step for ERTM to separate overlapping wavefields at reflectors before the computation of Poynting vectors. Results from two synthetic numerical examples indicate the effectiveness of our method in generating high-quality angle gathers for ERTM.

A staggered semi-implicit hybrid finite volume / finite element scheme for the shallow water equations at all Froude numbers

We present a novel staggered semi-implicit hybrid finite volume / finite element method for the numerical solution of the shallow water equations at all Froude numbers on unstructured meshes. A semi-discretization in time of the conservative Saint-Venant equations with bottom friction terms leads to its decomposition into a first order hyperbolic subsystem containing the nonlinear convective term and a second order wave equation for the pressure. For the spatial discretization of the free surface elevation an unstructured mesh composed of triangular simplex elements is considered, whereas a dual grid of the edge-type is employed for the computation of the depth-averaged momentum vector. The first stage of the proposed algorithm consists in the solution of the nonlinear convective subsystem using an explicit Godunov-type finite volume method on the staggered dual grid. Next, a classical continuous finite element scheme provides the free surface elevation at the vertices of the primal simplex mesh. The semi-implicit strategy followed in this paper circumvents the contribution of the surface wave celerity to the CFL-type time step restriction, hence making the proposed algorithm well-suited for the solution of low Froude number flows. It can be shown that in the low Froude number limit the proposed algorithm reduces to a semi-implicit hybrid FV/FE projection method for the incompressible Navier-Stokes equations. At the same time, the conservative formulation of the governing equations also allows the discretization of high Froude number flows with shock waves. As such, the new hybrid FV/FE scheme can be considered an all-Froude number solver, able to deal simultaneously with both, subcritical as well as supercritical flows. Besides, the algorithm is well balanced by construction. The accuracy of the overall methodology is studied numerically and the C-property is proven theoretically and is also validated via numerical experiments. The numerical solution of several Riemann problems, including flat bottom and a bottom with jumps, attests the robustness of the new method to deal also with flows containing bores and discontinuities. Finally, a 3D dam break problem over a dry bottom is studied and our numerical results are successfully compared with numerical reference solutions obtained for the 3D free surface Navier-Stokes equations and with available experimental reference data.

Pixel Antenna Optimization Based on Perturbation Sensitivity Analysis

Pixel antennas provide a straightforward method for antenna design that can meet a given set of specifications. A key step in the design of pixel antennas is the optimization of the hardwire connections between the pixels in the antenna. Due to the very large number of possible pixel connection combinations, this optimization needs to be performed by heuristic algorithms. In this work, the sensitivity analysis is proposed for the efficient optimization of pixel antennas. In the approach, each individual pixel of the antenna is perturbed in turn to obtain the sensitivity vector of the objective function. The sensitivity analysis at each step is performed efficiently through the use of algebraic simplification that avoids matrix inversion and leads to a significant saving in computational load. The optimization process then selects the perturbation with the greatest sensitivity. Two examples are provided to demonstrate the performance of the proposed optimization method. For both examples, the proposed approach performs the optimization with significantly fewer iterations and either achieves a better or similar minimum in the objective function compared to genetic algorithm approaches. Combined with the efficient computation of the sensitivity vector, significant savings in the computational load are achieved compared to existing approaches.

MULTISCALE MODEL WITH EMBEDDED DISCONTINUITY DISCRETE APPROXIMATION CAPABLE OF REPRESENTING FULL SET OF 3D FAILURE MODES FOR HETEROGENEOUS MATERIALS WITH NO SCALE SEPARATION

In this paper we present a 3D strongly coupled multiscale computational procedure for failure analysis of heterogeneous materials capable of representing a full set of different failure modes under various stress states. The proposed approach targets structural failure modeling by a multiscale method with no need for scale separation where a homogenized structural response is described at the macroscale, while microscale is utilized for representing a full set of 3D damage mechanisms inside the domain. The main novelty in terms of finite element method (FEM) implementation concerns macroscale elements that provide the adequate discrete approximation with embedded discontinuity for capturing localized failure with softening. Computation of element tangent stiffness matrices and residual vectors is performed by assembly of microscale elements whose contributions are statically condensed at the coarse level. A refined mesh built with corresponding microscale element discretization entirely fits in each macroscale element which acts as a container for microscale computational results. The compatibility between both scales is enforced by imposing constraint on the displacement field over the macroelement boundary producing a displacement based coupling in the spirit of localized Lagrange multipliers. Dealing with localized failure mechanisms is enabled through enlargement of such scale coupling through implementation of embedded strong discontinuity in macroscale elements. The computation is performed by using the operator split iterative solution procedure treating sequentially micro- and macroscales. Through several numerical simulations, it is demonstrated that the proposed methodology can reproduce a full set of 3D failure modes with very satisfying performance in dealing with localized failure problems.

Elements of the methodology of teaching vector graphics based on the free graphic editor LibreOffice Draw at the level of basic general education

The article presents the methodology for teaching the theme "Creation and editing of vector graphic information" in basic school, which can be implemented both in full-time education and using distance learning technologies. The methodology is based on the use of the free vector graphic editor LibreOffice Draw and has been tested over several years in teaching vector computer graphics in the seventh grade in informatics course in full-time, as well as in a distance learning format in 2020. The authors substantiate the need to develop universal methods of teaching information technologies that are insensitive to the form of education (full-time or using distance educational technologies) based on the use of free software. Some principles of constructing a methodology for teaching vector graphics based on the new Federal State Educational Standard of Basic General Education are formulated. As the basic operating system used by the teacher, the domestic free operating system "Alt Education 9" is proposed. The article substantiates the choice of the graphic editor LibreOffice Draw as the optimal software tool to support teaching vector graphics in elementary school, formulates the criteria for choosing LibreOffice Draw as a basic tool for studying computer graphics in grades 6–9 for the implementation of distance learning. A universal scheme for the implementation of a distance lesson in teaching information technology based on the use of free cross-platform software, in particular, teaching vector graphics, is proposed.

Building an allocentric travelling direction signal via vector computation.

Many behavioural tasks require the manipulation of mathematical vectors, but, outside of computational models1-7, it is not known how brains perform vector operations. Here we show how the Drosophila central complex, a region implicated in goal-directed navigation7-10, performs vector arithmetic. First, we describe a neural signal in the fan-shaped body that explicitly tracks the allocentric travelling angle of a fly, that is, the travelling angle in reference to external cues. Past work has identified neurons in Drosophila8,11-13 and mammals14 that track the heading angle of an animal referenced to external cues (for example, head direction cells), but this new signal illuminates how the sense of space is properly updated when travelling and heading angles differ (for example, when walking sideways). We then characterize a neuronal circuit that performs an egocentric-to-allocentric (that is, body-centred to world-centred) coordinate transformation and vector addition to compute the allocentric travelling direction. This circuit operates by mapping two-dimensional vectors onto sinusoidal patterns of activity across distinct neuronal populations, with the amplitude of the sinusoid representing the length of the vector and its phase representing the angle of the vector. The principles of this circuit may generalize to other brainsand to domains beyond navigation where vector operations or reference-frame transformations are required.

A mass conserving arbitrary Lagrangian–Eulerian formulation for three‐dimensional multiphase fluid flows

AbstractThe arbitrary Lagrangian–Eulerian (ALE) framework presented in [Sahin and Guventurk, An arbitrary Lagrangian–Eulerian framework with exact mass conservation for the numerical simulation of 2D rising bubble problem.Int J Numer Methods Eng. 2017;112:2110–2134] has been extended to simulate three‐dimensional immiscible incompressible multiphase fluid flows. The div‐stable side centered unstructured finite volume formulation is used for the discretization of the incompressible Navier–Stokes equations. A novel kinematic boundary condition that satisfies the local discrete geometric conservation law (DGCL) is implemented to ensure the mass conservation of each species at the machine precision. The pressure field is treated to be discontinuous across the interface with the discontinuous treatment of density and viscosity. Surface tension force is treated as a tangent force and discretized in a semi‐implicit form. Two different approaches for the computation of unit normal vector have been implemented: the least squares biquadratic surface fitting (LSBSF) and the mean weighted by sine and edge length reciprocals (MWSELR). The resulting large system of algebraic equations is solved in a fully coupled manner in order to improve the time step restrictions. As a preconditioner, an approximate matrix factorization similar to that of the projection method is employed and the parallel algebraic multigrid solver BoomerAMG provided by the HYPRE library, which is accessed through the PETSc library, has been utilized for the scaled discrete Laplacian of pressure and the diagonal blocks of mesh deformation equations. The accuracy of the proposed method is initially validated on the static bubble problem, since the surface tension force is highly sensitive to the accurate evaluation of the unit normal vector and the inaccuracies significantly contribute to unphysical velocities, called parasitic currents. The calculations indicate that the parasitic currents can be reduced to machine precision for the MWSELR method. Then, the proposed approach is applied to the single bubble rising in a viscous quiescent liquid for both low and high density ratios. The calculations produce accurate predictions of the bubble shape, center of mass, rise velocity, and so forth. Furthermore, the mass of each species is conserved at machine precision and discontinuous pressure field is obtained in order to avoid errors due to the incompressibility restriction in the vicinity of liquid‐liquid interfaces at large density and viscosity ratios.

Ray velocity derivatives in anisotropic elastic media – Part I: general anisotropy

SUMMARY We present an original, generic and efficient approach for computing the first and second partial derivatives of ray (group) velocities along seismic ray paths in general anisotropic (triclinic) elastic media. As the ray velocities deliver the ray element traveltimes, this set of partial derivatives constructs the so-called kinematic and dynamic sensitivity kernels which are used in different key seismic modelling and inversion methods, such as two-point ray bending methods and seismic tomography. The second derivatives are useful in the solution of the above-mentioned kinematic problems, and they are essential for evaluating the dynamic properties along the rays (amplitudes and phases). The traveltime is delivered through an integral over a given Lagrangian defined at each point along the ray. In our approach, we use an arclength-related Lagrangian representing a reciprocal of the ray velocity magnitude. Although this magnitude cannot be explicitly expressed in terms of the medium properties and the ray direction components, its derivatives can still be formulated analytically using the corresponding arclength-related Hamiltonian that can be explicitly expressed in terms of the medium properties and the slowness vector components; this requires first to obtain (invert for) the slowness vector components, given the ray direction components. Computation of the slowness vector and the ray velocity derivatives is considerably simplified by using an auxiliary scaled-time-related Hamiltonian obtained directly from the Christoffel equation and connected to the arclength-related Hamiltonian by a simple scale factor. This study consists of two parts. In Part I, we consider general anisotropic (triclinic) media, and provide the derivatives (gradients and Hessians) of the ray velocity, with respect to (1) the spatial location and direction vectors and (2) the elastic model parameters. The derivatives are obtained for both quasi-compressional and quasi-shear waves, where other types of media, characterized with higher symmetries, can be considered particular cases. In Part II, we apply the theory of Part I explicitly to polar anisotropic media (transverse isotropy with tilted axis of symmetry, TTI), and obtain the explicit ray velocity derivatives for the coupled qP and qSV waves and for SH waves. The derivatives for polar anisotropy are simplified (as compared to general anisotropy), obviously yielding more effective computations. The ray velocity derivatives are tested by checking consistency between the proposed analytical formulae and the corresponding numerical ones.

Development a method for determining the coordinates of air objects by radars with the additional use of multilateration technology

This paper reports an experimental study aimed at confirming disruptions in the operation of ADS-B receivers. The experimental investigation into disruptions in the operation of ADS-B receivers involved the FlightAware Piaware receiver. Examples of the disrupted performance of ADS-B receivers are given. It was found that the experimentally detected disruptions in the operation of ADS-B receivers could lead to a decrease in the accuracy of determining the coordinates of air objects with the joint use of the radar and multilateration technology. A method for determining the coordinates of an air object by radar with additional use of multilateration technology has been devised. The method involves the following stages: entering initial data, the calculation of distances between the points of reception and the air object, the computation of the inconsistency vector, the calculation of the matrix of partial derivatives taking into consideration the estimates of the coordinates of an air object at the previous iteration, the computation of the correction, the calculation of the refined coordinates of the air object. Unlike those known ones, the improved method for determining the coordinates of an air object by a radar additionally uses multilateration technology. The accuracy of determining the air objects' coordinates by a radar with the additional use of multilateration technology was estimated. It was established that the additional application of multilateration technology would reduce the error in determining the coordinates of an air object by 1.58 to 2.39 times on average, compared to using only an autonomous radar

Birkhoff averages and the breakdown of invariant tori in volume-preserving maps

In this paper, we develop numerical methods based on the weighted Birkhoff average for studying two-dimensional invariant tori for volume-preserving maps. The methods do not rely on symmetries, such as time-reversal symmetry, nor on approximating tori by periodic orbits. The rate of convergence of the average gives a sharp distinction between chaotic and regular dynamics and allows accurate computation of rotation vectors for regular orbits. Resonant and rotational tori are distinguished by computing the resonance order of the rotation vector to a given precision. Critical parameter values, where tori are destroyed, are computed by a sharp decrease in convergence rate of the Birkhoff average. We apply these methods for a three-dimensional generalization of Chirikov’s standard map: an angle–action map with two angle variables. Computations on grids in frequency and perturbation amplitude allow estimates of the critical set. We also use continuation to follow tori with fixed rotation vectors. We test three conjectures for cubic fields that have been proposed to give locally robust invariant tori, but are not able to provide compelling evidence that one of these three fields is more robust than the other two.

Validation of Multi-Frame PIV Image Interrogation Algorithms in the Spectral Domain

Multi-frame correlation algorithms for time-resolved PIV have been shown in previous studies to reduce noise and error levels in comparison with conventional two-frame correlations. However, none of these prior efforts tested the accuracy of the algorithms in spectral space. Even should a multi-frame algorithm reduce the error of vector computations summed over an entire data set, this does not imply that these improvements are observed at all frequencies. The present study examines the accuracy of velocity spectra in comparison with simultaneous hot-wire data. Results indicate that the high-frequency content of the spectrum is very sensitive to choice of the interrogation algorithm and may not return an accurate response. A top-hat-weighted sliding sum-of-correlation is contaminated by high-frequency ringing whereas Gaussian weighting is indistinguishable from a low-pass filtering effect. Some evidence suggests the pyramid correlation modestly increases bandwidth of the measurement at high frequencies. The apparent benefits of multi-frame interrogation algorithms may be limited in their ability to reveal additional spectral content of the flow.

Computation of velocities and polarization vectors in weakly anisotropic media

To compute the phase velocities in the weakly anisotropic media, we propose to transform the Christoffel matrix K into an adapted coordinate system, and, then, apply the perturbation theory to the resulting matrix X. For a weakly anisotropic medium, the off-diagonal elements of the matrix X are small compared to the diagonal ones, and two of them are equal to 0. The diagonal elements of the matrix X are initial approximations of the phase velocities squared. To refine them, it is proposed to use either iterative schemes or Taylor series expansions. The initial terms of the series and the formulas of iterative schemes are expressed through the elements of the matrix X and have a compact analytical representation. The odd-order terms in the series are equal to 0. To approximate the phase velocities of the S1 and S2 waves, a stable method is proposed based on solving a quadratic equation with the coefficients being expressed in terms of the matrix elements and the precomputed value of the qP wave phase velocity squared. For all iterative schemes and series, the convergence conditions are derived. The polarization vector of the wave with the square of the phase velocity is defined as the column with maximum modulus of cofactor of the matrix K-I. The group velocities vectors are computed based on the known components of the polarization vector, the directional vector, and the density-normalized stiffness coefficients. The computational accuracy is demonstrated for the standard orthorhombic model. It is shown how the perturbation theory can be applied to media with strong anisotropy. To do this, first we need to apply several QR transforms or Jacobi rotations of the Christoffel matrix, and then use the perturbation theory. This method with four Jacobi rotations is applied to the calculation of the phase velocities squared for a triclinic medium with a maximum number (32) of singularity points. In this case, the phase velocities are computed with a relative error less than 0,004 %.

Hybrid precoding algorithm for massive MIMO system with imperfect channel knowledge

Millimeter wave MIMO system offers orders of magnitude high data rate due to the excess bandwidth available then conventional MIMO system. But, at the cost of excessive free space losses that highly influence the transmission at very high millimeter wave frequencies. The resulting small Wavelength at the millimeter wave frequency can overcome the path losses using beam forming gain offered by the massive antennas which is known as pre-coding. In millimeter wave massive MIMO system, hybrid pre-coding is the technique that combines analog pre-coding and digital pre-coding to reduce the requirement of high number of RF chains and thus energy consumption. Hybrid beam forming uses number of RF chains equal to the number of simulations users being served rather than using separate RF chains in the case of digital pre-coding. In designing analog and digital pre-coders, large number of calculations that uses complex mathematical process such as block diagonalization, SVD for channel matrix inversion required for the computation of pre-coder weight vector computation. In this paper, we propose low complexity hybrid pre-coding algorithm using simple linear approximation algorithms for matrix inversion operations. We first used the simple inversion algorithm in the computation of analog beam forming matrix without any SVD or direct inversion of matrices. Then, the same is being used in digital pre-coding matrix. In the proposed algorithm, there is no need for the complicated operations as SVD as in traditional pre coding algorithms.

An efficient field programmable gate array based hardware architecture for efficient motion estimation with parallel implemented genetic algorithm

SummaryThe main idea of this article is to propose a hardware design of block matching (BM) algorithm for an efficient motion estimation (ME) strategy in a field programmable gate array platform based on a parallel implemented genetic algorithm (GA). Easiness and the effectiveness of the BM algorithm while implementing have a major drawback of low quality and computationally cost expensive during the process of ME. Therefore, here in this article, we suggest GA based BM for a quick and cost‐effective computation of motion vectors, without negotiating the quality factor. The ME carried out for various video sequences is implemented by using Xilinx ISE Design Suite 14.1. Delay, time, area, power, PSNR, MSE, SNR, SSIM, and NRMSE are the metrics used for analyzing the performance, and the simulation outcome shows that this parallel implemented BM architecture design shows an exotic improvement in time, quality and in utilization of power on estimating the motion than that of the conventional designs.

EQMO: Equation of motion method for efficient electronic structure calculations

Equation of motion method has proven efficient for electronic structure calculations of very large systems, i.e. containing several million atoms. In this work, we redesign its previously published implementation and hereby release a revised software tool, EQMO, now capable of solving a crystalline TiO2 test sample of nearly a quarter of a billion atoms on NEC SX-Aurora TSUBASA vector computer. The legacy code has been rewritten in modern free-form Fortran, and the main developments include MPI support and optimisations for parallel execution. New Version Program SummaryProgram Title: EQMOCPC Library link to program files:https://doi.org/10.17632/5m7jp4nb4y.1Developer's repository link:https://git.icm.edu.pl/herman/eqmoLicensing provisions: GPLv3Programming language: FortranJournal reference of previous version: Marek T. Michalewicz, Herbert B. Shore, N. Tit, J.W. Halley, Equation of motion method for the electronic structure of disordered transition metal oxides, Comput. Phys. Commun. 71 (1992) 222–234.Does the new version supersede the previous version?: YesReasons for the new version: Major revisionSummary of revisions: The legacy Fortran code has been rewritten in modern free-form Fortran. The OpenMP support has been replaced with OpenMPI suitable for NEC SX-Aurora TSUBASA architecture. The sequential and MPI versions can be built independently to produce two separate binary files for both x86_64 CPU and NEC vector computer. The program has been developed and tested with GNU Fortran and NEC Fortran compilers.Nature of problem: Electronic structure calculation of a large system, i.e. containing several million atoms, is a computationally demanding task. The problem is to determine electronic properties of solid state systems in an efficient manner. The program, at its current development stage, is capable of calculating electronic properties (density of electronic states) of rutile TiO2 structure distorted by point defects, and is intended to be further developed towards treating a wide range of crystalline systems.Solution method: EQMO software tool is an equation of motion implementation designed to determine electronic structure (density of electronic states) of large-scale crystalline systems. The solution method is based on solving the Schrödinger equation with a tight-binding Hamiltonian, and its physical and mathematical foundations remain unchanged with respect to the previous release. For an explicit formalism with elaborate description, the reader is referred to the literature referenced below [1,2,3,4,5,6,7,8,9,10], and in particular – to the journal reference of the previous implementation along with the supplemented dataset [5]. The program is able to perform a benchmark on a TiO2 sample of nearly a quarter of a billion atoms on NEC SX-Aurora TSUBASA vector computer, and its functionality can be further expanded.

Performance and Power Analysis of a Vector Computing System

The performance of recent computing systems has drastically improved due to the increase in the number of cores. However, this approach is reaching the limitation due to the power constraints of facilities. Instead, this paper focuses on a vector processing with long vector length that has a potential to realize high performance and high power efficiency. This paper discusses the potential through the optimization of two benchmarks, the Himeno and HPCG benchmarks, for the latest vector computing system SX-Aurora TSUBASA. The architecture of SX-Aurora TSUBASA owes the high efficiency to making good of its long vector length. Considering these characteristics, various levels of optimizations required for a large-scale vector computing system are examined such as vectorization, loop unrolling, use of cache, domain decomposition, process mapping, and problem size tuning. The evaluation and analysis suggest that the optimizations improve the sustained performance, power efficiency, and scalability of both benchmarks. Therefore, it is clarified that the SX-Aurora TSUBASA architecture can achieve higher power efficiency due to its high sustained memory bandwidth paired with the long vector computing.

Porting and Optimizing Molecular Docking onto the SX-Aurora TSUBASA Vector Computer

In computer-aided drug design, the rapid identification of drugs is critical for combating diseases. A key method in this field is molecular docking, which aims to predict the interactions between two molecules. Molecular docking involves long simulations running compute-intensive algorithms, and thus, can profit a lot from hardware-based acceleration. In this work, we investigate the performance efficiency of the SX-Aurora TSUBASA vector computer for such simulations. Specifically, we present our methodology for porting and optimizing AutoDock, a widely-used molecular docking program. Using a number of platform-specific code optimizations, we achieved executions on the SX-Aurora TSUBASA that are in average 3.6× faster than on modern 128-core CPU servers, and up to a certain extent, competitive to V100 and A100 GPUs. To the best of our knowledge, this is the first molecular docking implementation for the SX-Aurora TSUBASA.

Parallel Generalized Hebbian Algorithm for Large Scale Data Analytics

In order to store and analyse large amounts of data on a parallel cluster, Big Data Systems such as Hadoop and DBMSs require a complex configuration and tuning procedure. This is mostly the result of static partitioning occurring whenever data sets are imported into the file system or transferred into it. Following that, parallel processing is carried out in a distributed fashion, with the objective of achieving balanced parallel execution among nodes. The system is notoriously difficult to configure, particularly in the areas of node synchronisation, data redistribution, and distributed caching in main memory. The extended Hebbian algorithm, abbreviated as GHA, is a linear feedforward neural network model for unsupervised learning that finds the majority of its applications in principle components analysis. Sanger's rule is another name for the GHA that may be found in the academic literature. Its formulation and stability, with the additional feature that it may be used to networks that have more than one output. A unique hardware architecture for principal component analysis is presented here in the form of a paper. The Generalized Hebbian Algorithm (GHA) was chosen as the foundation for the design because to the fact that it is both straightforward and efficient. The architecture may be broken down into three distinct parts: the memory unit, the weight vector updating unit, and the primary computing unit. Within the weight vector updating unit, the computation of various synaptic weight vectors uses the same circuit in order to cut down on the area expenses. This is done in order to save space. The GHA architecture incorporates a versatile multi-computer framework that is based on mpi. Therefore, GHA may be efficiently executed on platforms that utilise either sequential processing or parallel processing. When the data set is studied for a short period of time or when a dynamic number of virtual processors is selected at runtime, we predict that our architecture will be able to profit from parallel processing on the cloud. In this research, a parallel implementation of a variety of machine learning algorithms that are built on top of the MapReduce paradigm is presented with the purpose of improving processing speed and saving time.