𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Frontal optimization algorithms for multiprocessor computers

✍ Scribed by I. V. Sergienko; L. F. Gulyanitskii

Publisher
Springer US
Year
1981
Tongue
English
Weight
352 KB
Volume
17
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Optimal Multiprocessor Real-Time Sche
An Optimal Multiprocessor Real-Time Scheduling Algorithm
✍ Ashok Khemka; R.K. Shyamasundar πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 170 KB

An optimal scheduling algorithm is described that feasibly schedules a set of m periodic tasks on n processors before their respective deadlines, if the task set satisfies certain conditions. The complexity of this scheduling algorithm in terms of the number of scheduled tasks and the number of proc

A frontal technique for vector computers
A frontal technique for vector computers
✍ Luisa Brusa; Francesca Riccio πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 639 KB

At the kernel of most scientific computations lies the solution of linear equations which, in finite element codes, is often performed by the frontal method. This method, like many algorithms for sparse matrices, is usually implemented with extensive use of indirect addressing which scarcely benefit

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

Multicast Algorithms for Hypercube Multi
Multicast Algorithms for Hypercube Multiprocessors
✍ Shih-Hsien Sheu; Chang-Biau Yang πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 266 KB

Depending on different switching technologies, the multicast communication problem has been formulated as three different graph theoretical problems: the Steiner tree problem, the multicast tree problem, and the multicast path problem. Our efforts in this paper are to reduce the communication traffi