메뉴 건너뛰기




Volumn 10, Issue 12, 1999, Pages 1262-1275

Tight bounds for prefetching and buffer management algorithms for parallel I/O systems

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER MANAGEMENT ALGORITHMS; PARALLEL INPUT/OUTPUT SYSTEMS;

EID: 0033317118     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.819948     Document Type: Article
Times cited : (17)

References (21)
  • 1
    • 0001342825 scopus 로고    scopus 로고
    • On the Influence of Lookahead in Competitive Paging Algorithms
    • S. Albers, "On the Influence of Lookahead in Competitive Paging Algorithms," Algorithmica, vol. 18, pp. 283-305, 1997.
    • (1997) Algorithmica , vol.18 , pp. 283-305
    • Albers, S.1
  • 3
    • 0031168087 scopus 로고    scopus 로고
    • Simple Randomized Mergesort on Parallel Disks
    • R.D. Barve, E.F. Grove, and J.S. Vitter, "Simple Randomized Mergesort on Parallel Disks," Parallel Computing, vol. 23, no. 4, pp. 601-631, 1997.
    • (1997) Parallel Computing , vol.23 , Issue.4 , pp. 601-631
    • Barve, R.D.1    Grove, E.F.2    Vitter, J.S.3
  • 4
    • 0003003638 scopus 로고
    • A Study of Replacement Algorithms for Virtual Storage
    • L.A. Belady, "A Study of Replacement Algorithms for Virtual Storage," IBM Systems J., vol. 5, no. 5, pp. 78-101, 1966.
    • (1966) IBM Systems J. , vol.5 , Issue.5 , pp. 78-101
    • Belady, L.A.1
  • 9
    • 0028385362 scopus 로고
    • High Performance I/O for Massively Parallel Computers: Problems and Prospects
    • J.M. del Rosario, A.N. Choudhary, "High Performance I/O for Massively Parallel Computers: Problems and Prospects," Computer, vol. 27, no. 3, pp. 59-68, 1994.
    • (1994) Computer , vol.27 , Issue.3 , pp. 59-68
    • Del Rosario, J.M.1    Choudhary, A.N.2
  • 12
  • 15
    • 85013606994 scopus 로고    scopus 로고
    • An Evaluation of Storage Systems Based on Network-Attached Disks
    • G. Ma and A.L.N. Reddy, "An Evaluation of Storage Systems Based on Network-Attached Disks," Proc. 1998 Int'l Conf. Parallel Processing, pp. 278-285, 1998.
    • (1998) Proc. 1998 Int'l Conf. Parallel Processing , pp. 278-285
    • Ma, G.1    Reddy, A.L.N.2
  • 16
    • 0028766446 scopus 로고
    • Markov Analysis of Multiple-Disk Prefetching Strategies for External Merging
    • V.S. Pai, A.A. Schäffer, and P.J. Varman, "Markov Analysis of Multiple-Disk Prefetching Strategies for External Merging," Theoretical Computer Science, vol. 12, pp. 211-239, 1994.
    • (1994) Theoretical Computer Science , vol.12 , pp. 211-239
    • Pai, V.S.1    Schäffer, A.A.2    Varman, P.J.3
  • 18
    • 0025416572 scopus 로고
    • Design, Analysis, and Simulation of I/O Architectures for Hypercube Multiprocessors
    • A.L.N. Reddy and P. Banerjee, "Design, Analysis, and Simulation of I/O Architectures for Hypercube Multiprocessors," IEEE Trans. Parallel and Distributed Computing, vol. 1, no. 2, pp. 140-151, 1990.
    • (1990) IEEE Trans. Parallel and Distributed Computing , vol.1 , Issue.2 , pp. 140-151
    • Reddy, A.L.N.1    Banerjee, P.2
  • 19
    • 0022012946 scopus 로고
    • Amortized Efficiency of List Update and Paging Rules
    • D. Sleator and R.E. Tarjan, "Amortized Efficiency of List Update and Paging Rules," Comm. ACM, vol. 28, no. 2, pp. 202-208, 1985.
    • (1985) Comm. ACM , vol.28 , Issue.2 , pp. 202-208
    • Sleator, D.1    Tarjan, R.E.2
  • 20
  • 21
    • 0028484243 scopus 로고
    • Optimal Algorithms for Parallel Memory 1: Two-Level Memories
    • J.S. Vitter and E.A.M. Shriver, "Optimal Algorithms For Parallel Memory 1: Two-Level Memories," Algorithmica, vol. 12, nos. 2-3, pp. 110-147, 1994.
    • (1994) Algorithmica , vol.12 , Issue.2-3 , pp. 110-147
    • Vitter, J.S.1    Shriver, E.A.M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.