Scheduling divisible MapReduce computations-Reference-Cited by-同舟云学术

Scheduling divisible MapReduce computations

Published:2011-03 Issue:3 Volume:71 Page:450-459
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Berlińska J.,Drozdowski M.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference26 articles.

1. Partitioning techniques for large-grained parallelism;Agrawal;IEEE Transactions on Computers,1988

2. Scheduling divisible loads on star and tree networks: results and open problems;Beaumont;IEEE Transactions on Parallel and Distributed Systems,2005

3. J. Berlińska, M. Drozdowski, Dominance properties for divisible mapreduce computations, Institute of Computing Science, Poznań University of Technology, Tech. Rep. RA-09/09, 2009. http://www.cs.put.poznan.pl/mdrozdowski/rapIIn/ra0909.pdf.

4. Experimental study of scheduling with memory constraints using hybrid methods;Berlińska;Journal of Computational and Applied Mathematics,2009

5. Scheduling Divisible Loads in Parallel and Distributed Systems;Bharadwaj,1996

Cited by 54 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Load balancing;Multicore and GPU Programming;2023

2. Bibliography;Multicore and GPU Programming;2023

3. Crop prediction based on soil types using machine learning;AIP Conference Proceedings;2023

4. Optimized scheduling of multi‐user Map‐Reduce jobs in heterogeneous environment;Concurrency and Computation: Practice and Experience;2022-10-18

5. Integrating Amdahl-like Laws and Divisible Load Theory;Parallel Processing Letters;2021-06