Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 17 of 17 for “"schedulability analysis"”.
-
Schedulability analysis of resource access control protocols in real-time systems
To guarantee the timing requirements of real-time systems are satisfied, the timing behavior of the systems must be predictable. Priority driven scheduling algorithms, such as the earliest deadline first algorithm, are known to be effective and predictable in scheduling independent tasks. However, …
-
Schedulability analysis and automated implementation of real-time object-oriented design models
… a feasible implementation model using a built-in schedulability analysis tool. The synthesis process is supported by automatic code generation that can take the application design model and the synthesized implementation model and generate code for the target platform. In this thesis, I have …
-
The Design, Analysis, & Application Of Multi-Modal Real-Time Embedded Systems
… modes and application-level modes. Existing schedulability analysis for a real-time multi-modal system (MMS) with software/hardware modes are computationally intractable. In addition, a fast schedulability analysis is desirable in a design-space exploration that determines the "best" …
-
Design Optimization Techniques for Time-Critical Cyber-Physical Systems
… CPS (e.g., system models and their timing and schedulability analysis). As CPS is becoming increasingly complex, there is an urgent need for efficient optimization techniques that can aid the design of large-scale systems. Specifically, techniques that can find good design options in a …
-
Real-Time Embedded Software Modeling and Synthesis using Polychronous Data Flow Languages
… technique of Prelude and expand upon current schedulability analysis techniques for multi-periodic real-time systems.
-
The delay composition theorem on pipeline systems with non-preemptive priority varying scheduling algorithms
… the number of tasks running on the system. The schedulability analysis based on delay composition theorem performs better than traditional analysis techniques. In this paper we break one assumption that has been hold by previous works on delay composition theorem, namely each task has the same …
-
Reducing the cost of real-time software through a cyclic task abstraction for Ada
… GNAT for Bare Boards, impedes the timing analysis of tasks and schedulability analysis of systems. Consequently, Ada and its environments do not reach their potential of producing low-cost, reliable and maintainable real-time systems. This thesis unlocks this latent potential through the …
-
Reducing the cost of real-time software through a cyclic task abstraction for Ada
… GNAT for Bare Boards, impedes the timing analysis of tasks and schedulability analysis of systems. Consequently, Ada and its environments do not reach their potential of producing low-cost, reliable and maintainable real-time systems. This thesis unlocks this latent potential through the …
-
Priority Assignment Algorithms for Real-Time Systems
… various design metrics in addition to the system schedulability when we assign priorities to tasks. There has been a rich set of research studies on the priority assignment algorithms. However, there exist several limitations in the state-of-the-art: 1) the current research focuses on improving …
-
Delay composition theory: A reduction-based schedulability theory for distributed real-time systems
This thesis develops a new reduction-based analysis methodology for studying the worst-case end-to-end delay and schedulability of real-time jobs in distributed systems. The main result is a simple delay composition rule, that computes a worst-case bound on the end-to-end delay of a job, given the …
-
Two concrete problems in timing analysis of embedded software
Static timing analysis is crucial for the design of real-time embedded systems. Static analysis methods analyze a program statically to give an upper bound on the worst case execution time (WCET) of the program. The problem of determining WCET of a program by static analysis methods has to be …
-
A Distributed Open Environment for Real-Time Applications
"Traditional approaches to real-time schedulability analysis tend to require detailed timing attributes and resource usages of all applications that may run concurrently in the system. Reconfiguring such a system is expensive and often done offline. This fact has motivated the design of open system …
-
Real-Time Software Transactional Memory: Contention Managers, Time Bounds, and Implementations
… times under the contention managers through schedulability analysis. Since ECM and RCM preserve the semantics of the underlying real-time scheduler, their maximum transactional retry cost is double the maximum atomic section length. This is improved in the design of LCM, which achieves …
-
Towards Real-time Wireless Sensor Networks
Wireless sensor networks are poised to change the way computer systems interact with the physical world. We plan on entrusting sensor systems to collect medical data from patients, monitor the safety of our infrastructure, and control manufacturing processes in our factories. To date, the focus of …
-
Performance and optimization technologies for software defined industrial networks
… networking by providing a comparative analysis of programmable network concepts, detailing where software-defined networks compare with other concepts and how its principles can be leveraged to evolve industrial networks. Armed with the fundamental principles of programmable networks, …
-
Timing analysis in existing and emerging cyber physical systems
… called budgeted generalized rate monotonic analysis (Budgeted GRMS) in which different applications’ tasks are globally scheduled for avoiding unnecessary priority inversions, yet the CPU resource is still partitioned for temporal isolation among applications. Incorporating the issues of no …
-
Next-generation safety-critical systems on multi-core platforms
… be calculated on individual tasks to compute the schedulability of the complete system when tasks are running together. This fundamental assumption has been broadly accepted by classic scheduling theory for the past three decades; unfortunately, it is not even true in an approximate sense in a …