Loading…
Monitoring timing constraints in distributed real-time systems
A run-time environment for monitoring distributed real-time systems is described. In particular, the authors focus on the problem of detecting violations of timing assertions in an environment in which the real-time tasks run on multiple processors, and timing constraints can be either interprocesso...
Saved in:
Main Authors: | , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 67 |
container_issue | |
container_start_page | 57 |
container_title | |
container_volume | |
creator | Raju, S.C.V. Rajkumar, R. Jahanian, F. |
description | A run-time environment for monitoring distributed real-time systems is described. In particular, the authors focus on the problem of detecting violations of timing assertions in an environment in which the real-time tasks run on multiple processors, and timing constraints can be either interprocessor or intraprocessor constraints. Constraint violations are detected at the earliest possible time by deriving and checking intermediate constraints. If the violations must be detected as early as possible, then the problem of minimizing the number of messages to be exchanged between the processors becomes intractable. The authors characterize a subclass of timing constraints that occur commonly in distributed real-time systems and whose message requirements can be minimized. They also take into account the drift among the various processor clocks when detecting a violation of a timing assertion. Finally, an implementation of a distributed run-time monitor is described.< > |
doi_str_mv | 10.1109/REAL.1992.242676 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_242676</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>242676</ieee_id><sourcerecordid>242676</sourcerecordid><originalsourceid>FETCH-LOGICAL-i174t-b1bd06881b21cd2d41c02ac49e76bc72e553c157ed038a304d54b87c86d63a943</originalsourceid><addsrcrecordid>eNotj81KAzEYRQMiqLV7cTUvMGO-_GcjlFKtMCKUui75-ZRIZ0aSuOjbO1Lv5nDhcOEScge0A6D2YbdZ9R1YyzommNLqgtxQA0ZxsJJfkWUpX3SOlEZzuCaPr9OY6pTT-NnUNPwhTGOp2aWxliaNTUxzS_6nYmwyumM7a9iUU6k4lFty-eGOBZf_XJD3p81-vW37t-eX9apvE2hRWw8-UmUMeAYhsiggUOaCsKiVD5qhlDyA1BgpN45TEaXwRgejouLOCr4g9-fdhIiH75wGl0-H80P-C1fpRyY</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Monitoring timing constraints in distributed real-time systems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Raju, S.C.V. ; Rajkumar, R. ; Jahanian, F.</creator><creatorcontrib>Raju, S.C.V. ; Rajkumar, R. ; Jahanian, F.</creatorcontrib><description>A run-time environment for monitoring distributed real-time systems is described. In particular, the authors focus on the problem of detecting violations of timing assertions in an environment in which the real-time tasks run on multiple processors, and timing constraints can be either interprocessor or intraprocessor constraints. Constraint violations are detected at the earliest possible time by deriving and checking intermediate constraints. If the violations must be detected as early as possible, then the problem of minimizing the number of messages to be exchanged between the processors becomes intractable. The authors characterize a subclass of timing constraints that occur commonly in distributed real-time systems and whose message requirements can be minimized. They also take into account the drift among the various processor clocks when detecting a violation of a timing assertion. Finally, an implementation of a distributed run-time monitor is described.< ></description><identifier>ISBN: 0818631953</identifier><identifier>ISBN: 9780818631955</identifier><identifier>DOI: 10.1109/REAL.1992.242676</identifier><language>eng</language><publisher>IEEE Comput. Soc. Press</publisher><subject>Clocks ; Computer science ; Computerized monitoring ; Formal verification ; Real time systems ; Runtime environment ; Software engineering ; Synchronization ; Time factors ; Timing</subject><ispartof>[1992] Proceedings Real-Time Systems Symposium, 1992, p.57-67</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/242676$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/242676$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Raju, S.C.V.</creatorcontrib><creatorcontrib>Rajkumar, R.</creatorcontrib><creatorcontrib>Jahanian, F.</creatorcontrib><title>Monitoring timing constraints in distributed real-time systems</title><title>[1992] Proceedings Real-Time Systems Symposium</title><addtitle>REAL</addtitle><description>A run-time environment for monitoring distributed real-time systems is described. In particular, the authors focus on the problem of detecting violations of timing assertions in an environment in which the real-time tasks run on multiple processors, and timing constraints can be either interprocessor or intraprocessor constraints. Constraint violations are detected at the earliest possible time by deriving and checking intermediate constraints. If the violations must be detected as early as possible, then the problem of minimizing the number of messages to be exchanged between the processors becomes intractable. The authors characterize a subclass of timing constraints that occur commonly in distributed real-time systems and whose message requirements can be minimized. They also take into account the drift among the various processor clocks when detecting a violation of a timing assertion. Finally, an implementation of a distributed run-time monitor is described.< ></description><subject>Clocks</subject><subject>Computer science</subject><subject>Computerized monitoring</subject><subject>Formal verification</subject><subject>Real time systems</subject><subject>Runtime environment</subject><subject>Software engineering</subject><subject>Synchronization</subject><subject>Time factors</subject><subject>Timing</subject><isbn>0818631953</isbn><isbn>9780818631955</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1992</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj81KAzEYRQMiqLV7cTUvMGO-_GcjlFKtMCKUui75-ZRIZ0aSuOjbO1Lv5nDhcOEScge0A6D2YbdZ9R1YyzommNLqgtxQA0ZxsJJfkWUpX3SOlEZzuCaPr9OY6pTT-NnUNPwhTGOp2aWxliaNTUxzS_6nYmwyumM7a9iUU6k4lFty-eGOBZf_XJD3p81-vW37t-eX9apvE2hRWw8-UmUMeAYhsiggUOaCsKiVD5qhlDyA1BgpN45TEaXwRgejouLOCr4g9-fdhIiH75wGl0-H80P-C1fpRyY</recordid><startdate>1992</startdate><enddate>1992</enddate><creator>Raju, S.C.V.</creator><creator>Rajkumar, R.</creator><creator>Jahanian, F.</creator><general>IEEE Comput. Soc. Press</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1992</creationdate><title>Monitoring timing constraints in distributed real-time systems</title><author>Raju, S.C.V. ; Rajkumar, R. ; Jahanian, F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i174t-b1bd06881b21cd2d41c02ac49e76bc72e553c157ed038a304d54b87c86d63a943</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Clocks</topic><topic>Computer science</topic><topic>Computerized monitoring</topic><topic>Formal verification</topic><topic>Real time systems</topic><topic>Runtime environment</topic><topic>Software engineering</topic><topic>Synchronization</topic><topic>Time factors</topic><topic>Timing</topic><toplevel>online_resources</toplevel><creatorcontrib>Raju, S.C.V.</creatorcontrib><creatorcontrib>Rajkumar, R.</creatorcontrib><creatorcontrib>Jahanian, F.</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 Xplore</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>Raju, S.C.V.</au><au>Rajkumar, R.</au><au>Jahanian, F.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Monitoring timing constraints in distributed real-time systems</atitle><btitle>[1992] Proceedings Real-Time Systems Symposium</btitle><stitle>REAL</stitle><date>1992</date><risdate>1992</risdate><spage>57</spage><epage>67</epage><pages>57-67</pages><isbn>0818631953</isbn><isbn>9780818631955</isbn><abstract>A run-time environment for monitoring distributed real-time systems is described. In particular, the authors focus on the problem of detecting violations of timing assertions in an environment in which the real-time tasks run on multiple processors, and timing constraints can be either interprocessor or intraprocessor constraints. Constraint violations are detected at the earliest possible time by deriving and checking intermediate constraints. If the violations must be detected as early as possible, then the problem of minimizing the number of messages to be exchanged between the processors becomes intractable. The authors characterize a subclass of timing constraints that occur commonly in distributed real-time systems and whose message requirements can be minimized. They also take into account the drift among the various processor clocks when detecting a violation of a timing assertion. Finally, an implementation of a distributed run-time monitor is described.< ></abstract><pub>IEEE Comput. Soc. Press</pub><doi>10.1109/REAL.1992.242676</doi><tpages>11</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 0818631953 |
ispartof | [1992] Proceedings Real-Time Systems Symposium, 1992, p.57-67 |
issn | |
language | eng |
recordid | cdi_ieee_primary_242676 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Clocks Computer science Computerized monitoring Formal verification Real time systems Runtime environment Software engineering Synchronization Time factors Timing |
title | Monitoring timing constraints in distributed real-time systems |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T03%3A05%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=Monitoring%20timing%20constraints%20in%20distributed%20real-time%20systems&rft.btitle=%5B1992%5D%20Proceedings%20Real-Time%20Systems%20Symposium&rft.au=Raju,%20S.C.V.&rft.date=1992&rft.spage=57&rft.epage=67&rft.pages=57-67&rft.isbn=0818631953&rft.isbn_list=9780818631955&rft_id=info:doi/10.1109/REAL.1992.242676&rft_dat=%3Cieee_6IE%3E242676%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i174t-b1bd06881b21cd2d41c02ac49e76bc72e553c157ed038a304d54b87c86d63a943%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=242676&rfr_iscdi=true |