Policy-Based Resource Assignment in Utility Computing Environments
In utility computing environments, multiple users and applications are served from the same resource pool. To maintain service level objectives and maintain high levels of utilization in the resource pool, it is desirable that resources be assigned in a manner consistent with operator policies, whil...
Gespeichert in:
Hauptverfasser: | , , , , , |
---|---|
Format: | Buchkapitel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 111 |
---|---|
container_issue | |
container_start_page | 100 |
container_title | |
container_volume | |
creator | Santos, Cipriano A. Sahai, Akhil Zhu, Xiaoyun Beyer, Dirk Machiraju, Vijay Singhal, Sharad |
description | In utility computing environments, multiple users and applications are served from the same resource pool. To maintain service level objectives and maintain high levels of utilization in the resource pool, it is desirable that resources be assigned in a manner consistent with operator policies, while ensuring that shared resources (e.g., networks) within the pool do not become bottlenecks. This paper addresses how operator policies (preferences) can be included in the resource assignment problem as soft constraints. We provide the problem formulation and use two examples of soft constraints to illustrate the method. Experimental results demonstrate impact of policies on the solution. |
doi_str_mv | 10.1007/978-3-540-30184-4_9 |
format | Book Chapter |
fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16334964</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16334964</sourcerecordid><originalsourceid>FETCH-LOGICAL-p272t-28a36165777c14b7ce8402efdfc91be25200c84ea4288372933433248c7239493</originalsourceid><addsrcrecordid>eNotkEtvwjAMgLOXNMb4Bbv0smO2JE7zOAJiDwlp0zTOUQgpylbSqimT-PekMF8s258s-0PogZInSoh81lJhwCUnGAhVHHOjL9Ad5Map5pdoRAWlGIDrKzTJ-DBjIIDCNRplimEtOdyiSUo_JAcTAkoxQrPPpg7ugGc2-U3x5VOz75wvpimFbdz52BchFqs-1KE_FPNm1-77ELfFIv6FrjkB6R7dVLZOfvKfx2j1sviev-Hlx-v7fLrELZOsx0xZEFSUUkpH-Vo6r_KJvtpUTtO1ZyUjxCnuLWdKgWQ6PwPAuHKSgeYaxujxvLe1ydm66mx0IZm2CzvbHQwVw_eCZ46euZRHces7s26a32QoMYNMk-0YMNmPOckzWSYcASr8YMQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Policy-Based Resource Assignment in Utility Computing Environments</title><source>Springer Books</source><creator>Santos, Cipriano A. ; Sahai, Akhil ; Zhu, Xiaoyun ; Beyer, Dirk ; Machiraju, Vijay ; Singhal, Sharad</creator><contributor>Sahai, Akhil ; Wu, Felix</contributor><creatorcontrib>Santos, Cipriano A. ; Sahai, Akhil ; Zhu, Xiaoyun ; Beyer, Dirk ; Machiraju, Vijay ; Singhal, Sharad ; Sahai, Akhil ; Wu, Felix</creatorcontrib><description>In utility computing environments, multiple users and applications are served from the same resource pool. To maintain service level objectives and maintain high levels of utilization in the resource pool, it is desirable that resources be assigned in a manner consistent with operator policies, while ensuring that shared resources (e.g., networks) within the pool do not become bottlenecks. This paper addresses how operator policies (preferences) can be included in the resource assignment problem as soft constraints. We provide the problem formulation and use two examples of soft constraints to illustrate the method. Experimental results demonstrate impact of policies on the solution.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540236313</identifier><identifier>ISBN: 3540236317</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540301844</identifier><identifier>EISBN: 9783540301844</identifier><identifier>DOI: 10.1007/978-3-540-30184-4_9</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Hard Constraint ; Object Constraint Language ; Operator Policy ; Resource Pool ; Soft Constraint ; Software</subject><ispartof>Lecture notes in computer science, 2004, p.100-111</ispartof><rights>IFIP International Federation for Information Processing 2004</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-30184-4_9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-30184-4_9$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4035,4036,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16334964$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Sahai, Akhil</contributor><contributor>Wu, Felix</contributor><creatorcontrib>Santos, Cipriano A.</creatorcontrib><creatorcontrib>Sahai, Akhil</creatorcontrib><creatorcontrib>Zhu, Xiaoyun</creatorcontrib><creatorcontrib>Beyer, Dirk</creatorcontrib><creatorcontrib>Machiraju, Vijay</creatorcontrib><creatorcontrib>Singhal, Sharad</creatorcontrib><title>Policy-Based Resource Assignment in Utility Computing Environments</title><title>Lecture notes in computer science</title><description>In utility computing environments, multiple users and applications are served from the same resource pool. To maintain service level objectives and maintain high levels of utilization in the resource pool, it is desirable that resources be assigned in a manner consistent with operator policies, while ensuring that shared resources (e.g., networks) within the pool do not become bottlenecks. This paper addresses how operator policies (preferences) can be included in the resource assignment problem as soft constraints. We provide the problem formulation and use two examples of soft constraints to illustrate the method. Experimental results demonstrate impact of policies on the solution.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Hard Constraint</subject><subject>Object Constraint Language</subject><subject>Operator Policy</subject><subject>Resource Pool</subject><subject>Soft Constraint</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540236313</isbn><isbn>3540236317</isbn><isbn>3540301844</isbn><isbn>9783540301844</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2004</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkEtvwjAMgLOXNMb4Bbv0smO2JE7zOAJiDwlp0zTOUQgpylbSqimT-PekMF8s258s-0PogZInSoh81lJhwCUnGAhVHHOjL9Ad5Map5pdoRAWlGIDrKzTJ-DBjIIDCNRplimEtOdyiSUo_JAcTAkoxQrPPpg7ugGc2-U3x5VOz75wvpimFbdz52BchFqs-1KE_FPNm1-77ELfFIv6FrjkB6R7dVLZOfvKfx2j1sviev-Hlx-v7fLrELZOsx0xZEFSUUkpH-Vo6r_KJvtpUTtO1ZyUjxCnuLWdKgWQ6PwPAuHKSgeYaxujxvLe1ydm66mx0IZm2CzvbHQwVw_eCZ46euZRHces7s26a32QoMYNMk-0YMNmPOckzWSYcASr8YMQ</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Santos, Cipriano A.</creator><creator>Sahai, Akhil</creator><creator>Zhu, Xiaoyun</creator><creator>Beyer, Dirk</creator><creator>Machiraju, Vijay</creator><creator>Singhal, Sharad</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>Policy-Based Resource Assignment in Utility Computing Environments</title><author>Santos, Cipriano A. ; Sahai, Akhil ; Zhu, Xiaoyun ; Beyer, Dirk ; Machiraju, Vijay ; Singhal, Sharad</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p272t-28a36165777c14b7ce8402efdfc91be25200c84ea4288372933433248c7239493</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Hard Constraint</topic><topic>Object Constraint Language</topic><topic>Operator Policy</topic><topic>Resource Pool</topic><topic>Soft Constraint</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Santos, Cipriano A.</creatorcontrib><creatorcontrib>Sahai, Akhil</creatorcontrib><creatorcontrib>Zhu, Xiaoyun</creatorcontrib><creatorcontrib>Beyer, Dirk</creatorcontrib><creatorcontrib>Machiraju, Vijay</creatorcontrib><creatorcontrib>Singhal, Sharad</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Santos, Cipriano A.</au><au>Sahai, Akhil</au><au>Zhu, Xiaoyun</au><au>Beyer, Dirk</au><au>Machiraju, Vijay</au><au>Singhal, Sharad</au><au>Sahai, Akhil</au><au>Wu, Felix</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Policy-Based Resource Assignment in Utility Computing Environments</atitle><btitle>Lecture notes in computer science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2004</date><risdate>2004</risdate><spage>100</spage><epage>111</epage><pages>100-111</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540236313</isbn><isbn>3540236317</isbn><eisbn>3540301844</eisbn><eisbn>9783540301844</eisbn><abstract>In utility computing environments, multiple users and applications are served from the same resource pool. To maintain service level objectives and maintain high levels of utilization in the resource pool, it is desirable that resources be assigned in a manner consistent with operator policies, while ensuring that shared resources (e.g., networks) within the pool do not become bottlenecks. This paper addresses how operator policies (preferences) can be included in the resource assignment problem as soft constraints. We provide the problem formulation and use two examples of soft constraints to illustrate the method. Experimental results demonstrate impact of policies on the solution.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-30184-4_9</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0302-9743 |
ispartof | Lecture notes in computer science, 2004, p.100-111 |
issn | 0302-9743 1611-3349 |
language | eng |
recordid | cdi_pascalfrancis_primary_16334964 |
source | Springer Books |
subjects | Applied sciences Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Hard Constraint Object Constraint Language Operator Policy Resource Pool Soft Constraint Software |
title | Policy-Based Resource Assignment in Utility Computing Environments |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T23%3A32%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Policy-Based%20Resource%20Assignment%20in%20Utility%20Computing%20Environments&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Santos,%20Cipriano%20A.&rft.date=2004&rft.spage=100&rft.epage=111&rft.pages=100-111&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540236313&rft.isbn_list=3540236317&rft_id=info:doi/10.1007/978-3-540-30184-4_9&rft_dat=%3Cpascalfrancis_sprin%3E16334964%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540301844&rft.eisbn_list=9783540301844&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |