A strategy for scheduling partially ordered program graphs onto multicomputers.
Ben LeeChae ShinAli R. HursonPublished in: HICSS (2) (1995)
Keyphrases
- partially ordered
- partial order
- precedence constraints
- partial ordering
- totally ordered
- scheduling strategy
- series parallel
- scheduling algorithm
- event calculus
- interval valued
- total order
- scheduling problem
- graph theoretic
- parallel machines
- possibilistic logic
- graph theory
- flexible manufacturing systems
- graph representation
- computer programs
- resource constraints
- data mining