scientific article; zbMATH DE number 4178740
From MaRDI portal
zbMATH Open0715.68005MaRDI QIDQ3201742FDOQ3201742
Authors: Pierre Henri Cubaud 
Publication date: 1991
Title of this publication is not available (Why is that?)
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
NP-hardpolynomial-time algorithmparallel processingcompletion timeexecution time evaluationPERT graph
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cited In (7)
- Determination of exact upper estimates of time taken to perform complex sets of problems in control, parallel computing systems
- A method of computing minimum firing time for self-cleaning SWITCH-less program nets
- Title not available (Why is that?)
- Average execution times of series-parallel networks
- An adaptive parallel algorithm for analyzing activity networks
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
