| 1. |
- Lüscher, Bernhard, et al.
(författare)
-
ADP-ribosyltransferases, an update on function and nomenclature
- 2022
-
Ingår i: The FEBS Journal. - : John Wiley & Sons. - 1742-464X .- 1742-4658. ; 289:23, s. 7399-7410
-
Tidskriftsartikel (refereegranskat)abstract
- ADP-ribosylation, a modification of proteins, nucleic acids, and metabolites, confers broad functions, including roles in stress responses elicited, for example, by DNA damage and viral infection and is involved in intra- and extracellular signaling, chromatin and transcriptional regulation, protein biosynthesis, and cell death. ADP-ribosylation is catalyzed by ADP-ribosyltransferases (ARTs), which transfer ADP-ribose from NAD+ onto substrates. The modification, which occurs as mono- or poly-ADP-ribosylation, is reversible due to the action of different ADP-ribosylhydrolases. Importantly, inhibitors of ARTs are approved or are being developed for clinical use. Moreover, ADP-ribosylhydrolases are being assessed as therapeutic targets, foremost as antiviral drugs and for oncological indications. Due to the development of novel reagents and major technological advances that allow the study of ADP-ribosylation in unprecedented detail, an increasing number of cellular processes and pathways are being identified that are regulated by ADP-ribosylation. In addition, characterization of biochemical and structural aspects of the ARTs and their catalytic activities have expanded our understanding of this protein family. This increased knowledge requires that a common nomenclature be used to describe the relevant enzymes. Therefore, in this viewpoint, we propose an updated and broadly supported nomenclature for mammalian ARTs that will facilitate future discussions when addressing the biochemistry and biology of ADP-ribosylation. This is combined with a brief description of the main functions of mammalian ARTs to illustrate the increasing diversity of mono- and poly-ADP-ribose mediated cellular processes.
|
|
| 2. |
- Altmeyer, Sebastian, et al.
(författare)
-
Parametric timing analysis for complex architectures
- 2008
-
Ingår i: Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008. - 9780769533490 ; , s. 367-376
-
Konferensbidrag (refereegranskat)abstract
- Hard real-time systems have stringent timing constraints expressed in units of time. To ensure that a task finishes within its time-frame, the designer of such a system must be able to derive upper bounds on the task's worst-case execution time (WCET). To compute such upper bounds, timing analyses are used. These analyses require that information such as bounds on the maximum numbers of loop iterations are known statically, i.e. during design time. Parametric timing analysis softens these requirements: it yields symbolic formulas instead of single numeric values representing the upper bound on the task's execution time.In this paper, we present a new parametric timing analysis that is able to derive safe and precise results. Our method determines what the parameters of the program are, constructs parametric loop bounds, takes processor behaviour into account and attains a formula automatically. In the end, we present tests to show that the precision and runtime of our analysis are very close to those of numeric timing analysis.
|
|
| 3. |
- Bril, Reinder J., et al.
(författare)
-
Integrating Cache-Related Pre-emption Delays into Analysis of Fixed Priority Scheduling with Pre-emption Thresholds
- 2015
-
Ingår i: Proceedings - Real-Time Systems Symposium. - 9781479972890 ; , s. 161-172
-
Konferensbidrag (refereegranskat)abstract
- Cache-related pre-emption delays (CRPD) have been integrated into the schedulability analysis of sporadic tasks with constrained deadlines for fixed-priority pre-emptive scheduling (FPPS). This paper generalizes that work by integrating CRPD into the schedulability analysis of tasks with arbitrary deadlines for fixed-priority pre-emption threshold scheduling (FPTS). The analysis is complemented by an optimal threshold assignment algorithm that minimizes CRPD. The paper includes a comparative evaluation of the schedulability ratios of FPPS and FPTS, for constrained-deadline tasks, taking CRPD into account.
|
|
| 4. |
- Hatvani, Leo, et al.
(författare)
-
Schedulability using native non-preemptive groups on an AUTOSAR/OSEK platform with caches
- 2017
-
Ingår i: Proceedings of the 2017 Design, Automation and Test in Europe, DATE 2017. - : Institute of Electrical and Electronics Engineers (IEEE). - 9783981537093 ; , s. 244-249
-
Konferensbidrag (refereegranskat)abstract
- Fixed-priority preemption threshold scheduling (FPTS) is a limited preemptive scheduling scheme that generalizes both fixed-priority preemptive scheduling (FPPS) and fixed-priority non-preemptive scheduling (FPNS). By increasing the priority of tasks as they start executing it reduces the set of tasks that can preempt any given task. A subset of FPTS task configurations can be implemented natively on any AUTOSAR/OSEK compatible platform by utilizing the platform's native implementation of non-preemptive task groups via so called internal resources. The limiting factor for this implementation is the number of internal resources that can be associated with any individual task. OSEK and consequently AUTOSAR limit this number to one internal resource per task. In this work, we investigate the impact of this limitation on the schedulability of task sets when cache related preemption delays are taken into account. We also consider the impact of this restriction on the stack size when the tasks are executed on a shared-stack system.
|
|
| 5. |
- J. Bril, Reinder, et al.
(författare)
-
Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays : integrated analysis and evaluation
- 2017
-
Ingår i: Real-time systems. - : Springer Science and Business Media LLC. - 0922-6443 .- 1573-1383. ; 53:4, s. 403-466
-
Tidskriftsartikel (refereegranskat)abstract
- Commercial off-the-shelf programmable platforms for real-time systems typically contain a cache to bridge the gap between the processor speed and main memory speed. Because cache-related pre-emption delays (CRPD) can have a significant influence on the computation times of tasks, CRPD have been integrated in the response time analysis for fixed-priority pre-emptive scheduling (FPPS). This paper presents CRPD aware response-time analysis of sporadic tasks with arbitrary deadlines for fixed-priority pre-emption threshold scheduling (FPTS), generalizing earlier work. The analysis is complemented by an optimal (pre-emption) threshold assignment algorithm, assuming the priorities of tasks are given. We further improve upon these results by presenting an algorithm that searches for a layout of tasks in memory that makes a task set schedulable. The paper includes an extensive comparative evaluation of the schedulability ratios of FPPS and FPTS, taking CRPD into account. The practical relevance of our work stems from FPTS support in AUTOSAR, a standardized development model for the automotive industry. [(This paper forms an extended version of Bril et al. (in Proceedings of 35th IEEE real-time systems symposium (RTSS), 2014). The main extensions are described in Sect. 1.2.].
|
|
| 6. |
- Markovic, Filip, et al.
(författare)
-
Improving the accuracy of cache-aware response time analysis using preemption partitioning
- 2020
-
Ingår i: Leibniz International Proceedings in Informatics, LIPIcs. - 9783959771528
-
Konferensbidrag (refereegranskat)abstract
- Schedulability analyses for preemptive real-time systems need to take into account cache-related preemption delays (CRPD) caused by preemptions between the tasks. The estimation of the CRPD values must be sound, i.e. it must not be lower than the worst-case CRPD that may occur at runtime, but also should minimise the pessimism of estimation. The existing methods over-approximate the computed CRPD upper bounds by accounting for multiple preemption combinations which cannot occur simultaneously during runtime. This over-approximation may further lead to the over-approximation of the worst-case response times of the tasks, and therefore a false-negative estimation of the system’s schedulability. In this paper, we propose a more precise cache-aware response time analysis for sporadic real-time systems under fully-preemptive fixed priority scheduling. The evaluation shows a significant improvement over the existing state of the art approaches.
|
|
| 7. |
- Markovic, Filip, 1992-
(författare)
-
Improving the Schedulability of Real Time Systems under Fixed Preemption Point Scheduling
- 2018
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- During the past decades of research in Real-Time systems, non-preemptive scheduling and fully preemptive scheduling have been extensively investigated, as well as compared with each other. However, it has been shown that none of the two scheduling paradigms dominates over the other in terms of schedulability. In this context, Limited Preemptive Scheduling (LPS) has emerged as an attractive alternative with respect to, e.g., increasing the overall system schedu- lability, efficiently reducing the blocking by lower priority tasks (compared to non-preemptive scheduling) as well as efficiently controlling the number of preemptions, thus controlling the overall preemption-related delay (compared to fully-preemptive scheduling).Several approaches within LPS enable the above mentioned advantages. In our work, we consider the Fixed Preemption Point Scheduling (LP-FPP) as it has been proved to effectively reduce the preemption-related delay compared to other LPS approaches. In particular, LP-FPP facilitates more precise estimation of the preemption-related delays, since the preemption points of a task in LP-FPP are explicitly selected during the design phase, unlike the other LPS approaches where the preemption points are determined at runtime.The main goal of the proposed work is to improve the schedulability of real-time systems under the LP-FPP approach. We investigate its use in different domains, such as: single core hard real-time systems, partitioned multi-core systems and real-time systems which can occasionally tolerate deadline misses. We enrich the state of the art for the single core hard real-time systems by proposing a novel cache-related preemption delay analysis, towards reducing the pessimism of the previously proposed methods. In the context of partitioned multi-core scheduling we propose a novel partitioning criterion for the Worst-Fit Decreasing based partitioning, and we also contribute with the comparison of existing partitioning strategies for LP-FPP scheduling. Finally, in the context of real-time systems which can occasionally tolerate deadline misses, we contribute with a probabilistic response time analysis for LP-FPP scheduling and a preemption point selection method for reducing the deadline-misses of the tasks.
|
|
