Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Schedulability analysis of real-time multiframe cosimulations on multicore platforms
Date
2019-01-01
Author
Ahsan, Muhammad Uzair
Oğuztüzün, Mehmet Halit S.
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
256
views
0
downloads
Cite This
For real-time simulations, the fidelity of simulation depends not only on the functional accuracy of simulation but also on its timeliness. It is helpful for simulation designers if they can analyze and verify that a simulation will always meet its timing requirements without unnecessarily sacrificing functional accuracy. Abstracting the simulated processes simply as software tasks allows us to transform the problem of verifying timeliness into a schedulability analysis problem where tasks are checked as to whether they are schedulable under the timing constraints or not. In this paper we extend a timed automaton-based framework due to Fersman and Yi for schedulability analysis of real-time systems, for the special case of real-time multiframe cosimulations. To the best of our knowledge, this work is the first to analyze the schedulability of single-or multiframe real-time simulations. We found that there are some special requirements posed by multiframe simulations, which necessitate changes and improvements in the existing framework designed for actual real-time systems. We made the required theoretical extensions to the framework and implemented our extended framework in UPPAAL, a tool for modeling, simulation, and verification of real-time systems modeled as timed automata. The functional correctness and resource requirements of the implemented framework are then demonstrated using simple examples.
Subject Keywords
Electrical and Electronic Engineering
,
General Computer Science
URI
https://hdl.handle.net/11511/36720
Journal
TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES
DOI
https://doi.org/10.3906/elk-1807-334
Collections
Department of Computer Engineering, Article
Suggestions
OpenMETU
Core
Schedulability analysis of real-time multi-frame co-simulations on multi-core platforms
Ahsan, Muhammad Uzair; Oğuztüzün, Mehmet Halit S.; Department of Computer Engineering (2020)
For real-time simulations, the fidelity of simulation does not depend only on the functional accuracy of simulation but also on its timeliness. It is helpful for developers if we can analyze and verify that a simulation will always meet its timing requirements while keeping an acceptable level of accuracy. Abstracting the simulated processes simply as software tasks allows us to transform the problem of verifying timeliness into a schedulability analysis problem where tasks are checked if they are schedulab...
Domain adaptation on graphs by learning graph topologies: theoretical analysis and an algorithm
Vural, Elif (The Scientific and Technological Research Council of Turkey, 2019-01-01)
Traditional machine learning algorithms assume that the training and test data have the same distribution, while this assumption does not necessarily hold in real applications. Domain adaptation methods take into account the deviations in data distribution. In this work, we study the problem of domain adaptation on graphs. We consider a source graph and a target graph constructed with samples drawn from data manifolds. We study the problem of estimating the unknown class labels on the target graph using the...
A new approach for better load balancing of visibility detection and target acquisition calculations
Filiz, Anıl Yiğit; Can, Tolga; Department of Computer Engineering (2010)
Calculating visual perception of entities in simulations requires complex intersection tests between the line of sight and the virtual world. In this study, we focus on outdoor environments which consist of a terrain and various objects located on terrain. Using hardware capabilities of graphics cards, such as occlusion queries, provides a fast method for implementing these tests. In this thesis, we introduce an approach for better load balancing of visibility detection and target acquisition calculations b...
Neural network method for direction of arrival estimation with uniform cylindrical microstrip patch array
Caylar, S.; Dural, G.; Leblebicioğlu, Mehmet Kemal (Institution of Engineering and Technology (IET), 2010-02-01)
In this study, a new neural network algorithm is proposed for real-time multiple source tracking problem with cylindrical patch antenna array based on a previously reported Modified Neural Multiple Source Tracking (MN-MUST) algorithm. The proposed algorithm, namely cylindrical microstrip patch array modified neural multiple source tracking (CMN-MUST) algorithm implements MN-MUST algorithm on a cylindrical microstrip patch array structure. CMN-MUST algorithm uses the advantage of directive pattern of microst...
State-space identification of switching linear discrete time-periodic systems with known scheduling signals
Uyanik, Ismail; Hamzacebi, Hasan; Ankaralı, Mustafa Mert (The Scientific and Technological Research Council of Turkey, 2019-01-01)
In this paper, we propose a novel frequency domain state-space identification method for switching linear discrete time-periodic (LDTP) systems with known scheduling signals. The state-space identification problem of linear time-invariant (LTI) systems has been widely studied both in the time and frequency domains. Indeed, there have been several studies that also concentrated on state-space identification of both continuous and discrete linear time-periodic (LTP) systems. The focus in this study is the fam...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. U. Ahsan and M. H. S. Oğuztüzün, “Schedulability analysis of real-time multiframe cosimulations on multicore platforms,”
TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES
, pp. 3599–3614, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36720.