Sciweavers

6437 search results - page 563 / 1288
» Parallel Algorithms for Arrangements
Sort
View
IEEEHPCS
2010
15 years 5 months ago
An experimental study of greedy routing algorithms
The “small world” phenomenon, i.e., the fact that the global social network is strongly connected in the sense that every two persons are inter-related through a small chain o...
Stavros Athanassopoulos, Christos Kaklamanis, Ilia...
220
Voted
MICRO
2010
IEEE
149views Hardware» more  MICRO 2010»
15 years 4 months ago
Improving SIMT Efficiency of Global Rendering Algorithms with Architectural Support for Dynamic Micro-Kernels
Wide Single Instruction, Multiple Thread (SIMT) architectures often require a static allocation of thread groups that are executed in lockstep throughout the entire application ker...
Michael Steffen, Joseph Zambreno
IWOMP
2009
Springer
16 years 1 months ago
Scalability Evaluation of Barrier Algorithms for OpenMP
OpenMP relies heavily on barrier synchronization to coordinate the work of threads that are performing the computations in a parallel region. A good implementation of barriers is ...
Ramachandra C. Nanjegowda, Oscar Hernandez, Barbar...
DATE
2008
IEEE
137views Hardware» more  DATE 2008»
16 years 1 months ago
SPARE - a Scalable algorithm for passive, structure preserving, Parameter-Aware model order REduction
In this paper we describe a flexible and efficient new algorithm for model order reduction of parameterized systems. The method is based on the reformulation of the parametric s...
Jorge Fernandez Villena, Luis Miguel Silveira
EUROPAR
2007
Springer
16 years 1 months ago
Decision Trees and MPI Collective Algorithm Selection Problem
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
Jelena Pjesivac-Grbovic, George Bosilca, Graham E....