메뉴 건너뛰기




Volumn 1470 LNCS, Issue , 1998, Pages 944-952

A data layout strategy for parallel web servers

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS PATTERNS; DATA ITEMS; DATA LAYOUTS; GRAPH-THEORETIC; MAPPING DATA; NEW MECHANISMS; PARTITIONING ALGORITHMS; WEB SERVERS;

EID: 84882578857     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper
Times cited : (1)

References (13)
  • 6
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • R. E. Miller and J. W. Thatcher
    • R. M. Karp: Reducibility among combinatorial problems, in R. E. Miller and J. W. Thatcher, Complexity of Computer Computations, pages 85-103, 1972
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 8
    • 84990479742 scopus 로고
    • An effective heristic procedure for partitioning graphs
    • Feb.
    • B.W. Kernighan and S.Lin. An effective heristic procedure for partitioning graphs. The Bell Systems Technical Journal, pages 192-308, Feb 1970.
    • (1970) The Bell Systems Technical Journal , pp. 192-308
    • Kernighan, B.W.1    Lin, S.2
  • 9
    • 0029403662 scopus 로고
    • NCSA world wide web server: Design and performance
    • November
    • Kwan, T.T., R.E. McGrath and D.A. Reed: NCSA World Wide Web Server: Design and Performance. IEEE Computer, November 1995, 28(11), pages 68-74.
    • (1995) IEEE Computer , vol.28 , Issue.11 , pp. 68-74
    • Kwan, T.T.1    McGrath, R.E.2    Reed, D.A.3
  • 11
    • 0030233888 scopus 로고    scopus 로고
    • Partitioning similarity graphs: A framework for declus-tering problems
    • D.R. Liu and S. Shekhar. Partitioning Similarity Graphs: A Framework for Declus-tering Problems, Information Systems, 1996, volume 21,6, pages 475-496
    • (1996) Information Systems , vol.21 , Issue.6 , pp. 475-496
    • Liu, D.R.1    Shekhar, S.2


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