Parallel algorithms for redundant precedence relations elimination in task systems

DOI10.1016/S0167-8191(05)80149-8MaRDI QIDQ1179246zbMATH OpenFDO

Authors F. Karoui-Sahtout, Z. Mahjoub

Publication date 26 June 1992

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-8191(05)80149-8

zbMATH Keywords

redundant precedence relations eliminationtask and precedence graphs and systemstask assignmenttriangular task graph

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Optimal parallel processing of random task graphs
• scientific article; zbMATH DE number 3900151
• Complexity of Scheduling Parallel Task Systems
• An approach to parallel algorithm design
• TWO PRECEDENCE-RELATED TASK-SCHEDULING ALGORITHMS

This page was built for publication: Parallel algorithms for redundant precedence relations elimination in task systems

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