By Topic

Using dynamic sets to overcome high I/O latencies during search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D. Steere ; Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA ; M. Satyanarayanan

Describes a single unifying abstraction called `dynamic sets', which can offer substantial benefits to search applications. These benefits include greater opportunity in the I/O subsystem to aggressively exploit prefetching and parallelism, as well as support for associative naming to complement the hierarchical naming in typical file systems. This paper motivates dynamic sets and presents the design of a system that embodies this abstraction

Published in:

Hot Topics in Operating Systems, 1995. (HotOS-V), Proceedings., Fifth Workshop on

Date of Conference:

4-5 May 1995