Parallelization in lexicographic discrete optimization algorithms
β Scribed by I. V. Sergienko; Yu. Yu. Chervak; V. I. Grendzha
- Publisher
- Springer US
- Year
- 1984
- Tongue
- English
- Weight
- 401 KB
- Volume
- 20
- Category
- Article
- ISSN
- 1573-8337
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A systolic algorithm is described for generating all permutations of \(n\) elements in lexicographic order. The algorithm is designed to be executed on a linear array of \(n\) processors, each having constant size memory, and each being responsible for producing one element of a given permutation. T
In this paper we solve the open problem of designing a costoptimal parallel algorithm for generating permutations of M elements out of the set {0, 1, . . . , N -1}, in lexicographic order. Our algorithm runs on the simplest model of parallel computation, i.e., a linear array of size M, where each pr
This paper analyzes the performance of two parallel algorithms for solving the linear-quadratic optimal control problem arising in discrete-time periodic linear systems. The algorithms perform a sequence of orthogonal reordering transformations on formal matrix products associated with the periodic