Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors.
Abir BenabidClaire HanenPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- communication delays
- precedence relations
- parallel architecture
- multiprocessor systems
- graph matching
- graph theoretic
- graph theory
- shared memory
- graph databases
- graph mining
- parallel algorithm
- directed graph
- parallel processing
- precedence constraints
- random graphs
- data flow
- distributed memory
- control theory
- neural network
- graph construction
- parallel processors
- message passing
- subgraph isomorphism
- series parallel
- resource constraints
- spanning tree