Search for Articles:

MECS Press Menu

Shanthi Makka

Work place: Department of Computer Science and Engineering, JRE Group of Institutions, Greater Noida, 201310, India

E-mail: Shanthi.makka@gmail.com

Website:

Research Interests: Computational Science and Engineering, Computational Engineering, Computer systems and computational processes, Computer Architecture and Organization, Parallel Computing, Data Structures and Algorithms, Engineering

Biography

Shanthi Makka, from greater Noida- Uttar Pradesh completed B.tech in Computer Science and Systems Engineering in 2000 from GITAM university, done M.Tech in Computer Science and Engineering and pursuing Ph.D. in Parallel Computing from BITs-Mesra( Noida campus).

Having total experience of 15 years in academics at various places which includes south India, Orissa, Himachal Pradesh and currently working in JRE Group of Institutions since 2014. I am also heading the department of Information Technology at JRE. Publication details (few) are: "A New Approach for Optimization of Program Dependence Graph using Finite Automata." Indian Journal of Science and Technology 9.38 (2016), "Simulation of a Model for Refactoring Approach for Parallelism Using Parallel Computing Tool Box." Proceedings of First International Conference on Information and Communication Technology for Intelligent Systems: Volume 2. Springer International Publishing, 2016, “The Program Dependence Graph and its applications in refactoring ”, paper has been ACCEPTED and registered in International Conference on Communication and Networks (COMNET 2016) and publication in Springer AISC series. Accepted on February, 2016 and “Survey on a new advanced approach for refactoring approach for parallelism using heterogeneous parallel architectures”, International Journal of Science and Research(IJSR)-ISSN 2319-7064,Volume 3, Issue 5, May 2014.

Author Articles
Performance Analysis of a System that Identifies the Parallel Modules through Program Dependence Graph

By Shanthi Makka B.B.Sagar

DOI: https://doi.org/10.5815/ijisa.2017.09.05, Pub. Date: 8 Sep. 2017

We have proposed a new approach to identify segments, which can be executed simultaneously, or coextending to achieve high computational speed with optimized utilization of available resources. Our suggested approach is divided into four modules. In first module we have represented a program segment using Abstract Syntax Tree (AST) along with an algorithm for constructing AST and in second module, this AST has been converted into Program Dependence Graph (PDG), the detailed approach has been described in section II, The process of construction of PDG is divided into two steps: First we construct a Control Dependence Graph (CDG, In second step reachability definition algorithm has been used to identify data dependencies between the various modules of a program by constructing Data Dependence Graph (DDG). In third module an algorithm is suggested to identify parallel modules, i.e., the modules that can be executed simultaneously in the section III and in fourth module performance analysis is discussed through our approach along with the computation of time complexity and its comparison with sequential approach is demonstrated in a pictorial form.

[...] Read more.
Other Articles

Subscribe to receive issue release notifications and newsletters from MECS Press journals