Social relation based cache scheduling algorithm for distributed caching systems

2014 ◽  
Author(s):  
Lei Yang
Keyword(s):  
Social Relation ◽  
Scheduling Algorithm ◽  
Distributed Caching ◽  
Cache Scheduling

Consistent Hashing and Real-Time Task Scheduling in Fog Computing

2022 ◽  
pp. 245-261
Author(s):  
Geetha J. J. ◽  
Jaya Lakshmi D. S. ◽  
Keerthana Ningaraju L. N.
Keyword(s):  
Real Time ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Fog Computing ◽  
Computation Time ◽  
Real Time Processing ◽  
Time Task ◽  
Distributed Caching ◽  
Consistent Hashing ◽  
Cloud Servers

Distributed caching is one such system used by dynamic high-traffic websites to process the incoming user requests to perform the required tasks in an efficient way. Distributed caching is currently employing hashing algorithm in order to serve its purpose. A significant drawback of hashing in this circumstance is the addition of new servers that would result in a change in the previous hashing method (rehashing), hence, goes into a rigmarole. Thus, we need an effective algorithm to address the problem. This technique has served as a solution for distributed and rehashing problems. Most of upcoming internet of things will have to be latency aware and will not afford the data transmission and computation time in the cloud servers. The real-time processing in proximal distance device would be much needed. Hence, the authors aim to employ a real-time task scheduling algorithm. Computations referring to the user requests that are to be handled by the servers can be efficiently handled by consistent hashing algorithms.

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

New Scheduling Algorithm Proposed for Real Time Traffic Over LTE Femto-Cell

2015 ◽  
Vol 5 (6) ◽  
pp. 383
Author(s):  
Mohammed Mahfoudi ◽  
Moulhime El Bekkali ◽  
Abdellah Najid ◽  
Mohamed El Ghazi ◽  
Said Mazer
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Real Time Traffic

Zero Forcing Beamforming Based Coordinated Scheduling Algorithm for Downlink Coordinated Multi-Point Transmission System

2015 ◽  
Vol E98.B (2) ◽  
pp. 352-359 ◽  
Author(s):  
Ping WANG ◽  
Lei DING ◽  
Huifang PANG ◽  
Fuqiang LIU ◽  
Nguyen Ngoc VAN
Keyword(s):  
Scheduling Algorithm ◽  
Transmission System ◽  
Zero Forcing ◽  
Coordinated Scheduling
Sign in / Sign up

Export Citation Format

Share Document