Ideal preemptive schedules on two processors.
Edward G. Coffman Jr.Jay SethuramanVadim G. TimkovskyPublished in: Acta Informatica (2003)
Keyphrases
- scheduling problem
- list scheduling
- single machine
- parallel machines
- parallel algorithm
- parallel processing
- single processor
- np hard
- processing times
- flowshop
- high end
- scheduling algorithm
- multiprocessor systems
- priority queue
- database
- high performance computing
- shared memory
- parallel computing
- database systems
- case study
- parallel architectures
- genetic algorithm
- information retrieval