Loading…

Deadline-sensitive workflow orchestration without explicit resource control

Deadline-sensitive workflows require careful coordination of user constraints with resource availability. Current distributed resource access models provide varying degrees of resource control: from limited or none in grid batch systems to explicit in cloud systems. Additionally applications experie...

Full description

Saved in:
Bibliographic Details
Published in:Journal of parallel and distributed computing 2011-03, Vol.71 (3), p.343-353
Main Authors: Ramakrishnan, Lavanya, Chase, Jeffrey S., Gannon, Dennis, Nurmi, Daniel, Wolski, Rich
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c406t-50de77fe0bd50ee4bc55ec2df99213c6d48c03a59939e37560462c50712158123
cites cdi_FETCH-LOGICAL-c406t-50de77fe0bd50ee4bc55ec2df99213c6d48c03a59939e37560462c50712158123
container_end_page 353
container_issue 3
container_start_page 343
container_title Journal of parallel and distributed computing
container_volume 71
creator Ramakrishnan, Lavanya
Chase, Jeffrey S.
Gannon, Dennis
Nurmi, Daniel
Wolski, Rich
description Deadline-sensitive workflows require careful coordination of user constraints with resource availability. Current distributed resource access models provide varying degrees of resource control: from limited or none in grid batch systems to explicit in cloud systems. Additionally applications experience variability due to competing user loads, performance variations, failures, etc. These variations impact the quality of service (QoS) that goes unaccounted for in planning strategies. In this paper we propose Workflow ORchestrator for Distributed Systems ( WORDS) architecture based on a least common denominator resource model that abstracts the differences and captures the QoS properties provided by grid and cloud systems. We investigate algorithms for effective orchestration (i.e., resource procurement and task mapping) for deadline-sensitive workflows atop the resource abstraction provided in WORDS. Our evaluation compares orchestration methodologies over TeraGrid and Amazon EC2 systems. Experimental results show that WORDS enables effective orchestration possible at reasonable costs on batch queue grid and cloud systems with or without explicit resource control. ► Separation of concerns between resources and application layers. ► Resource abstraction to represent resource properties. ► Probabilistic Quality of Service model. ► Workflow Orchestration for Deadline-Sensitive Workflows.
doi_str_mv 10.1016/j.jpdc.2010.11.010
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_864415765</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S074373151000242X</els_id><sourcerecordid>864415765</sourcerecordid><originalsourceid>FETCH-LOGICAL-c406t-50de77fe0bd50ee4bc55ec2df99213c6d48c03a59939e37560462c50712158123</originalsourceid><addsrcrecordid>eNp9UMtOwzAQtBBIlMcPcMoFcUrwJnEeEhdUnqISFzhb7majOqRxsJ0W_p6EVhw5jbSamZ0Zxi6AR8Ahu26ipq8wivl0gGiEAzYDXmYhL9LikM14niZhnoA4ZifONZwDiLyYsZc7UlWrOwoddU57vaFga-xH3ZptYCyuyHmrvDZdsNV-ZQYf0FffatQ-sOTMYJECNJ23pj1jR7VqHZ3v8ZS9P9y_zZ_Cxevj8_x2EWLKMx8KXlGe18SXleBE6RKFIIyruixjSDCr0gJ5okRZJiUluch4msUoeA4xiALi5JRd7Xx7az6HMaBca4fUtqojMzhZZGk6tsvEyIx3TLTGOUu17K1eK_stgctpONnIaTg5DScB5Aij6HJvrxyqtraqQ-3-lHFSAuS_MW52PBq7bjRZ6VBTh1RpS-hlZfR_b34APteEaw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>864415765</pqid></control><display><type>article</type><title>Deadline-sensitive workflow orchestration without explicit resource control</title><source>Elsevier</source><creator>Ramakrishnan, Lavanya ; Chase, Jeffrey S. ; Gannon, Dennis ; Nurmi, Daniel ; Wolski, Rich</creator><creatorcontrib>Ramakrishnan, Lavanya ; Chase, Jeffrey S. ; Gannon, Dennis ; Nurmi, Daniel ; Wolski, Rich</creatorcontrib><description>Deadline-sensitive workflows require careful coordination of user constraints with resource availability. Current distributed resource access models provide varying degrees of resource control: from limited or none in grid batch systems to explicit in cloud systems. Additionally applications experience variability due to competing user loads, performance variations, failures, etc. These variations impact the quality of service (QoS) that goes unaccounted for in planning strategies. In this paper we propose Workflow ORchestrator for Distributed Systems ( WORDS) architecture based on a least common denominator resource model that abstracts the differences and captures the QoS properties provided by grid and cloud systems. We investigate algorithms for effective orchestration (i.e., resource procurement and task mapping) for deadline-sensitive workflows atop the resource abstraction provided in WORDS. Our evaluation compares orchestration methodologies over TeraGrid and Amazon EC2 systems. Experimental results show that WORDS enables effective orchestration possible at reasonable costs on batch queue grid and cloud systems with or without explicit resource control. ► Separation of concerns between resources and application layers. ► Resource abstraction to represent resource properties. ► Probabilistic Quality of Service model. ► Workflow Orchestration for Deadline-Sensitive Workflows.</description><identifier>ISSN: 0743-7315</identifier><identifier>EISSN: 1096-0848</identifier><identifier>DOI: 10.1016/j.jpdc.2010.11.010</identifier><language>eng</language><publisher>Amsterdam: Elsevier Inc</publisher><subject>Algorithms ; Applied sciences ; Cloud computing ; Clouds ; Computer networks ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Control systems ; Deadline-sensitive workflows ; Distributed processing ; Exact sciences and technology ; Failure ; Grid computing ; Information systems. Data bases ; Mathematical models ; Memory organisation. Data processing ; Orchestration ; Software ; Workflow ; Workflow scheduling</subject><ispartof>Journal of parallel and distributed computing, 2011-03, Vol.71 (3), p.343-353</ispartof><rights>2010 Elsevier Inc.</rights><rights>2015 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c406t-50de77fe0bd50ee4bc55ec2df99213c6d48c03a59939e37560462c50712158123</citedby><cites>FETCH-LOGICAL-c406t-50de77fe0bd50ee4bc55ec2df99213c6d48c03a59939e37560462c50712158123</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=23911712$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Ramakrishnan, Lavanya</creatorcontrib><creatorcontrib>Chase, Jeffrey S.</creatorcontrib><creatorcontrib>Gannon, Dennis</creatorcontrib><creatorcontrib>Nurmi, Daniel</creatorcontrib><creatorcontrib>Wolski, Rich</creatorcontrib><title>Deadline-sensitive workflow orchestration without explicit resource control</title><title>Journal of parallel and distributed computing</title><description>Deadline-sensitive workflows require careful coordination of user constraints with resource availability. Current distributed resource access models provide varying degrees of resource control: from limited or none in grid batch systems to explicit in cloud systems. Additionally applications experience variability due to competing user loads, performance variations, failures, etc. These variations impact the quality of service (QoS) that goes unaccounted for in planning strategies. In this paper we propose Workflow ORchestrator for Distributed Systems ( WORDS) architecture based on a least common denominator resource model that abstracts the differences and captures the QoS properties provided by grid and cloud systems. We investigate algorithms for effective orchestration (i.e., resource procurement and task mapping) for deadline-sensitive workflows atop the resource abstraction provided in WORDS. Our evaluation compares orchestration methodologies over TeraGrid and Amazon EC2 systems. Experimental results show that WORDS enables effective orchestration possible at reasonable costs on batch queue grid and cloud systems with or without explicit resource control. ► Separation of concerns between resources and application layers. ► Resource abstraction to represent resource properties. ► Probabilistic Quality of Service model. ► Workflow Orchestration for Deadline-Sensitive Workflows.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Cloud computing</subject><subject>Clouds</subject><subject>Computer networks</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Control systems</subject><subject>Deadline-sensitive workflows</subject><subject>Distributed processing</subject><subject>Exact sciences and technology</subject><subject>Failure</subject><subject>Grid computing</subject><subject>Information systems. Data bases</subject><subject>Mathematical models</subject><subject>Memory organisation. Data processing</subject><subject>Orchestration</subject><subject>Software</subject><subject>Workflow</subject><subject>Workflow scheduling</subject><issn>0743-7315</issn><issn>1096-0848</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNp9UMtOwzAQtBBIlMcPcMoFcUrwJnEeEhdUnqISFzhb7majOqRxsJ0W_p6EVhw5jbSamZ0Zxi6AR8Ahu26ipq8wivl0gGiEAzYDXmYhL9LikM14niZhnoA4ZifONZwDiLyYsZc7UlWrOwoddU57vaFga-xH3ZptYCyuyHmrvDZdsNV-ZQYf0FffatQ-sOTMYJECNJ23pj1jR7VqHZ3v8ZS9P9y_zZ_Cxevj8_x2EWLKMx8KXlGe18SXleBE6RKFIIyruixjSDCr0gJ5okRZJiUluch4msUoeA4xiALi5JRd7Xx7az6HMaBca4fUtqojMzhZZGk6tsvEyIx3TLTGOUu17K1eK_stgctpONnIaTg5DScB5Aij6HJvrxyqtraqQ-3-lHFSAuS_MW52PBq7bjRZ6VBTh1RpS-hlZfR_b34APteEaw</recordid><startdate>20110301</startdate><enddate>20110301</enddate><creator>Ramakrishnan, Lavanya</creator><creator>Chase, Jeffrey S.</creator><creator>Gannon, Dennis</creator><creator>Nurmi, Daniel</creator><creator>Wolski, Rich</creator><general>Elsevier Inc</general><general>Elsevier</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20110301</creationdate><title>Deadline-sensitive workflow orchestration without explicit resource control</title><author>Ramakrishnan, Lavanya ; Chase, Jeffrey S. ; Gannon, Dennis ; Nurmi, Daniel ; Wolski, Rich</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c406t-50de77fe0bd50ee4bc55ec2df99213c6d48c03a59939e37560462c50712158123</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Cloud computing</topic><topic>Clouds</topic><topic>Computer networks</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Control systems</topic><topic>Deadline-sensitive workflows</topic><topic>Distributed processing</topic><topic>Exact sciences and technology</topic><topic>Failure</topic><topic>Grid computing</topic><topic>Information systems. Data bases</topic><topic>Mathematical models</topic><topic>Memory organisation. Data processing</topic><topic>Orchestration</topic><topic>Software</topic><topic>Workflow</topic><topic>Workflow scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ramakrishnan, Lavanya</creatorcontrib><creatorcontrib>Chase, Jeffrey S.</creatorcontrib><creatorcontrib>Gannon, Dennis</creatorcontrib><creatorcontrib>Nurmi, Daniel</creatorcontrib><creatorcontrib>Wolski, Rich</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of parallel and distributed computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ramakrishnan, Lavanya</au><au>Chase, Jeffrey S.</au><au>Gannon, Dennis</au><au>Nurmi, Daniel</au><au>Wolski, Rich</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Deadline-sensitive workflow orchestration without explicit resource control</atitle><jtitle>Journal of parallel and distributed computing</jtitle><date>2011-03-01</date><risdate>2011</risdate><volume>71</volume><issue>3</issue><spage>343</spage><epage>353</epage><pages>343-353</pages><issn>0743-7315</issn><eissn>1096-0848</eissn><abstract>Deadline-sensitive workflows require careful coordination of user constraints with resource availability. Current distributed resource access models provide varying degrees of resource control: from limited or none in grid batch systems to explicit in cloud systems. Additionally applications experience variability due to competing user loads, performance variations, failures, etc. These variations impact the quality of service (QoS) that goes unaccounted for in planning strategies. In this paper we propose Workflow ORchestrator for Distributed Systems ( WORDS) architecture based on a least common denominator resource model that abstracts the differences and captures the QoS properties provided by grid and cloud systems. We investigate algorithms for effective orchestration (i.e., resource procurement and task mapping) for deadline-sensitive workflows atop the resource abstraction provided in WORDS. Our evaluation compares orchestration methodologies over TeraGrid and Amazon EC2 systems. Experimental results show that WORDS enables effective orchestration possible at reasonable costs on batch queue grid and cloud systems with or without explicit resource control. ► Separation of concerns between resources and application layers. ► Resource abstraction to represent resource properties. ► Probabilistic Quality of Service model. ► Workflow Orchestration for Deadline-Sensitive Workflows.</abstract><cop>Amsterdam</cop><pub>Elsevier Inc</pub><doi>10.1016/j.jpdc.2010.11.010</doi><tpages>11</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0743-7315
ispartof Journal of parallel and distributed computing, 2011-03, Vol.71 (3), p.343-353
issn 0743-7315
1096-0848
language eng
recordid cdi_proquest_miscellaneous_864415765
source Elsevier
subjects Algorithms
Applied sciences
Cloud computing
Clouds
Computer networks
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Control systems
Deadline-sensitive workflows
Distributed processing
Exact sciences and technology
Failure
Grid computing
Information systems. Data bases
Mathematical models
Memory organisation. Data processing
Orchestration
Software
Workflow
Workflow scheduling
title Deadline-sensitive workflow orchestration without explicit resource control
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T09%3A35%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Deadline-sensitive%20workflow%20orchestration%20without%20explicit%20resource%20control&rft.jtitle=Journal%20of%20parallel%20and%20distributed%20computing&rft.au=Ramakrishnan,%20Lavanya&rft.date=2011-03-01&rft.volume=71&rft.issue=3&rft.spage=343&rft.epage=353&rft.pages=343-353&rft.issn=0743-7315&rft.eissn=1096-0848&rft_id=info:doi/10.1016/j.jpdc.2010.11.010&rft_dat=%3Cproquest_cross%3E864415765%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c406t-50de77fe0bd50ee4bc55ec2df99213c6d48c03a59939e37560462c50712158123%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=864415765&rft_id=info:pmid/&rfr_iscdi=true