Precedence constraints in hard real-time distributed systems.
Javier OrozcoRicardo CayssialsJorge SantosEdgardo FerroPublished in: ICECCS (1997)
Keyphrases
- distributed systems
- precedence constraints
- scheduling problem
- branch and bound algorithm
- approximation algorithms
- precedence relations
- parallel machines
- single machine scheduling problem
- fault tolerant
- partially ordered
- release dates
- partial order
- load balancing
- geographically distributed
- vertex cover
- parallel processors
- fault tolerance
- message passing
- lower bound
- global constraints
- maximum lateness
- distributed environment
- partially ordered sets
- distributed computing
- mobile agents
- real time systems
- distributed database systems
- np hard
- unit length
- branch and bound
- processing times
- concurrent systems
- deadlock detection
- search algorithm
- data replication