Please use this identifier to cite or link to this item:
https://dspace.upt.ro/xmlui/handle/123456789/1198
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Micea, Mihai | - |
dc.contributor.author | Stângaciu, Cristina-Sorina | - |
dc.contributor.author | Crețu, Vladimir Ioan | - |
dc.date.accessioned | 2020-03-30T12:53:14Z | - |
dc.date.accessioned | 2021-03-01T08:48:44Z | - |
dc.date.available | 2020-03-30T12:53:14Z | - |
dc.date.available | 2021-03-01T08:48:44Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | Mircea, Mihai V.. Analysis of non-preemptive scheduling techniques for HRT systems. Timişoara: Editura Politehnica, 2015 | en_US |
dc.identifier.uri | http://primo.upt.ro:1701/primo-explore/search?query=any,contains,Analysis%20of%20non-preemptive%20scheduling%20techniques%20for%20HRT%20systems&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo | - |
dc.description.abstract | Special cases of hard-real time (HRT) scheduling mechanisms, which provide high predictability regarding task scheduling and execution, are studied in this paper. These mechanisms are all based on a proposed task model called ModX. Extensive evaluation tests have been performed to simulate and analyze the proposed scheduling algorithms and their comparative performance, which is also discussed in this paper. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Timişoara : Editura Politehnica | en_US |
dc.relation.ispartofseries | Seria electronică şi telecomunicaţii;Vol. 60(74), issue 1 (2015) | - |
dc.subject | Scheduling | en_US |
dc.subject | Embedded | en_US |
dc.subject | Hard Real-Time | en_US |
dc.subject | Non-preemptive | en_US |
dc.title | Analysis of non-preemptive scheduling techniques for HRT systems [articol] | en_US |
dc.type | Article | en_US |
Appears in Collections: | Articole științifice/Scientific articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
BUPT_ART_Micea_f.pdf | 136.11 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.