Approximating linear time with finite count clocks

Bibliographic Details
Main Author: Fonseca, Pedro
Publication Date: 2001
Format: Article
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: https://proa.ua.pt/index.php/revdeti/article/view/18132
Summary: In computer systems, actions are trigered, not only by external events, but also by passing of time. In the case of real-time systems, these actions must be executed under strict time constraints. Deciding on what actions to take depends on the correct result of operations like comparing time instants. These are complicated by the fact that clock counters have a limited life span. If care is not taken, their wrap-around may present problems and limit the operating life of a system. We present a simple method to circumvent this problem, based on a counter that has a life span of twice the larger interval of interest. This method is easily and efficiently implemented by using the type cast facilities of language such as C.
id RCAP_67182397e897ff268c2ce6f6d4e6cfc6
oai_identifier_str oai:proa.ua.pt:article/18132
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling Approximating linear time with finite count clocksIn computer systems, actions are trigered, not only by external events, but also by passing of time. In the case of real-time systems, these actions must be executed under strict time constraints. Deciding on what actions to take depends on the correct result of operations like comparing time instants. These are complicated by the fact that clock counters have a limited life span. If care is not taken, their wrap-around may present problems and limit the operating life of a system. We present a simple method to circumvent this problem, based on a counter that has a life span of twice the larger interval of interest. This method is easily and efficiently implemented by using the type cast facilities of language such as C.UA Editora2001-01-01T00:00:00Zjournal articleinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://proa.ua.pt/index.php/revdeti/article/view/18132oai:proa.ua.pt:article/18132Eletrónica e Telecomunicações; Vol 3 No 4 (2001); 359-361Eletrónica e Telecomunicações; vol. 3 n.º 4 (2001); 359-3612182-97721645-0493reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAPenghttps://proa.ua.pt/index.php/revdeti/article/view/18132https://proa.ua.pt/index.php/revdeti/article/view/18132/13035Fonseca, Pedroinfo:eu-repo/semantics/openAccess2022-09-26T11:00:24Zoai:proa.ua.pt:article/18132Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T10:30:01.410815Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv Approximating linear time with finite count clocks
title Approximating linear time with finite count clocks
spellingShingle Approximating linear time with finite count clocks
Fonseca, Pedro
title_short Approximating linear time with finite count clocks
title_full Approximating linear time with finite count clocks
title_fullStr Approximating linear time with finite count clocks
title_full_unstemmed Approximating linear time with finite count clocks
title_sort Approximating linear time with finite count clocks
author Fonseca, Pedro
author_facet Fonseca, Pedro
author_role author
dc.contributor.author.fl_str_mv Fonseca, Pedro
description In computer systems, actions are trigered, not only by external events, but also by passing of time. In the case of real-time systems, these actions must be executed under strict time constraints. Deciding on what actions to take depends on the correct result of operations like comparing time instants. These are complicated by the fact that clock counters have a limited life span. If care is not taken, their wrap-around may present problems and limit the operating life of a system. We present a simple method to circumvent this problem, based on a counter that has a life span of twice the larger interval of interest. This method is easily and efficiently implemented by using the type cast facilities of language such as C.
publishDate 2001
dc.date.none.fl_str_mv 2001-01-01T00:00:00Z
dc.type.driver.fl_str_mv journal article
info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://proa.ua.pt/index.php/revdeti/article/view/18132
oai:proa.ua.pt:article/18132
url https://proa.ua.pt/index.php/revdeti/article/view/18132
identifier_str_mv oai:proa.ua.pt:article/18132
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv https://proa.ua.pt/index.php/revdeti/article/view/18132
https://proa.ua.pt/index.php/revdeti/article/view/18132/13035
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv UA Editora
publisher.none.fl_str_mv UA Editora
dc.source.none.fl_str_mv Eletrónica e Telecomunicações; Vol 3 No 4 (2001); 359-361
Eletrónica e Telecomunicações; vol. 3 n.º 4 (2001); 359-361
2182-9772
1645-0493
reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833590916140498944