Scheduling periodic jobs that allow imprecise results

The problem of scheduling periodic jobs in hard real-time systems that support imprecise computations is discussed. Timing faults are avoided in such systems by making available intermediate, imprecise results of acceptable quality when results of the desired quality cannot be produced on time. Two...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 1990-09, Vol.39 (9), p.1156-1174
Main Authors: Chung, J.-Y., Liu, J.W.S., Lin, K.-J.
Format: Article
Language:English
Subjects:
Applied sciences
Computational modeling
Computer Programming And Software
Computer science
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Exact sciences and technology
NASA
Process design
Processor scheduling
Programming environments
Programming profession
Real time systems
Scheduling algorithm
Software
Timing
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-c356t-fea8a27b6572c557c126b634890d3f945b5c76c6e218fad17f1daeb72bbb6973
cites cdi_FETCH-LOGICAL-c356t-fea8a27b6572c557c126b634890d3f945b5c76c6e218fad17f1daeb72bbb6973
container_end_page 1174
container_issue 9
container_start_page 1156
container_title IEEE transactions on computers
container_volume 39
creator Chung, J.-Y.
Liu, J.W.S.
Lin, K.-J.
description The problem of scheduling periodic jobs in hard real-time systems that support imprecise computations is discussed. Timing faults are avoided in such systems by making available intermediate, imprecise results of acceptable quality when results of the desired quality cannot be produced on time. Two workload models of imprecise computations are presented. These models differ from traditional models in that a task may be terminated any time after it has produced an acceptable result. Each task is logically decomposed into a mandatory part followed by an optional part. In a feasible schedule, the mandatory part of every task is completed before the deadline of the task. The optional part refines the result produced by the mandatory part to reduce the error in the result.< >
doi_str_mv 10.1109/12.57057
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1109_12_57057</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>57057</ieee_id><sourcerecordid>24975785</sourcerecordid><originalsourceid>FETCH-LOGICAL-c356t-fea8a27b6572c557c126b634890d3f945b5c76c6e218fad17f1daeb72bbb6973</originalsourceid><addsrcrecordid>eNqFkD1PwzAQhi0EEqEgsSIxZAGxpNhObMcjqviSKjHQ3bKdC3XlJsFOhPj3pE0FI9MN73PvnR6ELgmeE4LlPaFzJjATRyghjIlMSsaPUYIxKTOZF_gUncW4wRhzimWC2LtdQzV413ykHQTXVs6mm9bEtF_rPtXet1-p23YBrIuQBoiD7-M5Oqm1j3BxmDO0enpcLV6y5dvz6-Jhmdmc8T6rQZeaCsOZoHZ8xhLKDc-LUuIqr2XBDLOCWw6UlLWuiKhJpcEIaozhUuQzdDvVdqH9HCD2auuiBe91A-0QFS0ZF5TL_8FCCiZKNoJ3E2hDG2OAWnXBbXX4VgSrnT9FqNr7G9GbQ6eOVvs66GZU8MfLIi8Y21VeT1yjo1ZNH-KYyb1ggfkYX02xA4Df7enED9hffv8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>24975785</pqid></control><display><type>article</type><title>Scheduling periodic jobs that allow imprecise results</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Chung, J.-Y. ; Liu, J.W.S. ; Lin, K.-J.</creator><creatorcontrib>Chung, J.-Y. ; Liu, J.W.S. ; Lin, K.-J.</creatorcontrib><description>The problem of scheduling periodic jobs in hard real-time systems that support imprecise computations is discussed. Timing faults are avoided in such systems by making available intermediate, imprecise results of acceptable quality when results of the desired quality cannot be produced on time. Two workload models of imprecise computations are presented. These models differ from traditional models in that a task may be terminated any time after it has produced an acceptable result. Each task is logically decomposed into a mandatory part followed by an optional part. In a feasible schedule, the mandatory part of every task is completed before the deadline of the task. The optional part refines the result produced by the mandatory part to reduce the error in the result.&lt; &gt;</description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/12.57057</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>Legacy CDMS: IEEE</publisher><subject>Applied sciences ; Computational modeling ; Computer Programming And Software ; Computer science ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; NASA ; Process design ; Processor scheduling ; Programming environments ; Programming profession ; Real time systems ; Scheduling algorithm ; Software ; Timing</subject><ispartof>IEEE transactions on computers, 1990-09, Vol.39 (9), p.1156-1174</ispartof><rights>1991 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c356t-fea8a27b6572c557c126b634890d3f945b5c76c6e218fad17f1daeb72bbb6973</citedby><cites>FETCH-LOGICAL-c356t-fea8a27b6572c557c126b634890d3f945b5c76c6e218fad17f1daeb72bbb6973</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/57057$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27923,27924,54795</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=19434555$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Chung, J.-Y.</creatorcontrib><creatorcontrib>Liu, J.W.S.</creatorcontrib><creatorcontrib>Lin, K.-J.</creatorcontrib><title>Scheduling periodic jobs that allow imprecise results</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>The problem of scheduling periodic jobs in hard real-time systems that support imprecise computations is discussed. Timing faults are avoided in such systems by making available intermediate, imprecise results of acceptable quality when results of the desired quality cannot be produced on time. Two workload models of imprecise computations are presented. These models differ from traditional models in that a task may be terminated any time after it has produced an acceptable result. Each task is logically decomposed into a mandatory part followed by an optional part. In a feasible schedule, the mandatory part of every task is completed before the deadline of the task. The optional part refines the result produced by the mandatory part to reduce the error in the result.&lt; &gt;</description><subject>Applied sciences</subject><subject>Computational modeling</subject><subject>Computer Programming And Software</subject><subject>Computer science</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>NASA</subject><subject>Process design</subject><subject>Processor scheduling</subject><subject>Programming environments</subject><subject>Programming profession</subject><subject>Real time systems</subject><subject>Scheduling algorithm</subject><subject>Software</subject><subject>Timing</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1990</creationdate><recordtype>article</recordtype><recordid>eNqFkD1PwzAQhi0EEqEgsSIxZAGxpNhObMcjqviSKjHQ3bKdC3XlJsFOhPj3pE0FI9MN73PvnR6ELgmeE4LlPaFzJjATRyghjIlMSsaPUYIxKTOZF_gUncW4wRhzimWC2LtdQzV413ykHQTXVs6mm9bEtF_rPtXet1-p23YBrIuQBoiD7-M5Oqm1j3BxmDO0enpcLV6y5dvz6-Jhmdmc8T6rQZeaCsOZoHZ8xhLKDc-LUuIqr2XBDLOCWw6UlLWuiKhJpcEIaozhUuQzdDvVdqH9HCD2auuiBe91A-0QFS0ZF5TL_8FCCiZKNoJ3E2hDG2OAWnXBbXX4VgSrnT9FqNr7G9GbQ6eOVvs66GZU8MfLIi8Y21VeT1yjo1ZNH-KYyb1ggfkYX02xA4Df7enED9hffv8</recordid><startdate>19900901</startdate><enddate>19900901</enddate><creator>Chung, J.-Y.</creator><creator>Liu, J.W.S.</creator><creator>Lin, K.-J.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>CYE</scope><scope>CYI</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FD</scope><scope>H8D</scope><scope>L7M</scope><scope>7SC</scope><scope>JQ2</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19900901</creationdate><title>Scheduling periodic jobs that allow imprecise results</title><author>Chung, J.-Y. ; Liu, J.W.S. ; Lin, K.-J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c356t-fea8a27b6572c557c126b634890d3f945b5c76c6e218fad17f1daeb72bbb6973</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1990</creationdate><topic>Applied sciences</topic><topic>Computational modeling</topic><topic>Computer Programming And Software</topic><topic>Computer science</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>NASA</topic><topic>Process design</topic><topic>Processor scheduling</topic><topic>Programming environments</topic><topic>Programming profession</topic><topic>Real time systems</topic><topic>Scheduling algorithm</topic><topic>Software</topic><topic>Timing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chung, J.-Y.</creatorcontrib><creatorcontrib>Liu, J.W.S.</creatorcontrib><creatorcontrib>Lin, K.-J.</creatorcontrib><collection>NASA Scientific and Technical Information</collection><collection>NASA Technical Reports Server</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Technology Research Database</collection><collection>Aerospace Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chung, J.-Y.</au><au>Liu, J.W.S.</au><au>Lin, K.-J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Scheduling periodic jobs that allow imprecise results</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>1990-09-01</date><risdate>1990</risdate><volume>39</volume><issue>9</issue><spage>1156</spage><epage>1174</epage><pages>1156-1174</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>The problem of scheduling periodic jobs in hard real-time systems that support imprecise computations is discussed. Timing faults are avoided in such systems by making available intermediate, imprecise results of acceptable quality when results of the desired quality cannot be produced on time. Two workload models of imprecise computations are presented. These models differ from traditional models in that a task may be terminated any time after it has produced an acceptable result. Each task is logically decomposed into a mandatory part followed by an optional part. In a feasible schedule, the mandatory part of every task is completed before the deadline of the task. The optional part refines the result produced by the mandatory part to reduce the error in the result.&lt; &gt;</abstract><cop>Legacy CDMS</cop><pub>IEEE</pub><doi>10.1109/12.57057</doi><tpages>19</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0018-9340
ispartof IEEE transactions on computers, 1990-09, Vol.39 (9), p.1156-1174
issn 0018-9340
1557-9956
language eng
recordid cdi_crossref_primary_10_1109_12_57057
source IEEE Electronic Library (IEL) Journals
subjects Applied sciences
Computational modeling
Computer Programming And Software
Computer science
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Exact sciences and technology
NASA
Process design
Processor scheduling
Programming environments
Programming profession
Real time systems
Scheduling algorithm
Software
Timing
title Scheduling periodic jobs that allow imprecise results
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T19%3A52%3A53IST&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=Scheduling%20periodic%20jobs%20that%20allow%20imprecise%20results&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Chung,%20J.-Y.&rft.date=1990-09-01&rft.volume=39&rft.issue=9&rft.spage=1156&rft.epage=1174&rft.pages=1156-1174&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/12.57057&rft_dat=%3Cproquest_cross%3E24975785%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c356t-fea8a27b6572c557c126b634890d3f945b5c76c6e218fad17f1daeb72bbb6973%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=24975785&rft_id=info:pmid/&rft_ieee_id=57057&rfr_iscdi=true