Browsing by Keywords "Parallelizations"
Now showing items 1-12 of 12
-
Accelerating the HyperLogLog cardinality estimation algorithm
(Hindawi Limited, 2017)In recent years, vast amounts of data of different kinds, from pictures and videos from our cameras to software logs from sensor networks and Internet routers operating day and night, are being generated. This has led to ... -
Advanced partitioning and communication strategies for the efficient parallelization of the multilevel fast multipole algorithm
(IEEE, 2010)Large-scale electromagnetics problems can be solved efficiently with the multilevel fast multipole algorithm (MLFMA) [1], which reduces the complexity of matrix-vector multiplications required by iterative solvers from O(N ... -
Code scheduling for optimizing parallelism and data locality
(Springer, 2010-08-09)As chip multiprocessors proliferate, programming support for these devices is likely to receive a lot of attention in the near future. Parallelism and data locality are two critical issues in a chip multiprocessor environment. ... -
Comparison of two image-space subdivision algorithms for direct volume rendering on distributed-memory multicomputers
(Springer, 1995-08)Direct Volume Rendering (DVR) is a powerful technique for visualizing volumetric data sets. However, it involves intensive computations. In addition, most of the volumetric data sets consist of large number of 3D sampling ... -
Compiler-directed energy reduction using dynamic voltage scaling and voltage islands for embedded systems
(Institute of Electrical and Electronics Engineers, 2013)Addressing power and energy consumption related issues early in the system design flow ensures good design and minimizes iterations for faster turnaround time. In particular, optimizations at software level, e.g., those ... -
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 ... -
Elastic scaling for data stream processing
(IEEE Computer Society, 2014)This article addresses the profitability problem associated with auto-parallelization of general-purpose distributed data stream processing applications. Auto-parallelization involves locating regions in the application's ... -
Hierarchical parallelization of the multilevel fast multipole algorithm (MLFMA)
(IEEE, 2013)Due to its O(N log N) complexity, the multilevel fast multipole algorithm (MLFMA) is one of the most prized algorithms of computational electromagnetics and certain other disciplines. Various implementations of this algorithm ... -
Parallel pruning for k-means clustering on shared memory architectures
(Springer Verlag, 2001)We have developed and evaluated two parallelization schemes for a tree-based k-means clustering method on shared memory machines. One scheme is to partition the pattern space across processors. We have determined that ... -
Reducing MLFMA memory with out-of-core implementation and data-structure parallelization
(IEEE, 2013)We present two memory-reduction methods for the parallel multilevel fast multipole algorithm (MLFMA). The first method implements out-of-core techniques and the second method parallelizes the pre-processing data structures. ... -
Scalable linkage across location enhanced services
(CEUR-WS, 2017-08)In this work, we investigate methods for merging spatio-temporal usage and entity records across two location-enhanced services, even when the datasets are semantically different. To address both effectiveness and efficiency, ... -
Slicing based code parallelization for minimizing inter-processor communication
(ACM, 2009-10)One of the critical problems in distributed memory multi-core architectures is scalable parallelization that minimizes inter-processor communication. Using the concept of iteration space slicing, this paper presents a new ...
