| Title | The Research and Design of Calling and Testing System’s Task Autonomy Scheduling Algorithm |
| Abstract | With the scale of mobile network becoming larger and larger, market competition becoming more and more keen, users’ service demands are rising. Calling and Testing System is used for customer service on mobile network. It imitates the customers’ behavior and carries out tasks, and gets services condition by analyzing service performance index. This paper mainly researches calling and testing system’s task resource scheduling model, and gives a self-adapting scheduling algorithm which is suit for the system.The task resource scheduling algorithm has a relationship with tasks, resource and task resource scheduling model. Task type, the exclusive relationship between task and resource, task priority and task attribute determine the QOS demands of tasks. The computing ability of resource is depended on SID and RTD resource’s attributes. Under the framework of task resource scheduling model, the system gets the best scheduling sequence considering both the resource ability and the extent how the resource satisfies the QOS demands of tasks.Meta-task algorithms are suit for calling and testing system’s task resource scheduling model. This paper mentions three popular algorithms which are Min-Min, Max-Min and sufferage algorithm. Nowadays the Min-Min and Max-Min algorithm don’t consider the task priority, so they are not suitable for the system the paper mentions. Sufferage algorithm considers both task priority and the ability of task. This paper gives task-autonomy algorithm, which considers that the resource satisfies the QOS demands of tasks besides task priority and the usage ratio of resource, to select resource.At last, this paper shows a performance evaluation indexes of task resource scheduling algorithm. It measures the performance of algorithm by using makespan of task group and resource load. The paper emulate algorithm, and compare the performance indexes of task-autonomy algorithm and sufferage algorithm. In the end the paper summarizes this two algorithms’ advantages and disadvantages as well as their own suitable circumstances. |
| Category | Radio |
| Keywords | QoS, Resource Load, scheduling, task-autonomy, |
| FileType | |
| Pages | 187 |
| Price | US$80.00 |
| Buy Now | |
| Download | |
| Contact |
E-Mail:itpaper@hotmail.com TEL:1-888-786-998A |
| FAQ |
How to get this paper's electronic documents? 1, Click the "Buy Now" button to complete the online payment 2, Download the paper's electronic document from the successful payment return page/Or the system will send this paper's electronic document to your E-Mail within 24 hours |
| Favorite | ADD TO FAVORITE |
| Version | zh-cn |




