Program graph allocation in distributed multicomputers

DOI10.1016/0167-8191(88)90041-5MaRDI QIDQ1106010zbMATH OpenOpenAlexFDO

Authors J. I. Pi, M. L. Campbell, Jean-Luc Gaudiot

Publication date 1988

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(88)90041-5

zbMATH Keywords

allocationHughes data-flow multiprocessormultiprocessor schedulingpartitioningsimulation experiments

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Theory of software (68N99)

Review text

The problem of multiprocessor scheduling is discussed with special regard to the Hughes data-flow multiprocessor. Several partitioning and allocation mechanisms are presented and analyzed, including simulation experiments.

Cited in

(1)

• scientific article; zbMATH DE number 4162284 (Why is no real title available?)

This page was built for publication: Program graph allocation in distributed multicomputers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106010)