Big data frameworks are widely deployed in supercomputers for analyzing large-scale datasets. Topological data processing is an emerging approach that focuses on analyzing the topological structures in high-dimensional scientific data. However, ...

Distributed learning with multiple GPUs has been widely adopted to accelerate the training process of large-scale deep neural networks. However, misconfiguration of the GPU clusters with various communication primitives and topologies could ...

• A new performance prediction framework (termed PerfTop) is proposed to accurately predict the execution time of distributed learning over general topologies.
• The framework provides an in-depth analysis of the underlying mechanisms of ...

Option pricing is one of the most active Financial Economics research fields. Black-Scholes-Merton option pricing theory states that risk-neutral density is lognormal. However, markets' pieces of evidence do not support that ...

• An example of such big data environments is information associated with financial options contracts.

Race conditions, which occur when compute workers do not synchronise correctly, are considered undesirable in parallel computing, as they introduce often-unintended stochastic behaviour. This study presents an asynchronous parallel ...

• Performance gains from asynchronous algorithms are worth the race condition.
• ...

• The notions of the diameter and local diameter for not necessarily binary programs.

Reachability in parallel finite-state programs equipped with interleaving semantics is an inherently difficult, important problem. Its complexity in the number of threads n, while keeping the thread-local–memory size and the shared-...

• We present a theoretical framework that can be used for analyzing, and quantifying the performance of parallel algorithms designed for MS based omics data.
• We prove the lower communication bounds for the existing parallel algorithms.

Mass spectrometry (MS) based omics data analysis require significant time and resources. To date, few parallel algorithms have been proposed for deducing peptides from mass spectrometry-based data. However, these parallel algorithms were designed,...

We present a new approach to Parallel Discrete Event Simulation (PDES), where we enable the execution of so-called cross-state events. During their processing, the state of multiple concurrent simulation objects can be accessed in read/...

• Introduction of a new concept of “event” in parallel discrete event simulation, called cross-state event.

Refinement of the unit simplex by iterative longest edge bisection (LEB) up to sub-simplices have a size smaller or equal to a given accuracy, generates a binary tree. For a dimension higher than three, the size of the generated tree depends on the ...

Most published concurrent data structures which avoid locking do not provide any fairness guarantees. That is, they allow processes to access a data structure and complete their operations arbitrarily many times before some other trying process can ...

This paper is on the construction and use of a shared memory abstraction on top of an asynchronous message-passing system in which up to t processes may commit Byzantine failures. This abstraction consists of arrays of n single-writer/multi-reader ...

Based on a modification of the dichotomy algorithm, we propose a novel parallel procedure for solving tridiagonal systems of equations with Toeplitz matrices. Taking the structure of the Toeplitz matrices, we may substantially reduce the number of the ...

A recently proposed pipelined multithreading (PMT) technique exhibits wide applicability in parallelizing general sequential programs on multi-core processors. However, significant inter-core communication overhead limits PMT performance and prevents ...

Bitonic sort is one of the fastest oblivious parallel sorting algorithms known so far. Due to its high modularity, bitonic sort can be mapped to different interconnection networks. In this paper, the bitonic sort algorithm is mapped to the chained-cubic ...

In this paper we introduce our estimation method for parallel execution times, based on identifying separate ''parts'' of the work done by parallel programs. Our run time analysis works without any source code inspection. The time of parallel program ...

Direct solvers based on prefix computation and cyclic reduction algorithms exploit the special structure of tridiagonal systems of equations to deliver better parallel performance compared to those designed for more general systems of equations. This ...

Task-based programming models are beneficial for the development of parallel programs for several reasons. They provide a decoupling of the specification of parallelism from the scheduling and mapping to execution resources of a specific hardware ...

The Dandelion-like codes are eight bijections between labeled trees and strings of node labels. The literature contains optimal sequential algorithms for these bijections, but no parallel algorithms have been reported. In this paper the first parallel ...

We present an efficient parallel algorithm for building the separating tree for a separable permutation. Our algorithm runs in O(log^2n) time using O(nlog^1^.^5n) operations on the CREW PRAM and O(log^2n) time using O(nlognloglogn) operations on the ...

We introduce the framework of ordered read-write locks, ORWL, that are characterized by two main features: a strict FIFO policy for access, and the attribution of access to lock-handles instead of processes or threads. These two properties together ...