Efficient algorithms for multi-file caching

Conference · Mon Mar 15 04:00:00 EST 2004

OSTI ID:824285

Otoo, Ekow J ^[1]; Rotem, Doron; Seshadri, Sridhar

---

1. LBNL Library

Multi-File Caching issues arise in applications where a set of jobs are processed and each job requests one or more input files. A given job can only be started if all its input files are preloaded into a disk cache. Examples of applications where Multi-File caching may be required are scientific data mining, bit-sliced indexes, and analysis of sets of vertically partitioned files. The difference between this type of caching and traditional file caching systems is that in this environment, caching and replacement decisions are made based on ''combinations of files (file bundles),'' rather than single files. In this work we propose new algorithms for Multi-File caching and analyze their performance. Extensive simulations are presented to establish the effectiveness of the Multi-File caching algorithm in terms of job response time and job queue length.

• Research Organization: Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA (US)
• Sponsoring Organization: USDOE Director. Office of Science. Computational and Advanced Scientific Computing Research, Office of Laboratory Policy and Infrastructure Management (US)
• DOE Contract Number: AC03-76SF00098
• OSTI ID: 824285
• Report Number(s): LBNL--54880
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHM MULTI-FILE CACHING FINITE STATE MACHINE SIMULATION
ALGORITHMS
EXPERT SYSTEMS
MINING
PERFORMANCE
QUEUES