Sequential Scheduling of Dataflow Graphs for Memory Peak Minimization.
Pascal FradetAlain GiraultAlexandre HonoratPublished in: LCTES (2023)
Keyphrases
- graph transformation
- series parallel
- objective function
- scheduling problem
- memory requirements
- round robin
- memory usage
- scheduling algorithm
- graph representation
- graph matching
- memory space
- parallel computing
- main memory
- graph theoretic
- directed graph
- memory size
- resource consumption
- parallel machines
- weighted graph
- graph databases
- graph clustering
- data flow
- real time database systems
- database machine
- associative memory
- graph partitioning
- computing power
- graph mining
- parallel execution
- database management systems