๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallelizing secure linear programming

โœ Scribed by Rafael Deitos; Florian Kerschbaum

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
703 KB
Volume
21
Category
Article
ISSN
1532-0626

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient parallel linear programming
Efficient parallel linear programming
โœ Victor Pan; John Reif ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 668 KB
A parallel integer linear programming al
A parallel integer linear programming algorithm
โœ Rochelle L. Boehning; Ralph M. Butler; Billy E. Gillett ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 442 KB
Linear time detection of inherent parall
Linear time detection of inherent parallelism in sequential programs
โœ Peter L. Bird ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 724 KB

The topological sort can be used for the rapid detection of parallelism in sequential programs. Using this algorithm, one can detect both intrablock and interblock parallelism. The algorithm requires only information normally collected by an optimizing compiler. \* Throughout this paper, we will us