Sciweavers

2155 search results - page 40 / 431
» The EM-X Parallel Computer: Architecture and Basic Performan...
Sort
View
IPPS
1997
IEEE
15 years 8 months ago
Fast Parallel Computation of the Polynomial Shift
Given an n-degree polynomial fx over an arbitrary ring, the shift of fx by c is the operation which computes coefficients of the polynomial fx + c. In this paper we conside...
Eugene V. Zima
IJCNN
2006
IEEE
15 years 10 months ago
Methods for Parallelizing the Probabilistic Neural Network on a Beowulf Cluster Computer
—In this paper, we present three different methods for implementing the Probabilistic Neural Network on a Beowulf cluster computer. The three methods, Parallel Full Training Set ...
Jimmy Secretan, Michael Georgiopoulos, Ian Maidhof...
HPCC
2007
Springer
15 years 10 months ago
Adaptive Computation of Self Sorting In-Place FFTs on Hierarchical Memory Architectures
Computing ”in-place and in-order”FFT poses a very difficult problem on hierarchical memory architectures where data movement can seriously degrade the performance. In this pape...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
SC
2005
ACM
15 years 9 months ago
Transparent, Incremental Checkpointing at Kernel Level: a Foundation for Fault Tolerance for Parallel Computers
We describe the software architecture, technical features, and performance of TICK (Transparent Incremental Checkpointer at Kernel level), a system-level checkpointer implemented ...
Roberto Gioiosa, José Carlos Sancho, Song J...
JSA
2007
123views more  JSA 2007»
15 years 4 months ago
Application of deterministic and stochastic Petri-Nets for performance modeling of NoC architectures
The design of appropriate communication architectures for complex Systems-on-Chip (SoC) is a challenging task. One promising alternative to solve these problems are Networks-on-Ch...
Holger Blume, Thorsten von Sydow, Daniel Becker, T...