메뉴 건너뛰기




Volumn , Issue , 2013, Pages 155-168

Adaptive parallelism for web search

Author keywords

parallelism; response time; web search

Indexed keywords

ADAPTIVE RESOURCE MANAGEMENT; DEGREE OF PARALLELISM; MULTI-CORE SERVERS; PARALLELISM; PARALLELIZATION EFFICIENCY; PRODUCTION WORKLOADS; SEQUENTIAL EXECUTION; WEB SEARCHES;

EID: 84877706836     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2465351.2465367     Document Type: Conference Paper
Times cited : (45)

References (37)
  • 1
    • 0034785332 scopus 로고    scopus 로고
    • Vector-space ranking with effective early termination
    • V. N. Anh, O. de Kretser, and A. Moffat. Vector-space ranking with effective early termination. In SIGIR, 2001.
    • (2001) SIGIR
    • Anh, V.N.1    De Kretser, O.2    Moffat, A.3
  • 4
    • 21044447394 scopus 로고    scopus 로고
    • Non-clairvoyant scheduling for minimizing mean slowdown
    • DOI 10.1007/s00453-004-1115-0
    • N. Bansal, K. Dhamdhere, and A. Sinha. Non-clairvoyant scheduling for minimizing mean slowdown. Algorithmica, 40 (4):305-318, Sept. 2004. (Pubitemid 40871643)
    • (2004) Algorithmica (New York) , vol.40 , Issue.4 , pp. 305-318
    • Bansal, N.1    Dhamdhere, K.2    Konemann, J.3    Sinha, A.4
  • 5
    • 47249127725 scopus 로고    scopus 로고
    • The case for energy-proportional computing
    • Dec.
    • L. A. Barroso and U. Hölzle. The case for energy-proportional computing. Computer, 40(12):33-37, Dec. 2007.
    • (2007) Computer , vol.40 , Issue.12 , pp. 33-37
    • Barroso, L.A.1    Hölzle, U.2
  • 6
    • 35748984416 scopus 로고    scopus 로고
    • Runtime scheduling of dynamic parallelism on accelerator-based multi-core systems
    • DOI 10.1016/j.parco.2007.09.004, PII S0167819107001044, High-Performance Computing Using Accelerators
    • F. Blagojevic, D. S. Nikolopoulos, A. Stamatakis, C. D. Antonopoulos, and M. Curtis-Maury. Runtime scheduling of dynamic parallelism on accelerator-based multi-core systems. Parallel Comput., 33(10-11):700-719, Nov. 2007. (Pubitemid 350051063)
    • (2007) Parallel Computing , vol.33 , Issue.10-11 , pp. 700-719
    • Blagojevic, F.1    Nikolopoulos, D.S.2    Stamatakis, A.3    Antonopoulos, C.D.4    Curtis-Maury, M.5
  • 7
    • 84989529445 scopus 로고
    • Optimization of inverted vector searches
    • C. Buckley and A. F. Lewit. Optimization of inverted vector searches. In SIGIR, 1985.
    • (1985) SIGIR
    • Buckley, C.1    Lewit, A.F.2
  • 9
    • 34248374123 scopus 로고    scopus 로고
    • Online power-performance adaptation of multithreaded programs using hardware event-based prediction
    • M. Curtis-Maury, J. Dzierwa, C. D. Antonopoulos, and D. S. Nikolopoulos. Online power-performance adaptation of multithreaded programs using hardware event-based prediction. In ICS, 2006.
    • (2006) ICS
    • Curtis-Maury, M.1    Dzierwa, J.2    Antonopoulos, C.D.3    Nikolopoulos, D.S.4
  • 10
    • 57349191641 scopus 로고    scopus 로고
    • Using graphics processors for high performance ir query processing
    • S. Ding, J. He, H. Yan, and T. Suel. Using graphics processors for high performance ir query processing. In WWW, 2009.
    • (2009) WWW
    • Ding, S.1    He, J.2    Yan, H.3    Suel, T.4
  • 12
    • 76449119387 scopus 로고    scopus 로고
    • Reducing query latencies in web search using fine-grained parallelism
    • E. Frachtenberg. Reducing query latencies in web search using fine-grained parallelism. In WWW, 2009.
    • (2009) WWW
    • Frachtenberg, E.1
  • 13
    • 70350616726 scopus 로고    scopus 로고
    • Improved techniques for result caching in web search engines
    • Q. Gan and T. Suel. Improved techniques for result caching in web search engines. In WWW, 2009.
    • (2009) WWW
    • Gan, Q.1    Suel, T.2
  • 14
  • 15
    • 49349106444 scopus 로고    scopus 로고
    • Provably efficient online nonclairvoyant adaptive scheduling
    • Sept.
    • Y. He, W.-J. Hsu, and C. E. Leiserson. Provably efficient online nonclairvoyant adaptive scheduling. IEEE Trans. Parallel Distrib. Syst., 19(9):1263-1279, Sept. 2008.
    • (2008) IEEE Trans. Parallel Distrib. Syst. , vol.19 , Issue.9 , pp. 1263-1279
    • He, Y.1    Hsu, W.-J.2    Leiserson, C.E.3
  • 17
    • 77954977639 scopus 로고    scopus 로고
    • Web search using mobile cores: Quantifying and mitigating the price of efficiency
    • V. Janapa Reddi, B. C. Lee, T. Chilimbi, and K. Vaid. Web search using mobile cores: quantifying and mitigating the price of efficiency. In ISCA, 2010.
    • (2010) ISCA
    • Janapa Reddi, V.1    Lee, B.C.2    Chilimbi, T.3    Vaid, K.4
  • 18
    • 84866630993 scopus 로고    scopus 로고
    • Prefetching query results and its impact on search engines
    • S. Jonassen, B. B. Cambazoglu, and F. Silvestri. Prefetching query results and its impact on search engines. In SIGIR, 2012.
    • (2012) SIGIR
    • Jonassen, S.1    Cambazoglu, B.B.2    Silvestri, F.3
  • 19
    • 31844448889 scopus 로고    scopus 로고
    • Adaptive execution techniques for smt multiprocessor architectures
    • C. Jung, D. Lim, J. Lee, and S. Han. Adaptive execution techniques for smt multiprocessor architectures. In PPoPP, 2005.
    • (2005) PPoPP
    • Jung, C.1    Lim, D.2    Lee, J.3    Han, S.4
  • 20
  • 21
    • 77955001392 scopus 로고    scopus 로고
    • Thread tailor: Dynamically weaving threads together for efficient, adaptive parallel applications
    • J. Lee, H. Wu, M. Ravichandran, and N. Clark. Thread tailor: dynamically weaving threads together for efficient, adaptive parallel applications. In ISCA, 2010.
    • (2010) ISCA
    • Lee, J.1    Wu, H.2    Ravichandran, M.3    Clark, N.4
  • 22
    • 0027594835 scopus 로고
    • Dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors
    • DOI 10.1145/151244.151246
    • C. McCann, R. Vaswani, and J. Zahorjan. A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors. ACM Trans. Comput. Syst., 11(2):146-178, May 1993. (Pubitemid 23668699)
    • (1993) ACM Transactions on Computer Systems , vol.11 , Issue.2 , pp. 146-178
    • McCann, C.1    Vaswani, R.2    Zahorjan, J.3
  • 25
    • 84856164051 scopus 로고    scopus 로고
    • Thread reinforcer: Dynamically determining number of threads via os level monitoring
    • K. K. Pusukuri, R. Gupta, and L. N. Bhuyan. Thread reinforcer: Dynamically determining number of threads via os level monitoring. In IISWC, 2011.
    • (2011) IISWC
    • Pusukuri, K.K.1    Gupta, R.2    Bhuyan, L.N.3
  • 26
    • 79959909380 scopus 로고    scopus 로고
    • Parallelism orchestration using dope: The degree of parallelism executive
    • A. Raman, H. Kim, T. Oh, J. W. Lee, and D. I. August. Parallelism orchestration using dope: the degree of parallelism executive. In PLDI, 2011.
    • (2011) PLDI
    • Raman, A.1    Kim, H.2    Oh, T.3    Lee, J.W.4    August, D.I.5
  • 27
    • 84970913399 scopus 로고    scopus 로고
    • Fast sorted-set intersection using simd instructions
    • B. Schlegel, T. Willhalm, and W. Lehner. Fast sorted-set intersection using simd instructions. In ADMS, 2011.
    • (2011) ADMS
    • Schlegel, B.1    Willhalm, T.2    Lehner, W.3
  • 29
    • 84885594442 scopus 로고    scopus 로고
    • Optimization strategies for complex queries
    • T. Strohman, H. Turtle, and W. B. Croft. Optimization strategies for complex queries. In SIGIR, 2005.
    • (2005) SIGIR
    • Strohman, T.1    Turtle, H.2    Croft, W.B.3
  • 30
    • 70549085458 scopus 로고    scopus 로고
    • Feedback-driven threading: Power-efficient and high-performance execution of multi-threaded workloads on cmps
    • M. A. Suleman, M. K. Qureshi, and Y. N. Patt. Feedback-driven threading: power-efficient and high-performance execution of multi-threaded workloads on cmps. In ASPLOS, 2008.
    • (2008) ASPLOS
    • Suleman, M.A.1    Qureshi, M.K.2    Patt, Y.N.3
  • 31
  • 32
    • 77954064857 scopus 로고    scopus 로고
    • Improving the performance of list intersection
    • Aug.
    • D. Tsirogiannis, S. Guha, and N. Koudas. Improving the performance of list intersection. Proc. VLDB Endow., 2(1):838-849, Aug. 2009.
    • (2009) Proc. VLDB Endow. , vol.2 , Issue.1 , pp. 838-849
    • Tsirogiannis, D.1    Guha, S.2    Koudas, N.3
  • 33
    • 34748918309 scopus 로고    scopus 로고
    • Expressing and exploiting concurrency in networked applications with aspen
    • G. Upadhyaya, V. S. Pai, and S. P. Midkiff. Expressing and exploiting concurrency in networked applications with aspen. In PPoPP, 2007.
    • (2007) PPoPP
    • Upadhyaya, G.1    Pai, V.S.2    Midkiff, S.P.3
  • 35
    • 67650088253 scopus 로고    scopus 로고
    • Mapping parallelism to multi-cores: A machine learning based approach
    • Z. Wang and M. F. O'Boyle. Mapping parallelism to multi-cores: a machine learning based approach. In PPoPP, 2009.
    • (2009) PPoPP
    • Wang, Z.1    O'Boyle, M.F.2
  • 36
    • 0038674401 scopus 로고    scopus 로고
    • Seda: An architecture for well-conditioned, scalable internet services
    • M. Welsh, D. Culler, and E. Brewer. Seda: an architecture for well-conditioned, scalable internet services. In SOSP, 2001.
    • (2001) SOSP
    • Welsh, M.1    Culler, D.2    Brewer, E.3
  • 37
    • 80053169446 scopus 로고    scopus 로고
    • Better never than late: Meeting deadlines in datacenter networks
    • C. Wilson, H. Ballani, T. Karagiannis, and A. Rowtron. Better never than late: meeting deadlines in datacenter networks. In SIGCOMM, 2011.
    • (2011) SIGCOMM
    • Wilson, C.1    Ballani, H.2    Karagiannis, T.3    Rowtron, A.4


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