DocumentCode :
2295225
Title :
Using dynamic sets to overcome high I/O latencies during search
Author :
Steere, David ; Satyanarayanan, M.
Author_Institution :
Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
fYear :
1995
fDate :
4-5 May 1995
Firstpage :
136
Lastpage :
140
Abstract :
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
Keywords :
distributed databases; information retrieval; input-output programs; naming services; network operating systems; I/O subsystem; associative naming; dynamic sets; file systems; hierarchical naming; high input/output latencies; parallelism; prefetching; searching; unifying abstraction; Application software; Computer science; Delay; File systems; Large-scale systems; Operating systems; Parallel processing; Prefetching; Web sites; World Wide Web;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Hot Topics in Operating Systems, 1995. (HotOS-V), Proceedings., Fifth Workshop on
Conference_Location :
Orcas Island, WA
Print_ISBN :
0-8186-7081-9
Type :
conf
DOI :
10.1109/HOTOS.1995.513469
Filename :
513469
Link To Document :
بازگشت