Bounding the makespan of best pre-schedulings of task graphs with fixed communication delays and random execution times on a virtual distributed system.
Moustafa NakechbandiChristian DelaruelleJean-Yves ColinPublished in: OPODIS (2002)
Keyphrases
- distributed systems
- execution times
- communication delays
- processing times
- directed networks
- scheduling problem
- np hard
- upper bound
- message passing
- precedence relations
- lower bound
- single machine
- flowshop
- graph model
- control theory
- concurrent systems
- mobile agents
- distributed database systems
- release dates
- distributed databases
- genetic algorithm