Zobrazeno 1 - 10
of 40
pro vyhledávání: '"de Groote, Robert"'
Autor:
de Groote, Robert
In the design of real-time systems, time forms a key requirement in a system’s specification. System designers must be able to verify whether a system meets its timing demands or not, e.g., whether it responds to input within a specific time window
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::b80e48c5a7019c9d330e383bb91cf2b2
https://research.utwente.nl/en/publications/on-the-analysis-of-synchronous-dataflow-graphs(ff6b2b38-fdec-4aa3-865e-014a61eac9e2).html
https://research.utwente.nl/en/publications/on-the-analysis-of-synchronous-dataflow-graphs(ff6b2b38-fdec-4aa3-865e-014a61eac9e2).html
Autor:
Ahmad, W., de Groote, Robert, Holzenspies, P.K.F., Stoelinga, Mariëlle Ida Antoinette, van de Pol, Jan Cornelis
Synchronous dataflow (SDF) graphs are a widely used formalism for modelling, analysing and realising streaming applications, both on a single processor and in a multiprocessing context. Efficient schedules are essential to obtain maximal throughput u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::43ef08e83390489890d2fc0cecd0d6fb
https://research.utwente.nl/en/publications/resourceconstrained-optimal-scheduling-of-sdf-graphs-via-timed-automata-extended-version(6f198824-517e-4008-828d-1195e1a330fd).html
https://research.utwente.nl/en/publications/resourceconstrained-optimal-scheduling-of-sdf-graphs-via-timed-automata-extended-version(6f198824-517e-4008-828d-1195e1a330fd).html
Publikováno v:
Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013, 35-46
STARTPAGE=35;ENDPAGE=46;TITLE=Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013
STARTPAGE=35;ENDPAGE=46;TITLE=Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013
Exact temporal analyses of multi-rate synchronous dataflow (MRSDF) graphs, such as computing the maximum achievable throughput, or sufficient buffer sizes required to reach a minimum throughput, require a homogeneous representation called a homogeneo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::714c0a88c8bf107e8ea1a984aedd7200
https://research.utwente.nl/en/publications/6f5e206b-ea6f-4012-9828-0ea5b9bd3e17
https://research.utwente.nl/en/publications/6f5e206b-ea6f-4012-9828-0ea5b9bd3e17
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.
Publikováno v:
2012 38th Euromicro Conference on Software Engineering & Advanced Applications; 1/ 1/2012, p29-38, 10p
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.
Publikováno v:
Scalability of Networks & Services; 2009, p1-14, 14p
Publikováno v:
Proceedings of the 5th International Conference: Soft Computing as Transdisciplinary Science & Technology; 10/28/2008, p663-668, 6p
Autor:
Bargh, Mortaza S., de Groote, Robert
Publikováno v:
Proceedings of the First ACM International Workshop: Mobile Entity Localization & Tracking in GPS-Less Environments; 9/19/2008, p49-54, 6p
Publikováno v:
IEC/IEEE 60079-30-1 Edition 1.0 2015-09; 2015, p777-784, 8p