Search
Now showing items 1-10 of 122
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 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 ...
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 ...
Improving the performance of independent task assignment heuristics Minmin, Maxmin and Sufferage
(Institute of Electrical and Electronics Engineers, 2014)
MinMin, MaxMin, and Sufferage are constructive heuristics that are widely and successfully used in assigning independent tasks to processors in heterogeneous computing systems. All three heuristics are known to run in O(K ...
A parallel progressive radiosity algorithm based on patch data circulation
(Pergamon Press, 1996)
Abstract - Current research on radiosity has concentrated on increasing the accuracy and the speed of the solution. Although algorithmic and meshing techniques decrease the execution time, still excessive computational ...
Two novel multiway circuit partitioning algorithms using relaxed locking
(IEEE, 1997)
All the previous Kernighan-Lin-based (KL-based) circuit partitioning algorithms employ the locking mechanism, which enforces each cell to move exactly once per pass. In this paper, we propose two novel approaches for ...
Circuit partitioning using mean field annealing
(Elsevier, 1995)
Mean field annealing (MFA) algorithm, proposed for solving combinatorial optimization problems, combines the characteristics of neural networks and simulated annealing. Previous works on MFA resulted with successful mapping ...
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 ...
Hypergraph partitioning based models and methods for exploiting cache locality in sparse matrix-vector multiplication
(Society for Industrial and Applied Mathematics, 2013-02-27)
Sparse matrix-vector multiplication (SpMxV) is a kernel operation widely used in iterative linear solvers. The same sparse matrix is multiplied by a dense vector repeatedly in these solvers. Matrices with irregular sparsity ...
SE4SEE: A grid-enabled search engine for South-East Europe
(2005)
Search Engine for South-East Europe (SE4SEE) is an application project aiming to develop a grid-enabled search engine that specifically targets the countries in the South-East Europe. It is one of the two selected regional ...