Reducing memory requirements of stream programs by graph transformations.
Pablo de Oliveira CastroStéphane LouiseDenis BarthouPublished in: HPCS (2010)
Keyphrases
- memory requirements
- memory space
- computational complexity
- graph representation
- data streams
- random walk
- directed graph
- low memory
- graph theory
- real time
- graph model
- sliding window
- graph theoretic
- memory usage
- computational speed
- directed acyclic graph
- computational power
- geometric transformations
- weighted graph
- graph structure
- graph matching
- connected components
- data sets
- spanning tree
- graph partitioning
- bipartite graph
- structured data
- graph structures
- search algorithm
- graph based algorithm