Zobrazeno 1 - 10
of 108
pro vyhledávání: '"Johann Blieberger"'
Publikováno v:
Tehnički Vjesnik, Vol 24, Iss 1, Pp 21-30 (2017)
We present a methodology for dispatching trains which prevents deadlocks and includes possible limitation of the available energy provided by the power supply. Our approach applies Kronecker algebra to manipulate matrices. Generally blocking of train
Externí odkaz:
https://doaj.org/article/40aaa806919a4c78a109a9d4b3ae8822
Publikováno v:
Promet (Zagreb), Vol 24, Iss 5, Pp 359-369 (2012)
Deadlock analysis for railway systems differs in several aspects from deadlock analysis in computer science. While the problem of deadlock analysis for standard computer systems is well-understood, multi-threaded embedded computer systems pose new ch
Externí odkaz:
https://doaj.org/article/2121f89e02fd48d0ab62be6d418c76d6
Publikováno v:
2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92f2bcba23226b20dbc3fb25d1b57c3b
https://doi.org/10.1109/isorc52572.2022.9812832
https://doi.org/10.1109/isorc52572.2022.9812832
Autor:
Robert Mittermayr, Johann Blieberger
Publikováno v:
Computing. 103:749-770
Kronecker algebra until now has been applied to concurrent programs that use semaphores and protected objects for synchronization. Like many other programming languages, Ada uses barriers, too. In this paper, we present a new synchronization construc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61f5e44a9df2fc640c360e71c971ec33
https://doi.org/10.1007/s00607-017-0555-8
https://doi.org/10.1007/s00607-017-0555-8
Publikováno v:
Transportation Research Procedia. 27:545-552
Within the project DESTination Rail, funded by the H2020 programme, a task is dedicated to the development of a tool for rail traffic flow optimization during maintenance work. On a single track line, priority is set for as much work as possible to b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92b796771269bdc8327fb49c6ce72f42
https://doi.org/10.1016/j.trpro.2017.12.040
https://doi.org/10.1016/j.trpro.2017.12.040
Autor:
Johann Blieberger, Robert Mittermayr
Publikováno v:
Journal of Software Engineering and Applications. :182-198
Worst-case execution time (WCET) analysis of multi-threaded software is still a challenge. This comes mainly from the fact that synchronization has to be taken into account. In this paper, we focus on this issue and on automatically calculating and i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49f8485276e4ae039ec9da76a70be9d4
https://doi.org/10.4236/jsea.2016.95015
https://doi.org/10.4236/jsea.2016.95015
Autor:
Johann Blieberger, Seongho Jeong, Shinhyung Yang, Yeon-Soo Kim, Byunguk Min, Bernd Burgstaller
Publikováno v:
Journal of Systems Architecture. 110:101764
The current ISO/IEC standard of the Ada programming language does not support non-blocking synchronization. The restriction to locks conflicts with Ada’s design goals for program safety and efficiency, because (1) task failure inside a critical sec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acefad389c30532d6918c73013356509
https://doi.org/10.1016/j.sysarc.2020.101764
https://doi.org/10.1016/j.sysarc.2020.101764
Autor:
Bernd Burgstaller, Johann Blieberger
Publikováno v:
Reliable Software Technologies – Ada-Europe 2018 ISBN: 9783319924311
Ada-Europe
Ada-Europe
The mutual-exclusion property of locks stands in the way to scalability of parallel programs on many-core architectures. Locks do not allow progress guarantees, because a task may fail inside a critical section and keep holding a lock that blocks oth
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea0bd045bea07703a954f9681b12d224
https://doi.org/10.1007/978-3-319-92432-8_4
https://doi.org/10.1007/978-3-319-92432-8_4
Autor:
Johann Blieberger, Markus Bader
This book constitutes the refereed proceedings of the 22nd Ada-Europe International Conference on Reliable Software Technologies, Ada-Europe 2017, held in Vienna, Austria, in June 2017. The revised 15 full papers presented were carefully reviewed and
Publikováno v:
ICPP
String pattern matching with finite automata (FAs) is a well-established method across many areas in computer science. Until now, data dependencies inherent in the pattern matching algorithm have hampered effective parallelization. To overcome the de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4c06a44e6cb4262f37ce422a907a10a
https://doi.org/10.1109/icpp.2017.36
https://doi.org/10.1109/icpp.2017.36