Qualification: 
Ph.D, MCA, MSc, M.Tech
k_priyanka@cb.amrita.edu

Dr. Priyanka Kumar currently serves as Assistant Professor at the department of Computer Science and Engineering, School of Engineering, Amrita Vishwa Vidyapeetham, Coimbatore. She did her PhD in the Software Transactional Memory system under Parallel and Distributed Computing domain led by Dr. Sathya Peri at Indian Institute of Technology Hyderabad (IITH).

Research Projects

  • “On Increasing Concurrency in Transactional Memory Systems”, with Sathya Peri between January 2013 – June 2014, Sponsored by NetApp Bangalore for USD 25,000 ( Rs. 12.5 Lakhs).

Fellowships & Awards

  • Awarded "Young Woman in Engineering" (Major Area of Study - Computer Science and Engineering) of the 4th Venus International Women Awards - VIWA 2019 on March 2, 2019 at Radha Regent, Chennai, India during the 4th Annual Women's Meet (AWM 2019).
  • Awarded “TCS Scholarship” from TCS under “Research Scholar Program” for the 9th cycle in 2014 at IIT Hyderabad.
  • Awarded as “Most Promising PhD Researcher” in PhD Forum of ICDCN 2013, TIFR, Mumbai, India.
  • Awarded “High Value PhD Fellowship 2013” by Indian Institute of Technology (IIT) Patna in 2013.
  • Awarded “TCS scholarship” from TCS under “Research Scholar Program” for the 6th cycle in 2013 at IIT Patna.
  • Gold Medalist” in M.Tech. in Database Systems in 2010.
  • Awarded the “First Position” in the event “The Apprentice” at Aaruush ’09, a National Level Tech Fest organized by SRM University, Kattankulathur, Chennai, Tamilnadu, India.
  • Gold Medalist” in M. Sc. Electronics in 2007.

Technical Reports

  • Multi-Version Conflict Notion”, Priyanka Kumar, Sathya Peri. CoRR abs/1307.8256, 2013.
  • A TimeStamp based Multi-version STM Protocol that satisfies Opacity and Multi-Version Permissiveness”, Priyanka Kumar, Sathya Peri. CoRR abs/1305.6624, 2013
  • Multiversion Conflict Notion for Transactional Memory Systems”, authored by Priyanka Kumar and Sathya Peri can be accessed here

Poster Presentations

  • "Implementation of online-permissiveness using multiple versions and MVC Algorithm” at “IRISS 2016”, January 21-22, 2016, Trivandrum, India..
  • Impossibility of online-scheduling with mvc-opacity and MVC algorithm for Multiverion STMs” at “XRCI Open 2016”, January 21-22, 2016, Xerox, Bangalore, India.
  • Multiversion Conflict algorithm for Multiversion Software Transactional Memory Systems”, at “5th IDRBT Doctoral Colloquium 2015”, from December 10-11, 2015 Institute for Development and Research in Banking Technology, Hyderabad, India.
  • A new Conflict Notion for Multiversion Software Transactional Memory System” at “Doctoral Symposium of DEBS 2014”, May 26-29, 2014, IIT Bombay, India.
  • Presented various posters in “University Day at NetApp” in March 2013, 2014 and 2015, Bengaluru, Karnataka, India.
  • Efficient Algorithm for Concurrency Control using Software Transactional Memory System” at “ACM Annual Event”, held at IIT Delhi, in February, 2014.
  • Concurrency Control issues in Multicore Architecture” at “PhD Forum of ICDCN 2013”, January 3-6, 2013, TIFR, Mumbai, India.
  • Concurrency Control issues in Multicore Architectures”, Priyanka Kumar and Sathya Peri in Poster Presentation at Ph.D Forum of 14th International Conference on Distributed Computing and Networking (ICDCN), TIFR, Mumbai, India 2013. (Adjudged 2nd Best Poster).

