Data structures for the most frequently used algorithm

Authors:
Jenq-Foung "JF" Yao;Yongqiao Xiao
Affiliations:
Georgia College & State University;SAS Institute, Inc.
Venue:
Journal of Computing Sciences in Colleges
Year:
2010

Citing 10
Cited 0

Energy-Efficient Caching for Wireless Mobile Computing

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
A general framework for prefetch scheduling in linked data structures and its application to multi-chain prefetching

ACM Transactions on Computer Systems (TOCS)
Introduction to the Design and Analysis of Algorithms (2nd Edition)

Introduction to the Design and Analysis of Algorithms (2nd Edition)
C++ Plus Data Structures

C++ Plus Data Structures
Improving hash join performance through prefetching

ACM Transactions on Database Systems (TODS)
Optimal multistream sequential prefetching in a shared cache

ACM Transactions on Storage (TOS)
Energy efficient cache invalidation in a disconnected wireless mobile environment

International Journal of Ad Hoc and Ubiquitous Computing
Data access history cache and associated data prefetching mechanisms

Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Memory resource allocation for file system prefetching: from a supply chain management perspective

Proceedings of the 4th ACM European conference on Computer systems
Operating System Concepts

Operating System Concepts

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes three sets of data structures that could be used for the Most Frequently Used algorithm, and could serve as projects in computer science courses such as Data Structures, Operating Systems, and Algorithm Analysis. The proposed data structures are introduced first. Algorithm analysis is then provided. The paper concludes with the benefits of these data structures.