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.endPage 1156 -
dc.citation.number 3 -
dc.citation.startPage 1141 -
dc.citation.title CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS -
dc.citation.volume 18 -
dc.contributor.author Eom, Youngmoon -
dc.contributor.author Kim, Jinwoong -
dc.contributor.author Nam, Beomseok -
dc.date.accessioned 2023-12-22T00:44:22Z -
dc.date.available 2023-12-22T00:44:22Z -
dc.date.created 2015-10-26 -
dc.date.issued 2015-09 -
dc.description.abstract It is becoming more important to leverage a large number of distributed cache memory seamlessly in modern large scale systems. Several previous studies showed that traditional scheduling policies often fail to exhibit high cache hit ratio and to achieve good system load balance with large scale distributed caching facilities. To maximize the system throughput, distributed caching facilities should balance the workloads and leverage cached data at the same time. In this work, we present a distributed job processing framework that yields high cache hit ratio while achieving balanced system load. Our framework employs a scheduling policy-DEMA that considers both cache hit ratio and system load and it supports geographically distributed multiple job schedulers. We show collaborative task scheduling and the data migration can even further improve the performance by increasing the cache hit ratio while achieving good load balance. Our experiments show that the proposed job scheduling policies outperform legacy load-based job scheduling policy in terms of job response time, load balancing, and cache hit ratio -
dc.identifier.bibliographicCitation CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, v.18, no.3, pp.1141 - 1156 -
dc.identifier.doi 10.1007/s10586-015-0464-6 -
dc.identifier.issn 1386-7857 -
dc.identifier.scopusid 2-s2.0-84942549882 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/17584 -
dc.identifier.url http://link.springer.com/article/10.1007%2Fs10586-015-0464-6 -
dc.identifier.wosid 000361897200012 -
dc.language 영어 -
dc.publisher SPRINGER -
dc.title Multi-dimensional multiple query scheduling with distributed semantic caching framework -
dc.type Article -
dc.description.isOpenAccess FALSE -
dc.relation.journalWebOfScienceCategory Computer Science, Information Systems; Computer Science, Theory & Methods -
dc.relation.journalResearchArea Computer Science -
dc.description.journalRegisteredClass scie -
dc.description.journalRegisteredClass scopus -
dc.subject.keywordAuthor Semantic caching -
dc.subject.keywordAuthor Multi-dimensional query -
dc.subject.keywordAuthor Multiple query optimization -
dc.subject.keywordAuthor Data migration -
dc.subject.keywordAuthor Distributed query scheduling -

qrcode

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