| J. Saltz and et al. A manual for the CHAOS runtime library. Technical report, Department of Computer Science, University of Maryland, 1993. Available via anonymous ftp directory hyena.cs.umd.edu:/pub/chaos distribution. |
....due to the irregular computational structure of MD programs. This paper presents an implementation of the CHARMM program that scales well on MIMD distributed memory machines. This program is parallelized using a set of efficient runtime primitives called the CHAOS runtime support library [5]. Several parallel MD algorithms use the replicated approach, i.e. the entire system s coordinates and forces are stored at each processor [4] The replicated approach eliminates the overhead in maintaining the data distributions, but it would require more memory space. This prohibits users from ....
J. Saltz and et al. A manual for the CHAOS runtime library. Technical report, Department of Computer Science, University of Maryland, 1993. Available via anonymous ftp directory hyena.cs.umd.edu:/pub/chaos distribution.
....due to the irregular computational structure of MD programs. This paper presents an implementation of the CHARMM program that scales well on MIMD distributed memory machines. This program is parallelized using a set of efficient runtime primitives called the CHAOS runtime support library [5]. Several parallel MD algorithms use the replicated approach, i.e. the entire system s coordinates and forces are stored at each processor [4] The replicated approach eliminates the overhead in maintaining the data distributions, but it does require more memory space. This prohibits users from ....
Joel H. Saltz and et al. A manual for the CHAOS runtime library. Technical report, Department of Computer Science, University of Maryland, 1993. Available via anonymous ftp directory hyena.cs.umd.edu:/pub/chaos distribution or Mosaic URL location http://www.cs.umd.edu/projects/hpsl.html.
....due to the irregular computational structure of MD programs. This paper presents an implementation of the CHARMM program that scales well on MIMD distributed memory machines. This program is parallelized using a set of efficient runtime primitives called the CHAOS runtime support library [5]. Several parallel MD algorithms use the replicated approach, i.e. the entire system s coordinates and forces are stored at each processor [4] The replicated approach eliminates the overhead in maintaining the data distributions, but it would require more memory space. This prohibits users from ....
J. Saltz and et al. A manual for the CHAOS runtime library. Technical report, Department of Computer Science, University of Maryland, 1993. Available via anonymous ftp directory hyena.cs.umd.edu:/pub/chaos distribution.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC