Raman, Rajeev, Raman, Venkatesh, Satti, Srinivasa Rao
We consider the {\it indexable dictionary} problem, which consists of storing a set $S \subseteq \{0,...,m-1\}$ for some integer $m$, while supporting the operations of $\Rank(x)$, which returns the...
A study of cluster paging methods to boost virtual memory performance (2002)
Thesis (M.S.)--University of Cincinnati, 2002.
A STUDY OF CLUSTER PAGING METHODS TO BOOST VIRTUAL MEMORY PERFORMANCE (2002)
With increase in CPU speed, the performance of many applications has become limited by Virtual Memory (VM). In the case of large out-of-core applications, a portion of their address space is kept in...
A study of cluster paging methods to boost virtual memory performance (2002)
Thesis (M.S.)--University of Cincinnati, 2002.
Static Dictionaries Supporting Rank (2001)
Venkatesh Raman, S. Srinivasa Rao
A static dictionary is a data structure for storing a subset S of a finite universe U so that membership queries can be answered efficiently. We explore space efficient structures to also find the...
A STUDY OF CLUSTER PAGING METHODS TO BOOST VIRTUAL MEMORY PERFORMANCE
With increase in CPU speed, the performance of many applications has become limited by Virtual Memory (VM). In the case of large out-of-core applications, a portion of their address space is kept in...