Scalable Parallel Execution

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 21 Experts worldwide ranked by ideXlab platform

Lei Wang - One of the best experts on this subject based on the ideXlab platform.

  • modeling dynamic load balancing in molecular dynamics to achieve Scalable Parallel Execution
    Lecture Notes in Computer Science, 1998
    Co-Authors: Lars Nyland, Jan F Prins, R H Yun, Jan Hermans, Hyechung Kum, Lei Wang
    Abstract:

    To achieve Scalable Parallel performance in Molecular Dynamics Simulation, we have modeled and implemented several dynamic spatial domain decomposition algorithms. The modeling is based upon Valiant's Bulk Synchronous Parallel architecture model (BSP), which describes supersteps of computation, communication, and synchronization. We have developed prototypes that estimate the differing costs of several spatial decomposition algorithms using the BSP model.

Lars Nyland - One of the best experts on this subject based on the ideXlab platform.

  • modeling dynamic load balancing in molecular dynamics to achieve Scalable Parallel Execution
    Lecture Notes in Computer Science, 1998
    Co-Authors: Lars Nyland, Jan F Prins, R H Yun, Jan Hermans, Hyechung Kum, Lei Wang
    Abstract:

    To achieve Scalable Parallel performance in Molecular Dynamics Simulation, we have modeled and implemented several dynamic spatial domain decomposition algorithms. The modeling is based upon Valiant's Bulk Synchronous Parallel architecture model (BSP), which describes supersteps of computation, communication, and synchronization. We have developed prototypes that estimate the differing costs of several spatial decomposition algorithms using the BSP model.

Hyechung Kum - One of the best experts on this subject based on the ideXlab platform.

  • modeling dynamic load balancing in molecular dynamics to achieve Scalable Parallel Execution
    Lecture Notes in Computer Science, 1998
    Co-Authors: Lars Nyland, Jan F Prins, R H Yun, Jan Hermans, Hyechung Kum, Lei Wang
    Abstract:

    To achieve Scalable Parallel performance in Molecular Dynamics Simulation, we have modeled and implemented several dynamic spatial domain decomposition algorithms. The modeling is based upon Valiant's Bulk Synchronous Parallel architecture model (BSP), which describes supersteps of computation, communication, and synchronization. We have developed prototypes that estimate the differing costs of several spatial decomposition algorithms using the BSP model.

Jan Hermans - One of the best experts on this subject based on the ideXlab platform.

  • modeling dynamic load balancing in molecular dynamics to achieve Scalable Parallel Execution
    Lecture Notes in Computer Science, 1998
    Co-Authors: Lars Nyland, Jan F Prins, R H Yun, Jan Hermans, Hyechung Kum, Lei Wang
    Abstract:

    To achieve Scalable Parallel performance in Molecular Dynamics Simulation, we have modeled and implemented several dynamic spatial domain decomposition algorithms. The modeling is based upon Valiant's Bulk Synchronous Parallel architecture model (BSP), which describes supersteps of computation, communication, and synchronization. We have developed prototypes that estimate the differing costs of several spatial decomposition algorithms using the BSP model.

R H Yun - One of the best experts on this subject based on the ideXlab platform.

  • modeling dynamic load balancing in molecular dynamics to achieve Scalable Parallel Execution
    Lecture Notes in Computer Science, 1998
    Co-Authors: Lars Nyland, Jan F Prins, R H Yun, Jan Hermans, Hyechung Kum, Lei Wang
    Abstract:

    To achieve Scalable Parallel performance in Molecular Dynamics Simulation, we have modeled and implemented several dynamic spatial domain decomposition algorithms. The modeling is based upon Valiant's Bulk Synchronous Parallel architecture model (BSP), which describes supersteps of computation, communication, and synchronization. We have developed prototypes that estimate the differing costs of several spatial decomposition algorithms using the BSP model.