dc.contributor.author |
Dobias, P |
en |
dc.contributor.author |
Casseau, E |
en |
dc.contributor.author |
Sinnen, Oliver |
en |
dc.coverage.spatial |
Porto, Portugal |
en |
dc.date.accessioned |
2019-05-28T01:50:16Z |
en |
dc.date.issued |
2018 |
en |
dc.identifier.citation |
Dasip 2018. The Conference on Design and Architectures for Signal and Image Processing, Porto, Portugal, 10 Oct 2018 - 12 Oct 2018. Conference on Design and Architectures for Signal and Image Processing, DASIP. IEEE, Piscataway, NJ. 100-105. 2018 |
en |
dc.identifier.isbn |
9781538682371 |
en |
dc.identifier.issn |
2164-9766 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/46642 |
en |
dc.description.abstract |
As transistors scale down, systems are more vulnerable to faults. Their reliability consequently becomes the main concern, especially in safety-critical applications such as automotive sector, aeronautics or nuclear plants. Many methods have already been introduced to conceive fault-tolerant systems and therefore improve the reliability. Nevertheless, several of them are not suitable for real-time embedded systems since they incur significant overheads, other methods may be less intrusive but at the cost of being too specific to a dedicated system. The aim of this paper is to analyse a method making use of two task copies when on-line scheduling tasks on multiprocessor systems. This method can guarantee the system reliability without causing too much overhead and requiring any special hardware components. In addition, it remains general and thus applicable to large amount of systems. Last but not least, this paper studies two techniques of processor allocation policies: the exhaustive search and the first found solution search. It is shown that the exhaustive search is not necessary for efficient fault-tolerant scheduling and that the latter search significantly reduces the computation complexity, which is interesting for embedded systems. |
en |
dc.description.uri |
https://web.fe.up.pt/~specs/events/dasip2018/ |
en |
dc.publisher |
IEEE |
en |
dc.relation.ispartof |
Dasip 2018. The Conference on Design and Architectures for Signal and Image Processing |
en |
dc.relation.ispartofseries |
Conference on Design and Architectures for Signal and Image Processing, DASIP |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.rights.uri |
https://www.ieee.org/publications/rights/author-posting-policy.html |
en |
dc.subject |
Science & Technology |
en |
dc.subject |
Technology |
en |
dc.subject |
Computer Science, Hardware & Architecture |
en |
dc.subject |
Engineering, Electrical & Electronic |
en |
dc.subject |
Computer Science |
en |
dc.subject |
Engineering |
en |
dc.subject |
Embedded real-time systems |
en |
dc.subject |
Fault tolerance |
en |
dc.subject |
Multiprocessor systems |
en |
dc.subject |
On-line scheduling |
en |
dc.subject |
Primary/backup approach |
en |
dc.title |
Comparison of different methods making use of backup copies for fault-tolerant scheduling on embedded multiprocessor systems |
en |
dc.type |
Conference Item |
en |
dc.identifier.doi |
10.1109/DASIP.2018.8597044 |
en |
pubs.begin-page |
100 |
en |
dc.rights.holder |
Copyright: IEEE |
en |
pubs.author-url |
https://ieeexplore.ieee.org/document/8597044 |
en |
pubs.end-page |
105 |
en |
pubs.finish-date |
2018-10-12 |
en |
pubs.place-of-publication |
Piscataway, NJ |
en |
pubs.publication-status |
Published |
en |
pubs.start-date |
2018-10-10 |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |
pubs.subtype |
Proceedings |
en |
pubs.elements-id |
764127 |
en |
pubs.org-id |
Engineering |
en |
pubs.org-id |
Department of Electrical, Computer and Software Engineering |
en |
pubs.record-created-at-source-date |
2019-08-19 |
en |