𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithm for compiling optimal schedule for parallel-sequential networks

✍ Scribed by K. V. Shakhbazyan; T. A. Tushkina; N. B. Lebedinskaya

Publisher
Springer US
Year
1978
Tongue
English
Weight
444 KB
Volume
10
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A parallel optimization algorithm for mi
A parallel optimization algorithm for minimum execution-time multiprocessor scheduling problem
✍ Hironori Kasahara; Atsusi Itoh; Hisamitsu Tanaka; Keisuke Itoh πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 944 KB

## Abstract This paper proposes a parallel optimization algorithm PDF/IHS for the minimum execution‐time multiprocessor scheduling problem which is a strong NP‐hard optimization problem. PDF/IHS is a parallelization and efficient implementation of the only practical optimization algorithm DF/IHS am

Compiler Algorithms for Optimizing Local
Compiler Algorithms for Optimizing Locality and Parallelism on Shared and Distributed-Memory Machines
✍ M. Kandemir; J. Ramanujam; A. Choudhary πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 608 KB

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