Journal of Parallel and Distributed Computing

Three parallel sorting applications and two list output protocols for the first phase of an external sort execute on a fine-grained many-core processor array that contains no algorithm-specific hardware acting as a co-processor with a ...

• Many-core processors can serve as a high-performance energy-efficient co-processor.

Biological data is prone to grow exponentially, which consumes more resources, time and manpower. Parallelization of algorithms could reduce overall execution time. There are two main challenges in parallelizing computational methods. (...

• Biological data keeps growing and dealing with this huge data is a challenging task.

Modern applications generally need a large volume of computation and communication to fulfill the goal. These applications are often implemented on multiprocessor systems to meet the requirements in computing capacity and communication ...

• A MILP formulation for the duplication-based scheduling problem is proposed.
• A ...

An algorithm to partition structured multi-block hexahedral grids for a load balanced assignment of the partitions to a given number of bins is presented. It uses a balanced hierarchical cut tree data structure to partition the ...

• Balanced Cut Trees are used to generate structured partitions of hexahedral grids.

Encryption is an important technique to improve information security for many real-world applications. The Advanced Encryption Standard (AES) is a widely-used efficient cryptographic algorithm. Although AES is fast both in software and ...

• A data layout enabling SIMD operations inside one Computing Processor Element.
• ...

Hypercube and folded hypercube are the most fundamental interconnection networks for the attractive topological properties. We assume for any distinct vertices u , v ∈ V , κ ( u , v ) defined as local connectivity of u and v, is the ...

With the advent of the Big data, the scalability of the machine learning algorithms has become more crucial than ever before. Furthermore, Feature selection as an essential preprocessing technique can improve the performance of the ...

• Proposing a distributed and scalable feature selection for Big Data, DQPFS.
• An ...

We have implemented the computation of Coulomb interactions in particle systems using the performance portable C++ framework Kokkos. For the computation of the electrostatic interactions in particle systems we used an Ewald summation. ...

• Portability for particle simulation algorithm demonstrated with C++ framework Kokkos

Many applications in high performance computing are designed based on underlying performance and execution models. While these models could successfully be employed in the past for balancing load within and between compute nodes, ...

• Increasing dynamic variability observable in modern hardware and software.
• ...

In this work we have implemented a novel Linear Algebra Library on top of the task-based runtime OmpSs-2. We have used some of the most advanced OmpSs-2 features; weak dependencies and regions, together with the final clause for the ...

• Development of a highly optimized auto-tuned library for BLAS-3 and LAPACK operations.

The performance of parallel algorithms is often inconsistent with their preliminary theoretical analyses. Indeed, the difference is increasing between the ability to theoretically predict the performance of a parallel algorithm and the ...

• Performance analysis of Cormen’s parallel Quicksort algorithm.
• Comparing the ...

The main contribution of this paper is to show efficient implementations of the convolution-pooling in the GPU, in which the pooling follows the multiple convolution. Since the multiple convolution and the pooling operations are ...

• Efficient GPU implementations for the convolution-pooling have been presented.
• ...

Live migration of virtual machines (VMs) has become an extremely powerful tool for cloud data center management and provides significant benefits of seamless VM mobility among physical hosts within a data center or across multiple data ...

• Clock synchronization problem for time-sensitive applications and services.
• ...

Nowadays, Big Data security processes require mining large amounts of content that was traditionally not typically used for security analysis in the past. The RSA algorithm has become the de facto standard for encryption, especially ...

• We investigate prospects for a cache oblivious adaptation of the TURBO algorithm for solving linear systems over finite fields, necessary for adversarial ...

Nowadays, more than ever, digital forensics activities are involved in any criminal, civil or military investigation and represent a fundamental tool to support cyber-security. Investigators use a variety of techniques and proprietary ...

• A reusable methodology that make use of NLP techniques to produce a semantic representation of relevant concepts of a specific domain is presented.

In this paper we survey a number of interesting applications of blockchain technology not related to cryptocurrencies. As a matter of fact, after an initial period of application to cryptocurrencies and to the financial world, ...

• Survey of five selected applications Blockchain 3.0 applications.
• Problem ...

Micro-core architectures combine many low memory, low power computing cores together in a single package. These are attractive for use as accelerators but due to limited on-chip memory and multiple levels of memory hierarchy, the way ...

• Pass by reference model is mandatory for micro-cores to support arbitrary large data

Spectral clustering is widely used in data mining, machine learning and other fields. It can identify the arbitrary shape of a sample space and converge to the global optimal solution. Compared with the traditional k-means algorithm, ...

• A Julia-based parallel algorithm of the spectral clustering is designed.
• The ...