874 search results - page 16 / 175 » Predicting the Running Times of Parallel Programs by Simulat... |
106
click to vote
CANPC
1998
Springer
15 years 1 months ago
1998
Springer
In many parallel processing applications, task times have relatively little variability. Accordingly, many nodes will complete a task at approximately the same time. If the applica...
IPPS
2008
IEEE
2008
IEEE
Modeling and predicting application performance on parallel computers using HPC challenge benchmarks
15 years 4 months ago
A method is presented for modeling application performance on parallel computers in terms of the performance of microkernels from the HPC Challenge benchmarks. Specifically, the a...
IJON
2002
14 years 9 months ago
2002
: A new supervised learning procedure for training RBF networks is proposed. It uses a pair of parallel running Kalman filters to sequentially update both the output weights and th...
ANSS
1991
IEEE
15 years 1 months ago
1991
IEEE
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
HASKELL
2006
ACM
15 years 3 months ago
2006
ACM
We propose a development methodology for designing and prototyping high assurance microkernels, and describe our application of it. The methodology is based on rapid prototyping a...