Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel.
Marek KlonowskiDariusz R. KowalskiJaroslaw MirekPrudence W. H. WongPublished in: CoRR (2017)
Keyphrases
- fault tolerant
- identical machines
- arbitrary length
- batch processing machines
- parallel machines
- fault tolerance
- processing times
- scheduling problem
- interconnection networks
- single machine
- maximum lateness
- job scheduling
- distributed systems
- unrelated parallel machines
- load balancing
- minimize total
- flowshop
- precedence constraints
- high availability
- scheduling strategy
- identical parallel machines
- computational grids
- release dates
- state machine
- distributed memory
- shared memory
- b tree
- parallel computing
- wafer fabrication
- completion times
- safety critical
- parallel processing
- parallel processors
- parallel computers
- round robin
- single machine scheduling problem
- parallel implementation
- database