Static and dynamic scheduling algorithms for scalable Web server farm

2002 ◽  
Author(s):  
E. Casalicchio ◽  
S. Tucci
Keyword(s):  
Dynamic Scheduling ◽  
Web Server ◽  
Scheduling Algorithms

scholarly journals Exploring the Spectrum of Dynamic Scheduling Algorithms for Scalable Distributed-MemoryRay Tracing

2014 ◽  
Vol 20 (6) ◽  
pp. 893-906 ◽  
Author(s):  
Paul A. Navratil ◽  
Hank Childs ◽  
Donald S. Fussell ◽  
Calvin Lin
Keyword(s):  
Dynamic Scheduling ◽  
Scheduling Algorithms

scholarly journals REVIEW OF TASK SCHEDULING METHODS FOR REAL TIME TASKS IN CLOUD ENVIRONMENT

2020 ◽  
Vol 5 (1) ◽  
pp. 85-89
Author(s):  
Dinkan Patel ◽  
Anjuman Ranavadiya
Keyword(s):  
Cloud Computing ◽  
Real Time ◽  
Task Scheduling ◽  
Virtual Machines ◽  
Dynamic Scheduling ◽  
Scheduling Algorithms ◽  
Minimum Time ◽  
Cloud Environment ◽  
Static Scheduling ◽  
On Demand

Cloud Computing is a type of Internet model that enables convenient, on-demand resources that can be used rapidly and with minimum effort. Cloud Computing can be IaaS, PaaS or SaaS. Scheduling of these tasks is important so that resources can be utilized efficiently with minimum time which in turn gives better performance. Real time tasks require dynamic scheduling as tasks cannot be known in advance as in static scheduling approach. There are different task scheduling algorithms that can be utilized to increase the performance in real time and performing these on virtual machines can prove to be useful. Here a review of various task scheduling algorithms is done which can be used to perform the task and allocate resources so that performance can be increased.

scholarly journals Analisis Perbandingan Algoritma Static Round-Robin dengan Least-Connection Terhadap Efisiensi Load Balancing pada Load Balancer Haproxy

2019 ◽  
Vol 4 (1) ◽  
pp. 70-75
Author(s):  
Hasta Triangga ◽  
Ilham Faisal ◽  
Imran Lubis
Keyword(s):  
Load Balancing ◽  
Operating Systems ◽  
Web Server ◽  
Scheduling Algorithms ◽  
Round Robin ◽  
Average Throughput ◽  
Total Delay ◽  
Average Percentage ◽  
Cpu Usage ◽  
Load Balancer

In IT networking, load balancing used to share the traffic between backend servers. The idea is to make effective and efficient load sharing. Load balancing uses scheduling algorithms in the process includes Static round-robin and Least-connection algorithm. Haproxy is a load balancer that can be used to perform the load balancing technique and run by Linux operating systems. In this research, Haproxy uses 4 Nginx web server as backend servers. Haproxy act as a reverse proxy which accessed by the client while the backend servers handle HTTP requests. The experiment involves 20 Client PCs that are used to perform HTTP requests simultaneously, using the Static round-robin algorithm and Least-connection on the haproxy load balancer alternately. When using Static round-robin algorithm, the results obtained average percentages of CPU usage successively for 1 minute; 5 minutes; and 15 minutes are; 0.1%; 0.25%; and 1.15% with average throughput produced is 14.74 kbps. Average total delay produced 64.3 kbps. The average total delay and jitter is 181.3 ms and 11.1 ms, respectively. As for the Least-connection algorithm average percentage obtained successively for 1 minute; 5 minutes; and 15 minutes are 0.1%; 0.3%; and 1.25% with the average throughput produced is 14.66 kbps. The average total delay and jitter is 350.3 ms and 24.5 ms, respectively. It means Static round-robin algorithm is more efficient than the algorithms Least-connection because it can produce a greater throughput with less CPU load and less total delay.

scholarly journals Genealogy of hard real-time preemptive scheduling algorithms for identical multiprocessors

2011 ◽  
Vol 1 (3) ◽  
Author(s):  
Dirk Müller ◽  
Matthias Werner
Keyword(s):  
Real Time ◽  
Dynamic Scheduling ◽  
Scheduling Algorithms ◽  
Real Time Scheduling ◽  
Context Switching ◽  
Migration Dynamics ◽  
Time Scheduling ◽  
And Migration ◽  
Hard Real Time ◽  
Full Utilization

AbstractWith the advent of multi-core computer systems, real-time (RT) scheduling on multiprocessors (MPs) is gaining more and more practical relevance. Basic algorithms developed in the 1970s or earlier are strongly influential on state-of-the-art preemptive hard real-time scheduling algorithms. These relationships will be revealed and visualized by four genealogies. Here, the two classification dimensions prioritization dynamics and migration dynamics serve as a framework for the systematization. Finally, such genealogical reconstructions could even lead to the discovery of new algorithms. An extra look will be devoted to the group of fully dynamic scheduling algorithms with full migration in which algorithms can reach full utilization, neglecting scheduling and context switching overheads. The important question for a set of RT scheduling algorithms serving as a basis for more sophisticated ones will be dealt with.

Sign in / Sign up

Export Citation Format

Share Document