Improving miss penalty and cache replacement policy has been a hotspot for researches. The miss p... more Improving miss penalty and cache replacement policy has been a hotspot for researches. The miss penalty may be defined as the number of cycles microprocessor is stalled for a memory access is called miss penalty and it is sum of Cycles to replace a block in the cache. • Cycles to deliver the block to the processor. • The miss penalty problem reduces the overall efficiency of the processing environment. Several efforts have been made to improve the performance of the cache by reducing the miss penalty rate. In this paper, we discuss the work done by different researchers to reduce the miss penalty problem and propose a new idea that can be combined with the existing techniques to improve the performance and reduce the miss penalty problem.
Sorting is considered as a very basic operation in computer science. Sorting is used as an interm... more Sorting is considered as a very basic operation in computer science. Sorting is used as an intermediate step in many operations. Sorting refers to the process of arranging list of elements in a particular order either ascending or descending using a key value. There are a lot of sorting algorithms have been developed so far. This research paper presents the different types of sorting algorithms of data structure like Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Heap Sort and Quick Sort and also gives their performance analysis with respect to time complexity. These six algorithms are important and have been an area of focus for a long time but still the question remains the same of "which to use when?" which is the main reason to perform this research. Each algorithm solves the sorting problem in a different way. This research provides a detailed study of how all the six algorithms work and then compares them on the basis of various parameters apart from time c...
Improving miss penalty and cache replacement policy has been a hotspot for researches. The miss p... more Improving miss penalty and cache replacement policy has been a hotspot for researches. The miss penalty may be defined as the number of cycles microprocessor is stalled for a memory access is called miss penalty and it is sum of Cycles to replace a block in the cache. • Cycles to deliver the block to the processor. • The miss penalty problem reduces the overall efficiency of the processing environment. Several efforts have been made to improve the performance of the cache by reducing the miss penalty rate. In this paper, we discuss the work done by different researchers to reduce the miss penalty problem and propose a new idea that can be combined with the existing techniques to improve the performance and reduce the miss penalty problem.
Sorting is considered as a very basic operation in computer science. Sorting is used as an interm... more Sorting is considered as a very basic operation in computer science. Sorting is used as an intermediate step in many operations. Sorting refers to the process of arranging list of elements in a particular order either ascending or descending using a key value. There are a lot of sorting algorithms have been developed so far. This research paper presents the different types of sorting algorithms of data structure like Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Heap Sort and Quick Sort and also gives their performance analysis with respect to time complexity. These six algorithms are important and have been an area of focus for a long time but still the question remains the same of "which to use when?" which is the main reason to perform this research. Each algorithm solves the sorting problem in a different way. This research provides a detailed study of how all the six algorithms work and then compares them on the basis of various parameters apart from time c...
Uploads
Papers by miraj gul