Dynamic programming, decision tables, and the Hawaii Parallel Computer
β Scribed by A. Lew; R. Halverson Jr.
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 527 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
The use of decision tables to express concurrent algorithms, and the use of concurrent processors to execute decision table programs, are discussed. As a specific application, we show how dynamic programming algorithms can be implemented ss decision tables.
The Hawaii Parallel Computer (HPC) is a parallel processing computer which was designed utilizing a new computer architecture baaed upon field-programmable gate arrays. To exploit this computer's unique architecture, algorithms must be expressed in a decision table format.
The HPC can be used to implement dynamic programming algorithms expressed in a decision table format.
π SIMILAR VOLUMES
Dynamic programming is an important paradigm that has been widely used to solve problems in various areas such as control theory, operation research, biology and computer science. We generalize the finite automaton formal model for dynamic programming deriving pipeline parallel algorithms. The optim
Current compilers show ineffective when optimizing complex applications, both analyzing dependences and exploiting data locality and extracting parallelism. Complex applications may be characterized as irregular and dynamic. Irregular applications arrange data as multidimensional arrays and memory i
We describe the implementation of the cell multipole method CMM in a Ε½ . Ε½ . complete molecular dynamics MD simulation program MPSim for massively parallel supercomputers. Tests are made of how the program scales with size Ε½ . Ε½ . linearly and with number of CPUs nearly linearly in applications invo
## 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