Numerically efficient probabilistic guarantees for resource reservations

This paper presents an efficient algorithm for providing probabilistic guarantees in soft real-time systems using resource reservations. We use a conservative model for the temporal evolution of a resource reservation, which has a particular structure - a quasi birth death process - enabling an effi...

Full description

Saved in:
Bibliographic Details
Main Authors: Manica, N., Palopoli, L., Abeni, L.
Format: Conference Proceeding
Language:English
Subjects:
Probabilistic Guarantees
Soft real-time systems
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 8
container_issue
container_start_page 1
container_title
container_volume
creator Manica, N.
Palopoli, L.
Abeni, L.
description This paper presents an efficient algorithm for providing probabilistic guarantees in soft real-time systems using resource reservations. We use a conservative model for the temporal evolution of a resource reservation, which has a particular structure - a quasi birth death process - enabling an efficient computation of the stationary probability of respecting deadlines. We show the accuracy and the efficiency of the method in a large set of experiments.
doi_str_mv 10.1109/ETFA.2012.6489566
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6489566</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6489566</ieee_id><sourcerecordid>6489566</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-8b4fffe30c094ff694f840de43b458bfedd1821e17bdebf85fab2b38c893cb6d3</originalsourceid><addsrcrecordid>eNpVkMtKw0AYhccbWGoeQNzkBRLnflmW0otQdFPXZWbyj4ykSZlJhL69EYvg6nxw4ONwEHokuCYEm-fVfr2oKSa0llwbIeUVKozShEvFuGKKXqMZMVxWWAlz868T-vav4_geFTl_YownrTScztD2dTxCit627bmEEKKP0A3lKfXOutjGPERffow22W4AyGXoU5kg92Py8AOQvuwQ-y4_oLtg2wzFJefofb3aL7fV7m3zslzsqkiUGCrteAgBGPbYTDSNCJrjBjhzXGgXoGmIpgSIcg24oEWwjjqmvTbMO9mwOXr69UYAOJxSPNp0Plx-Yd_1j1SN</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Numerically efficient probabilistic guarantees for resource reservations</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Manica, N. ; Palopoli, L. ; Abeni, L.</creator><creatorcontrib>Manica, N. ; Palopoli, L. ; Abeni, L.</creatorcontrib><description>This paper presents an efficient algorithm for providing probabilistic guarantees in soft real-time systems using resource reservations. We use a conservative model for the temporal evolution of a resource reservation, which has a particular structure - a quasi birth death process - enabling an efficient computation of the stationary probability of respecting deadlines. We show the accuracy and the efficiency of the method in a large set of experiments.</description><identifier>ISSN: 1946-0740</identifier><identifier>ISBN: 9781467347358</identifier><identifier>ISBN: 1467347353</identifier><identifier>EISSN: 1946-0759</identifier><identifier>EISBN: 9781467347372</identifier><identifier>EISBN: 146734737X</identifier><identifier>EISBN: 1467347361</identifier><identifier>EISBN: 9781467347365</identifier><identifier>DOI: 10.1109/ETFA.2012.6489566</identifier><language>eng</language><publisher>IEEE</publisher><subject>Probabilistic Guarantees ; Soft real-time systems</subject><ispartof>Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies &amp; Factory Automation (ETFA 2012), 2012, p.1-8</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6489566$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6489566$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Manica, N.</creatorcontrib><creatorcontrib>Palopoli, L.</creatorcontrib><creatorcontrib>Abeni, L.</creatorcontrib><title>Numerically efficient probabilistic guarantees for resource reservations</title><title>Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies &amp; Factory Automation (ETFA 2012)</title><addtitle>ETFA</addtitle><description>This paper presents an efficient algorithm for providing probabilistic guarantees in soft real-time systems using resource reservations. We use a conservative model for the temporal evolution of a resource reservation, which has a particular structure - a quasi birth death process - enabling an efficient computation of the stationary probability of respecting deadlines. We show the accuracy and the efficiency of the method in a large set of experiments.</description><subject>Probabilistic Guarantees</subject><subject>Soft real-time systems</subject><issn>1946-0740</issn><issn>1946-0759</issn><isbn>9781467347358</isbn><isbn>1467347353</isbn><isbn>9781467347372</isbn><isbn>146734737X</isbn><isbn>1467347361</isbn><isbn>9781467347365</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpVkMtKw0AYhccbWGoeQNzkBRLnflmW0otQdFPXZWbyj4ykSZlJhL69EYvg6nxw4ONwEHokuCYEm-fVfr2oKSa0llwbIeUVKozShEvFuGKKXqMZMVxWWAlz868T-vav4_geFTl_YownrTScztD2dTxCit627bmEEKKP0A3lKfXOutjGPERffow22W4AyGXoU5kg92Py8AOQvuwQ-y4_oLtg2wzFJefofb3aL7fV7m3zslzsqkiUGCrteAgBGPbYTDSNCJrjBjhzXGgXoGmIpgSIcg24oEWwjjqmvTbMO9mwOXr69UYAOJxSPNp0Plx-Yd_1j1SN</recordid><startdate>201209</startdate><enddate>201209</enddate><creator>Manica, N.</creator><creator>Palopoli, L.</creator><creator>Abeni, L.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201209</creationdate><title>Numerically efficient probabilistic guarantees for resource reservations</title><author>Manica, N. ; Palopoli, L. ; Abeni, L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-8b4fffe30c094ff694f840de43b458bfedd1821e17bdebf85fab2b38c893cb6d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Probabilistic Guarantees</topic><topic>Soft real-time systems</topic><toplevel>online_resources</toplevel><creatorcontrib>Manica, N.</creatorcontrib><creatorcontrib>Palopoli, L.</creatorcontrib><creatorcontrib>Abeni, L.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library Online</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Manica, N.</au><au>Palopoli, L.</au><au>Abeni, L.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Numerically efficient probabilistic guarantees for resource reservations</atitle><btitle>Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies &amp; Factory Automation (ETFA 2012)</btitle><stitle>ETFA</stitle><date>2012-09</date><risdate>2012</risdate><spage>1</spage><epage>8</epage><pages>1-8</pages><issn>1946-0740</issn><eissn>1946-0759</eissn><isbn>9781467347358</isbn><isbn>1467347353</isbn><eisbn>9781467347372</eisbn><eisbn>146734737X</eisbn><eisbn>1467347361</eisbn><eisbn>9781467347365</eisbn><abstract>This paper presents an efficient algorithm for providing probabilistic guarantees in soft real-time systems using resource reservations. We use a conservative model for the temporal evolution of a resource reservation, which has a particular structure - a quasi birth death process - enabling an efficient computation of the stationary probability of respecting deadlines. We show the accuracy and the efficiency of the method in a large set of experiments.</abstract><pub>IEEE</pub><doi>10.1109/ETFA.2012.6489566</doi><tpages>8</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1946-0740
ispartof Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies & Factory Automation (ETFA 2012), 2012, p.1-8
issn 1946-0740
1946-0759
language eng
recordid cdi_ieee_primary_6489566
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Probabilistic Guarantees
Soft real-time systems
title Numerically efficient probabilistic guarantees for resource reservations
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T16%3A15%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Numerically%20efficient%20probabilistic%20guarantees%20for%20resource%20reservations&rft.btitle=Proceedings%20of%202012%20IEEE%2017th%20International%20Conference%20on%20Emerging%20Technologies%20&%20Factory%20Automation%20(ETFA%202012)&rft.au=Manica,%20N.&rft.date=2012-09&rft.spage=1&rft.epage=8&rft.pages=1-8&rft.issn=1946-0740&rft.eissn=1946-0759&rft.isbn=9781467347358&rft.isbn_list=1467347353&rft_id=info:doi/10.1109/ETFA.2012.6489566&rft.eisbn=9781467347372&rft.eisbn_list=146734737X&rft.eisbn_list=1467347361&rft.eisbn_list=9781467347365&rft_dat=%3Cieee_6IE%3E6489566%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-8b4fffe30c094ff694f840de43b458bfedd1821e17bdebf85fab2b38c893cb6d3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6489566&rfr_iscdi=true