Database System Implementation (2013)
Implemented on system level a single-user database management system that supports a subset of SQL commands like Create, Delete tables; Insert Into, Drop table, Select queries.
• Implemented Heap and Sorted file storage for storage and retrieval of data. Used advanced data structures and multi-threading to handle processing of large volume data.
• Used TPC-H benchmark tables for testing and scaling queries over huge datasets.
• Implemented Relational Operators for select, projection, joins and aggregation functionality.
• Developed Query Processing Engine, Statistical Estimation profiler, Query Parser for query execution
Project Supervisor :
Prof. Alin Dobra,
Assistant Professor, Computer and Information Science and Engineering,
University of Florida
Detecting Communities in social networking Edge Data (2013)
Implemented label propagation algorithm using Elastic Map Reduce infrastructure to detect existing communities in twitter edge data. For testing the accuracy of the algorithm we used LFR benchmark tool developed by Lancichinetti and Fortunato[12]. The tool provides means to control all parameters to develop a graph structure
Project Supervisor :
Prof. Daisy Wang,
Assistant Professor, Computer and Information Science and Engineering,
University of Florida
Distributed Debugger
Debugging in distributed system is challenging and specially when the system is running on multiple muticore machines with each having multiple threads. We developed a system which has a python backend and web user interface and is capable of zooming into issues and weeding out unnecessary information from the logs and helps in finding out issues.
The logging and debugging parts were separable and though the project was used to debug logs from the scala project on gossip protocol but it could be used as a pluggable module for any project by overloading the messaging class and logging sufficient information with lampart clock or any other notion of logical ordering between messages.The backend python filter had multiple options to filter unwanted messages and so that user can zoom in on a particular kind of messages or sequence of messages. The web interface provided a nice user interface to fire the python script letting user to do filtering in a single click. Moreover the python script and webUI provided various methods of visualization to help user to generate graphs which can help user in debugging the information. The graphs were drawn using graphviz and mscgen tools and the user interface provided feature of controlling various parameters of the graphs while drawing.
Project Supervisor :
Prof. Alin Dobra,
Assistant Professor, Computer and Information Science and Engineering,
University of Florida
Comparison of performance of tree structures (2012)
Implemented and compared the relative performance of AVL, red-black, and B-trees as well as their counterparts with a hash table front end using C++ STL class map focusing only on the search and insert operations. It was observed that average search time BTreeHash and AVLHash was lowest (keeping all other factors constant for n=1000000). However the worst time for AVLhash was observed to be lowest.
Average Insertion Time of AVLHash was found to be lowest for n=100 but BtreeHAsh has better performance at n=75 than n=100 but since order for both Btree and Btreehash had to be taken optimized same value it was chosen 100. As performance depends on value of m so BtreeHash may outwit AVLhash for certain value of m when m value for Btree and BtreeHash would be taken different.
Hashed structures had better performance than their non-hashed counterparts (as expected) and the Btree based structures had good performance between 50 to 100.
Project Supervisor :
Prof. Sartaj Sahni,
Computer and Information Science and Engineering,
University of Florida
Gossip Protocol based Algorithms (2012)
Implemented Gossip type algorithms to determine the convergence of Gossip type algorithms through a simulator based on actors written in Scala. No central node was used for monitoring the data flow or the states of nodes in the network.
Only one initiator was used (as an external agent) to initiate the protocol. In a real world scenario this could be an event generated by a node internally also or external disturbance. For instance, there could be nodes with seismographic sensor and in an event of earthquake a node is activated automatically and alerts other remote nodes or share data with them. On reception of a message each node selects a node randomly from its neighbor and sends two messages (to non serialize the process) and then waits for the next incoming message and this continues till the whole network converges or node saturates. Due to absence of any central node time to converge was taken as the maximum time taken by any node to converge (which is receiving the same message for 10 times) in network.Also investigated the effects of failure of nodes in the networks on convergence of the algorithm and also on accessibility of nodes by the message in network upon failureProject Supervisor :Prof. Alin Dobra, Assistant Professor, Computer and Information Science and Engineering, University of Florida
First Hit Ray Tracer (2012)
Implemented a first hit ray tracer using openGl functions and analyzed the performance of adding different 3D shapes to the modelling spaced which needs to be rendered in 2D.
Multiple spheres were added and it was observed that adding polygonal shapes like tetrahedron required more effort to be rendered and hence slows down the process as compared to adding spheresProject Supervisor :Prof. Alireza Entezari, Assistant Professor, Computer and Information Science and Engineering,
University of Florida
UNDERGRAD PROJECTS
Swarm Robotics (2009)
Developed a Low Cost Embedded Platform for the study of various distributed algorithms like Gallagher-Humblet-Spira Algorithm, Bully Election Algorithm on a Swarm of Robots. Each bot consisted of IR based communication system and a stepper motor controlled differential drive mechanism. A simulation (on webots software) of different distributed algorithms was also used before integration into the hardware.
Project Home-Page : Click here
Project Supervisor :
Prof. Shampa Chakraverty, Head of Dept. Computer Engg Dept. ,NSIT
Dr. (Ms.) Smriti Srivastava, Asstt. Prof. & Associate Head, ICE Dept. NSIT
Fractal Rendering (2008)
Implemented a Fractal Rendering Engine to plot and analyze fractals like Mandelbrot set, Newton Set, Lorentz Attractor developed in MATLAB.
Project Supervisor :
Professor V.K. Bansal,
Instrumentation & Control Dept. NSIT
RGB LED color control system (2008)
Developed a RGB LED color control system which involved controlling the red, green and blue components of the LED through PWM signals generated by PCA9633, interfaced via I2C bus to a renesas R8C Tiny 1A1 16-bit Microcontroller. The Project was extended by multiplexing 4 PCA chips through the same controller, driving 4 RGB LEDs
Data Encryption(2007)
Implemented and evaluated the performance of different encryption standards like Data Encryption Standard (DES) and Triple Data Encryption Standard (TDES) in C language
Project Supervisor :
Professor V.K. Bansal,
Instrumentation & Control Dept. NSIT