scientific article; zbMATH DE number 4178740

MaRDI QIDQ3201742zbMATH OpenFDO

Authors Pierre Henri Cubaud

Publication date 1991

zbMATH Keywords

NP-hardpolynomial-time algorithmparallel processingcompletion timeexecution time evaluationPERT graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 4187099
• An adaptive parallel algorithm for analyzing activity networks
• Performance analysis of parallel programs based on directed acyclic graphs
• Parallel comparison algorithms for approximation problems
• Approximating schedules for dynamic process graphs efficiently

Cited in

(7)

• A method of computing minimum firing time for self-cleaning SWITCH-less program nets
• scientific article; zbMATH DE number 2086783 (Why is no real title available?)
• An adaptive parallel algorithm for analyzing activity networks
• Determination of exact upper estimates of time taken to perform complex sets of problems in control, parallel computing systems
• scientific article; zbMATH DE number 4187099 (Why is no real title available?)
• Average execution times of series-parallel networks
• scientific article; zbMATH DE number 3938549 (Why is no real title available?)

This page was built for publication:

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