Optimizing pipe-like mashup execution for improving resource utilization

Jingbo Xu; Hailong Sun; Xu Wang; Xudong Liu; Richong Zhang

doi:10.1109/SOCA.2012.6449434

Optimizing pipe-like mashup execution for improving resource utilization

Jingbo Xu^*
, Hailong Sun
, Xu Wang
, Xudong Liu
, Richong Zhang

^*Corresponding author for this work

Beihang University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

Mashup is usually created by end-users to provide new services by combining data or functionality from multiple sources on the Web. Given that a mashup may have millions of concurrent user access, it is essential to work out a framework to optimize the runtime engine hosting the running of a myriad of pipe-like mashups. According to our analysis, memory is the primary resource to run mashups and we work out a metric named PMT to measure the memory consumption. A scheduling framework is then put forward consisting of mashup decomposition and a PMT-aware scheduling policy, which is named 'lazy-start' designed to improve memory utilization. A set of experiments are performed to show the effectiveness and efficiency of this framework.

Original language	English
Title of host publication	Proceedings - 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012
DOIs	https://doi.org/10.1109/SOCA.2012.6449434
State	Published - 2012
Event	2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012 - Taipei, Taiwan, Province of China Duration: 17 Dec 2012 → 19 Dec 2012

Publication series

Name	Proceedings - 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012

Conference

Conference	2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012
Country/Territory	Taiwan, Province of China
City	Taipei
Period	17/12/12 → 19/12/12

Keywords

mashup
performance optimization
personalization
web 2.0
web service

Access to Document

10.1109/SOCA.2012.6449434

Cite this

Xu, J., Sun, H., Wang, X., Liu, X., & Zhang, R. (2012). Optimizing pipe-like mashup execution for improving resource utilization. In Proceedings - 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012 Article 6449434 (Proceedings - 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012). https://doi.org/10.1109/SOCA.2012.6449434

@inproceedings{5357ddb10e974e578097d0b89bebafcf,

title = "Optimizing pipe-like mashup execution for improving resource utilization",

abstract = "Mashup is usually created by end-users to provide new services by combining data or functionality from multiple sources on the Web. Given that a mashup may have millions of concurrent user access, it is essential to work out a framework to optimize the runtime engine hosting the running of a myriad of pipe-like mashups. According to our analysis, memory is the primary resource to run mashups and we work out a metric named PMT to measure the memory consumption. A scheduling framework is then put forward consisting of mashup decomposition and a PMT-aware scheduling policy, which is named 'lazy-start' designed to improve memory utilization. A set of experiments are performed to show the effectiveness and efficiency of this framework.",

keywords = "mashup, performance optimization, personalization, web 2.0, web service",

author = "Jingbo Xu and Hailong Sun and Xu Wang and Xudong Liu and Richong Zhang",

year = "2012",

doi = "10.1109/SOCA.2012.6449434",

language = "英语",

isbn = "9781467347754",

series = "Proceedings - 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012",

booktitle = "Proceedings - 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012",

note = "2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012 ; Conference date: 17-12-2012 Through 19-12-2012",

}

Xu, J, Sun, H, Wang, X, Liu, X & Zhang, R 2012, Optimizing pipe-like mashup execution for improving resource utilization. in Proceedings - 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012., 6449434, Proceedings - 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012, 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012, Taipei, Taiwan, Province of China, 17/12/12. https://doi.org/10.1109/SOCA.2012.6449434

Optimizing pipe-like mashup execution for improving resource utilization. / Xu, Jingbo; Sun, Hailong; Wang, Xu et al.
Proceedings - 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012. 2012. 6449434 (Proceedings - 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Optimizing pipe-like mashup execution for improving resource utilization

AU - Xu, Jingbo

AU - Sun, Hailong

AU - Wang, Xu

AU - Liu, Xudong

AU - Zhang, Richong

PY - 2012

Y1 - 2012

N2 - Mashup is usually created by end-users to provide new services by combining data or functionality from multiple sources on the Web. Given that a mashup may have millions of concurrent user access, it is essential to work out a framework to optimize the runtime engine hosting the running of a myriad of pipe-like mashups. According to our analysis, memory is the primary resource to run mashups and we work out a metric named PMT to measure the memory consumption. A scheduling framework is then put forward consisting of mashup decomposition and a PMT-aware scheduling policy, which is named 'lazy-start' designed to improve memory utilization. A set of experiments are performed to show the effectiveness and efficiency of this framework.

AB - Mashup is usually created by end-users to provide new services by combining data or functionality from multiple sources on the Web. Given that a mashup may have millions of concurrent user access, it is essential to work out a framework to optimize the runtime engine hosting the running of a myriad of pipe-like mashups. According to our analysis, memory is the primary resource to run mashups and we work out a metric named PMT to measure the memory consumption. A scheduling framework is then put forward consisting of mashup decomposition and a PMT-aware scheduling policy, which is named 'lazy-start' designed to improve memory utilization. A set of experiments are performed to show the effectiveness and efficiency of this framework.

KW - mashup

KW - performance optimization

KW - personalization

KW - web 2.0

KW - web service

UR - https://www.scopus.com/pages/publications/84874424890

U2 - 10.1109/SOCA.2012.6449434

DO - 10.1109/SOCA.2012.6449434

M3 - 会议稿件

AN - SCOPUS:84874424890

SN - 9781467347754

T3 - Proceedings - 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012

BT - Proceedings - 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012

T2 - 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012

Y2 - 17 December 2012 through 19 December 2012

ER -

Xu J, Sun H, Wang X, Liu X , Zhang R. Optimizing pipe-like mashup execution for improving resource utilization. In Proceedings - 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012. 2012. 6449434. (Proceedings - 2012 5th IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2012). doi: 10.1109/SOCA.2012.6449434

Optimizing pipe-like mashup execution for improving resource utilization

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this