Placement Des Taches D’Un Programme A Structure Arborescente Sur Un Reseau De Processeurs: Synthese De Resultats Recents

DOI10.1080/03155986.1994.11732239zbMath0805.90057OpenAlexW2396214664MaRDI QIDQ4304826

Alain Billionnet, Sourour Elloumi

Publication date: 1994

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1994.11732239

zbMATH Keywords

treedistributed systemcommunication graphtask allocationpipelined processing

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

This page was built for publication: Placement Des Taches D’Un Programme A Structure Arborescente Sur Un Reseau De Processeurs: Synthese De Resultats Recents