Comparative performance analysis of proposed variants of list accessing algorithms using centralized cost model with doublylinked list

For the list accessing problem, the standard cost model developed by Sleator and Tarjan[5] is most widely used for cost computation. In this paper, we have proposed a new effective cost model for the list accessing problem which uses doubly linked list as the data structure. We have proposed three new variants of MTF, TRANSPOSE and FC algorithms using our proposed cost model. Experimental analysis has been done for our proposed algorithms Move-To-Middle (MTM), Double Transpose (DT) and Double Frequency Count(DFC) for different dataset. For each algorithm, we have generated some input pattern where each of the algorithms performs optimally. We have made a comparative performance analysis of our proposed algorithms.