| |
Browse All Reviews > Mathematics Of Computing (G) > Numerical Analysis (G.1) > General (G.1.0) > Parallel Algorithms (G.1.0...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 60
Reviews about "Parallel Algorithms (G.1.0...)":
|
Date Reviewed |
| |
Reprint of "A parallel connectivity algorithm for de Bruijn graphs in metagenomic applications"
Flick P., Jain C., Pan T., Aluru S. Parallel Computing 70 54-65, 2017. Type: Article
Ed. note: This paper is a reprint, included in a special issue of Parallel Computing. It was identified by the ACM Artifact Review and Badging Initiative, and received the “Results Replicated” badge. The other papers in this ...
|
Apr 13 2018 |
| |
An algorithm for parallel calculation of trigonometric functions
Barrera T., Hast A., Bengtsson E. CF 2013 (Proceedings of the ACM International Conference on Computing Frontiers, Ischia, Italy, May 14-16, 2013) 1-4, 2013. Type: Proceedings
The task of computing trigonometric functions is frequently encountered in mathematical software. As a result, there is a substantial interest in fast and efficient algorithms for this task. The authors of this paper recall the classic...
|
Jun 4 2013 |
| |
A two-step splitting algorithm in heat and mass transfer problems
Gryshchenko A., Martsafei A. Cybernetics and Systems Analysis 47(6): 941-947, 2011. Type: Article
The authors propose a theoretical approach for solving heat and mass transfer problems modeled using Navier-Stokes equations using a two-step difference method with multi-sequence computations. The assumption for solving the problem is...
|
Apr 24 2012 |
| |
A parallel computational model for heterogeneous clusters
Bosque J., Pastor L. IEEE Transactions on Parallel and Distributed Systems 17(12): 1390-1400, 2006. Type: Article
Today, it is not uncommon for a supercomputer to consist of heterogeneous components, that is, different types of central processing units (CPUs), different types of connections, and different storage systems. As most of the published ...
|
Mar 19 2007 |
| |
Parallel numerical algorithms based on tensor notation and co-array Fortran syntax
Numrich R. Parallel Computing 31(6): 588-607, 2005. Type: Article
This is one of a series of papers by Numrich on the use of Fortran co-array syntax and tensor notation for numerical linear algebra. It includes computational examples in tensor notation, and Fortran programs for them using co-array sy...
|
Oct 6 2006 |
| |
Use of parallel computing and visualisation techniques in the simulation of large scale geoenvironmental engineering problems
Cleall P., Thomas H., Melhuish T., Owen D. Future Generation Computer Systems 22(4): 460-467, 2006. Type: Article
This paper is a review of the challenges faced by designers and implementers of software and hardware to aid in the design of solutions to serious environmental problems. The complexity of the problems usually requires that the softwar...
|
Aug 17 2006 |
| |
Parallel metaheuristics: a new class of algorithms
Alba E., Wiley-Interscience, New York, NY, 2005. 576 pp. Type: Book (9780471678069)
The goal of this book is to combine novel aspects in the research fields of metaheuristics and parallelism. Metaheuristics are approximation methods for optimization problems that try to combine basic heuristic methods such that a sear...
|
Mar 13 2006 |
| |
A parallel least-squares spectral element solver for incompressible flow problems on unstructured grids
Nool M., Proot M. Parallel Computing 31(5): 414-438, 2005. Type: Article
The spectral element method is essentially a high-order finite element technique. This method is suited to problems for which the solutions can be expressed as a series of polynomial basis functions. The method may yield an equation sy...
|
Jan 24 2006 |
| |
A novel parallelization approach for hierarchical clustering
Du Z., Lin F. Parallel Computing 31(5): 523-527, 2005. Type: Article
Hierarchical clustering is an approach to collecting groups of similar data points. The method begins with individual data points (clusters), which are then successively merged according to some predefined metric until one single hiera...
|
Jan 24 2006 |
| |
Stabilizing mobile philosophers
Datta A., Gradinariu M., Raynal M. Information Processing Letters 95(1): 299-306, 2005. Type: Article
A modification of the classical dining philosopher problem, the mobile philosopher problem, is introduced in this paper, in the context of dynamic networks with a variable number of resources and mobile processes that can join or leave...
|
Jan 23 2006 |
| |
|
|
| |
|
|
