Communication scheduling in data gathering networks with limited memory

DOI10.1016/J.AMC.2014.03.024zbMath1334.90025OpenAlexW2087019660MaRDI QIDQ272491

Joanna Berlińska

Publication date: 20 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.03.024

zbMATH Keywords

schedulingdata gathering networksdivisible loadslimited memory

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Communication theory (94A05)

Related Items (5)

Scheduling for data gathering networks with data compression ⋮ A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks ⋮ Scheduling in data gathering networks with background communications ⋮ 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

Cites Work

• Experimental study of scheduling with memory constraints using hybrid methods
• Heuristics for multi-round divisible loads scheduling with limited memory
• Scheduling divisible loads in a three-dimensional mesh of processors.

This page was built for publication: Communication scheduling in data gathering networks with limited memory