Efficient algorithms for multi-file caching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3180, Issue , 2004, Pages 707-719

  Otoo, Ekow J ^a   Rotem, Doron ^a   Seshadri, Sridhar ^b  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EXPERT SYSTEMS;

BIT-SLICED INDEXES; CACHING ALGORITHM; CACHING SYSTEM; EXTENSIVE SIMULATIONS; INPUT FILES; JOB RESPONSE TIME; QUEUE LENGTHS; SCIENTIFIC DATA;

DATA MINING;

EID: 35048894964     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30075-5_68     Document Type: Article

References (12)

1. Cao, P., Irani, S.: Cost-aware WWW proxy caching algorithms. In: USENIX Symposium on Internet Technologies and Systems. (1997)
2. Hahn, U., Dilling, W., Kaletta, D.: Adaptive replacement algorithm for disk caches in hsm systems. In: 16 Int'l. Symp on Mass Storage Syst., San Diego, California (1999) 128-140
3. Otoo, E.J., Rotem, D., Shoshani, A.: Impact of admission and cache replacement policies on response times of jobs on data grids. In: Int'l. Workshop on Challenges of Large Applications in Distrib. Environments, Seatle, Washington, IEEE Computer Society, Los Alamitos, California (2003)
4. Tan, M., Theys, M., Siegel, H., Beck, N., Jurczyk, M.: A mathematical model, heuristic, and simulation study for a basic data staging problem in a heterogeneous networking environment. In: Proc. of the 7th Hetero. Comput. Workshop, Orlando, Florida (1998) 115-129
5. Wang, J.: A survey of web caching schemes for the Internet. In: ACM SIGCOMM'99, Cambridge, Massachusetts (1999)
6. Young, N.: On-line file caching. In: SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms). (1998)
7. Shoshani, A.L.B., Nordberg, H., Rotem, D., Sim, A.: Multidimensional indexing and query coordination for tertiary storage management. In: Proc. of SSDBM'99. (1999) 214-225
8. Wu, K., Koegler, W.S., Chen, J., Shoshani, A.: Using bitmap index for interactive exploration of large datasets. In: SSDBM'2003, Cambridge, Mass. (2003) 65-74
9. Feige, U., Peleg, D., Kortsarz, G.: The dense k-subgraph problem. Algorithmica 29 (2001) 410-421
10. Khuller, S., Moss, A., Naor, J.S.: The budgeted maximum coverage problem. Information Processing Letters 70 (1999) 39-45
11. Krumke, S.O., Marathe, M.V., Poensgen, D., Ravi, S.S., Wirth, H.C.: Budgeted maximum graph coverage. In: int'l. Workshop on Graph Theoretical Concepts in Comp. Sc., WG 2002, Cesky Krumlov, Czech Republic (2002) 321-332
12. Rotem, D., Seshadri, S., Otoo, E.J.: Analysis of multi-file caching problem. Technical report, Lawrence Berkeley National Laboratory (2003)