Browsing by Author "Aykanat, Cevdet"
Now showing items 21-40 of 123
-
Data-parallel web crawling models
(Springer, 2004)The need to quickly locate, gather, and store the vast amount of material in the Web necessitates parallel computing. In this paper, we propose two models, based on multi-constraint graph-partitioning, for efficient ... -
Decomposing linear programs for parallel solution
(Springer, 1995-08)Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, these approaches suffer from unscalability ... -
Direct volume rendering of unstructured grids
(Pergamon Press, 2003)This paper investigates three categories of algorithms for direct volume rendering of unstructured grids, which are image-space, object-space, and hybrid methods. We propose three new algorithms. Cell Projection algorithm, ... -
Document replication strategies for geographically distributed web search engines
(Elsevier Ltd., 2013)Large-scale web search engines are composed of multiple data centers that are geographically distant to each other. Typically, a user query is processed in a data center that is geographically close to the origin of the ... -
Effect of inverted index partitioning schemes on performance of query processing in parallel text retrieval systems
(Springer, 2006-11)Shared-nothing, parallel text retrieval systems require an inverted index, representing a document collection, to be partitioned among a number of processors. In general, the index can be partitioned based on either the ... -
The effect of various sparsity structures on parallelism and algorithms to reveal those structures
(Birkhauser, 2020)Structured sparse matrices can greatly benefit parallel numerical methods in terms of parallel performance and convergence. In this chapter, we present combinatorial models for obtaining several different sparse matrix ... -
An effective model to decompose linear programs for parallel solution
(Springer, 1996-08)Although inherent parallelism in the solution of block angulax Linear Programming (LP) problems has been exploited in many research works, the literature that addresses decomposing constraint matrices into block angular ... -
Efficient fast hartley transform algorithms for hypercube-connected multicomputers
(IEEE, 1995)Although fast Hartley transform (FHT) provides efficient spectral analysis of real discrete signals, the literature that addresses the parallelization of FHT is extremely rare. FHT is a real transformation and does not ... -
Efficient overlapped FFT algorithms for hypercube-connected multicomputers
(1994)In this work, we propose parallel FFT algorithms, for medium-to-coarse grain hypercube-connected multicomputers, which are more elegant and efficient than the existing ones. The proposed algorithms achieve perfect load-balance ... -
Efficient parallel spatial subdivision algorithm for object-based parallel ray tracing
(Pergamon Press, 1994)Parallel ray tracing of complex scenes on multicomputers requires the distribution of both computation and scene data to the processors. This is carried out during preprocessing and usually consumes too much time and memory. ... -
Efficient successor retrieval operations for aggregate query processing on clustered road networks
(Elsevier Inc., 2010)Get-Successors (GS) which retrieves all successors of a junction is a kernel operation used to facilitate aggregate computations in road network queries. Efficient implementation of the GS operation is crucial since the ... -
Efficient vectorization of forward/backward substitutions in solving sparse linear equations
(IEEE, 1994)Vector processors have promised an enormous increase in computing speed for computationally intensive and time-critical power system problems which require the repeated solution of sparse linear equations. Due to short ... -
Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies
(SIAM, 2004)This paper addresses the problem of one-dimensional partitioning of structurally unsymmetric square and rectangular sparse matrices for parallel matrix-vector and matrix-transpose-vector multiplies. The objective is to ... -
Energy-price-driven query processing in multi-center web search engines
(IEEE, 2011-07)Concurrently processing thousands of web queries, each with a response time under a fraction of a second, necessitates maintaining and operating massive data centers. For large-scale web search engines, this translates ... -
Exploiting locality in sparse matrix-matrix multiplication on many-core rchitectures
(IEEE Computer Society, 2017)Exploiting spatial and temporal localities is investigated for efficient row-by-row parallelization of general sparse matrix-matrix multiplication (SpGEMM) operation of the form C=A,B on many-core architectures. Hypergraph ... -
A fast neural-network algorithm for VLSI cell placement
(Pergamon Press, 1998)Cell placement is an important phase of current VLSI circuit design styles such as standard cell, gate array, and Field Programmable Gate Array (FPGA). Although nondeterministic algorithms such as Simulated Annealing (SA) ... -
Fast optimal load balancing algorithms for 1D partitioning
(Academic Press, 2004)The one-dimensional decomposition of nonuniform workload arrays with optimal load balancing is investigated. The problem has been studied in the literature as the "chains-on-chains partitioning" problem. Despite the rich ... -
Fast shared-memory streaming multilevel graph partitioning
(Elsevier, 2020-09-12)A fast parallel graph partitioner can benefit many applications by reducing data transfers. The online methods for partitioning graphs have to be fast and they often rely on simple one-pass streaming algorithms, while the ... -
A fault-tolerant hexagonal systolic array
(Elsevier, 1992) -
Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories
(Academic Press, 2007)We consider the problem of scheduling an application on a computing system consisting of heterogeneous processors and data repositories. The application consists of a large number of file-sharing otherwise independent ...
