Follow
Joanna Berlińska
Title
Cited by
Cited by
Year
Scheduling divisible MapReduce computations
J Berlińska, M Drozdowski
Journal of Parallel and Distributed Computing 71 (3), 450-459, 2011
1092011
Scheduling for data gathering networks with data compression
J Berlińska
European Journal of Operational Research 246, 744-749, 2015
262015
Heuristics for multi-round divisible loads scheduling with limited memory
J Berlińska, M Drozdowski
Parallel Computing 36 (4), 199-211, 2010
252010
Communication scheduling in data gathering networks with limited memory
J Berlińska
Applied Mathematics and Computation 235, 530-537, 2014
182014
Comparing load-balancing algorithms for MapReduce under Zipfian data skews
J Berlińska, M Drozdowski
Parallel Computing 72, 14-28, 2018
172018
Experimental study of scheduling with memory constraints using hybrid methods
J Berlińska, M Drozdowski, M Lawenda
Journal of Computational and Applied Mathematics 232 (2), 638-654, 2009
142009
Heuristics for scheduling data gathering with limited base station memory
J Berlińska
Annals of Operations Research 285 (1-2), 149-159, 2020
122020
Scheduling data gathering with variable communication speed
J Berlińska
The First International Workshop on Dynamic Scheduling Problems, 29-32, 2016
82016
Scheduling Data Gathering with Maximum Lateness Objective
J Berlińska
International Conference on Parallel Processing and Applied Mathematics, 135-144, 2018
72018
Scheduling Multilayer Divisible Computations
J Berlińska, M Drozdowski
RAIRO Oper. Res 49 (2), 339-368, 2015
72015
Scheduling in data gathering networks with background communications
J Berlińska
Journal of Scheduling 23 (6), 681-691, 2020
52020
Scheduling for gathering multitype data with local computations
J Berlińska, B Przybylski
European Journal of Operational Research 294 (2), 453-459, 2021
32021
Mitigating Partitioning Skew in MapReduce Computations
J Berlińska, M Drozdowski
Multidisciplinary International Conference on Scheduling : Theory and …, 2013
32013
Multi-installment divisible loads scheduling in systems with limited memory
J Berlińska, M Drozdowski, M Lawenda
Research Report RA-07/08, Institute of Computing Science, Poznań University …, 2008
32008
A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks
J Berlińska
Engineering Optimization 54 (2), 218-231, 2022
22022
Two-machine flow shop with dynamic storage space
J Berlińska, A Kononov, Y Zinder
Optimization Letters 15, 2433-2454, 2021
22021
Makespan Minimization in Data Gathering Networks with Dataset Release Times
J Berlińska
International Conference on Parallel Processing and Applied Mathematics, 230-241, 2020
22020
Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations
J Berlińska, A Kononov, Y Zinder
World Congress on Global Optimization, 1139-1148, 2020
22020
Scheduling in a data gathering network to minimize maximum lateness
J Berlińska
Operations Research Proceedings 2018: Selected Papers of the Annual …, 2019
22019
Scheduling data gathering with limited base station memory
J Berlińska
16th International Conference on Project Management and Scheduling, 42-45, 2018
22018
The system can't perform the operation now. Try again later.
Articles 1–20