Performance prediction of massively parallel computation by Bayesian inference
نویسندگان
چکیده
A performance prediction method for massively parallel computation is proposed. The based on modeling and Bayesian inference to predict elapsed time T as a function of the number used nodes P (T=T(P)). focus extrapolation larger values from perspective application researchers. proposed has several improvements over developed in previous paper, real-symmetric generalized eigenvalue problem shows promising results. generalizable applicable many other computations.
منابع مشابه
Massively Parallel Sequential Monte Carlo for Bayesian Inference
This paper reconsiders sequential Monte Carlo approaches to Bayesian inference in the light of massively parallel desktop computing capabilities now well within the reach of individual academics. It first develops an algorithm that is well suited to parallel computing in general and for which convergence results have been established in the sequential Monte Carlo literature but that tends to re...
متن کاملMassively parallel neural computation
Reverse-engineering the brain is one of the US National Academy of Engineering’s “Grand Challenges.” The structure of the brain can be examined at many different levels, spanning many disciplines from low-level biology through psychology and computer science. This thesis focusses on real-time computation of large neural networks using the Izhikevich spiking neuron model. Neural computation has ...
متن کاملPlausible Prediction by Bayesian Inference
The capability to perform inference with uncertain and incomplete information is characteristic to intelligent systems. Many of the research issues in artiicial intelligence and computational intelligence can actually be viewed as topics in the \science of uncertainty," which addresses the problem of plausible inference, i.e., optimal processing of incomplete information. The various diierent a...
متن کاملEfficient, Massively Parallel Eigenvalue Computation
In numerical simulations of disordered electronic systems, one of the most common approaches is to diagonalize random Hamiltonian matrices and to study the eigenvalues and eigenfunctions of a single electron in the presence of a random potential. In this paper, we describe an effort to implement a matrix diagonalization routine for real symmetric dense matrices on massively parallel SIMD comput...
متن کاملPerformance Prediction of Benchmark Programs for Massively Parallel Architectures
A performance prediction method is presented, which accurately predicts the runtime of a parallel application using the messagepassing model and the asynchronous task programming paradigm. The introduced model also considers the complete memory hierarchy of a multiprocessor node architecture. We study the optimizied parallel Linpack application as an example benchmark program. The predicted per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JSIAM Letters
سال: 2022
ISSN: ['1883-0609', '1883-0617']
DOI: https://doi.org/10.14495/jsiaml.14.13