Bounding Preemption Delay within Data Cache Reference Patterns for Real-Time Tasks

Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timing predictability of single real-time tasks has been the focus of much research, bounding the overhead of cache warm-ups after preemptions remains a challenging problem, particularly for data caches. In this paper, we bound the penalty of cache interference for real-time tasks by providing accurate predictions of the data cache behavior across preemptions. For every task, we derive data cache reference patterns for all scalar and non-scalar references. Partial timing of a task is performed up to a preemption point using these patterns. The effects of cache interference are then analyzed using a settheoretic approach, which identifies the number and location of additional misses due to preemption. A feedback mechanism provides the means to interact with the timing analyzer, which subsequently times another interval of a task bounded by the next preemption. Our experimental results demonstrate that it is sufficient to consider the n most expensive preemption points, where n is the maximum possible number of preemptions. Further, it is shown that such accurate modeling of data cache behavior in preemptive systems significantly improves the WCET predictions for a task. To the best of our knowledge, our work of bounding preemption delay for data caches is unprecedented

Bounding Worst-Case Response Time for Tasks With Non-Preemptive Regions

Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a scheduling policy that determines priorities among tasks. Such policies can be non-preemptive or preemptive. While the former reduces analysis complexity and overhead in implementation, the latter provides increased flexibility in terms of schedulability for higher utilizations of arbitrary task sets. In practice, tasks often have non-preemptive regions but are otherwise scheduled preemptively. To bound the WCET of tasks, architectural features have to be considered in the context of a scheduling scheme. In particular, preemption affects caches, which can be modeled by bounding the cache-related preemption delay (CRPD) of a task. In this paper, we propose a framework that provides safe and tight bounds of the data-cache related preemption delay (D-CRPD), the WCET and the worst-case response times, not just for homogeneous tasks under fully preemptive or fully non-preemptive systems, but for tasks with a non-preemptive region. By retaining the option of preemption where legal, task sets become schedulable that might otherwise not be. Yet, by requiring a region within a task to be non-preemptive, correctness is ensured in terms of arbitration of access to shared resources. Experimental results confirm an increase in schedulability of a task set with nonpreemptive regions over an equivalent task set where only those tasks with non-preemptive regions are scheduled nonpreemptively altogether. Quantitative results further indicate that D-CRPD bounds and response-time bounds comparable to task sets with fully non-preemptive tasks can be retained in the presence of short non-preemptive regions. To the best of our knowledge, this is the first framework that performs D-CRPD calculations in a system for tasks with a non-preemptive region

Bounding Worst-Case Data Cache Behavior by Analytically Deriving Cache Reference Patterns

While caches have become invaluable for higher-end architectures due to their ability to hide, in part, the gap between processor speed and memory access times, caches (and particularly data caches) limit the timing predictability for data accesses that may reside in memory or in cache. This is a significant problem for real-time systems. The objective our work is to provide accurate predictions of data cache behavior of scalar and non-scalar references whose reference patterns are known at compile time. Such knowledge about cache behavior provides the basis for significant improvements in bounding the worst-case execution time (WCET) of real-time programs, particularly for hard-to-analyze data caches. We exploit the power of the Cache Miss Equations (CME) framework but lift a number of limitations of traditional CME to generalize the analysis to more arbitrary programs. We further devised a transformation, coined “forced” loop fusion, which facilitates the analysis across sequential loops. Our contributions result in exact data cache reference patterns — in contrast to approximate cache miss behavior of prior work. Experimental results indicate improvements on the accuracy of worst-case data cache behavior up to two orders of magnitude over the original approach. In fact, our results closely bound and sometimes even exactly match those obtained by trace-driven simulation for worst-case inputs. The resulting WCET bounds of timing analysis confirm these findings in terms of providing tight bounds. Overall, our contributions lift analytical approaches to predict data cache behavior to a level suitable for efficient static timing analysis and, subsequently, real-time schedulability of tasks with predictable WCET

