Browsing by Keywords "Parallelization"
Now showing items 119 of 19

Accurate and efficient solutions of electromagnetic problems with the multilevel fast multipole algorithm
(Bilkent University, 2009)The multilevel fast multipole algorithm (MLFMA) is a powerful method for the fast and efficient solution of electromagnetics problems discretized with large numbers of unknowns. This method reduces the complexity of ... 
Accurate solutions of extremely large integralequation problems in computational electromagnetics
(IEEE, 201302)Accurate simulations of reallife electromagnetics problems with integral equations require the solution of dense matrix equations involving millions of unknowns. Solutions of these extremely large problems cannot be ... 
Autotuning similarity search algorithms on multicore architectures
(2013)In recent times, large highdimensional datasets have become ubiquitous. Video and image repositories, financial, and sensor data are just a few examples of such datasets in practice. Many applications that use such datasets ... 
Autopipelining for data stream processing
(Institute of Electrical and Electronics Engineers, 2013)Stream processing applications use online analytics to ingest highrate data sources, process them onthefly, and generate live results in a timely manner. The data flow graph representation of these applications facilitates ... 
Efficient parallelization of multilevel fast multipole algorithm
(2006)We report our efforts for the solution of large electromagnetics problems accurately and efficiently with the parallel multilevel fast multipole algorithm. We carefully investigate different stages of the parallelization ... 
Efficient solution of the combinedfield integral equation with the parallel multilevel fast multipole algorithm
(2007)We present fast and accurate solutions of largescale scattering problems formulated with the combinedfield integral equation. Using the multilevel fast multipole algorithm (MLFMA) parallelized on a cluster of computers, ... 
Elastic scaling for data stream processing
(IEEE Computer Society, 2014)This article addresses the profitability problem associated with autoparallelization of generalpurpose distributed data stream processing applications. Autoparallelization involves locating regions in the application's ... 
Fast and accurate solutions of extremely large integralequation problems discretised with tens of millions of unknowns
(The Institution of Engineering and Technology, 2007)The solution of extremely large scattering problems that are formulated by integral equations and discretised with tens of millions of unknowns is reported. Accurate and efficient solutions are performed by employing a ... 
A hierarchical partitioning strategy for an efficient parallelization of the multilevel fast multipole algorithm
(IEEE, 2009)We present a novel hierarchical partitioning strategy for the efficient parallelization of the multilevel fast multipole algorithm (MLFMA) on distributedmemory architectures to solve largescale problems in electromagnetics. ... 
Parallel hardware and software implementations for electromagnetic computations
(Bilkent University, 2005)Multilevel fast multipole algorithm (MLFMA) is an accurate frequencydomain electromagnetics solver that reduces the computational complexity and memory requirement significantly. Despite the advantages of the MLFMA, ... 
Parallel sparse matrix vector multiplication techniques for shared memory architectures
(Bilkent University, 2014)SpMxV (Sparse matrix vector multiplication) is a kernel operation in linear solvers in which a sparse matrix is multiplied with a dense vector repeatedly. Due to random memory access patterns exhibited by SpMxV operation, ... 
Pipelined fission for stream programs with dynamic selectivity and partitioned state
(Bilkent University, 201412)There is an ever increasing rate of digital information available in the form of online data streams. In many application domains, high throughput processing of such data is a critical requirement for keeping up with the ... 
A scratchpad memory aware dynamic loop scheduling algorithm
(2008)Executing array based applications on a chip multiprocessor requires effective loop parallelization techniques. One of the critical issues that need to be tackled by an optimizing compiler in this context is loop scheduling, ... 
Sitebased partitioning and repartitioning techniques for parallel pagerank computation
(Institute of Electrical and Electronics Engineers, 201105)The PageRank algorithm is an important component in effective web search. At the core of this algorithm are repeated sparse matrixvector multiplications where the involved web matrices grow in parallel with the growth of ... 
Solution of extremely large integralequation problems
(2007)We report the solution of extremely large integralequation problems involving electromagnetic scattering from conducting bodies. By orchestrating diverse activities, such as the multilevel fast multipole algorithm, iterative ... 
Solution of largescale scattering problems with the multilevel fast multipole algorithm parallelized on distributedmemory architectures
(2007)We present the solution of largescale scattering problems involving threedimensional closed conducting objects with arbitrary shapes. With an efficient parallelization of the multilevel fast multipole algorithm on ... 
Solutions of large integralequation problems with preconditioned MLFMA
(2007)We report the solution of the largest integralequation problems in computational electromagnetics. We consider matrix equations obtained from the discretization of the integralequation formulations that are solved ... 
Vectorization and parallelization of the conjugate gradient algorithm on hypercubeconnected vector processors
(Elsevier, 1990)Solution of large sparse linear systems of equations in the form constitutes a significant amount of the computations in the simulation of physical phenomena [1]. For example, the finite element discretization of a regular ... 
A websitebased partitioning technique for reducing preprocessing overhead of parallel PageRank computation
(2007)A power method formulation, which efficiently handles the problem of dangling pages, is investigated for parallelization of PageRank computation. Hypergraphpartitioningbased sparse matrix partitioning methods can be ...