Real-Time Distributed Scheduling of Precedence Graphs on Arbitrary Wide Networks.
Franck ButelleMourad HakemLucian FintaPublished in: IPDPS (2007)
Keyphrases
- real time
- resource constraints
- meeting scheduling
- computer networks
- high speed networks
- peer to peer networks
- real time database systems
- precedence relations
- distributed systems
- structured peer to peer
- heterogeneous networks
- dynamic scheduling
- computational grids
- scheduling problem
- network nodes
- series parallel
- timing constraints
- highly connected
- real time systems
- peer to peer
- cooperative
- wide area network
- network structure
- distributed environment
- real world networks
- partial order
- graph structures
- dynamic networks
- social networks
- control system
- community discovery
- scheduling algorithm
- precedence constraints
- graph structure
- small world
- local area network
- fully connected
- round robin
- directed graph
- complex networks
- network resources
- network analysis
- communication cost
- real world graphs
- edge weights
- multi agent
- graph mining