Sciweavers

663 search results - page 40 / 133
» A Parallel Algorithm for Enumerating Combinations
Sort
View
IPPS
2007
IEEE
15 years 8 months ago
Performance Analysis of a Family of WHT Algorithms
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...
Michael Andrews, Jeremy Johnson
CSDA
2007
116views more  CSDA 2007»
15 years 1 months ago
Exploring the state sequence space for hidden Markov and semi-Markov chains
The knowledge of the state sequences that explain a given observed sequence for a known hidden Markovian model is the basis of various methods that may be divided into three categ...
Yann Guédon
MICRO
2008
IEEE
159views Hardware» more  MICRO 2008»
15 years 8 months ago
Copy or Discard execution model for speculative parallelization on multicores
The advent of multicores presents a promising opportunity for speeding up sequential programs via profile-based speculative parallelization of these programs. In this paper we pr...
Chen Tian, Min Feng, Vijay Nagarajan, Rajiv Gupta
INFORMATICALT
2006
102views more  INFORMATICALT 2006»
15 years 1 months ago
Parallel DEM Software for Simulation of Granular Media
The paper describes the development and performance of parallel algorithms for the discrete element method (DEM) software. Spatial domain decomposition strategy and message passing...
Algirdas Maknickas, Arnas Kaceniauskas, Rimantas K...
87
Voted
EUROPAR
2000
Springer
15 years 5 months ago
Scheduling the Computations of a Loop Nest with Respect to a Given Mapping
Abstract. When parallelizing loop nests for distributed memory parallel computers, we have to specify when the different computations are carried out (computation scheduling), wher...
Alain Darte, Claude G. Diderich, Marc Gengler, Fr&...