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).
Year of Publication | Title |
---|---|
2019 |
M. Shah and Dr. Priyanka Kumar, “Tamper proof Birth certificate using Blockchain Technology”, International Journal of Recent Technology and Engineering (IJRTE), 2019. |
2018 |
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 |
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. |
Year of Publication | Title |
---|---|
2018 |
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 |
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 |
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 |
Dr. Priyanka Kumar and Peri, S., “Multiversion Conflict Notion”, in 5th International Workshop on Theory of Transactional Memory (WTTM), , Jerusalem, Israel, 2013. |