2 publications

• Published Subscription 29 Feb 2020

  Finest Round Robin Scheduling Algorithm using Effective Time Quantum

  By K. Purushotam Naidu, V.V.D. Prasad Chelluri, S. Sumahasan, R.D.D.V. Sivaram

  Abstract: Scheduling is a most important task of operating-system function. Almost all computer resources are scheduled before use. CPU scheduling is the main task of multi -programmed operating systems. By switching the CPU among processes, the operating system can make the computer more effectively [1]. The CPU is one of the primary computer resources so its scheduling is central to operating-system design. In a simple computer system, the CPU then just …

  Published in Journal of Software Engineering Tools & Technology Trends · Vol. 1, Issue 1, 2014 · pp. 4–8 Read article →

• Published Subscription 5 Jul 2019

  Implementing FP-Growth Algorithm using Map Reduce for Mining Association Rules

  By K. Purushotam Naidu, CH. V. VD. Prasad

  Abstract: Abstract: In mining frequent itemsets, one of most important algorithms is FP-growth. FP-growth proposes an algorithm to compress information needed for mining frequent itemsets in FP-tree and recursively constructs FP-trees to find all frequent itemsets. Map Reduce is a distributed processing framework where the application is divided into many fragments of work, each of which may be executed on any node on a cluster. The main objective of this paper …

  Published in Journal of Advanced Database Management & Systems · Vol. 6, Issue 2, 2019 · pp. 18–29 Read article →