Provably good scheduling for parallel programs that use data structures through implicit batching.
Kunal AgrawalJeremy T. FinemanKefu LuBrendan SheridanJim SukhaRobert UtterbackPublished in: SPAA (2014)
Keyphrases
- data structure
- scheduling problem
- identical machines
- parallel machines
- precedence constraints
- single machine
- batch processing machines
- release dates
- maximum lateness
- scheduling jobs
- batch processing
- parallel processors
- setup times
- processing times
- round robin
- data types
- high level programming language
- multiprocessor systems
- parallel implementation
- resource constraints
- suffix tree
- resource allocation
- search algorithm
- parallel programming
- worst case
- parallel computation
- shared memory
- distributed memory
- real time database systems
- response time
- flexible manufacturing systems
- answer sets
- scheduling algorithm
- branch and bound algorithm
- logic programs
- efficient data structures
- parallel processing
- database