Please use this identifier to cite or link to this item:
https://dspace.upt.ro/xmlui/handle/123456789/1024
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Stângaciu, Valentin | - |
dc.contributor.author | Micea, Mihai | - |
dc.contributor.author | Crețu, Vladimir Ioan | - |
dc.contributor.author | Datcu, O. | - |
dc.date.accessioned | 2020-03-20T07:56:54Z | - |
dc.date.accessioned | 2021-03-01T08:41:22Z | - |
dc.date.available | 2020-03-20T07:56:54Z | - |
dc.date.available | 2021-03-01T08:41:22Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | Stângaciu, Valentin. INVERTA - specification of real-time scheduling algorithms. Timişoara: Editura Politehnica, 2015 | en_US |
dc.identifier.uri | http://primo.upt.ro:1701/primo-explore/search?query=any,contains,INVERTA%20-%20specification%20of%20real-time%20scheduling%20algorithms&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo | - |
dc.description.abstract | This paper describes how the scheduling algorithms for real time applications can be specified formally and the development of a simulator that verifies if a set of tasks for a real time application can be scheduled with an existing scheduling algorithm or with an algorithm defined by the user. This simulator is part of the integrated visual environment for designing and analysing real-time applications called INVERT | en_US |
dc.language.iso | en | en_US |
dc.publisher | 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 | Real-time | en_US |
dc.subject | Simulator | en_US |
dc.title | INVERTA - specification of real-time scheduling algorithms [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_Stângaciu_f.pdf | 293.35 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.