The Experts below are selected from a list of 104277 Experts worldwide ranked by ideXlab platform
Bruno Cochelin - One of the best experts on this subject based on the ideXlab platform.
-
a Parallel Computer implementation of the asymptotic numerical method to study thermal convection instabilities
Journal of Computational Physics, 2009Co-Authors: Marc Medale, Bruno CochelinAbstract:We have developed a numerical model to efficiently compute steady-state combined buoyancy and thermocapillary convection solutions. It features a Parallel Computer implementation of an Asymptotic Numerical Method to perform steady-state path-following and locate bifurcation points in problems involving large size algebraic systems, up to few million degrees of freedom. The model has been first validated on a problem for which a reference solution exists and then is used to analyse the influence of the container size and shape on Rayleigh-Benard-Marangoni convection and its related cellular pattern.
-
A Parallel Computer implementation of the asymptotic numerical method to study thermal convection instabilities
Journal of Computational Physics, 2009Co-Authors: Marc Medale, Bruno CochelinAbstract:We have developed a numerical model to efficiently compute steady-state combined buoyancy and thermocapillary convection solutions. It features a Parallel Computer implementation of an Asymptotic Numerical Method to perform steady-state path-following and locate bifurcation points in problems involving large size algebraic systems, up to few million degrees of freedom. The model has been first validated on a problem for which a reference solution exists and then is used to analyse the influence of the container size and shape on Rayleigh–Bénard–Marangoni convection and its related cellular pattern.
Marc Medale - One of the best experts on this subject based on the ideXlab platform.
-
a Parallel Computer implementation of the asymptotic numerical method to study thermal convection instabilities
Journal of Computational Physics, 2009Co-Authors: Marc Medale, Bruno CochelinAbstract:We have developed a numerical model to efficiently compute steady-state combined buoyancy and thermocapillary convection solutions. It features a Parallel Computer implementation of an Asymptotic Numerical Method to perform steady-state path-following and locate bifurcation points in problems involving large size algebraic systems, up to few million degrees of freedom. The model has been first validated on a problem for which a reference solution exists and then is used to analyse the influence of the container size and shape on Rayleigh-Benard-Marangoni convection and its related cellular pattern.
-
A Parallel Computer implementation of the asymptotic numerical method to study thermal convection instabilities
Journal of Computational Physics, 2009Co-Authors: Marc Medale, Bruno CochelinAbstract:We have developed a numerical model to efficiently compute steady-state combined buoyancy and thermocapillary convection solutions. It features a Parallel Computer implementation of an Asymptotic Numerical Method to perform steady-state path-following and locate bifurcation points in problems involving large size algebraic systems, up to few million degrees of freedom. The model has been first validated on a problem for which a reference solution exists and then is used to analyse the influence of the container size and shape on Rayleigh–Bénard–Marangoni convection and its related cellular pattern.
Gabor Papp - One of the best experts on this subject based on the ideXlab platform.
-
better than l mflops sustained a scalable pc based Parallel Computer for lattice qcd
Computer Physics Communications, 2003Co-Authors: Zoltan Fodor, S D Katz, Gabor PappAbstract:Abstract We study the feasibility of a PC-based Parallel Computer for medium to large scale lattice QCD simulations. The Eotvos Univ., Inst. Theor. Phys. cluster consists of 137 Intel P4-1.7GHz nodes with 512 MB RDRAM. The 32-bit, single precision sustained performance for dynamical QCD without communication is 1510 Mflops/node with Wilson and 970 Mflops/node with staggered fermions. This gives a total performance of 208 Gflops for Wilson and 133 Gflops for staggered QCD, respectively (for 64-bit applications the performance is approximately halved). The novel feature of our system is its communication architecture. In order to have a scalable, cost-effective machine we use Gigabit Ethernet cards for nearest-neighbor communications in a two-dimensional mesh. This type of communication is cost effective (only 30% of the hardware costs is spent on the communication). According to our benchmark measurements this type of communication results in around 40% communication time fraction for lattices upto 48 3 ·96 in full QCD simulations. The price/sustained-performance ratio for full QCD is better than $l/Mflops for Wilson (and around $1.5/Mflops for staggered) quarks for practically any lattice size, which can fit in our Parallel Computer. The communication software is freely available upon request for non-profit organizations.
Ramin Yahyapour - One of the best experts on this subject based on the ideXlab platform.
-
JSSPP - Parallel Computer workload modeling with markov chains
Job Scheduling Strategies for Parallel Processing, 2004Co-Authors: Baiyi Song, Carsten Ernemann, Ramin YahyapourAbstract:In order to evaluate different scheduling strategies for Parallel Computers, simulations are often executed. As the scheduling quality highly depends on the workload that is served on the Parallel machine, a representative workload model is required. Common approaches such as using a probability distribution model can capture the static feature of real workloads, but they do not consider the temporal relation in the traces. In this paper, a workload model is presented which uses Markov chains for modeling job parameters. In order to consider the interdependence of individual parameters without requiring large scale Markov chains, a novel method for transforming the states in different Markov chains is presented. The results show that the model yields closer results to the real workloads than other common approaches.
-
Parallel Computer workload modeling with markov chains
Job Scheduling Strategies for Parallel Processing, 2004Co-Authors: Baiyi Song, Carsten Ernemann, Ramin YahyapourAbstract:In order to evaluate different scheduling strategies for Parallel Computers, simulations are often executed. As the scheduling quality highly depends on the workload that is served on the Parallel machine, a representative workload model is required. Common approaches such as using a probability distribution model can capture the static feature of real workloads, but they do not consider the temporal relation in the traces. In this paper, a workload model is presented which uses Markov chains for modeling job parameters. In order to consider the interdependence of individual parameters without requiring large scale Markov chains, a novel method for transforming the states in different Markov chains is presented. The results show that the model yields closer results to the real workloads than other common approaches.
Emmanuel Dreyfus - One of the best experts on this subject based on the ideXlab platform.
-
Protocol and Performance Analysis of the MPC Parallel Computer
2001Co-Authors: Olivier Glück, Amal Zerrouki, Jean-lou Desbarbieux, Alexandre Fenyö, Alain Greiner, Franck Wajsbürt, Cyril Spasevski, Fabricio Silva, Emmanuel DreyfusAbstract:This paper presents the MPC Parallel Computer and its MPI implementation performed at the Laboratoire LIP6 of Univ. Pierre and Marie Curie, Paris. MPC is a low cost and high performance Parallel Computer using standard PC main-boards as processing nodes connected through the specific FastHSL board to a high speed communication network using HSL 1 Gbits/s serial links, IEEE 1355 compliant. Two Asics are presented: RCUBE which is the HSL network router and PCI-DDC the network controller implementing the Direct Deposit State Less receiver protocol. The software part of the MPC Parallel Computer consists of 2 zero-copy layers leading to a latency of 5 to 40 /spl mu/s and a throughput of 490 Mbits/s. An efficient MPI implementation based on MPICH is presented and evaluated on an MPC Parallel Computer. Measures show a latency of 26 /spl mu/s and an useful throughput of 450 Mbits/s This paper presents also a performances study of the MPI implementation on the MPC Computer. This reveals Several possible optimizations to reduce the overall MPI transfer latency on the MPC Computer.
-
IPDPS - Protocol and performance analysis of the MPC Parallel Computer
Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001, 1Co-Authors: Olivier Glück, Amal Zerrouki, Jean-lou Desbarbieux, Alexandre Fenyö, Franck Wajsbürt, Cyril Spasevski, A. Grener, Fabricio Alves Barbosa Da Silva, Emmanuel DreyfusAbstract:This paper presents the MPC Parallel Computer and its MPI implementation performed at the Laboratoire LIP6 of Univ. Pierre and Marie Curie, Paris. MPC is a low cost and high performance Parallel Computer using standard PC main-boards as processing nodes connected through the specific FastHSL board to a high speed communication network using HSL 1 Gbits/s serial links, IEEE 1355 compliant. Two Asics are presented: RCUBE which is the HSL network router and PCI-DDC the network controller implementing the Direct Deposit State Less receiver protocol. The software part of the MPC Parallel Computer consists of 2 zero-copy layers leading to a latency of 5 to 40 /spl mu/s and a throughput of 490 Mbits/s. An efficient MPI implementation based on MPICH is presented and evaluated on an MPC Parallel Computer. Measures show a latency of 26 /spl mu/s and an useful throughput of 450 Mbits/s This paper presents also a performances study of the MPI implementation on the MPC Computer. This reveals Several possible optimizations to reduce the overall MPI transfer latency on the MPC Computer.
