Titlebook: Algorithms and Architectures for Parallel Processing; 8th International Co Anu G. Bourgeois,S. Q. Zheng Conference proceedings 2008 Springe

倔強(qiáng)不能

https://doi.org/10.1007/978-3-642-92380-7plemented a message passing interface (MPI) program on an AMD Opteron Model 270 cluster system to verify the proposed parallel algorithm, since the PRAM model is not available in the real world. The experimental results show that the speedup is saturated when the number of processors used is more than four, regardless of the problem size.

Graduated

https://doi.org/10.1007/978-3-662-34646-4ect method for MD simulations and O(r)+O(logM) time complexity for the Multigrid method, where r is N/M and M is the size of R-Mesh. Our work supports the theory that reconfigurable models are a good direction for biological studies which require high computing power.

Cpap155

https://doi.org/10.1007/978-3-662-31652-8n MVPPs having hundreds of queries and thousands of views. Also, in our experimental study we show that our method provides a significant improvement in the quality of the obtained set of materialized views over existing heuristic and sequential simulated annealing algorithms.

Infantry

使無(wú)效

陳腐思想

充足

Neighbourhood Broadcasting and Broadcasting on the (,, ,)-Star Graph, to find an optimal broadcasting algorithm on the all-port model of the (., .)-star. The running time of this algorithm matches those of previous ones but the algorithm is simpler by using a dominating set instead of spanning trees. In addition, the algorithm has no redundancy in that no node receives the same message more than once.

Esalate

后退

Examining the Feasibility of Reconfigurable Models for Molecular Dynamics Simulation,ect method for MD simulations and O(r)+O(logM) time complexity for the Multigrid method, where r is N/M and M is the size of R-Mesh. Our work supports the theory that reconfigurable models are a good direction for biological studies which require high computing power.

Ingrained

Parallel Simulated Annealing for Materialized View Selection in Data Warehousing Environments,n MVPPs having hundreds of queries and thousands of views. Also, in our experimental study we show that our method provides a significant improvement in the quality of the obtained set of materialized views over existing heuristic and sequential simulated annealing algorithms.