Skip to main content

Mathematical Model for Distributed Heap Memory Load Balancing

  • Conference paper
Digital Information and Communication Technology and Its Applications (DICTAP 2011)

Abstract

In this paper, we will introduce a new method to achieve the fair distribution of data among distributed memories in a distributed system. Some processes consume larger amount of heap spaces [1] in its local memory than the others. So, those processes may use the virtual memory and may cause the thrashing problem [2].At the same time, the rest of heap memories in that distributed system remain almost empty without best utilization for heap memories of the whole distributed system. So, a UDP-Based process communication system is defined [3] to make use of remote heap memories. This is done by allocating dynamic data spaces for other processes in other machines. In fact, the increasing use of high-bandwidth and low-latency networks provides the possibility to use the distributed memory as an alternative to disk.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lopez-Ortega, O., Lopez-Morales, V.: Cognitive communication in a multi-agent system for distributed process planning. International Journal of Computer Applications in Technology (IJCAT) 26(1/2) (2006)

    Google Scholar 

  2. Katzke, U., Vogel-Heuser, B.: Design and application of an engineering model for distributed process automation. In: Proceedings of the American Control Conference 2005, vol. 4, pp. 2960–2965 (June 2005)

    Google Scholar 

  3. Kruse, RoBert, L., Rybe, Alexander, J.: Data Structure and Program Design in C++. Prentice Hall Inc., Englewood Cliffs (1998)

    Google Scholar 

  4. Wilkinson, Barry: Computer Architecture design and performance, 2nd edn. Prentice Hall Europe, Englewood Cliffs (1996)

    Google Scholar 

  5. Peterson, Larry, L., Davie, Bruce, S.: Computer Network A System Approach, 3rd edn. Morgan Kaufann Publisher, San Francisco (2003)

    MATH  Google Scholar 

  6. Tanenbaum, Andrew, S.: Distributed Operating Systems. Prentice Hall Inc., Englewood Cliffs (1995)

    MATH  Google Scholar 

  7. Geist, A., Beguelin, A., Dongarra, J., Manchek, R., Jaing, W., Sunderam, V.: PVM: A Users’ Guide and Tutorial for Networked Parallel Computing. MIT Press, Boston (1994)

    MATH  Google Scholar 

  8. Coulouris, George, Dollimore, J., Kindberg, T.: Distributed Systems: Concepts and Design, 2nd edn. Addision-Wesely, Harlow (1994)

    MATH  Google Scholar 

  9. Bal, H.E., Kaashoek, M.F., Tanenbaum, A.S.: Orca: A language for Parallel Programming of Distributed Systems. IEEE Trans. On Software Engineering 18, 190–205 (1992)

    Article  Google Scholar 

  10. Di Stefano, A., Santoro, C.: A Java kernel for embedded systems in distributed process control (December 2000)

    Google Scholar 

  11. Concurrency, IEEE [see also IEEE Parallel & Distributed Technology] 8(4), 55-63 (October-December 2000)

    Google Scholar 

  12. Sithirasenan, E., Muthukumarasamy, V.: A Model for Object-based Distributed Processing using Behaviour Trees. Proceeding (436) Software Engineering and Applications (2004)

    Google Scholar 

  13. Kee, Y., Ha, S.: A Robust Dynamic Load-balancing Scheme for Data Parallel Application on Multicomputer Systems. In: Proceedings of International Conference on Parallel Programming Environment (1998)

    Google Scholar 

  14. Borovska, P., Lazarova, M.: Token-Based Adaptive Load Balancing for Dynamically ParallelComputations on Multicomputer Platforms. In: International Conference on Computer Systems and Technologies – CompSys.Tech. (2007)

    Google Scholar 

  15. Faes, P., Christiaens, M., Stroobandt, D.: Mobility of Data in Distributed Hybrid Computing Systems. In: IEEE International Parallel and Distributed Processing Symposium, p. 386 (2007)

    Google Scholar 

  16. Roohi Shabrin, S., Devi Prasad, B., Prabu, D., Pallavi, R.S., Revathi, P.: Memory Leak Detection in Distributed System. In: Proceedings of World Academy of Science, Engineering and Technology, vol. 16 (November 2006)

    Google Scholar 

  17. Serhan, S., Armiti, A., Herbawi, W.: A Heuristic Distributed System Load Balancing Technique with Optimized Network Traffic. Accepted for publication in AMSE Journals/ series D (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Serhan, S., Salah, I., Saadeh, H., Abdel-Haq, H. (2011). Mathematical Model for Distributed Heap Memory Load Balancing. In: Cherifi, H., Zain, J.M., El-Qawasmeh, E. (eds) Digital Information and Communication Technology and Its Applications. DICTAP 2011. Communications in Computer and Information Science, vol 167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22027-2_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22027-2_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22026-5

  • Online ISBN: 978-3-642-22027-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics