Distributed-memory message-passing machines deliver scalable performance but are difficult to program. Shared-memory machines, on the other hand, are easier to program but obtaining scalable performance with large number of processors is difficult. Recently, scalable machines based on logically shar
β¦ LIBER β¦
Parallel-Vector Algorithm for Optimization of Large Steel Structures on a Shared-Memory Machine
β Scribed by R. Soegiarso; Hojjat Adeli
- Book ID
- 108507958
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 289 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1093-9687
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Compiler Algorithms for Optimizing Local
β
M. Kandemir; J. Ramanujam; A. Choudhary
π
Article
π
2000
π
Elsevier Science
π
English
β 608 KB
Bilevel Parallel Genetic Algorithms for
β
Kamal C. Sarma; Hojjat Adeli
π
Article
π
2001
π
John Wiley and Sons
π
English
β 729 KB
Vector and parallel algorithms for the m
β
John E. Mertz; Douglas J. Tobias; Charles L. Brooks III; U. C. Singh
π
Article
π
1991
π
John Wiley and Sons
π
English
β 797 KB
## Abstract A detailed description of vector/parallel algorithms for the molecular dynamics (MD) simulation of macromolecular systems on multiple processor, sharedβmemory computers is presented. The algorithms encompass three computationally intensive portions of typical MD programs: (__1__) the ev