2 publications

  • Published Subscription

    Off-Line List Accessing Algorithms with Circular Doubly Linked List and Partial Cost Model

    Abstract: List Accessing Problem (LAP) has been an interesting and challenging research area for computer scientists since last four decades. Various algorithms have been developed to access the records by different researchers with an intention to minimize the cost of traversal. This paper describes two newly proposed algorithms, which are variants of FC and MTF for circular doubly linked list with the use of partial cost model. A theoretical as well …

    Published in Current Trends in Information Technology · Vol. 1, Issue 1, 2011 Read article

  • Published Subscription

    A Clustering Based CPU Scheduling Algorithm for Real Time Systems

    Abstract: CPU scheduling is a fundamental function of operating system. The performance and efficiency of multitasking operating systems mainly depend upon the uses of CPU scheduling algorithm. When an operating system wants to execute a process, it does not know the execution time it needs. After running, the exact execution time of that process would appear. Here we present a new scheduling approach using the Partitioning Around Medoid (PAM) clustering algorithm …

    Published in Current Trends in Information Technology · Vol. 1, Issue 1, 2011 Read article

Support