Browsing by Keywords "Parallel processing systems"
Now showing items 1-20 of 29
-
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
(Academic Press, 2007-01)Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS decomposition problem is modeled as a graph ... -
Comparison of local and global computation and its implications for the role of optical interconnections in future nanoelectronic systems
(Elsevier, 1993)Various methods of simulating diffusion phenomena with parallel hardware are discussed. In particular methods are compared requiring local and global communication among the processors in terms of total computation time. ... -
A comparison of logical and physical parallel I/O patterns
(SAGE Publications Inc., 1998)Although there are several extant studies of parallel scientific application request patterns, there is little experimental data on the correlation of physical I/O patterns with application I/O stimuli. To understand these ... -
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 ... -
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 ... -
Domain specific language for deployment of parallel applications on parallel computing platforms
(Association for Computing Machinery, 2014-08)To increase the computing performance the current trend is towards applying parallel computing in which parallel tasks are executed on multiple nodes. The deployment of tasks on the computing platform usually impacts 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 ... -
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 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. ... -
An efficient parallelization technique for high throughput FFT-ASIPs
(IEEE, 2006)Fast Fourier Transformation (FFT) and it's inverse (IFFT) are used in Orthogonal Frequency Division Multiplexing (OFDM) systems for data (de)modulation. The transformations are the kernel tasks in an OFDM implementation, ... -
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 ... -
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 ... -
Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication
(IEEE, 1999)In this work, we show that the standard graph-partitioning-based decomposition of sparse matrices does not reflect the actual communication volume requirement for parallel matrix-vector multiplication. We propose two ... -
Hypergraph-theoretic partitioning models for parallel web crawling
(Springer, London, 2012)Parallel web crawling is an important technique employed by large-scale search engines for content acquisition. A commonly used inter-processor coordination scheme in parallel crawling systems is the link exchange scheme, ... -
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 ... -
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. ... -
A novel method for scaling iterative solvers: avoiding latency overhead of parallel sparse-matrix vector multiplies
(Institute of Electrical and Electronics Engineers, 2015)In parallel linear iterative solvers, sparse matrix vector multiplication (SpMxV) incurs irregular point-to-point (P2P) communications, whereas inner product computations incur regular collective communications. These P2P ... -
One-dimensional partitioning for heterogeneous systems: theory and practice
(Academic Press, 2008-11)We study the problem of one-dimensional partitioning of nonuniform workload arrays, with optimal load balancing for heterogeneous systems. We look at two cases: chain-on-chain partitioning, where the order of the processors ... -
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 ...
