EM-KDE: A locality-aware job scheduling policy with distributed semantic caches

Eom, Youngmoon; Hwang, Deukyeon; Liu, Junyong; Moon, Jonghwan; Shin, Minho; Nam, Beomseok

doi:10.1016/j.jpdc.2015.06.002

Cited by 4 publications

(2 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The survey (Qureshi et al, 2013) provides valuable insights in learning various types of semantic search modes and the behavior of existing semantic search engines. Another work (Eom et al, 2015) proposed scheduling policies in the context of distributed query processing. The policies are based on the dynamic details of caching infrastructure for distributed systems and apply the statistical prediction techniques into scheduling policies for query processing.…”

Section: Related Workmentioning

confidence: 99%

A comprehensive framework for the semantic cache systems

Alghobiri

Khan

Afzal³

et al. 2016

Int. j. adv. appl. sci

View full text Add to dashboard Cite

Semantic Cache deals in both semantic descriptions as well as the results of previous queries providing improved efficiency. The semantic cache is an active research domain due to its novel ideology and advantages. The proposed framework is formulated based on the extensive study in the domain of semantic cache in general and in the study of framework for semantic cache in particular. About all the previous works contributed to the domain knowledge, but the certain raised issues still needed to be addressed. For the proposed framework, about all factors involving semantic caching systems are explored. The novelty of the proposed framework lies in the deep modular approach. The proposed framework, described at the detailed level, may present guidance for future works on semantic cache systems.

show abstract

Section: Related Workmentioning

confidence: 99%

A comprehensive framework for the semantic cache systems

Alghobiri

Khan

Afzal³

et al. 2016

Int. j. adv. appl. sci

View full text Add to dashboard Cite

show abstract

“…Mobile Internet to achieve large amounts of data, query data is a multi-node distributed storage and the real-time transaction scheduling, the existing methods generally part of the query task is decomposed into sub transactions and the sub-transaction put in different nodes were treated, the priority assessment, consensus sequence of problems [6] [7]. Improve the efficiency of distributed database transaction real-time scheduling, and optimize the decomposition process of the transaction.…”

Section: Introductionmentioning

confidence: 99%

Real-time Transaction Scheduling Method for Distributed Database

Sun¹,

Zhang²,

Fu³

et al. 2016

Proceedings of the 2nd International Conference on Electronics, Network and Computer Engineering (ICENCE 2016)

View full text Add to dashboard Cite

The existing distributed database is mainly based on the limited scale network environment. Many systems implement algorithms are difficult to apply when it needs to be expanded or involved into the field of distributed query processing, distributed transaction processing and data replication. In this paper, one real-time transaction management architecture and its details are proposed to improve the efficacy of SQL processing based on distributed database system. The seven primary functional models in the server cluster part and four functional models in the distributed database part are designed to enhance the query function such as insert or update in our network environment. The experiments and results proved that our method is more efficient than traditional methods.

show abstract

Comparation of distributed cache and centralized cache on web proxy

Parulian

Zarlis

BenyaminNasution

2020

IOP Conf. Ser.: Mater. Sci. Eng.

View full text Add to dashboard Cite

Caching is an object storage mechanism from a web page that has been accessed. With caching, bandwidth usage will be more efficient and the time to access a web page is getting faster. In caching there are 2 techniques used, namely centralized cache and distributed cache. The purpose of this study is to build a distributed cache system that supports Availability, Reliability, and Scalability. This system will overcome various problems found in the centralized cache, such as single point of failure, unreliable, and not scalable. With the availability of Availability, the system will avoid the problem of single point of failure by implementing a failover mechanism. For the Reliability system will still hold (reliable) accept requests from users, because some proxy servers (parent proxy) will serve requests from users. For Scalability, the system can add proxy servers easily and quickly. To develop the system, the developer takes several approaches such as basic learning about proxy servers and related theories. Next is an analysis to build a system that supports Availability, Reliability, and Scalability. Then the analysis phase is implementedand testing of the system is built. Tests carried out are testing centralized cache systems and testing distributed cache systems. The test results will then be compared to see the performance comparison between centralized cache and distributed cache.

show abstract

EM-KDE: A locality-aware job scheduling policy with distributed semantic caches

Cited by 4 publications

References 29 publications

A comprehensive framework for the semantic cache systems

A comprehensive framework for the semantic cache systems

Real-time Transaction Scheduling Method for Distributed Database

Comparation of distributed cache and centralized cache on web proxy

Contact Info

Product

Resources

About