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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Runtime Customization of Swap Partition to Improve the Performance of a Number Crunching Algorithm

by Rajeev Raghuvanshi, Rakesh Verma, Dharmendra Sharma
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 63 - Number 17
Year of Publication: 2013
Authors: Rajeev Raghuvanshi, Rakesh Verma, Dharmendra Sharma
10.5120/10561-5651

Rajeev Raghuvanshi, Rakesh Verma, Dharmendra Sharma . Runtime Customization of Swap Partition to Improve the Performance of a Number Crunching Algorithm. International Journal of Computer Applications. 63, 17 ( February 2013), 38-41. DOI=10.5120/10561-5651

@article{ 10.5120/10561-5651,
author = { Rajeev Raghuvanshi, Rakesh Verma, Dharmendra Sharma },
title = { Runtime Customization of Swap Partition to Improve the Performance of a Number Crunching Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { February 2013 },
volume = { 63 },
number = { 17 },
month = { February },
year = { 2013 },
issn = { 0975-8887 },
pages = { 38-41 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume63/number17/10561-5651/ },
doi = { 10.5120/10561-5651 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:14:37.852553+05:30
%A Rajeev Raghuvanshi
%A Rakesh Verma
%A Dharmendra Sharma
%T Runtime Customization of Swap Partition to Improve the Performance of a Number Crunching Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 63
%N 17
%P 38-41
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper focuses on the enhancement of the practical performance of an algorithm and data structures. It provides a way to achieve the effect on performance parameters of operating system. The proposed work has been done about the performance of a number crunching program (Matrix Multiplication) by varying the swap area at run time. We feed a C program as input to the system that executes it for different value of swap area and records the performance parameters as real time, system time, CPU utilization, page faults occurs during execution, context switching due to time slice and context switching due to input output etc. It also presents the way of enhancement in performance of program by customizing the swap partition of operating system.

References
  1. S. Mansoor Sarwar, Edwin E. Parks and Syed Aqeel Sarwar "Laboratory Exercises for Practical Performance of Algorithms and Data Structures", IEEE Transactions on Education, Vol 19, No. 4, November 1996.
  2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajshekharan, "Performance Analysis", in Fundamentals of computer algorithms, New Delhi, India, Galgotia Publications, 2008.
  3. Sumitabha Das, "Advanced system administration", in Unix Concepts and Applications, 4 ed, New Delhi, TMH, 2006.
  4. Maurice j. Batch, "Memory Management Policies", in The Design of the Unix operating System", 6 edition, Delhi, India, Pearson Education, 2005.
  5. G. S. Baluja, "Recursion – A Breath Breaker", in Data Structures through C, 1 ed. , Delhi, India, Dhanpat Rai, 2005.
  6. Udit Agrawal, "Growth of Functions", in Algorithm Design and Analysis, 1 ed. , Delhi, India.
  7. Coremen Thomas, Leiserson CE, Rivest RL; Introduction to algorithms; PHI.
  8. Michael T Goodrich, Robarto Tamassia, Algorithm Design, wiely India.
  9. S. M, Sawar, M, H. A. Jaragh, S. A, Sarwar, and J, Brandenburg, "Engineering quicksort," Comp. Languages, to be publiced.
  10. A. Aho, J. Hopcroft, and J. D. Ullman, Data Structures and Algorithms. Reading, MA: Addison-Wesley, 1983.
  11. Burgin, M. Super-recursive algorithms, Monographs in computer science, Springer.
  12. ACM Curriculum Committee on Computer Science, "Curriculum '78- recommendations for the under graduate program in computer science," Comm. ACM.
  13. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajshekharan, "Performance Analysis", in Fundamentals of computer algorithms, New Delhi, India, Galgotia Publications, 2008.
  14. M. L. , Moore, C. , and Costa, J. F. (2000) An analog characterization of the subrecursive functions. In Proc. of the 4th Conference on Real Numbers and Computers, Odense University, pp. 91–109
Index Terms

Computer Science
Information Sciences

Keywords

MIPF CSIO Swap area CST CSIO PSO System Time User Time Page Fault Cache Size

Powered by PhDFocusTM