File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

남범석

Nam, Beomseok
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.conferencePlace II -
dc.citation.conferencePlace Goa -
dc.citation.title International Conference on High Performance Computing -
dc.contributor.author Um, Yeong Moon -
dc.contributor.author Kim, Jin Woong -
dc.contributor.author Nam, Beomseok -
dc.contributor.author Kwak, Jaewon -
dc.contributor.author Sin, Min Ho -
dc.contributor.author Hwang, Deuk Yeon -
dc.contributor.author Nam, Beomseok -
dc.date.accessioned 2023-12-19T23:06:32Z -
dc.date.available 2023-12-19T23:06:32Z -
dc.date.created 2014-12-23 -
dc.date.issued 2014-12-17 -
dc.description.abstract In distributed query processing systems where caching infrastructure is distributed and scales with the number of servers, it is becoming more important to orchestrate and leverage a large number of cached objects in distributed caching systems seamlessly as the present trend is to build large scalable distributed systems by connecting small heterogeneous machines. With a large scale distributed caching system, a scheduling policy must consider both cache hit ratio and system load balance to optimize multiple queries. A scheduling policy that considers system load but not cache hit ratio often fails to reuse cached data by not assigning a query to the sever that has data objects the query needs. On the contrary, a scheduling policy that considers cache hit ratio but not system load balance may suffer from system load imbalance. To maximize the overall system throughput and to reduce query response time, a multiple query scheduling policy must balance system load and also leverage cached objects. In this paper, we present a distributed query processing framework that exhibits high cache hit ratio while achieving good system load balance. In order to seamlessly manage our distributed scalable caching system, our framework performs autonomic cached data migrations to improve cache hit ratio. Our experiments show that our proposed query scheduling policy and data migration policy significantly improve system throughput by achieving high cache hit ratio while avoiding system load imbalance. -
dc.identifier.bibliographicCitation International Conference on High Performance Computing -
dc.identifier.doi 10.1109/HiPC.2014.7116906 -
dc.identifier.scopusid 2-s2.0-84988223669 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/46604 -
dc.identifier.url https://ieeexplore.ieee.org/document/7116906 -
dc.language 영어 -
dc.publisher IEEE -
dc.title Improving Multi-dimensional Query Processing with Data Migration in Distributed Cache Infrastructure -
dc.type Conference Paper -
dc.date.conferenceDate 2014-12-17 -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.