Paper Presentations

  • Mobility and Networking with Mobile IP” at “National Conference on Mobile Applications and Security” held at Sri Balwant Institute of Technology, Sonepat, Haryana, India, from October 15-16, 2010.
  • A Study Based On Terror Tracking Application Using Advanced Web Mining System” at “International Conference On Recent Advances in e – communication and i - technologies ” held at Anand Institute of Higher Technology, IT Corridor, Kalasalingam Nagar, Chennai, from April 29-30, 2010.
  • A New Framework for the implementation of Active Data Warehousing & it’s Application in E-Business Environment” at “National Conference” held at Manipal Centre for Information Science, Manipal University, Manipal, Karnataka, from April 23-24, 2010.
  • Object-oriented Data Mining and its knowledge Based Optimization” at “National Conference” held at K S Rangasamy College of Technology, Tirunchengode, Tamil Nadu, from March 5-6, 2010.
  • A New Architecture framework on Cloud Computing and its application” at “National Conference” held at K S Rangasamy College of Technology, Tirunchengode, Tamil Nadu, from March 5-6, 2010.
  • Multi-Relational Object Oriented Data Mining and Ontology Based Application” at “National Conference (NCACC’ 09)” held at Vellalar College of Engineering, Erode, Tamil Nadu, on April 17, 2009.

Other Achievements

  • Completed ISRO-sponsored NNRMS Course on “Space Technology Applications in Governance and Development” at NRSC, ISRO, Hyderabad, India during March 5-10, 2017.
  • Presented a Technical paper in NAFED’ 2016 organised by Structural Engineering Entity, Vikram Sarabhai Space Center, ISRO, Trivandrum, Kerala on December 12, 2016.
  • Awarded 'A' Grade in Deep Dive Faculty Enablement Program on Big Data and Analytics workshop organized by Infosys, Mangalore Development Centre, India during August 22- 26, 2016. 
  • “Research Internship” in JAPAN under “Sakura Exchange Program in Science”, conducted between IIT, Hyderabad and University of Tokyo and funded by JST under Japan – Asia Youth Exchange Program in Science started on June 12, 2016 and ended on July 2, 2016. 
  • Attended “MSR India 2012 Summer School” on “Distributed Algorithms, Systems, and Programming” at the Indian Institute of Science (IISc.), Bangalore, India.

Teaching 

  • Spring 2019 (January – June):
    • Foundation of IT (15CSE377) – 3 credit course (B.Tech. 4th year ECE students and EIE students)
  • Autumn 2018 (July – December):
    • Database Management Systems (15CSE302) – 3 credit course (B.Tech. 3rd year)
    • Oops using Java (15CSE202 and 15CSE282)– 3 credit course (B.Tech. 2nd year)
  • Spring 2018 (January – June):
    • Distributed Systems (16CS622) – 4 credits course (M.Tech.+ PhD)
    • C- Programming (15CSE102 and 15CSE180) – 3 credit course (B.Tech. 1st year)
  • Autumn 2017(July – December):
    • Android Application Development (15CSE375) – 3 credit course (B.Tech. 3rd year Elective)
    • Computational Thinking and Problem Solving (15CSE100) – 3 credit course (B.Tech. 1st year)  
  • Spring 2016 (January – June):
    • Distributed Systems (16CS622) – 4 credits course (M.Tech.+ PhD)
  • Autumn 2016 (July – December):
    • Database Management Systems (15CSE340 and 15CSE391) – 3 credit course (B.Tech. 3rd year)

Students

  • Maharshi Shah (2017-2019 batch M. Tech.) – He is working on Blockchain Technology and IPFS. He is also doing internship at Intel, Bangalore.

Publications

Publication Type: Journal Article

Year of Publication Publication Type Title

2019

Journal Article

M. Shah and Dr. Priyanka Kumar, “Tamper proof Birth certificate using Blockchain Technology”, International Journal of Recent Technology and Engineering (IJRTE), 2019.

2018

Journal Article

Dr. Priyanka Kumar, S., V., and M., S., “Improving Late Scheduler and Result Analysis in Heterogeneous Environment”, International Journal of Pure and Applied Mathematics, vol. 118, pp. 2545-2551, 2018.[Abstract]


The word Heterogeneity signifies diversity and Heterogeneity of Hadoop cluster exists as nodes have different configuration and they are distributed in various geographical sites. In distributed environments, homogeneity and local access of data are not full filled. Therefore, performance reduction will happen in default Hadoop schedulers where the cluster nodes are heterogeneous. Because of highly robust nature of LATE Scheduler, it can be used to improve response time in heterogeneous environment by varying the number of Mappers and Reducers for each node. In this paper we have used variable number of Reducers and Mappers to improve the performance of Hadoop heterogeneous cluster.

More »»

2015

Journal Article

