Devashree Tripathy
Ph.D. Student in Computer Science at UCR


Computer Science & Engineering Department
University of California, Riverside
Riverside, CA 92521

Email: dtrip003 [at] ucr [dot] edu

Google Scholar Google Plus Linked in Facebook CV



About Me

I am a PhD candidate in the Department of Computer Science & Engineering at the University of California, Riverside. I work with Distinguished Prof. Laxmi Narayan Bhuyan and Prof.Daniel Wong and am a member of SoCal Lab at UCR. My interest lies in Computer Architecture , GPGPU Architecture design, High Performance Computing, Fault-Tolerance systems. I have worked on multiple projects on Data- Dependent Applications on GPGPU, Low power Design of GPGPU Execution units and have achieved notable improvements in terms of Performance gain and Power and Area saving.



News

Sept 14, 2017
Won student travel grant to attend MICRO 2017.
Sept 9, 2017
Won student travel grant to attend Third Career Workshop for Women and Minorities in Computer Architecture.
July 2, 2017
Our paper on Data Dependency Support in GPU accepted to MICRO 2017.
March 15, 2016
Passed Oral Qualifying exam. PhD Candidate now!
August 8, 2016
Won student travel grant to attend NAS 2016.

Publications

Conference

C2

WIREFRAME: Supporting Data-dependent Parallelism through Dependency Graph Execution in GPUs. MICRO '17

AmirAli Abdolrashidi,Devashree Tripathy,Mehmet Esat Belviranli, Laxmi Narayan Bhuyan, and Daniel Wong
The 50th International Symposium on Microarchitecture (MICRO), 2017. (acceptance rate: 18.6%)

C1

Design and Implementation of Brain Computer Interface Based Robot Motion Control FICTA '14

Devashree Tripathy, and Jagdish Lal Raheja
Proceedings of the 3rd International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA) 2014.

In this paper, a Brain Computer Interactive (BCI) robot motion control system for patients’ assistance is designed and implemented. The proposed system acquires data from the patient’s brain through a group of sensors using Emotiv Epoc neuroheadset. The acquired signal is processed. From the processed data the BCI system determines the patient’s requirements and accordingly issues commands (output signals). The processed data is translated into action using the robot as per the patient’s requirement. A Graphics user interface (GUI) is developed by us for the purpose of controlling the motion of the Robot. Our proposed system is quite helpful for persons with severe disabilities and is designed to help persons suffering from spinal cord injuries/ paralytic attacks. It is also helpful to all those who can’t move physically and find difficulties in expressing their needs verbally.
@Inbook{Tripathy2015, author="Tripathy, Devashree and Raheja, Jagdish Lal", editor="Satapathy, Suresh Chandra and Biswal, Bhabendra Narayan and Udgata, Siba K. and Mandal, J. K.", title="Design and Implementation of Brain Computer Interface Based Robot Motion Control", bookTitle="Proceedings of the 3rd International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA) 2014: Volume 2", year="2015", publisher="Springer International Publishing", address="Cham", pages="289--296", abstract="In this paper, a Brain Computer Interactive (BCI) robot motion control system for patients' assistance is designed and implemented. The proposed system acquires data from the patient's brain through a group of sensors using Emotiv Epoc neuroheadset. The acquired signal is processed. From the processed data the BCI system determines the patient's requirements and accordingly issues commands (output signals). The processed data is translated into action using the robot as per the patient's requirement. A Graphics user interface (GUI) is developed by us for the purpose of controlling the motion of the Robot. Our proposed system is quite helpful for persons with severe disabilities and is designed to help persons suffering from spinal cord injuries/ paralytic attacks. It is also helpful to all those who can't move physically and find difficulties in expressing their needs verbally.", isbn="978-3-319-12012-6", doi="10.1007/978-3-319-12012-6_32", url="https://doi.org/10.1007/978-3-319-12012-6_32" }

Journal

J5

An improved load‑balancing mechanism based on deadline failure recovery on GridSim Improved Survey Grid

Deepak Kumar Patel, Devashree Tripathy, and C.R Tripathy
Engineering with Computers April 2016, Volume 32, Issue 2, pp 173–188.

