Browsing by Keywords "Parallel algorithms"
Now showing items 1-20 of 25
-
Architecture framework for mapping parallel algorithms to parallel computing platforms
(CEUR-WS, 2013)Mapping parallel algorithms to parallel computing platforms requires several activities such as the analysis of the parallel algorithm, the definition of the logical configuration of the platform, and the mapping of the ... -
Computational analysis of complicated metamaterial structures using MLFMA and nested preconditioners
(IEEE, 2007-11)We consider accurate solution of scattering problems involving complicated metamaterial (MM) structures consisting of thin wires and split-ring resonators. The scattering problems are formulated by the electric-field ... -
A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows
(Association for Computing Machinery, 1994)We describe the development of a data-level, massively parallel software system for the solution of multicommodity network flow problems. Using a smooth linear-quadratic penalty (LQP) algorithm we transform the multicommodity ... -
Distributed evaluation of an iterative function for all object pairs on an SIMD hypercube
(Elsevier BV, 1991)An efficient distributed algorithm for evaluating an iterative function on all pairwise combinations of C objects on an SIMD hypercube is presented. The algorithm achieves uniform load distribution and minimal, completely ... -
Distributed joint flow-radio and channel assignment using partially overlapping channels in multi-radio wireless mesh networks
(Springer, 2016)Equipping mesh nodes with multiple radios that support multiple wireless channels is considered a promising solution to overcome the capacity limitation of single-radio wireless mesh networks. However, careful and intelligent ... -
Efficient parallelization of the multilevel fast multipole algorithm for the solution of large-scale scattering problems
(Institute of Electrical and Electronics Engineers, 2008-08)We present fast and accurate solutions of large-scale scattering problems involving three-dimensional closed conductors with arbitrary shapes using the multilevel fast multipole algorithm (MLFMA). With an efficient ... -
Efficient solution of the combined-field integral equation with the parallel multilevel fast multipole algorithm
(IEEE, 2007-08)We present fast and accurate solutions of large-scale scattering problems formulated with the combined-field integral equation. Using the multilevel fast multipole algorithm (MLFMA) parallelized on a cluster of computers, ... -
Improving efficiency of parallel vertex-centric algorithms for irregular graphs
(IEEE Computer Society, 2019)Memory access is known to be the main bottleneck for shared-memory parallel graph applications especially for large and irregular graphs. Propagation blocking (PB) idea was proposed recently to improve the parallel performance ... -
Iterative algorithms for solution of large sparse systems of linear equations on hypercubes
(IEEE, 1988)Finite-element discretization produces linear equations in the form Ax=b, where A is large, sparse, and banded with proper ordering of the variables x. The solution of such equations on distributed-memory message-passing ... -
Mars: A tool-based modeling, animation, and parallel rendering system
(Springer, 1994)This paper describes a system for modeling, animating, previewing and rendering articulated objects. The system has a modeler of objects that consists of joints and segments. The animator interactively positions the ... -
MLFMA solutions of transmission problems Involving realistic metamaterial walls
(IEEE, 2007-08)We present the solution of multilayer metamaterial (MM) structures containing large numbers of unit cells, such as split-ring resonators. Integral-equation formulations of scattering problems are solved iteratively by ... -
Model-driven approach for supporting the mapping of parallel algorithms to parallel computing platforms
(Springer, Berlin, Heidelberg, 2013)The trend from single processor to parallel computer architectures has increased the importance of parallel computing. To support parallel computing it is important to map parallel algorithms to a computing platform that ... -
Model-driven transformations for mapping parallel algorithms on parallel computing platforms
(MDHPCL, 2013)One of the important problems in parallel computing is the mapping of the parallel algorithm to the parallel computing platform. Hereby, for each parallel node the corresponding code for the parallel nodes must be implemented. ... -
Novel algorithms and models for scaling parallel sparse tensor and matrix factorizations
(Bilkent University, 2022-07)Two important and widely-used factorization algorithms, namely CPD-ALS for sparse tensor decomposition and distributed stratified SGD for low-rank matrix factorization, suffer from limited scalability. In CPD-ALS, the ... -
Online balancing two independent criteria
(Springer, 2008-10)We study the online bicriteria load balancing problem in this paper. We choose a system of distributed homogeneous file servers located in a cluster as the scenario and propose two online approximate algorithms for balancing ... -
Parallel direct and hybrid methods based on row block partitioning for solving sparse linear systems
(Bilkent University, 2017-08)Solving system of linear equations is a kernel operation in many scienti c and industrial applications. These applications usually give rise to linear systems in which the coe cient matrix is very large and sparse. The ... -
Parallel minimum norm solution of sparse block diagonal column overlapped underdetermined systems
(Association for Computing Machinery, 2017)Underdetermined systems of equations in which the minimum norm solution needs to be computed arise in many applications, such as geophysics, signal processing, and biomedical engineering. In this article, we introduce a ... -
The parallel surrogate constraint approach to the linear feasibility problem
(Springer, 1996)The linear feasibility problem arises in several areas of applied mathematics and medical science, in several forms of image reconstruction problems. The surrogate constraint algorithm of Yang and Murty for the linear ... -
Parallel-MLFMA solution of CFIE discretized with tens of millions of unknowns
(Institution of Engineering and Technology, 2007)We consider the solution of large scattering problems in electromagnetics involving three-dimensional arbitrary geometries with closed surfaces. The problems are formulated accurately with the combined-field integral ... -
Rigorous solutions of electromagnetic problems involving hundreds of millions of unknowns
(IEEE, 2011)Accurate simulations of real-life electromagnetic problems with integral equations require the solution of dense matrix equations involving millions of unknowns. Solutions of these extremely large problems cannot be easily ...
