|
|
|
Vladimir Korkhov, Ivan Gankevich, Anton Gavrikov, Maria Mingazova, Ivan Petriakov, Dmitrii Tereshchenko, Artem Shatalin and Vitaly Slobodskoy
Bottlenecks and imbalance in parallel programs can significantly affect performance of parallel execution. Finding these bottlenecks is a key issue in performance analysis of MPI programs especially on a large scale. One of the ways to discover bottlenec...
ver más
|
|
|
|
|
|
|
Souhail Meftah, Shuhao Zhang, Bharadwaj Veeravalli and Khin Mi Mi Aung
The appealing properties of secure hardware solutions such as trusted execution environment (TEE) including low computational overhead, confidentiality guarantee, and reduced attack surface have prompted considerable interest in adopting them for secure ...
ver más
|
|
|
|
|
|
|
Tong Yu, Xiaming Chen, Zhuo Xu and Jianlong Xu
Blockchain is making a big impact in various applications, but it is also attracting a variety of cybercrimes. In blockchain, phishing transfers the victim?s virtual currency to make huge profits through fraud, which poses a threat to the blockchain ecos...
ver más
|
|
|
|
|
|
|
Alessandro Varsi, Simon Maskell and Paul G. Spirakis
Resampling is a well-known statistical algorithm that is commonly applied in the context of Particle Filters (PFs) in order to perform state estimation for non-linear non-Gaussian dynamic models. As the models become more complex and accurate, the run-ti...
ver más
|
|
|
|
|
|
|
Mohd Anuaruddin Bin Ahmadon and Shingo Yamaguchi
In this paper, we proposed a verification method for the message passing behavior of IoT systems by checking the accumulative event relation of process models. In an IoT system, it is hard to verify the behavior of message passing by only looking at the ...
ver más
|
|
|
|
|
|
|
Kedar Kulkarni,Shreeya Badhe,Geetanjali Gadre
Pág. 56 - 60
Message Passing Interface (MPI) is a standardized message passing system, independent of underlying network, and the most widely used parallel programming paradigm. The communication library should make full use of the Host Channel Adapter (HCA) characte...
ver más
|
|
|
|
|
|
|
Jose I. Aliaga, Maribel Castillo, Sergio Iserte, Iker Martín-Álvarez and Rafael Mayo
Maintaining a high rate of productivity, in terms of completed jobs per unit of time, in High-Performance Computing (HPC) facilities is a cornerstone in the next generation of exascale supercomputers. Process malleability is presented as a straightforwar...
ver más
|
|
|
|
|
|
|
Libero Nigro
K-means is a well-known clustering algorithm often used for its simplicity and potential efficiency. Its properties and limitations have been investigated by many works reported in the literature. K-means, though, suffers from computational problems when...
ver más
|
|
|
|
|
|
|
Sandip Dutta
With the rapid development of the autonomous world, local decision making between devices is becoming important. This article provides a new paradigm (Rock-Paper-Scissors-Hammer: RPSH) that can reduce the number of conflicts or decision draws and thus in...
ver más
|
|
|
|
|
|
|
Xin Liao and Khoi D. Hoang
Distributed Constraint Optimization Problems (DCOPs) are an efficient framework widely used in multi-agent collaborative modeling. The traditional DCOP framework assumes that variables are discrete and constraint utilities are represented in tabular form...
ver más
|
|
|
|
|
|
|
Jakub Kurzak,Piotr Luszczek,Ichitaro Yamazaki,Yves Robert,Jack Dongarra
Pág. 4 - 26
The objective of the PULSAR project was to design a programming model suitable for large scale machines with complex memory hierarchies, and to deliver a prototype implementation of a runtime system supporting that model. PULSAR tackled th...
ver más
|
|
|
|
|
|
|
Dmitry Lukyanenko
The paper proposes a parallel algorithm for solving large overdetermined systems of linear algebraic equations with a dense matrix. This algorithm is based on the use of a modification of the conjugate gradient method, which is able to take into account ...
ver más
|
|
|
|
|
|
|
Yifei Wang, Shiyang Chen, Guobin Chen, Ethan Shurberg, Hang Liu and Pengyu Hong
This work considers the task of representation learning on the attributed relational graph (ARG). Both the nodes and edges in an ARG are associated with attributes/features allowing ARGs to encode rich structural information widely observed in real appli...
ver más
|
|
|
|
|
|
|
Tamas Foldi, Chris von Csefalvay and Nicolas A. Perez
The new barrier mode in Apache Spark allows for embedding distributed deep learning training as a Spark stage to simplify the distributed training workflow. In Spark, a task in a stage does not depend on any other tasks in the same stage, and hence it ca...
ver más
|
|
|
|
|
|
|
Tobias Martin and Ivan Shevchuk
In this article, the development of high-order semi-implicit interpolation schemes for convection terms on unstructured grids is presented. It is based on weighted essentially non-oscillatory (WENO) reconstructions which can be applied to the evaluation ...
ver más
|
|
|
|
|
|
|
Saeed Musaad Altalhi, Fathy Elbouraey Eassa, Abdullah Saad Al-Malaise Al-Ghamdi, Sanaa Abdullah Sharaf, Ahmed Mohammed Alghamdi, Khalid Ali Almarhabi and Maher Ali Khemakhem
As the development of high-performance computing (HPC) is growing, exascale computing is on the horizon. Therefore, it is imperative to develop parallel systems, such as graphics processing units (GPUs) and programming models, that can effectively utilis...
ver más
|
|
|
|
|
|
|
Andrei Gorchakov
Pág. 1 - 5
When developing parallel methods for solving many numerical methods for solving applied problems, in particular the branch-and-bound method, the problem of load balancing arises. The choice of implementation options at the moment has been proposed quite ...
ver más
|
|
|
|
|
|
|
Andrei Gorchakov
Pág. 1 - 5
When developing parallel methods for solving many numerical methods for solving applied problems, in particular the branch-and-bound method, the problem of load balancing arises. The choice of implementation options at the moment has been proposed quite ...
ver más
|
|
|
|
|
|
|
Syed Aizaz Ali Shah, Maximilian Stark and Gerhard Bauch
The information bottleneck method is a generic clustering framework from the field of machine learning which allows compressing an observed quantity while retaining as much of the mutual information it shares with the quantity of primary relevance as pos...
ver más
|
|
|
|
|
|
|
Zhipeng Lin, Wenjing Yang, Houcun Zhou, Xinhai Xu, Liaoyuan Sun, Yongjun Zhang and Yuhua Tang
Multiphase flow solvers are widely-used applications in OpenFOAM, whose scalability suffers from the costly communication overhead. Therefore, we establish communication-optimized multiphase flow solvers in OpenFOAM. In this paper, we first deliver a sca...
ver más
|
|
|
|