Tightening the Bounds on Feasible Preemption Points

Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timing predictability of single real-time tasks has been the focus of much research, bounding the overhead of cache warm-ups after preemptions remains a challenging problem, particularly for data caches. This paper makes multiple contributions. 1) We bound the penalty of cache interference for real-time tasks by providing accurate predictions of data cache behavior across preemptions, including instruction cache and pipeline effects. We show that, when considering cache preemption, the critical instant does not occur upon simultaneous release of all tasks. 2) We develop analysis methods to calculate upper bounds on the number of possible preemption points for each job of a task. To make these bounds tight, we consider the entire range between the best-case and worst-case execution times (BCET and WCET) of higher priority jobs. The effects of cache interference are integrated into the WCET calculations by using a feedback mechanism to interact with a static timing analyzer. Significant improvements in tightening bounds of up to an order of magnitude over two prior methods and up to half a magnitude over a third prior method are obtained by experiments for (a) the number of preemptions, (b) the WCET and (c) the response time of a task. Overall, this work contributes by calculating the worst-case preemption delay under consideration of data caches

Conformational and Circular Dichroism Studies on N-Acetyl-L-Prolyl-D-Alanyl-Methylamide

The compact ordered conformations of the molecule N-Acteyl-L-Prolyl-D-Alanyl-Methylamide have been studied by semiempirical energy calculations in vacuum and circular dichroism (CD) in solution. The presence of ordered structure has been observed in hydrogen bond promoting solvents like trifluoroethanol by CD studies. In hydrogen bond breaking solvents, like trifluoroacetic acid (TFA), significant fraction of the ordered conformers probably assume extended conformation without intramolecular hydrogen bonds and perhaps are in equilibrium with the fraction of compact ordered structures. The trend observed in going from nonpolar to polar solvent is also compatible with the previous NMR studies in solution. The semiempirical energy calculations have been carried out in the allowed region for β-bends. The flexibility of pyrrolidine ring has been incorporated into the calculations. Representative puckerings, namely, A-type (Cy-exo) and B-type (Cy-endo) have been considered in this study. The results show the B-type to be slightly preferred over the A-type in this tripeptide moiety. The minimum energy conformation predicted from these studies agree only minimally with that found in crystal structure. A better agreement is found after performing the calculations using the geometrical data as observed in the crystal structure of this molecule. Our studies demonstrate that solvent solute interactions are minimal in nonpolar solvents and the predicted minimum energy conformations are preserved at least in nonpolar solvents

Ontological Meta-Analysis and Synthesis

We present ontological meta-analysis and synthesis as a method for reviewing, mapping, and visualizing the research literature in a domain cumulatively, logically, systematically, and systemically. The method will highlight the domain’s bright spots which are heavily emphasized, the light spots which are lightly emphasized, the blank spots which are not emphasized, and the blind spots which have been overlooked. It will highlight the biases and asymmetries in the domain’s research; the research can then be realigned to make it stronger and more effective. We illustrate the method using the emerging domain of Public Health Informatics (PHI). We present an ontological framework for the domain, map the literature onto the framework, and highlight its bright, light, and blank/blind spots. We conclude with a discussion of how (a) the results can be used to realign PHI research, and (b) the method can be used in other information systems domains

Engagement on Digital Platforms: A Theoretical Perspective

The new business models enabled by digital platforms and the ecosystems built around them drive the most profound change in the global macroeconomic environment today. User engagement plays a crucial role in value creation for platform business models. Although Information Systems (IS) literature has started examining this key concept, it presents diverse and inconsistent conceptualizations, resulting in an incomplete nomological network of engagement with important antecedents, consequences, and mechanisms left largely unexamined. This study aims to build a theory of engagement for digital platforms. To achieve this goal, we have provided a coherent definition and a preliminary typology in this extended abstract. We will construct a nomological network of engagement in our follow-up study