FORK-JOIN QUEUE MODELING AND OPTIMAL SCHEDULING IN PARALLEL PROGRAMMING FRAMEWORKS

@inproceedings{2017FORKJOINQM,
  title={FORK-JOIN QUEUE MODELING AND OPTIMAL SCHEDULING IN PARALLEL PROGRAMMING FRAMEWORKS},
  author={},
  year={2017}
}
  • Published 2017
MapReduce framework is widely used to parallelize batch jobs since it exploits a high degree of multi-tasking to process them. However, it has been observed that when the number of servers increases, the map phase can take much longer than expected. This thesis analytically shows that the stochastic behavior of the servers has a negative effect on the completion time of a MapReduce job, and continuously increasing the number of servers without accurate scheduling can degrade the overall… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 53 REFERENCES

The Hadoop Distributed File System

  • 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST)
  • 2010
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Puzzle-based auction mechanism for spectrum sharing in cognitive radio networks

  • 2016 IEEE 12th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)
  • 2016