P2PScheMe: a P2P scheduling mechanism for workflows in grid computing
Identifieur interne : 000335 ( Istex/Corpus ); précédent : 000334; suivant : 000336P2PScheMe: a P2P scheduling mechanism for workflows in grid computing
Auteurs : João Marcelo U. De Alencar ; Rossana M. C. Andrade ; Windson Viana ; Bruno SchulzeSource :
- Concurrency and Computation: Practice and Experience [ 1532-0626 ] ; 2012-09-10.
Abstract
Complex scientific experiments have a growing demand for computational resources, which are expensive to be acquired and maintained. Grid computing has emerged as the mainstream technology to solve this issue. Grids are also adequate for the execution of scientific workflows because they allow the use of heterogeneous and distributed resources. In spite of the progress in grid technology, there are challenges to overcome in workflow scheduling. For instance, centralized scheduling solutions may lead to performance degradation and to problems with scalability. Some scheduling approaches are partially distributed, keeping a few centralized components that may become bottlenecks. Other distributed solutions have a lack of flexibility in the definition of workflows, in which only the use of tasks as steps in the workflow is permitted not high level services. In this work, we present P2PScheMe, a scheduling mechanism for peer‐to‐peer execution of workflows based on the invocation of grid services. The proposal considers information regarding grid execution environment in order to allow workflow scheduling adaptation. This adaptation is performed according to user requirements of quality of service. In this paper, we describe how P2PScheMe works and provides a comparative analysis with existing solutions. Copyright © 2011 John Wiley & Sons, Ltd.
Url:
DOI: 10.1002/cpe.1899
Links to Exploration step
ISTEX:959048CE3757990B6B3EEB8078651EBDAACF3941Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">P2PScheMe: a P2P scheduling mechanism for workflows in grid computing</title><author><name sortKey="De Alencar, Joao Marcelo U" sort="De Alencar, Joao Marcelo U" uniqKey="De Alencar J" first="João Marcelo U." last="De Alencar">João Marcelo U. De Alencar</name><affiliation><mods:affiliation>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE, Brazil</mods:affiliation></affiliation><affiliation><mods:affiliation>Quixadá Campus Academic Department, UFC, CE, Quixadá, Brazil</mods:affiliation></affiliation><affiliation><mods:affiliation>João Marcelo U. de Alencar, GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University of Ceará, Av. Mister Hull, s/n ‐ Campus do Pici ‐ Block Number 942A ‐ CEP: 60455‐760 ‐ Fortaleza ‐ CE ‐ Brazil.E‐mail:</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: joao.marcelo@ufc.br</mods:affiliation></affiliation></author><author><name sortKey="Andrade, Rossana M C" sort="Andrade, Rossana M C" uniqKey="Andrade R" first="Rossana M. C." last="Andrade">Rossana M. C. Andrade</name><affiliation><mods:affiliation>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE, Brazil</mods:affiliation></affiliation><affiliation><mods:affiliation>Department Of Computer Science, UFC, CE, Fortaleza, Brazil</mods:affiliation></affiliation></author><author><name sortKey="Viana, Windson" sort="Viana, Windson" uniqKey="Viana W" first="Windson" last="Viana">Windson Viana</name><affiliation><mods:affiliation>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE, Brazil</mods:affiliation></affiliation><affiliation><mods:affiliation>UFC Virtual Institute, CE, Fortaleza, Brazil</mods:affiliation></affiliation></author><author><name sortKey="Schulze, Bruno" sort="Schulze, Bruno" uniqKey="Schulze B" first="Bruno" last="Schulze">Bruno Schulze</name><affiliation><mods:affiliation>LNCC ‐ National Laboratory for Scientific Computing, RJ, Petrópolis, Brazil</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:959048CE3757990B6B3EEB8078651EBDAACF3941</idno><date when="2012" year="2012">2012</date><idno type="doi">10.1002/cpe.1899</idno><idno type="url">https://api.istex.fr/document/959048CE3757990B6B3EEB8078651EBDAACF3941/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000335</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">P2PScheMe: a P2P scheduling mechanism for workflows in grid computing</title><author><name sortKey="De Alencar, Joao Marcelo U" sort="De Alencar, Joao Marcelo U" uniqKey="De Alencar J" first="João Marcelo U." last="De Alencar">João Marcelo U. De Alencar</name><affiliation><mods:affiliation>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE, Brazil</mods:affiliation></affiliation><affiliation><mods:affiliation>Quixadá Campus Academic Department, UFC, CE, Quixadá, Brazil</mods:affiliation></affiliation><affiliation><mods:affiliation>João Marcelo U. de Alencar, GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University of Ceará, Av. Mister Hull, s/n ‐ Campus do Pici ‐ Block Number 942A ‐ CEP: 60455‐760 ‐ Fortaleza ‐ CE ‐ Brazil.E‐mail:</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: joao.marcelo@ufc.br</mods:affiliation></affiliation></author><author><name sortKey="Andrade, Rossana M C" sort="Andrade, Rossana M C" uniqKey="Andrade R" first="Rossana M. C." last="Andrade">Rossana M. C. Andrade</name><affiliation><mods:affiliation>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE, Brazil</mods:affiliation></affiliation><affiliation><mods:affiliation>Department Of Computer Science, UFC, CE, Fortaleza, Brazil</mods:affiliation></affiliation></author><author><name sortKey="Viana, Windson" sort="Viana, Windson" uniqKey="Viana W" first="Windson" last="Viana">Windson Viana</name><affiliation><mods:affiliation>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE, Brazil</mods:affiliation></affiliation><affiliation><mods:affiliation>UFC Virtual Institute, CE, Fortaleza, Brazil</mods:affiliation></affiliation></author><author><name sortKey="Schulze, Bruno" sort="Schulze, Bruno" uniqKey="Schulze B" first="Bruno" last="Schulze">Bruno Schulze</name><affiliation><mods:affiliation>LNCC ‐ National Laboratory for Scientific Computing, RJ, Petrópolis, Brazil</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Concurrency and Computation: Practice and Experience</title><title level="j" type="abbrev">Concurrency Computat.: Pract. Exper.</title><idno type="ISSN">1532-0626</idno><idno type="eISSN">1532-0634</idno><imprint><publisher>John Wiley & Sons, Ltd</publisher><pubPlace>Chichester, UK</pubPlace><date type="published" when="2012-09-10">2012-09-10</date><biblScope unit="volume">24</biblScope><biblScope unit="issue">13</biblScope><biblScope unit="page" from="1478">1478</biblScope><biblScope unit="page" to="1496">1496</biblScope></imprint><idno type="ISSN">1532-0626</idno></series><idno type="istex">959048CE3757990B6B3EEB8078651EBDAACF3941</idno><idno type="DOI">10.1002/cpe.1899</idno><idno type="ArticleID">CPE1899</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1532-0626</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract">Complex scientific experiments have a growing demand for computational resources, which are expensive to be acquired and maintained. Grid computing has emerged as the mainstream technology to solve this issue. Grids are also adequate for the execution of scientific workflows because they allow the use of heterogeneous and distributed resources. In spite of the progress in grid technology, there are challenges to overcome in workflow scheduling. For instance, centralized scheduling solutions may lead to performance degradation and to problems with scalability. Some scheduling approaches are partially distributed, keeping a few centralized components that may become bottlenecks. Other distributed solutions have a lack of flexibility in the definition of workflows, in which only the use of tasks as steps in the workflow is permitted not high level services. In this work, we present P2PScheMe, a scheduling mechanism for peer‐to‐peer execution of workflows based on the invocation of grid services. The proposal considers information regarding grid execution environment in order to allow workflow scheduling adaptation. This adaptation is performed according to user requirements of quality of service. In this paper, we describe how P2PScheMe works and provides a comparative analysis with existing solutions. Copyright © 2011 John Wiley & Sons, Ltd.</div></front></TEI><istex><corpusName>wiley</corpusName><author><json:item><name>João Marcelo U. de Alencar</name><affiliations><json:string>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE, Brazil</json:string><json:string>Quixadá Campus Academic Department, UFC, CE, Quixadá, Brazil</json:string><json:string>João Marcelo U. de Alencar, GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University of Ceará, Av. Mister Hull, s/n ‐ Campus do Pici ‐ Block Number 942A ‐ CEP: 60455‐760 ‐ Fortaleza ‐ CE ‐ Brazil.E‐mail:</json:string><json:string>E-mail: joao.marcelo@ufc.br</json:string></affiliations></json:item><json:item><name>Rossana M.C. Andrade</name><affiliations><json:string>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE, Brazil</json:string><json:string>Department Of Computer Science, UFC, CE, Fortaleza, Brazil</json:string></affiliations></json:item><json:item><name>Windson Viana</name><affiliations><json:string>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE, Brazil</json:string><json:string>UFC Virtual Institute, CE, Fortaleza, Brazil</json:string></affiliations></json:item><json:item><name>Bruno Schulze</name><affiliations><json:string>LNCC ‐ National Laboratory for Scientific Computing, RJ, Petrópolis, Brazil</json:string></affiliations></json:item></author><subject><json:item><lang><json:string>eng</json:string></lang><value>grid computing</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>peer‐to‐peer</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>workflows</value></json:item></subject><articleId><json:string>CPE1899</json:string></articleId><language><json:string>eng</json:string></language><originalGenre><json:string>article</json:string></originalGenre><abstract>Complex scientific experiments have a growing demand for computational resources, which are expensive to be acquired and maintained. Grid computing has emerged as the mainstream technology to solve this issue. Grids are also adequate for the execution of scientific workflows because they allow the use of heterogeneous and distributed resources. In spite of the progress in grid technology, there are challenges to overcome in workflow scheduling. For instance, centralized scheduling solutions may lead to performance degradation and to problems with scalability. Some scheduling approaches are partially distributed, keeping a few centralized components that may become bottlenecks. Other distributed solutions have a lack of flexibility in the definition of workflows, in which only the use of tasks as steps in the workflow is permitted not high level services. In this work, we present P2PScheMe, a scheduling mechanism for peer‐to‐peer execution of workflows based on the invocation of grid services. The proposal considers information regarding grid execution environment in order to allow workflow scheduling adaptation. This adaptation is performed according to user requirements of quality of service. In this paper, we describe how P2PScheMe works and provides a comparative analysis with existing solutions. Copyright © 2011 John Wiley & Sons, Ltd.</abstract><qualityIndicators><score>7.888</score><pdfVersion>1.4</pdfVersion><pdfPageSize>595.276 x 782.362 pts</pdfPageSize><refBibsNative>true</refBibsNative><keywordCount>3</keywordCount><abstractCharCount>1361</abstractCharCount><pdfWordCount>9175</pdfWordCount><pdfCharCount>54069</pdfCharCount><pdfPageCount>19</pdfPageCount><abstractWordCount>199</abstractWordCount></qualityIndicators><title>P2PScheMe: a P2P scheduling mechanism for workflows in grid computing</title><genre><json:string>article</json:string></genre><host><volume>24</volume><editor><json:item><name>Bruno Schulze</name></json:item><json:item><name>Rajkumar Buyya</name></json:item><json:item><name>Fabio Porto</name></json:item></editor><publisherId><json:string>CPE</json:string></publisherId><pages><total>19</total><last>1496</last><first>1478</first></pages><issn><json:string>1532-0626</json:string></issn><issue>13</issue><subject><json:item><value>Special Issue Paper</value></json:item></subject><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><eissn><json:string>1532-0634</json:string></eissn><title>Concurrency and Computation: Practice and Experience</title><doi><json:string>10.1002/(ISSN)1532-0634</json:string></doi></host><publicationDate>2012</publicationDate><copyrightDate>2012</copyrightDate><doi><json:string>10.1002/cpe.1899</json:string></doi><id>959048CE3757990B6B3EEB8078651EBDAACF3941</id><score>0.19755524</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/959048CE3757990B6B3EEB8078651EBDAACF3941/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/959048CE3757990B6B3EEB8078651EBDAACF3941/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/959048CE3757990B6B3EEB8078651EBDAACF3941/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">P2PScheMe: a P2P scheduling mechanism for workflows in grid computing</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>John Wiley & Sons, Ltd</publisher><pubPlace>Chichester, UK</pubPlace><availability><p>Copyright © 2012 John Wiley & Sons, Ltd.Copyright © 2011 John Wiley & Sons, Ltd.</p></availability><date>2011-12</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">P2PScheMe: a P2P scheduling mechanism for workflows in grid computing</title><author xml:id="author-1"><persName><forename type="first">João Marcelo U.</forename><surname>de Alencar</surname></persName><email>joao.marcelo@ufc.br</email><affiliation>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE, Brazil</affiliation><affiliation>Quixadá Campus Academic Department, UFC, CE, Quixadá, Brazil</affiliation><affiliation>João Marcelo U. de Alencar, GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University of Ceará, Av. Mister Hull, s/n ‐ Campus do Pici ‐ Block Number 942A ‐ CEP: 60455‐760 ‐ Fortaleza ‐ CE ‐ Brazil.E‐mail:</affiliation></author><author xml:id="author-2"><persName><forename type="first">Rossana M.C.</forename><surname>Andrade</surname></persName><affiliation>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE, Brazil</affiliation><affiliation>Department Of Computer Science, UFC, CE, Fortaleza, Brazil</affiliation></author><author xml:id="author-3"><persName><forename type="first">Windson</forename><surname>Viana</surname></persName><affiliation>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE, Brazil</affiliation><affiliation>UFC Virtual Institute, CE, Fortaleza, Brazil</affiliation></author><author xml:id="author-4"><persName><forename type="first">Bruno</forename><surname>Schulze</surname></persName><affiliation>LNCC ‐ National Laboratory for Scientific Computing, RJ, Petrópolis, Brazil</affiliation></author></analytic><monogr><title level="j">Concurrency and Computation: Practice and Experience</title><title level="j" type="abbrev">Concurrency Computat.: Pract. Exper.</title><idno type="pISSN">1532-0626</idno><idno type="eISSN">1532-0634</idno><idno type="DOI">10.1002/(ISSN)1532-0634</idno><editor><persName><forename type="first">Bruno</forename><surname>Schulze</surname></persName></editor><editor><persName><forename type="first">Rajkumar</forename><surname>Buyya</surname></persName></editor><editor><persName><forename type="first">Fabio</forename><surname>Porto</surname></persName></editor><imprint><publisher>John Wiley & Sons, Ltd</publisher><pubPlace>Chichester, UK</pubPlace><date type="published" when="2012-09-10"></date><biblScope unit="volume">24</biblScope><biblScope unit="issue">13</biblScope><biblScope unit="page" from="1478">1478</biblScope><biblScope unit="page" to="1496">1496</biblScope></imprint></monogr><idno type="istex">959048CE3757990B6B3EEB8078651EBDAACF3941</idno><idno type="DOI">10.1002/cpe.1899</idno><idno type="ArticleID">CPE1899</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2011-12</date></creation><langUsage><language ident="en">en</language></langUsage><abstract><p>Complex scientific experiments have a growing demand for computational resources, which are expensive to be acquired and maintained. Grid computing has emerged as the mainstream technology to solve this issue. Grids are also adequate for the execution of scientific workflows because they allow the use of heterogeneous and distributed resources. In spite of the progress in grid technology, there are challenges to overcome in workflow scheduling. For instance, centralized scheduling solutions may lead to performance degradation and to problems with scalability. Some scheduling approaches are partially distributed, keeping a few centralized components that may become bottlenecks. Other distributed solutions have a lack of flexibility in the definition of workflows, in which only the use of tasks as steps in the workflow is permitted not high level services. In this work, we present P2PScheMe, a scheduling mechanism for peer‐to‐peer execution of workflows based on the invocation of grid services. The proposal considers information regarding grid execution environment in order to allow workflow scheduling adaptation. This adaptation is performed according to user requirements of quality of service. In this paper, we describe how P2PScheMe works and provides a comparative analysis with existing solutions. Copyright © 2011 John Wiley & Sons, Ltd.</p></abstract><textClass><keywords scheme="keyword"><list><head>keywords</head><item><term>grid computing</term></item><item><term>peer‐to‐peer</term></item><item><term>workflows</term></item></list></keywords></textClass><textClass><keywords scheme="Journal Subject"><list><head>article-category</head><item><term>Special Issue Paper</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2011-03-16">Received</change><change when="2011-10-05">Registration</change><change when="2011-12">Created</change><change when="2012-09-10">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/959048CE3757990B6B3EEB8078651EBDAACF3941/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Wiley, elements deleted: body"><istex:xmlDeclaration>version="1.0" encoding="UTF-8" standalone="yes"</istex:xmlDeclaration><istex:document><component type="serialArticle" version="2.0" xml:lang="en" xml:id="cpe1899"><header><publicationMeta level="product"><publisherInfo><publisherName>John Wiley & Sons, Ltd</publisherName><publisherLoc>Chichester, UK</publisherLoc></publisherInfo><doi>10.1002/(ISSN)1532-0634</doi><issn type="print">1532-0626</issn><issn type="electronic">1532-0634</issn><idGroup><id type="product" value="CPE"></id></idGroup><titleGroup><title type="main" sort="CONCURRENCY AND COMPUTATION: PRACTICE AND EXPERIENCE">Concurrency and Computation: Practice and Experience</title><title type="short">Concurrency Computat.: Pract. Exper.</title></titleGroup></publicationMeta><publicationMeta level="part" position="130"><doi>10.1002/cpe.v24.13</doi><titleGroup><title type="specialIssueTitle">Special Issue on Middleware for Clouds and e‐Science</title></titleGroup><copyright ownership="publisher">Copyright © 2012 John Wiley & Sons, Ltd.</copyright><numberingGroup><numbering type="journalVolume" number="24">24</numbering><numbering type="journalIssue">13</numbering></numberingGroup><creators><creator creatorRole="guestEditor" xml:id="cpe1899-cr-0001"><personName><givenNames>Bruno</givenNames><familyName>Schulze</familyName></personName></creator><creator creatorRole="guestEditor" xml:id="cpe1899-cr-0002"><personName><givenNames>Rajkumar</givenNames><familyName>Buyya</familyName></personName></creator><creator creatorRole="guestEditor" xml:id="cpe1899-cr-0003"><personName><givenNames>Fabio</givenNames><familyName>Porto</familyName></personName></creator></creators><coverDate startDate="2012-09-10">10 September 2012</coverDate></publicationMeta><publicationMeta level="unit" position="60" type="article" status="forIssue"><doi>10.1002/cpe.1899</doi><idGroup><id type="unit" value="CPE1899"></id></idGroup><countGroup><count type="pageTotal" number="19"></count></countGroup><titleGroup><title type="articleCategory">Special Issue Paper</title><title type="tocHeading1">Special Issue Papers</title></titleGroup><copyright ownership="publisher">Copyright © 2011 John Wiley & Sons, Ltd.</copyright><eventGroup><event type="manuscriptReceived" date="2011-03-16"></event><event type="manuscriptRevised" date="2011-10-05"></event><event type="manuscriptAccepted" date="2011-10-05"></event><event type="xmlCreated" agent="Spi global" date="2011-12"></event><event type="publishedOnlineEarlyUnpaginated" date="2011-12-20"></event><event type="firstOnline" date="2011-12-20"></event><event type="publishedOnlineFinalForm" date="2012-08-17"></event><event type="xmlConverted" agent="Converter:WILEY_ML3G_TO_WILEY_ML3GV2 version:3.8.8" date="2014-01-16"></event><event type="xmlConverted" agent="Converter:WML3G_To_WML3G version:4.3.4 mode:FullText" date="2015-02-24"></event></eventGroup><numberingGroup><numbering type="pageFirst">1478</numbering><numbering type="pageLast">1496</numbering></numberingGroup><correspondenceTo><lineatedText><line>João Marcelo U. de Alencar, GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University of Ceará, Av. Mister Hull, s/n ‐ Campus do Pici ‐ Block Number 942A ‐ CEP: 60455‐760 ‐ Fortaleza ‐ CE ‐ Brazil.</line><line>E‐mail: <email>joao.marcelo@ufc.br</email></line></lineatedText></correspondenceTo><linkGroup><link type="toTypesetVersion" href="file:CPE.CPE1899.pdf"></link></linkGroup></publicationMeta><contentMeta><titleGroup><title type="main">P2PScheMe: a P2P scheduling mechanism for workflows in grid computing</title><title type="short">A P2P SCHEDULING MECHANISM FOR WORKFLOWS IN GRID COMPUTING</title><title type="shortAuthors">J. M. U. D. ALENCAR <i>ET AL.</i></title></titleGroup><creators><creator xml:id="cpe1899-cr-0004" creatorRole="author" affiliationRef="#cpe1899-aff-0001 #cpe1899-aff-0005" corresponding="yes"><personName><givenNames>João Marcelo U.</givenNames><familyNamePrefix>de</familyNamePrefix><familyName>Alencar</familyName></personName></creator><creator xml:id="cpe1899-cr-0005" creatorRole="author" affiliationRef="#cpe1899-aff-0001 #cpe1899-aff-0004"><personName><givenNames>Rossana M.C.</givenNames><familyName>Andrade</familyName></personName></creator><creator xml:id="cpe1899-cr-0006" creatorRole="author" affiliationRef="#cpe1899-aff-0001 #cpe1899-aff-0003"><personName><givenNames>Windson</givenNames><familyName>Viana</familyName></personName></creator><creator xml:id="cpe1899-cr-0007" creatorRole="author" affiliationRef="#cpe1899-aff-0002"><personName><givenNames>Bruno</givenNames><familyName>Schulze</familyName></personName></creator></creators><affiliationGroup><affiliation xml:id="cpe1899-aff-0001" countryCode="BR" type="organization"><orgDiv>GREat ‐ Group of Computer Networks, Software Engineering and Systems</orgDiv><orgName>Federal University Of Ceará (GREat‐UFC)</orgName><address><city>Fortaleza</city><countryPart>CE</countryPart><country>Brazil</country></address></affiliation><affiliation xml:id="cpe1899-aff-0002" countryCode="BR" type="organization"><orgName>LNCC ‐ National Laboratory for Scientific Computing</orgName><address><city>Petrópolis</city><countryPart>RJ</countryPart><country>Brazil</country></address></affiliation><affiliation xml:id="cpe1899-aff-0003" countryCode="BR" type="organization"><orgName>UFC Virtual Institute</orgName><address><city>Fortaleza</city><countryPart>CE</countryPart><country>Brazil</country></address></affiliation><affiliation xml:id="cpe1899-aff-0004" countryCode="BR" type="organization"><orgDiv>Department Of Computer Science</orgDiv><orgName>UFC</orgName><address><city>Fortaleza</city><countryPart>CE</countryPart><country>Brazil</country></address></affiliation><affiliation xml:id="cpe1899-aff-0005" countryCode="BR" type="organization"><orgDiv>Quixadá Campus Academic Department</orgDiv><orgName>UFC</orgName><address><city>Quixadá</city><countryPart>CE</countryPart><country>Brazil</country></address></affiliation></affiliationGroup><keywordGroup type="author"><keyword xml:id="cpe1899-kwd-0001">grid computing</keyword><keyword xml:id="cpe1899-kwd-0002">peer‐to‐peer</keyword><keyword xml:id="cpe1899-kwd-0003">workflows</keyword></keywordGroup><abstractGroup><abstract type="main" xml:id="cpe1899-abs-0001"><title type="main">SUMMARY</title><p>Complex scientific experiments have a growing demand for computational resources, which are expensive to be acquired and maintained. Grid computing has emerged as the mainstream technology to solve this issue. Grids are also adequate for the execution of scientific workflows because they allow the use of heterogeneous and distributed resources. In spite of the progress in grid technology, there are challenges to overcome in workflow scheduling. For instance, centralized scheduling solutions may lead to performance degradation and to problems with scalability. Some scheduling approaches are partially distributed, keeping a few centralized components that may become bottlenecks. Other distributed solutions have a lack of flexibility in the definition of workflows, in which only the use of tasks as steps in the workflow is permitted not high level services. In this work, we present P2PScheMe, a scheduling mechanism for peer‐to‐peer execution of workflows based on the invocation of grid services. The proposal considers information regarding grid execution environment in order to allow workflow scheduling adaptation. This adaptation is performed according to user requirements of quality of service. In this paper, we describe how P2PScheMe works and provides a comparative analysis with existing solutions. Copyright © 2011 John Wiley & Sons, Ltd.</p></abstract> </abstractGroup> </contentMeta> </header></component></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>P2PScheMe: a P2P scheduling mechanism for workflows in grid computing</title></titleInfo><titleInfo type="abbreviated" lang="en"><title>A P2P SCHEDULING MECHANISM FOR WORKFLOWS IN GRID COMPUTING</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>P2PScheMe: a P2P scheduling mechanism for workflows in grid computing</title></titleInfo><name type="personal"><namePart type="given">João Marcelo U.</namePart><namePart type="family">de Alencar</namePart><affiliation>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE, Brazil</affiliation><affiliation>Quixadá Campus Academic Department, UFC, CE, Quixadá, Brazil</affiliation><affiliation>João Marcelo U. de Alencar, GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University of Ceará, Av. Mister Hull, s/n ‐ Campus do Pici ‐ Block Number 942A ‐ CEP: 60455‐760 ‐ Fortaleza ‐ CE ‐ Brazil.E‐mail:</affiliation><affiliation>E-mail: joao.marcelo@ufc.br</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Rossana M.C.</namePart><namePart type="family">Andrade</namePart><affiliation>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE, Brazil</affiliation><affiliation>Department Of Computer Science, UFC, CE, Fortaleza, Brazil</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Windson</namePart><namePart type="family">Viana</namePart><affiliation>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE, Brazil</affiliation><affiliation>UFC Virtual Institute, CE, Fortaleza, Brazil</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Bruno</namePart><namePart type="family">Schulze</namePart><affiliation>LNCC ‐ National Laboratory for Scientific Computing, RJ, Petrópolis, Brazil</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="article" displayLabel="article"></genre><originInfo><publisher>John Wiley & Sons, Ltd</publisher><place><placeTerm type="text">Chichester, UK</placeTerm></place><dateIssued encoding="w3cdtf">2012-09-10</dateIssued><dateCreated encoding="w3cdtf">2011-12</dateCreated><dateCaptured encoding="w3cdtf">2011-03-16</dateCaptured><dateValid encoding="w3cdtf">2011-10-05</dateValid><copyrightDate encoding="w3cdtf">2012</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract>Complex scientific experiments have a growing demand for computational resources, which are expensive to be acquired and maintained. Grid computing has emerged as the mainstream technology to solve this issue. Grids are also adequate for the execution of scientific workflows because they allow the use of heterogeneous and distributed resources. In spite of the progress in grid technology, there are challenges to overcome in workflow scheduling. For instance, centralized scheduling solutions may lead to performance degradation and to problems with scalability. Some scheduling approaches are partially distributed, keeping a few centralized components that may become bottlenecks. Other distributed solutions have a lack of flexibility in the definition of workflows, in which only the use of tasks as steps in the workflow is permitted not high level services. In this work, we present P2PScheMe, a scheduling mechanism for peer‐to‐peer execution of workflows based on the invocation of grid services. The proposal considers information regarding grid execution environment in order to allow workflow scheduling adaptation. This adaptation is performed according to user requirements of quality of service. In this paper, we describe how P2PScheMe works and provides a comparative analysis with existing solutions. Copyright © 2011 John Wiley & Sons, Ltd.</abstract><subject><genre>keywords</genre><topic>grid computing</topic><topic>peer‐to‐peer</topic><topic>workflows</topic></subject><relatedItem type="host"><titleInfo><title>Concurrency and Computation: Practice and Experience</title></titleInfo><titleInfo type="abbreviated"><title>Concurrency Computat.: Pract. Exper.</title></titleInfo><name type="personal"><namePart type="given">Bruno</namePart><namePart type="family">Schulze</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Rajkumar</namePart><namePart type="family">Buyya</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Fabio</namePart><namePart type="family">Porto</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="journal">journal</genre><subject><genre>article-category</genre><topic>Special Issue Paper</topic></subject><identifier type="ISSN">1532-0626</identifier><identifier type="eISSN">1532-0634</identifier><identifier type="DOI">10.1002/(ISSN)1532-0634</identifier><identifier type="PublisherID">CPE</identifier><part><date>2012</date><detail type="title"><title>Special Issue on Middleware for Clouds and e‐Science</title></detail><detail type="volume"><caption>vol.</caption><number>24</number></detail><detail type="issue"><caption>no.</caption><number>13</number></detail><extent unit="pages"><start>1478</start><end>1496</end><total>19</total></extent></part></relatedItem><identifier type="istex">959048CE3757990B6B3EEB8078651EBDAACF3941</identifier><identifier type="DOI">10.1002/cpe.1899</identifier><identifier type="ArticleID">CPE1899</identifier><accessCondition type="use and reproduction" contentType="copyright">Copyright © 2012 John Wiley & Sons, Ltd.Copyright © 2011 John Wiley & Sons, Ltd.</accessCondition><recordInfo><recordContentSource>WILEY</recordContentSource><recordOrigin>John Wiley & Sons, Ltd</recordOrigin></recordInfo></mods></metadata><enrichments><json:item><type>multicat</type><uri>https://api.istex.fr/document/959048CE3757990B6B3EEB8078651EBDAACF3941/enrichments/multicat</uri></json:item></enrichments><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/CyberinfraV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000335 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000335 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= CyberinfraV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:959048CE3757990B6B3EEB8078651EBDAACF3941
|texte= P2PScheMe: a P2P scheduling mechanism for workflows in grid computing
}}
| This area was generated with Dilib version V0.6.25. |  |