Scheduling for data gathering networks with data compression
From MaRDI portal
Recommendations
- Algorithms for communication scheduling in data gathering network with data compression
- Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments
- Scheduling in data gathering networks with background communications
- Communication scheduling in data gathering networks with limited memory
- Scheduling data transfers in a network and the set scheduling problem
- Heuristics for scheduling data requests using collective communications in a distributed communication network
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 695323 (Why is no real title available?)
- Communication scheduling in data gathering networks with limited memory
- Handbook on Scheduling
- Maximizing system lifetime in wireless sensor networks
Cited in
(9)- Communication scheduling in data gathering networks with limited memory
- Algorithms for communication scheduling in data gathering network with data compression
- Heuristics for scheduling data requests using collective communications in a distributed communication network
- An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements
- Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments
- Scheduling for gathering multitype data with local computations
- Scheduling in data gathering networks with background communications
- On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements
- A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks
This page was built for publication: Scheduling for data gathering networks with data compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319855)