|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Kayhan Erciyes
Biological networks such as protein interaction networks, gene regulation networks, and metabolic pathways are examples of complex networks that are large graphs with small-world and scale-free properties. An analysis of these networks has a profound eff...
ver más
|
|
|
|
|
|
|
|
|
|
|
Fernando Díaz-del-Río, Pablo Sanchez-Cuevas, María José Moron-Fernández, Daniel Cascado-Caballero, Helena Molina-Abril and Pedro Real
Relating image contours and regions and their attributes according to connectivity based on incidence or adjacency is a crucial task in numerous applications in the fields of image processing, computer vision and pattern recognition. In this paper, the c...
ver más
|
|
|
|
|
|
|
|
|
|
|
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci and Eli Upfal
We present an algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction. In order to be efficient in terms of both time and space, our algorithm is based on a decomposi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mustafa Hajij and Paul Rosen
The Reeb graph of a scalar function that is defined on a domain gives a topologically meaningful summary of that domain. Reeb graphs have been shown in the past decade to be of great importance in geometric processing, image processing, computer graphics...
ver más
|
|
|
|
|
|
|
|
|
|
|
S.V. Vostokin,I.V. Bobyleva
Pág. 45 - 53
The article discusses the constructing of tasks dependencies graphs for many-task applications that perform parallel asynchronous data processing on the principle of round-robin sport tournament. The following components of the technique are described: t...
ver más
|
|
|
|
|
|
|
|
|
|
|
Apolinar Velarde Martinez
The problem of scheduling parallel tasks graphs (PTGs) represented by directed acyclic graphs (DAGs) in heterogeneous distributed computing systems (HDCSs) is considered an nondeterministic polynomial time (NP) problem due to the diversity of characteris...
ver más
|
|
|
|
|
|
|
|
|
|
|
Andrii Morozov,Tamara Loktikova,Iurii Iefremov,Anatolii Dykyi,Pavlo Zabrodskyy
Pág. 21 - 28
By advancing the idea of finding width in bipartite graphs and basic definitions in matching theory, this paper shows that the task on establishing a maximal matching in an arbitrary graph can be reduced to its bipartite case. It has been proven that eac...
ver más
|
|
|
|
|
|
|
|
|
|
|
Vladimir V. Voevodin,Alexander S. Antonov,Jack Dongarra
Pág. 4 - 18
The main goal of this project is to formalize the mapping of algorithms onto the architecture of parallel computing systems. The basic idea is that features of algorithms are independent of any computing system. A detailed description of a given algorith...
ver más
|
|
|
|
|
|
|
|
|
|
|
Peng, C-H; Wang, B-F; Wang, J-S
Pág. 559 - 570
|
|
|
|
|
|