CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A New Approach of Prediction of Memory Leak in the Cluster Computing Applications

by R.Kavitha, C.kotteeswari, G.Sumathi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 3 - Number 1
Year of Publication: 2010
Authors: R.Kavitha, C.kotteeswari, G.Sumathi
10.5120/702-985

R.Kavitha, C.kotteeswari, G.Sumathi . A New Approach of Prediction of Memory Leak in the Cluster Computing Applications. International Journal of Computer Applications. 3, 1 ( June 2010), 13-16. DOI=10.5120/702-985

@article{ 10.5120/702-985,
author = { R.Kavitha, C.kotteeswari, G.Sumathi },
title = { A New Approach of Prediction of Memory Leak in the Cluster Computing Applications },
journal = { International Journal of Computer Applications },
issue_date = { June 2010 },
volume = { 3 },
number = { 1 },
month = { June },
year = { 2010 },
issn = { 0975-8887 },
pages = { 13-16 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume3/number1/702-985/ },
doi = { 10.5120/702-985 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:51:48.283268+05:30
%A R.Kavitha
%A C.kotteeswari
%A G.Sumathi
%T A New Approach of Prediction of Memory Leak in the Cluster Computing Applications
%J International Journal of Computer Applications
%@ 0975-8887
%V 3
%N 1
%P 13-16
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper presents a memory leak prediction algorithm for the cluster computing applications. This proposed algorithm uses process characteristics to calculate the exact memory requirement and uniquely identifies maximum memory utilization of an application before the application starts its execution. During the appffplication execution phase, memory leaks in the application processes in the cluster is identified by existing Dynamic Memory Monitoring Agent (DMMA) gives information to the end users to make corrective actions and removes memory leak processes from the affected nodes. This unified approach increases the reliability and fault tolerant in the cluster computing.

References
  1. Roohi Shabrin S., Devi Prasad B., Prabu D., Pallavi R. S., and Revathi P., “Memory Leak Detection in Distributed System”, World Academy of Science, Engineering and Technology 16 2006.
  2. R.Hastings and B.Joyce, “Purify Fast detection of memory leaks and access errors”, Proceedings of USENIX winter 1992 Technical conference, pages 125-136, Dec 1992.
  3. US-CERT vulnerability notes database http//www.kb.cert.org/vuls
  4. Mohammad Tanvir Huda, Heinz W.Schimdt, Ian D.Peake, “An agent oriented dynamic fault tolerant framework for Grid computing”, 2005, Monash University Melbourne.p.84.
  5. “Valgrind A Program Supervision Framework”, Nicholas Nethercote and Julian Seward.Electronic Notes in Theoretical Computer Science 89 No.2, 2003.
  6. “Ramandeeep singh, “Get the better of memory leaks with Valgrind”, Linux J., February2006 (106), 2006.
  7. J.Seward, N.Nethercote, and Fitzhardinge, “valgrind, an open–source memory debugger for x86– gnu/Linux” http//valgrind. Kde.org/.
  8. “Gray Watson, Debug Malloc Library”, Published by Gray Watson, Version 5.4.2; October 2004.
  9. Heike Verta, T.S. “Detection of heap management flaws in Component-based software”, In EUROMICRO, 2004, Rennes, France IEEE.
  10. C. D. Polychronopoulos , D. J. Kuck, Guided self-scheduling “A practical scheduling scheme for parallel supercomputers, IEEE Transactions on Computers, v.36 n.12, p.1425-1439”, Dec. 1987
  11. Frank D. Anger , Jing-Jang Hwang , Yuan-Chieh Chow, “Scheduling with sufficient loosely coupled processors, Journal of Parallel and Distributed Computing, v.9 n.1, p.87-92”, May 1990.
  12. Glenn R. Luecke, James Coyle, Jim Hoekstra, Marina Kraeva, Ying Li, Olga Taborskaia, and Yanmei Wang, “A Survey of Systems for Detecting Serial Run-Time Errors”,2006.
  13. HPC Management Software “Reducing the Complexity of HPC Cluster and Grid Resources”.
  14. M. Girkar C. Polychronopoulos “Partitioning programs for parallel execution”, Proceedings of the 2nd international conference on Supercomputing.
  15. T. Yang A. Gerasoulis “ Scheduling Parallel Tasks on an Unbounded Number of Processors” IEEE Transactions on Parallel and Distributed Systems 1994.
Index Terms

Computer Science
Information Sciences

Keywords

Cluster Computing Memory Leak Fault Tolerance Maximum memory utilization Process characteristics

Powered by PhDFocusTM