Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A popular b site is expected to deal with a large number of requests simultaneously in the reasonable mean response time. The performance of the b sites mainly relies on hardware performance and the processing strategy of requests. In order to improve the hardware performance, more and more b servers are adopting multi-core CPUs. Moreover, the scheduling algorithm of requests on basis of first-come-first-served (FCFS) is still utilized. Although FCFS is a reasonable and fair strategy for requests sequence, it doesn’t take the distribution of the dynamic requests service time and the characteristic of multi-core CPUs into account. , in order to solve the above problems, a new dynamic requests scheduling model is presented. The new scheduling model, according to the distribution of the dynamic request service time, schedule the dynamic request based on ight-fair-queueing (WFQ), and exploit the performance of multi-core CPUs by means of hard affinity in O/S. Simulation Experiments has been done to evaluate the new scheduling approach, and the results show that the new scheduling model can reduce the mean response time efficiently.
['Guohua You', 'Ying Zhao']
I am writing a research paper on a idea Dynamic Requests Scheduling Model in Multi-core Web Server
[{"from": "human", "value": "I am writing a research paper on a idea Dynamic Requests Scheduling Model in Multi-core Web Server"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A popular b site is expected to deal with a large number of requests simultaneously in the reasonable mean response time. The performance of the b sites mainly relies on hardware performance and the processing strategy of requests. In order to improve the hardware performance, more and more b servers are adopting multi-core CPUs. Moreover, the scheduling algorithm of requests on basis of first-come-first-served (FCFS) is still utilized. Although FCFS is a reasonable and fair strategy for requests sequence, it doesn\u2019t take the distribution of the dynamic requests service time and the characteristic of multi-core CPUs into account. , in order to solve the above problems, a new dynamic requests scheduling model is presented. The new scheduling model, according to the distribution of the dynamic request service time, schedule the dynamic request based on ight-fair-queueing (WFQ), and exploit the performance of multi-core CPUs by means of hard affinity in O/S. Simulation Experiments has been done to evaluate the new scheduling approach, and the results show that the new scheduling model can reduce the mean response time efficiently."}]