Nalini Bonam
*************@*****.***
Interests: Software Engineering, Database systems, Intelligent Systems, Computational science, Data
mining
Languages : Java, C, C++, MATLAB, Python, Objective C, SAS, PHP, HTML.
J2EE Technologies : Servlets, JDBC, JSP, EJB
Operating systems : W indows XP, 2000, Ubuntu.
Database : M Y SQL, Oracle 9i
Application Servers : A pache Tomcat
IDE : Eclipse
Web Services : SOAP, REST
Others : Rational Rose, Win Runner, NS2, Weka.
Education:
• 01/14 – Current: MS in Computational Science at Texas A&M University, Commerce, GPA: 4.0
• 08/07-05/12: MS in Software engineering at Vellore Institute of technology, India. GPA: 3.8.
Thesis: Design and Implementation of Proficient Scheduling Algorithm in Cloud Computing .
Course Work: Programming in C, Object oriented Programming, Data Structures and algorithms,
System Programming, Database management systems, Theory of computation, Operating Systems, Open
source programming, Data Warehousing and Data Mining, Mobile Communication, Intelligent Systems,
Software testing, Operations Research, Design Patterns, Mobile Programming, Algorithm Design, Human
Computer Interaction, Networking, Advanced Databases, System Analysis and Design, Statistics and Data
Analysis.
Experience:
• 08/14 – 12/12: Teaching Assistant at Texas A&M University, Commerce.
• 09/12-06/13: Programmer Analyst, Cognizant Technology Solution, Chennai, India.
Worked in the production and support team to help fix bugs, support customer access portal and
perform code enhancements preliminarily using Java.
08/07-05/12: Undergraduate/Graduate student, Vellore Institute of technology, India.
●
D esign and Implementation of Proficient Scheduling Algorithm in Cloud
Computing: Developed and implemented an optimized scheduling algorithm for task
scheduling in cloud computing in order to improve the utilization of computing resources. Cloud
Computing is an internet-based development in which dynamically scalable and often virtualized
resources are provided as a service over the internet. The Min-Min-Average (MMA) scheduling
algorithm estimates the mean execution time of a user specified tasks. The algorithm is tested in
CloudSim environment which enables modeling and simulation of Cloud Computing systems and
application provisioning environment. The algorithm has tremendously reduced the mean
execution time of the user specified tasks.
Multihoming with NE MO (NS2 simulator, Ubuntu): Proposed a new variant that
offers an uninterrupted packet transmission service independent of the mobility and location of
the router yet maintaining all the sessions of the mobile network nodes enabling undisturbed
service across a single or across several domains. The mechanism offers an efficient methodology
to curb the packet losses that occur during ingress filtering. Ingress Filtering occurs when a
mobile node moves from one coverage area to another and then tries to send packets. When it
moves to a new coverage area, the mobile node is not tunneled to the new home agent and so if it
sends packet then they are discarded which results in packet loss and delay in the process.
Activities:
• Attended a workshop on Swatantra ’09 - 2 Day National Level Symposium on Open Source
Development organized by School of Computing Sciences at VIT University.
• Attended a workshop on Open Source Initiatives and Linux Kernel Internals, Programming
held at VIT University.
• In plant training in Ashok Leyland in CAE and PLM Department, Vellivoyal Chavadi.
• Participated in a workshop on IBM TOOLS and Software’s held at VIT University.
• Attended an International workshop on Cloud Computing held at MIT Campus, Anna
University, Chennai.
• Served as one of the Members of Computer Society of India – VIT University Students Branch.