 |
Service Request Scheduling based on Quantification Principle using... |
 |
by International Journal of Electrical and Computer Engineering (IJECE) |
 |
Thumbnail |
|
Download |
 |
Web page |
|
|
|
Service request scheduling has a major impact on the |
|
performance of the |
|
service processing design in a large-scale distributed |
|
computing environment |
|
like cloud systems. It is desirable to have a service |
|
request scheduling |
|
principle that evenly distributes the workload among the |
|
servers, according |
|
to their capacities. The capacities of the servers are |
|
termed high or low |
|
relative to one another. Therefore, there is a need to |
|
quantify the server |
|
capacity to overcome this subjective assessment. |
|
Subsequently, a method to |
|
split and distribute the service requests based on this |
|
quantified server |
|
capacity is also needed. The novelty of this research |
|
paper is to address these |
|
requirements by devising a service request scheduling |
|
principle for a |
|
heterogeneous distributed system using appropriate |
|
statistical methods, |
|
namely Conjoint analysis and Z-score. Suitable |
|
experiments were conducted |
|
and the experimental results show considerable |
|
improvement in the |
|
performance of the designed service request scheduling |
|
principle compared |
|
to a few other existing principles. Areas of further |
|
improvement have also |
|
been identified and presented. |
|
|
|
Date Published: 2022-08-05 06:49:15 |
|
Identifier: 10.11591ijece.v8i2.pp1238-1246 |
|
Item Size: 7214228 |
|
Media Type: texts |
|
|
|
# Topics |
|
Cloud computing |
|
Conjoint analysis |
|
Service request scheduling |
|
Scheduling principles |
|
Z-score |
|
|
|
# Collections |
|
journals_contributions |
|
journals |
|
|
|
# Uploaded by |
|
@ijece1 |
|
|
|
# Similar Items |
|
View similar items |
|
|
|
PHAROS |
|
