Professor and Director, Data Management Research Lab (DaMRL)
Office: CASE 238B
Janki Bhimani’s primary research focus revolves around Flash-Based Storage Systems, Big Data Processing, Cloud Computing, High-Performance Computing, and Parallel and Distributed Computing. Her research interest also includes Performance Modeling, Resource Management, and Capacity Planning for various emerging inter-disciplinary research domains. With her extraordinary expertise and extensive experience in the field of new emerging flash-based storage systems and devices, she has made significant contributions to the data storage management community. She is the recipient of the Outstanding Graduate Research Award of 2019 from Northeastern University. She also received Best Paper Awards from flagship conferences. Her work is published in highly selective conferences and journals. She is also the main inventor of top graded patents. Hand-in-hand with her research, she is very passionate about teaching and mentoring. Prior to joining at Florida International University, she previously served Northeastern University as an instructor. She also closely worked with research scientists at Samsung Semiconductor Research Labs towards evolving flash-based SSDs. In her free time, Janki is a creative visual artist. Far from home, amidst nature, she finds her inspiration to paint. She enjoys understanding the impact of art on human psychology, and she can painterly bring motivation, healing, and encouragement through the canvas.
Dr. Janki Bhimani is the Director of the Data Management Research Laboratory (DaMRL). Her research focuses on:
- Memory and Storage Systems;
- Datacenter Endurance and Reliability Management;
- High-Performance Computing;
- Performance Modeling and Prediction;
- Capacity Planning; Resource Management;
- Applied Machine Learning.
- Ph.D. in Computer Engineering, Northeastern University, 2019.
- M.S. in Electrical and Computer Engineering, Northeastern University, 2016.
- B.S. in Electrical and Electronics Engineering, GITAM University, 2013.
Honors and Awards
- 2019 Outstanding Graduate Research Award, Northeastern University
- 2018 The Best Paper Award at IEEE International Conference on Cloud Computing (IEEE CLOUD).
- 2017 The Best Paper Award at 36th IEEE International Performance Computing and Communications
- 2014 Double Husky Scholarship, Northeastern University
CIS 3530: Data Structures
The course covers the collection of classic algorithmic techniques that are useful for solving problems. These algorithms include sorting algorithms (e.g., selection sort, insertion sort, quicksort), recursive backtracking search, tree algorithms (traversals, binary search algorithms), and graph algorithms (traversals, spanning trees forests, shortest paths, etc.). It covers exhaustive approaches, divide and conquer, greedy algorithms, backtracking, branch and bound, and iterative improvement, algorithm analysis, asymptotic notation, and recursion. Data structures covered include vectors, stacks, queues, trees, graphs, priority queues, hashtables, and heaps.
Syllabus – https://damrl.cis.fiu.edu/cop-3530-syllabus/
Spring 2020, Fall 2020, Spring 2021, Fall 2021, Spring 2022
CIS 5346: Storage Systems
Covers the introduction to storage systems, storage devices (hard disk drives, solid-state drives), storage system components, storage architecture, large-scale distributed storage systems, data center storage, non-volatile memory (NVM), reliability and fault tolerance (RAID systems), performance, file-systems, operating systems storage management, memory and storage concepts (caching, consistency, and deduplication), disks and scheduling, emerging storage technologies and future trends
Syllabus – https://damrl.cis.fiu.edu/cis-5346-syllabus/
Fall 2019, Spring 2022
EECE 2560: Fundamentals of Engineering Algorithms
Covers the design and implementation of algorithms to solve engineering problems using a high-level programming language. Reviews elementary data structures, such as arrays, stacks, queues, and lists, and introduces more advanced structures, such as trees and graphs, and the use of recursion. Covers both the algorithms to manipulate these data structures as well as their use in problem-solving. Emphasizes the importance of software engineering principles. Introduces algorithm complexity analysis and its application to developing efficient algorithms
[Janki_Bhimani_FIU_CV] (updated by Mar. 2022)