Dr. Priyanka Kumar and Peri, S., “Multiversion Conflict Notion for Transactional Memory Systems”, CoRR, vol. abs/1509.04048, 2015.[Abstract]


In recent years, Software Transactional Memory systems (STMs) have garnered significant interest as an elegant alternative for addressing concurrency issues in memory. STM systems take optimistic approach. Multiple transactions are allowed to execute concurrently. On completion, each transaction is validated and if any inconsistency is observed it is aborted. Otherwise it is allowed to commit.
In databases a class of histories called as conflict-serializability (CSR) based on the notion of conflicts have been identified, whose membership can be efficiently verified. As a result, CSR is the commonly used correctness criterion in databases. Similarly, using the notion of conflicts, a correctness criterion, conflict-opacity (co-opacity) which is a sub-class of can be designed whose membership can be verified in polynomial time. Using the verification mechanism, an efficient STM implementation can be designed that is permissive w.r.t co-opacity.
By storing multiple versions for each transaction object, multi-version STMs provide more concurrency than single-version STMs. But the main drawback of co-opacity is that it does not admit histories that are uses multiple versions. This has motivated us to develop a new conflict notions for multi-version STMs. In this paper, we present a new conflict notion multi-version conflict. Using this conflict notion, we identify a new subclass of opacity (a popular correctness-criterion), mvc-opacity that admits multi-versioned histories and whose membership can be verified in polynomial time. We show that co-opacity is a proper subset of this class. The proposed conflict notion mv-conflict can be applied on non-sequential histories as well unlike traditional conflicts. Further, we believe that this conflict notion can be easily extended to other correctness-criterion as well.

More »»

Publication Type: Conference Paper

Year of Publication Publication Type Title

2018

Conference Paper

Abirami K., Harini, D. N., Vaidhyesh, P. S., and Dr. Priyanka Kumar, “Analysis of Web Workload on QoS to Assist Capacity planning”, in International Conference on ISMAC in Computational Vision and Bio-Engineering 2018 (ISMAC-CVB), 2018.[Abstract]


Workload characterization is a well-established discipline, which finds its applications in performance evaluation of modern Internet services. With the high degree of popularity of the Internet, there is a huge variation in the intensity of workload and this opens up new challenging performance issues to be addressed. Internet Services are subject to huge variations in demand, with bursts coinciding with the times that the service has the most value. Apart from these flash crowds, sites are also subject to denial-of-service (DoS) attacks that can knock a service out of commission. The paper aims to study the effect of various workload distributions with the service architecture ‘thread-per-connection’ in use as a basis. The source model is structured as a sequence of activities with equal execution time requirement with an additional load time of page (loading embedded objects, images, etc.). The threads are allocated to the requests in the queue; leftover requests if any are denied service. The rejection rate is used as a criterion for evaluation of the performance of the system with a given capacity. The proposed model could form a basis for various system models to be integrated into the system and get its performance metrics (i.e. QoS) evaluated.

More »»

2018

Conference Paper

Dr. Priyanka Kumar and M., R., “Location based Parental control – Child Tracking App using Android Mobile Operating System”, in ICCCA’18, Galgotias University, NCR Delhi, from December 14-15, 2018, 2018.

2014

Conference Paper

Dr. Priyanka Kumar, Peri, S., and Vidyasankar, K., “A TimeStamp Based Multi-version STM Algorithm”, in Distributed Computing and Networking, Berlin, Heidelberg, 2014.[Abstract]


Software Transactional Memory Systems (STM) are a promising alternative for concurrency control in shared memory systems. Multiversion STM systems maintain multiple versions for each t-object. The advantage of storing multiple versions is that it facilitates successful execution of higher number of read operations than otherwise. Multi-Version permissiveness (mv-permissiveness) is a progress condition for multi-version STMs that states that a read-only transaction never aborts. Recently a STM system was proposed that maintains only a single version but is mv-permissive. This raises a natural question: how much concurrency can be achieved by multi-version STM. We show that fewer transactions are aborted in multi-version STMs than single-version systems. We also show that any STM system that is permissive w.r.t opacity must maintain at least as many versions as the number of live transactions. A direct implication of this result is that no single-version STM can be permissive w.r.t opacity.

More »»

2013

Conference Paper

Dr. Priyanka Kumar and Peri, S., “Multiversion Conflict Notion”, in 5th International Workshop on Theory of Transactional Memory (WTTM), , Jerusalem, Israel, 2013.