Skip to main content

Research of Task Scheduling Mechanism Based on Prediction of Memory Utilization

  • Conference paper
  • First Online:
Mobile Ad-hoc and Sensor Networks (MSN 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 747))

Included in the following conference series:

  • 995 Accesses

Abstract

With the arrival of big data era, distributed computing framework Hadoop has become the main solution to deal with big data now. People usually promote the performance of distributed computing by adding new computing nodes to cluster. With the expansion of the scale of the cluster, it produces a large amount of power consumption because of lack of reasonable management strategy. So how to make full use of computing resources in the cluster to improve the performance of the whole system and reduce the power consumption has become the main research direction of scholars and industrial circles. For the above, in order to make best use of computing resources and reduce the power consumption, this paper firstly proposes to optimize a reasonable configuration of the parameters provided by Hadoop. Comparing with the default configuration of Hadoop. It shows we can get better performance by parameter tuning. This paper proposes a task scheduling mechanism based on memory usage prediction. In this task schedule, it predicts the future use status of memory in the computing nodes by analyzing the use status before. The task scheduling mechanism can reduce the memory pressure by reducing the allocation of tasks when the computing node is under memory pressure. The task scheduling mechanism can be more flexible by setting the threshold of memory usage. This mechanism based on predicting memory usage can improve the performance of the system by making full use of the computing resources.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bryant, R.E., Katz, R.H., Lazowska, E.D.: Big-data computing: creating revolutionary breakthroughs in commerce, science, and society. Computing Community Consortium, pp. 1–15 (2008)

    Google Scholar 

  2. Xu, X., Cao, L., Wang, X.: Adaptive task scheduling strategy based on dynamic workload adjustment for heterogeneous Hadoop clusters. IEEE Syst. J. 10(2), 471–482 (2016)

    Article  Google Scholar 

  3. Cheng, D., Rao, J., Guo, Y., et al.: Improving performance of heterogeneous mapreduce clusters with adaptive task tuning. IEEE Trans. Parallel Distrib. Syst. 28(3), 774–786 (2017)

    Article  Google Scholar 

  4. Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. In: Proceedings of Operating Systems Design and Implementation (OSDI), pp. 137–150 (2004)

    Google Scholar 

  5. Xiong, S.,Yu, L.,Shen, H., et al.: Efficient algorithms for sensor deployment and routing in sensor networks for network-strucured environment monitoring. In: 2012 IEEE Proceedings of INFOCOM, pp. 1008–1016. IEEE (2012)

    Google Scholar 

  6. Bai, X., Xuan, D., Yun, Z., et al.: Complete optimal deployment patterns for full-coverage and k-connectivity wireless sensor networks. In: Proceedings of the 9th ACM International Symposium on Mobile Ad hoc Networking and Computing, pp. 401–410. ACM (2008)

    Google Scholar 

  7. Zaharia, M., Konwinski, A., Joseph, A., Katz, R., Stoica, I.: Improving mapreduce performance in heterogeneous environments. In: OSDI, pp. 29–42 (2009)

    Google Scholar 

  8. Babu, S.: Towards automatic optimization of mapreduce programs. In: SoCC, pp. 137–142. ACM (2010)

    Google Scholar 

  9. Jiang, D., et al.: The performance of mapreduce: an in-depth study. Proc. VLDB Endow. 3, 472–483 (2010)

    Article  Google Scholar 

  10. Dean, J., Ghemawat, S.: Mapreduce: a flexible data processing tool. Commun. ACM 53(1), 72–77 (2010)

    Article  Google Scholar 

  11. Xie, J., Yin, S., Ruan, X.-J., Ding, Z.-Y., Tian, Y., Majors, J., Qin, X.: Improving mapreduce performance via data placement in heterogeneous hadoop clusters. In: Proceedings of 19th International Heterogeneity in Computing Workshop (2010)

    Google Scholar 

  12. Jiang, D., et al.: The performance of mapreduce: An in-depth study. Proc. VLDB Endow. 3, 472–483 (2010)

    Article  Google Scholar 

  13. Strutz, T.: Data fitting and uncertainty (A practical introduction to weighted least squares and beyond), Chapter 3. Springer Vieweg

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Juan Fang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fang, J., Wang, M., Sun, H. (2018). Research of Task Scheduling Mechanism Based on Prediction of Memory Utilization. In: Zhu, L., Zhong, S. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2017. Communications in Computer and Information Science, vol 747. Springer, Singapore. https://doi.org/10.1007/978-981-10-8890-2_16

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-8890-2_16

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-8889-6

  • Online ISBN: 978-981-10-8890-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics