A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Influence of different abstractions on the performance analysis of distributed hard real-time systems
2008
Design automation for embedded systems
Preserved Fulltext
System level performance analysis plays a fundamental role in the design process of hard real-time embedded systems. ...
Introduction One of the major challenges in the design process of hard real-time embedded systems is to accurately predict performance characteristics of the final system implementation in early design ...
While the previously mentioned formal performance analysis methods provide hard upper bounds for the worst-case performance and hard lower bounds for the best-case performance of a system, there are also ...
doi:10.1007/s10617-008-9015-1
fatcat:f5vev7eaonbxfmyzxpzvrceepq
Influence of different system abstractions on the performance analysis of distributed real-time systems
2007
Proceedings of the 7th ACM & IEEE international conference on Embedded software - EMSOFT '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
System level performance analysis plays a fundamental role in the design process of real-time embedded systems. ...
We define a set of benchmarks aimed at the evaluation of performance analysis techniques for distributed systems. ...
While in general this might be tolerable for soft real-time systems, it is not for systems with hard real-time requirements. ...
doi:10.1145/1289927.1289959
dblp:conf/emsoft/PerathonerWTHSHREH07
fatcat:2xon3emq45eozcdtyin4sjchyi
Probabilistic Modelling and Evaluation of Soft Real-Time Embedded Systems
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Soft real-time systems are often analysed using hard realtime techniques, which are not suitable to take into account the deadline misses rate allowed in such systems. ...
Therefore, the resulting system is over-dimensioned, thus expensive. To appropriately dimension soft real-time systems, adequate models, capturing their varying runtime behaviour, are needed. ...
From such distribution histograms, the minimum (best case) and the maximum (worst case) values for the end-to-end delays can be deduced. ...
doi:10.1007/11796435_22
fatcat:pnnsqw7dh5esfdtybt273nkeou
Period optimization for hard real-time distributed automotive systems
2007
Proceedings - Design Automation Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This is accomplished by leveraging schedulability analysis within a convex optimization framework to simultaneously assign periods and satisfy end-to-end latency constraints. ...
The need for accommodating legacy tasks and messages further complicates the scenario. In this work, we automatically assign task and message periods for distributed automotive systems. ...
Distributed architectures supporting the execution of hard real-time applications are common not only for automotive, but also for avionics and industrial control systems. ...
doi:10.1145/1278480.1278553
dblp:conf/dac/DavareZNPKS07
fatcat:ly23sqx3efcbzbhmhocgskqnky
Period Optimization for Hard Real-time Distributed Automotive Systems
2007
Proceedings - Design Automation Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This is accomplished by leveraging schedulability analysis within a convex optimization framework to simultaneously assign periods and satisfy end-to-end latency constraints. ...
The need for accommodating legacy tasks and messages further complicates the scenario. In this work, we automatically assign task and message periods for distributed automotive systems. ...
Distributed architectures supporting the execution of hard real-time applications are common not only for automotive, but also for avionics and industrial control systems. ...
doi:10.1109/dac.2007.375172
fatcat:ykmnpz756ndd7kftwe35q3zcg4
An Approximate Timing Analysis Framework for Complex Real-Time Embedded Systems
2010
2010 13th IEEE International Conference on Computational Science and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In such context, not only functional behavior but also non-functional properties of systems have to be assured, i.e., Worst-Case Response Time (WCRT) of tasks has to be known. ...
In addition, the existing relatively well developed theories for modeling and analysis of real-time systems are having problems which limit their application in the context. ...
For this model, the evaluation focuses on the end-to-end response time of the transaction which contains the tasks with the lowest priority. ...
doi:10.1109/cse.2010.21
dblp:conf/cse/LuNK10
fatcat:5w53up5b7zhk5f2xejjzhv43di
Analysis, Design, and Control of Predictable Interconnected Systems (Dagstuhl Seminar 19101)
2019
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Research communities have developed formal theories for predictability which are specialized to each application domain or type of resource (e.g., schedulability analysis for real-time systems or network ...
Time predictability is a key requirement for above systems. ...
We will end highlighting some open challenges towards adequate networking infrastructures for effective dynamic real-time systems. ...
doi:10.4230/dagrep.9.3.1
dblp:journals/dagstuhl-reports/AgrawalBS19
fatcat:jangqlafkfceppxy4xdecrru5y
Analysis of end-to-end QoS for networked virtual reality services in UMTS
2004
IEEE Communications Magazine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a classification of VR services based on delivery requirements (real-time or non-real-time) and degree of interactivity that maps to existing UMTS QoS classes and service attributes. ...
Measurements of network parameters serve to determine the end-to-end QoS requirements of the considered applications, which are in turn mapped to proposed VR service classes. ...
variation tion loss
Conver-
Hard real-
Data,
Distributed
Tightly coupled flight
Two-way End-to-end one-way 50 ms
< 3%
sational
time
graphics, simulations
simulation
delay < 100 ms
packet loss ...
doi:10.1109/mcom.2004.1284929
fatcat:7oworb3wavd5zlnxpnynvw27n4
A metaheuristic to support the distribution of COVID-19 vaccines
2021
Production
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Implications for theory and practice: To mitigate disease, adequate logistics for transporting and distributing vaccines is essential, especially in emergency situations to face pandemic crises. ...
Originality: As far as we know, no metaheuristics has been developed for vaccine distribution, and specifically, to support the Brazilian government. ...
for each case was executed 30 times with the best adaptation alpha for each case, the best solution being considered for analysis. ...
doi:10.1590/0103-6513.20210031
fatcat:6uzedzniavfivg4cmopyx2c7vy
Verifying Weakly-Hard Real-Time Properties of Traffic Streams in Switched Networks
2018
Euromicro Conference on Real-Time Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
performance analysis Keywords and phrases embedded and cyber-physical systems, weakly-hard real-time systems and networks, timing analysis ...
In this paper, we introduce the first verification method which is able to provide weakly-hard real-time guarantees for tasks and task chains in systems with multiple resources under partitioned scheduling ...
Compositional Performance Analysis (CPA) . CPA [11] is a compositional framework to verify classical hard real-time properties, e.g., worst case response times. ...
doi:10.4230/lipics.ecrts.2018.15
dblp:conf/ecrts/AhrendtsQBE18
fatcat:zwxbja44rjel7dfcopiksmbdri
A comparative study of rate monotonic schedulability tests
2011
Journal of Supercomputing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Under fixed priority nonpreemptive real-time systems, current schedulability tests (in exact form) can be divided into: response time based tests, and scheduling points tests. ...
a matter of primary interest to real-time system designers. ...
Keywords Real-time systems · Feasibility analysis · Rate monotonic scheduling
Introduction The main issue involved in the design of real-time systems is of timing correctness and the solution lies in ...
doi:10.1007/s11227-011-0554-z
fatcat:w7gmw2u6fnhf7ligutybkpkxy4
Schedulability-driven frame packing for multi-cluster distributed embedded systems
2003
Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems - LCTES '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
We present an approach to frame packing for multi-cluster distributed embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways. ...
Thus, we have also proposed a schedulability analysis for applications consisting of mixed eventtriggered and time-triggered processes and messages, and a worst case queuing delay analysis for the gateways ...
ACKNOWLEDGEMETNS The authors are grateful to the industrial partners at Volvo Technology Corporation in Gothenburg, for their close involvement and precious feedback during this work. ...
doi:10.1145/780746.780748
fatcat:75tbfjd6ujgzrbo7ltacwbvpli
Schedulability-driven frame packing for multi-cluster distributed embedded systems
2003
Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems - LCTES '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
We present an approach to frame packing for multi-cluster distributed embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways. ...
Thus, we have also proposed a schedulability analysis for applications consisting of mixed eventtriggered and time-triggered processes and messages, and a worst case queuing delay analysis for the gateways ...
ACKNOWLEDGEMETNS The authors are grateful to the industrial partners at Volvo Technology Corporation in Gothenburg, for their close involvement and precious feedback during this work. ...
doi:10.1145/780732.780748
dblp:conf/lctrts/PopEP03
fatcat:6ej6l3ikezfxflztrgj7klgelq
Schedulability-driven frame packing for multicluster distributed embedded systems
2005
ACM Transactions on Embedded Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
We present an approach to frame packing for multi-cluster distributed embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways. ...
Thus, we have also proposed a schedulability analysis for applications consisting of mixed eventtriggered and time-triggered processes and messages, and a worst case queuing delay analysis for the gateways ...
ACKNOWLEDGEMETNS The authors are grateful to the industrial partners at Volvo Technology Corporation in Gothenburg, for their close involvement and precious feedback during this work. ...
doi:10.1145/1053271.1053276
fatcat:ryuhwoltwfbmba7ujqpbu4icma
A Survey and Comparative Study of Hard and Soft Real-Time Dynamic Resource Allocation Strategies for Multi-/Many-Core Systems
2017
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Such systems need to cater for increasingly dynamic workloads, requiring e cient dynamic resource allocation strategies in order to satisfy hard or soft real-time constraints. ...
This article provides an extensive survey of hard and soft real-time dynamic resource allocation strategies proposed over the last two decades and highlights the emerging trends for multi/many-core systems ...
For hard real-time systems, the schedulability tests ensuring timing guarantees, e.g., worst-case response time test [6, 127] and exact schedulability test [13, 49, 57] can be employed. ...
doi:10.1145/3057267
fatcat:ykfrc5lytnehxncsp3wdmvi5uy
« Previous
Showing results 1 — 15 out of 166,050 results