Performance of critical path type algorithms with communication delay

MaRDI QIDQ3517652zbMATH OpenFDO

Authors Gaurav Singh

Publication date 12 August 2008

zbMATH Keywords

maximum latenessworst-case analysisprecedencescheduling theoryunit execution and communication times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1783868
• Performance of critical path type algorithms for scheduling on parallel processors
• Performance of Garey-Johnson algorithm for pipelined typed tasks systems
• Performance of Coffman-Graham schedules in the presence of unit communication delays
• Scheduling series--parallel orders subject to 0/1-communication delays

Cited in

(2)

• Performance of Garey-Johnson algorithm for pipelined typed tasks systems
• scientific article; zbMATH DE number 1783868 (Why is no real title available?)

This page was built for publication: Performance of critical path type algorithms with communication delay

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