INTERNATIONAL JOURNA L OF ENGINEERING SCI ENCES & RESEARCH TECHNOLOGY Optimization of Cache Memory Using Unrolled Linked List

Data structures play an important role to reduce th e cost of memory access. First array was introduced which gives access, as elements are stored in consecutive place s. But it has disadvantage also, like, wastage of time, and most important takes large number of shif ting operations to insert or delete an item at any other position excluding last position. d to overcome disadvantages of array. It has advant ages of quick insertions and time new data can be inserted and avoid wastage of memory. But it also has some disadvantages, like requirement of extra memory spa ce to store refere nces. For N elements N references are List is introduced which combines the cache advanta ges of an array but the quick insertions and incremental growth of a linked list. This is Un rolled Linked -List. Actually data field stores an array in place of a sensitive data structure, which increases the speed of memory access by using arrays. We'll implement its all basic operation alo ng with its applications . Basic operations are insertion, deletion, searching, traversing and sorting. Like array and L inked - List it also has applications to implement many oth er elementary data structures like stack and queue. sensitive and cache -ob vious data structure can be defined and implemented . Also NP Complete problems can be solved using these data st ructures like unrolled linked -list. Cache Memory, Linked List, Unrolled Linked List, Memory Access