Scalable algorithm

Scalable Algorithms for Three-Dimensional Reactive Scattering Evaluation of a New Algorithm for Obtaining Surface Functions. 

Then, from the DA algorithm, the location of the lead compound (rj) is determined by rj = . Since the cluster is separated from all the other clusters, the lead compound location /j will be determined in the scalable algorithm by... 

The computation time for the scalable algorithm can be further reduced (by changing e), but at the expense of increased distortion. 

Bowers KJ, Chow E, Xu H et al (2006) Scalable algorithms for molecular dynamics simulations on commodity clusters. In International conference for high performance computing,... 

A scalable algorithm is one that will execute with acceptable efficiency on large numbers of processors. One way to assess this attribute is through construction of a model for the execution of the code that combines costs from all parts of the algorithm. The result is a function such as... 

The second requirement, in the area of large MD simulations, is the ability to develop truly scalable algorithms capable of exploiting larger and faster parallel machines. The development of such algorithms that scale optimally with both the number of atoms and the number of processors will leave the simulation community ideally positioned to tackle larger problems as the next generation of more powerful parallel machines become available. 

Since the density of states and thus the multicanonical weights are not known initially, a scalable algorithm to estimate these quantities is needed. The Wang-Landau algorithm [13, 14] is a simple but efficient iterative method to obtain good approximations of the density of states g E) and the multicanonical weights TTmulticanonical(F ) [Pg.599]

Pottinger R, Halevy A (2001) Minicon A scalable algorithm for answering queries using views. VLDB J 10(2-3) 182-198... 

This paper reports on the progress of the development work. The development outlook includes further implementation of the different data validity mechanisms as well as scalable algorithms for achieving cooperative service level evaluation. 

The figure also illustrates the speed with which data can be transferred from the memory associated with other processors. This can require thousands or tens of thousands of processor cycles. The trick to developing scalable algorithms is to keep the data close to the processor(s) that need it. This is, of course, easier said than done. 

---