Parallélisation de l'algorithme du chemin critique pour une machine à mémoire partagée

DOI10.1051/RO/1997310404291zbMATH Open0890.68071OpenAlexW2507362093MaRDI QIDQ4372115FDOQ4372115

Authors: Mounir Marrakchi 

Publication date: 11 June 1998

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105159

Recommendations

• Optimal parallel scheduling for the 2-steps graph with constant task cost
• scientific article; zbMATH DE number 4113979
• Parallel nested dissection for path algebra computations
• scientific article; zbMATH DE number 56471
• scientific article; zbMATH DE number 18296

zbMATH Keywords

parallel computer with shared memory

Mathematics Subject Classification ID

Distributed algorithms (68W15) Computer system organization (68M99)

Cited In (4)

• Title not available (Why is that?)
• Optimal parallel scheduling for the 2-steps graph with constant task cost
• Performance optimization using extended critical path analysis in multithreaded programs on multiprocessors
• Performance of critical path type algorithms for scheduling on parallel processors

This page was built for publication: Parallélisation de l'algorithme du chemin critique pour une machine à mémoire partagée

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