Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Huyen Chau Nguyen"'
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031066771
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0116a59c96dee4b14fc0251f423f9e69
https://doi.org/10.1007/978-3-031-06678-8_33
https://doi.org/10.1007/978-3-031-06678-8_33
Autor:
Thi Huyen Chau Nguyen, Werner Grass
Publikováno v:
Real-Time Systems. 54:1-30
We consider fixed priority sporadic tasks with arbitrary deadlines to be executed upon a uni-processor platform. Efficient schedulability tests for this task model are required for both online task admission in dynamic systems and interactive design
Publikováno v:
IEEE Transactions on Computers. 64:1805-1818
Response time analysis is required both for on-line admission of applications in dynamic systems and as an integral part of design tools for complex distributed real-time systems. We consider sporadic tasks with fixed-priorities and arbitrary deadlin
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Matthias Stumpp, Sebastian Schlag, Peter Sanders, Emanuel Jobstl, Alexander Noe, Tobias Sturm, Huyen Chau Nguyen, Timo Bingmann, Michael Axtmann, Sebastian Lamm
Publikováno v:
IEEE BigData
We present the design and a first performance evaluation of Thrill -- a prototype of a general purpose big data processing framework with a convenient data-flow style programming interface. Thrill is somewhat similar to Apache Spark and Apache Flink
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b07e56dcccc897d783b1d59a48f9f33
Publikováno v:
IEEE Transactions on Computers
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2009, 58 (2), pp.279--286. ⟨10.1109/TC.2008.167⟩
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2009, 58 (2), pp.279--286. ⟨10.1109/TC.2008.167⟩
Since worst case response times must be determined repeatedly during the interactive design of real-time application systems, repeated exact computation of such response times would slow down the design process considerably. In this research, we iden
Autor:
Thi Huyen Chau Nguyen, Werner Grass
Publikováno v:
Real-Time Systems. 54:31-31
Publikováno v:
RTNS
We consider real-time tasks under fixed-priority scheduling with deferred preemption (FPDS) and arbitrary deadlines. Exact response time analysis is known but exhibits to high computational cost. Effective sufficient test has been proposed under cert
Publikováno v:
ETFA
In this paper we propose parametric approximation algorithm (Fully Polynomial Time Approximation Scheme — FPTAS) that defines a compromise on the precision of computed worst-case response time upper bounds and the amount of extra processor speed re