SPSE: A flexible QoS-based service scheduling algorithm for service-oriented Grid

Laiping Zhao, Yizhi Ren, Mingchu Li, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010
DOIs
Publication statusPublished - 2010
Event2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010 - Atlanta, GA, United States
Duration: Apr 19 2010Apr 23 2010

Other

Other2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010
CountryUnited States
CityAtlanta, GA
Period4/19/104/23/10

Fingerprint

Service-oriented
Search engines
Scheduling algorithms
Scheduling Algorithm
Quality of service
Grid
Grid computing
Personalization
Scalability
Search Engine
Internet
Web Search
User Preferences
Grid Computing
Experiments
Sort
Simulation Experiment
Schedule
Requirements

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Software
  • Theoretical Computer Science

Cite this

Zhao, L., Ren, Y., Li, M., & Sakurai, K. (2010). SPSE: A flexible QoS-based service scheduling algorithm for service-oriented Grid. In Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010 [5470920] https://doi.org/10.1109/IPDPSW.2010.5470920

SPSE : A flexible QoS-based service scheduling algorithm for service-oriented Grid. / Zhao, Laiping; Ren, Yizhi; Li, Mingchu; Sakurai, Kouichi.

Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010. 2010. 5470920.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhao, L, Ren, Y, Li, M & Sakurai, K 2010, SPSE: A flexible QoS-based service scheduling algorithm for service-oriented Grid. in Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010., 5470920, 2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010, Atlanta, GA, United States, 4/19/10. https://doi.org/10.1109/IPDPSW.2010.5470920
Zhao L, Ren Y, Li M, Sakurai K. SPSE: A flexible QoS-based service scheduling algorithm for service-oriented Grid. In Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010. 2010. 5470920 https://doi.org/10.1109/IPDPSW.2010.5470920
Zhao, Laiping ; Ren, Yizhi ; Li, Mingchu ; Sakurai, Kouichi. / SPSE : A flexible QoS-based service scheduling algorithm for service-oriented Grid. Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010. 2010.
@inproceedings{059baeb2ded94f02a6007ae3d12f1ac7,
title = "SPSE: A flexible QoS-based service scheduling algorithm for service-oriented Grid",
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.",
author = "Laiping Zhao and Yizhi Ren and Mingchu Li and Kouichi Sakurai",
year = "2010",
doi = "10.1109/IPDPSW.2010.5470920",
language = "English",
isbn = "9781424465347",
booktitle = "Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010",

}

TY - GEN

T1 - SPSE

T2 - A flexible QoS-based service scheduling algorithm for service-oriented Grid

AU - Zhao, Laiping

AU - Ren, Yizhi

AU - Li, Mingchu

AU - Sakurai, Kouichi

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77954073565&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77954073565&partnerID=8YFLogxK

U2 - 10.1109/IPDPSW.2010.5470920

DO - 10.1109/IPDPSW.2010.5470920

M3 - Conference contribution

AN - SCOPUS:77954073565

SN - 9781424465347

BT - Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010

ER -