14 papers · ranked by Valyu relevance
Michael Olbrich, Lennart Bartels, Inken Wohlers
Parallel computing refers to utilizing multiple computing units to address a specific problem, wherein computations are executed concurrently, significantly improving computational speed. Suitable hardware resources are required on which the parallel calculations can be performed. Modern multi-core central processing…
Cristian Vidal-Silva, Vannessa Duarte, Jesennia Cárdenas-Cobo, Iván Veas
Parallel computing is a current algorithmic approach to looking for efficient solutions; that is, to define a set of processes in charge of performing at the same time the same task. Advances in hardware permit the massification of accessibility to and applications of parallel computing. Nonetheless, some algorithms…
Predrag Brođanac, Josip Novak, Ivica Boljat
Today, almost every computer has at least one multicore processor. To remain in stride with hardware developments, numerous university faculties oriented towards computer science have introduced parallel programming as an integral part of their courses. The question is, given the availability of parallel architectures…
Ahmed Hadi Ali AL-Jumaili, Ravie Chandren Muniyandi, Mohammad Kamrul Hasan, Johnny Koh Siaw Paw + 2 more
Traditional parallel computing for power management systems has prime challenges such as execution time, computational complexity, and efficiency like process time and delays in power system condition monitoring, particularly consumer power consumption, weather data, and power generation for detecting and predicting…
Michael Konopik, Till Korten, Eric Lutz, Heiner Linke
The fundamental energy cost of irreversible computing is given by the Landauer bound of $kT\ln 2$/bit, where k is the Boltzmann constant and T is the temperature in Kelvin. However, this limit is only achievable for infinite-time processes. We here determine the fundamental energy cost of finite-time parallelizable…
Zeyu Xia, Canqun Yang, Chenchen Peng, Yifei Guo + 3 more
'Tao Tang' 'Yingbo Cui'] Background The advent of Single Molecule Real-Time (SMRT) sequencing has overcome many limitations of second-generation sequencing, such as limited read lengths, PCR amplification biases. However, longer reads increase data volume exponentially and high error rates make many existing alignment…
Paul Cardosi, Bérenger Bramas, Bilal Alatas
Parallelization is needed everywhere, from laptops and mobile phones to supercomputers. Among parallel programming models, task-based programming has demonstrated a powerful potential and is widely used in high-performance scientific computing. Not only does it allow efficient parallelization across distributed…
Sirilak Ketchaya, Apisit Rattanatranurak
Quicksort is an important algorithm that uses the divide and conquer concept, and it can be run to solve any problem. The performance of the algorithm can be improved by implementing this algorithm in parallel. In this paper, the parallel sorting algorithm named the Multi-Deque Partition Dual-Deque Merge Sorting…
Ashish Chapagain, Dima Abuoliem, In Ho Cho, Tongbiao Wang
Multifunctional nanosurfaces receive growing attention due to their versatile properties. Capillary force lithography (CFL) has emerged as a simple and economical method for fabricating these surfaces. In recent works, the authors proposed to leverage the evolution strategies (ES) to modify nanosurface characteristics…
Trinity Cheng, Pei-Ju Chin, Kenny Cha, Nicholas Petrick + 1 more
'Mike Mikailov'] Background The Basic Local Alignment Search Tool (BLAST) is a suite of commonly used algorithms for identifying matches between biological sequences. The user supplies a database file and query file of sequences for BLAST to find identical sequences between the two. The typical millions of database and…
Vladislav Skorpil, Vaclav Oujezsky, Arcangelo Castiglione, Gianni D’Angelo
'Gianni D’Angelo'] This paper presents an implementation of the parallelization of genetic algorithms. Three models of parallelized genetic algorithms are presented, namely the Master-Slave genetic algorithm, the Coarse-Grained genetic algorithm, and the Fine-Grained genetic algorithm. Furthermore, these models are…
Rosario Esposito, Giuseppe Mensitieri, You‐Liang Zhou, Zhong‐Yuan Lu + 3 more
'Ying Zhao' 'Toshihiro Kawakatsu' 'Giuseppe Milano'] Title: ABSTRACT A parallelization strategy for hybrid particle-field molecular dynamics (hPF-MD) simulations on multi-node multi-GPU architectures is proposed. Two design principles have been followed to achieve a massively parallel version of the OCCAM code for…
Shinya Mizuno, Haruka Ohba, Palaniyappan Sathyaprakash
This study applied a closed BCMP queueing network to a real-world model, examining the limitations of the theoretical solution and the possibility of replacing theoretical values with those from parallel simulation. Parallel computing was applied to mean value analysis (MVA). We first obtained computational and…
Christoph Stelz, Lukas Hübner, Alexandros Stamatakis, Russell Schwartz
Given an input array of elements $E=[e_{0},e_{1},…,e_{n-1}]$, distributed across p processing elements (PEs; e.g. processes or threads), we desire to compute $r=e_{0}⊕e_{1}⊕…⊕e_{n-1}$, where $⊕$ denotes a binary, associative operation (e.g. summation or multiplication). In a distributed reduction, we return the result…