Grid computing has emerged a new field, distinguished from conventional distributed computing. It focuses on large-scale resource sharing, innovative applications and in some cases, high performance orientation. The Grid serves as a comprehensive and complete system for organizations by which the maximum utilization of resources is achieved. The load balancing is a process which involves the resource management and an effective load distribution among the resources. Therefore, it is considered to be very important in Grid systems. For a Grid, a dynamic, distributed load balancing scheme provides deadline control for tasks. Due to the condition of deadline failure, developing, deploying, and executing long running applications over the grid remains a challenge. So, deadline failure recovery is an essential factor for Grid computing. In this paper, we propose a dynamic distributed load-balancing technique called “Enhanced GridSim with Load balancing based on Deadline Failure Recovery” (EGDFR) for computational Grids with heterogeneous resources. The proposed algorithm EGDFR is an improved version of the existing EGDC in which we perform load balancing by providing a scheduling system which includes the mechanism of recovery from deadline failure of the Gridlets. Extensive simulation experiments are conducted to quantify the performance of the proposed load-balancing strategy on the GridSim platform. Experiments have shown that the proposed system can considerably improve Grid performance in terms of total execution time, percentage gain in execution time, average response time, resubmitted time and throughput. The proposed load-balancing technique gives 7 % better performance than EGDC in case of constant number of resources, whereas in case of constant number of Gridlets, it gives 11 % better performance than EGDC.

@Article{Patel2016, author="Patel, Deepak Kumar and Tripathy, Devashree and Tripathy, Chitaranjan", title="An improved load-balancing mechanism based on deadline failure recovery on GridSim", journal="Engineering with Computers", year="2016", month="Apr", day="01", volume="32", number="2", pages="173--188", abstract="Grid computing has emerged a new field, distinguished from conventional distributed computing. It focuses on large-scale resource sharing, innovative applications and in some cases, high performance orientation. The Grid serves as a comprehensive and complete system for organizations by which the maximum utilization of resources is achieved. The load balancing is a process which involves the resource management and an effective load distribution among the resources. Therefore, it is considered to be very important in Grid systems. For a Grid, a dynamic, distributed load balancing scheme provides deadline control for tasks. Due to the condition of deadline failure, developing, deploying, and executing long running applications over the grid remains a challenge. So, deadline failure recovery is an essential factor for Grid computing. In this paper, we propose a dynamic distributed load-balancing technique called ``Enhanced GridSim with Load balancing based on Deadline Failure Recovery'' (EGDFR) for computational Grids with heterogeneous resources. The proposed algorithm EGDFR is an improved version of the existing EGDC in which we perform load balancing by providing a scheduling system which includes the mechanism of recovery from deadline failure of the Gridlets. Extensive simulation experiments are conducted to quantify the performance of the proposed load-balancing strategy on the GridSim platform. Experiments have shown that the proposed system can considerably improve Grid performance in terms of total execution time, percentage gain in execution time, average response time, resubmitted time and throughput. The proposed load-balancing technique gives 7 {\%} better performance than EGDC in case of constant number of resources, whereas in case of constant number of Gridlets, it gives 11 {\%} better performance than EGDC.", issn="1435-5663", doi="10.1007/s00366-015-0409-y", url="https://doi.org/10.1007/s00366-015-0409-y" }

J4

Survey of load balancing techniques for Grid Survey Grid

Deepak Kumar Patel, Devashree Tripathy, and C.R Tripathy
Journal of Network and Computer Applications Volume 65, April 2016, Pages 103-119.

In recent days, due to the rapid technological advancements, the Grid computing has become an important area of research. Grid computing has emerged a new field, distinguished from conventional distributed computing. It focuses on large-scale resource sharing, innovative applications and in some cases, high-performance orientation. A Grid is a network of computational resources that may potentially span many continents. The Grid serves as a comprehensive and complete system for organizations by which the maximum utilization of resources is achieved. The load balancing is a process which involves the resource management and an effective load distribution among the resources. Therefore, it is considered to be very important in Grid systems. The proposed work presents an extensive survey of the existing load balancing techniques proposed so far. These techniques are applicable for various systems depending upon the needs of the computational Grid, the type of environment, resources, virtual organizations and job profile it is supposed to work with. Each of these models has its own merits and demerits which forms the subject matter of this survey. A detailed classification of various load balancing techniques based on different parameters has also been included in the survey.

@article{PATEL2016103, title = "Survey of load balancing techniques for Grid", journal = "Journal of Network and Computer Applications", volume = "65", number = "", pages = "103 - 119", year = "2016", note = "", issn = "1084-8045", doi = "http://dx.doi.org/10.1016/j.jnca.2016.02.012", url = "http://www.sciencedirect.com/science/article/pii/S1084804516000953", author = "Deepak Kumar Patel and Devashree Tripathy and C.R. Tripathy", keywords = "Grid computing", keywords = "Distributed systems", keywords = "Load balancing" }

