Sciweavers

6897 search results - page 601 / 1380
» Parallelization of Modular Algorithms
Sort
View
ISPAN
1997
IEEE
15 years 10 months ago
A method for estimating optimal unrolling times for nested loops
Loop unrolling is one of the most promising parallelization techniques, because the nature of programs causes most of the processing time to be spent in their loops. Unrolling not...
Akira Koseki, Hideaki Komatsu, Yoshiaki Fukazawa
SIGCSE
1997
ACM
111views Education» more  SIGCSE 1997»
15 years 10 months ago
Teaching an engineering approach for network computing
Parallelism and concurrency have long been considered as non essential during the cursus of the average programmer. However, thanks to technological advances, new promising forms ...
Eric Dillon, Carlos Gamboa Dos Santos, Jacques Guy...
HPCS
2009
IEEE
15 years 10 months ago
FFT-Based Dense Polynomial Arithmetic on Multi-cores
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...
Marc Moreno Maza, Yuzhen Xie
EUROPAR
2000
Springer
15 years 10 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&...
PDPTA
2007
15 years 8 months ago
Software Support for Non-Numerical Computing on Multi-Core Chips
- Multi-core chips present a new computing environment that can benefit from software support for non-numerical applications. Heterogeneous cores will allow efficient sophisticated...
Jerry Potter, Howard Jay Siegel