DocumentCode
2451369
Title
SPSE: A flexible QoS-based service scheduling algorithm for service-oriented Grid
Author
Zhao, Laiping ; Ren, Yizhi ; Li, Mingchu ; Sakurai, Kimio
Author_Institution
Dept. of Inf., Kyushu Univ., Fukuoka, Japan
fYear
2010
fDate
19-23 April 2010
Firstpage
1
Lastpage
8
Abstract
With the development of the Grid computing, increased attention is paid to services and user personalization. How to search and schedule the most suitable service for an end user direct affects the popularization use of service oriented Grid. Inspired from the mode of web search engine, such as Yahoo, Google, this paper proposes an innovative service searching and scheduling algorithm (SPSE: Service Providers Search Engine) for the Grid. The SPSE sorts all services from Internet and returns the most appropriate ones to the end user. Compared with the existing scheduling algorithms, our method is much more flexible in meeting user´s QoS requirements, especially supporting the multiobjective and user personalization. The related simulation experiments show that our method performs well in scalability, and can capture user´s preferences value precisely and automatically.
Keywords
Internet; grid computing; quality of service; scheduling; search engines; user interfaces; Internet; SPSE; Web search engine; flexible QoS-based service scheduling; grid computing; innovative service searching; service providers search engine; service-oriented grid; user personalization; Costs; Economic forecasting; Grid computing; Informatics; Processor scheduling; Quality of service; Scalability; Scheduling algorithm; Search engines; Web and internet services; Fuzzy ranking; Pareto optimal; QoS; Scheduling; Service-oriented Grid;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010 IEEE International Symposium on
Conference_Location
Atlanta, GA
Print_ISBN
978-1-4244-6533-0
Type
conf
DOI
10.1109/IPDPSW.2010.5470920
Filename
5470920
Link To Document