J3

Fault Tolerance in Interconnection Network-a Survey Fault IC

Laxminath Tripathy, Devashree Tripathy, and C.R Tripathy
Research Journal of Applied Sciences, Engineering and Technology Volume 11 Issue 2, Sept 2015, Pages 193-214.

Interconnection networks are used to provide communication between processors and memory modules in a parallel computing environment. In the past years, various interconnection networks have been proposed by many researchers. An interconnection network may suffer from mainly two types of faults: link faults and/or switch fault. Many fault tolerant techniques have also been proposed in the literature. This study makes an extensive survey of various methods of fault tolerance for interconnection networks those are used in large scale parallel processing.

@article{AL:20407467-201509-201512090023-201512090023-198-214, title ={Fault Tolerance in Interconnection Network-a Survey}, author ={Laxminath Tripathy and Devashree Tripathy and C.R. Tripathy}, keywords ={DFA property; dynamic fault-tolerance; fault model; interconnection network; MIN; static fault tolerance}, journal ={Research Journal of Applied Sciences, Engineering and Technology}, volume ={11}, number ={2}, year ={2015}, month ={Sep}, abstract ={Interconnection networks are used to provide communication between processors and memory modules in a parallel computing environment. In the past years, various interconnection networks have been proposed by many researchers. An interconnection network may suffer from mainly two types of faults: link faults and/or switch fault. Many fault tolerant techniques have also been proposed in the literature. This study makes an extensive survey of various methods of fault tolerance for interconnection networks those are used in large scale parallel processing.}, pages ={198-214}, language ={英文}, ISSN ={2040-7467}, publisher ={Maxwell Science Publishing}, }

J2

The Crossed cube-Mesh: A New Fault-Tolerant Interconnection Network Topology for Parallel Systems Crossed Cube mesh

Bhaskar Jyoti Das, Devashree Tripathy, and Bibek Mishra
International Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS) Volume 14, 2014, Pages 211-219.

Recently, the Cube based networks have emerged as attractive interconnection structures in parallel computing systems. In this paper we propose a new interconnection network called crossed cube-mesh which is a product graph of crossed cube and mesh topology. The various topological properties of the new network are derived. The embedding properties, fault-tolerance, node disjoint paths, routing, cost and other performance aspects of the new network are discussed in detail. Based on the comparison, the proposed topologyis proved to be an attractive alternative to the existing Hyper-mesh topology.

@inproceedings{Das2014TheCC, title={The Crossed cube-Mesh: A New Fault-Tolerant Interconnection Network Topology for Parallel Systems}, author={Bhaskar Jyoti Das and Devashree Tripathy and Bibek Mishra}, year={2014} }

J1

Star-Mobius Cube: A New Interconnection Topology for Large Scale Parallel Processing Star-Mobius Cube

Debasmita Pattanayak, Devashree Tripathy, and C.R Tripathy
International Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS) Volume 14, 2014, Pages 62-68.

The interconnection topology plays a vital role in parallel computing systems. In this paper a new interconnection network topology named as Star-mobius cube (SMQ) is introduced. The various topological and performance parameters such as diameter, cost, average distance, and message traffic density are discussed. The embedding and broadcasting aspects of the new network are also presented. Based on the performance analysis, the proposed topology SMQ is proved to be a better alternative to its contemporary networks.

@MISC{Pattanayak_star-mobiuscube:, author = {Debasmita Pattanayak and Devashree Tripathy and C. R. Tripathy}, title = {Star-Mobius Cube: A New Interconnection Topology for Large Scale Parallel Processing}, year = {} }


Academic Professional Service


Awards/Honors

2017
Student Travel Grant for MICRO 2017.
2017
Student Travel Grant for Third Career Workshop for Women and Minorities in Computer Architecture.
2016
Student Travel Grant for NAS 2016.
2015
Dean’s Distinguished Fellowship, Bourns College of Engineering, University of California, Riverside.
2012-2014
Quick-Hire Fellowship by Government of India
2012
Ranked first among all undergraduate students of VSSUT Burla.
2009
Golden Jubilee Meritorious Girls Scholarship, VSSUT Burla. (Awarded for being ranked first among 300+ students among all disciplines of college of engineering in the freshman year.)

Others

Welcome! you are the free counterth vistor of my homepage.

Free Visitor Maps at VisitorMap.org
Get a FREE visitor map for your site!