High-Integrity Performance Monitoring Units in Automotive Chips for Reliable Timing V&V

As software continues to control more system-critical functions in cars, its timing is becoming an integral element in functional safety. Timing validation and verification (V&V) assesses softwares end-to-end timing measurements against given budgets. The advent of multicore processors with massive resource sharing reduces the significance of end-to-end execution times for timing V&V and requires reasoning on (worst-case) access delays on contention-prone hardware resources. While Performance Monitoring Units (PMU) support this finer-grained reasoning, their design has never been a prime consideration in high-performance processors - where automotive-chips PMU implementations descend from - since PMU does not directly affect performance or reliability. To meet PMUs instrumental importance for timing V&V, we advocate for PMUs in automotive chips that explicitly track activities related to worst-case (rather than average) softwares behavior, are recognized as an ISO-26262 mandatory high-integrity hardware service, and are accompanied with detailed documentation that enables their effective use to derive reliable timing estimatesThis work has also been partially supported by the Spanish Ministry of Economy and Competitiveness (MINECO) under grant TIN2015-65316-P and the HiPEAC Network of Excellence. Jaume Abella has been partially supported by the MINECO under Ramon y Cajal postdoctoral fellowship number RYC-2013-14717. Enrico Mezzet has been partially supported by the Spanish Ministry of Economy and Competitiveness under Juan de la Cierva-Incorporación postdoctoral fellowship number IJCI-2016- 27396.Peer ReviewedPostprint (author's final draft

Propagation of Pericentral Necrosis During Acetaminophen-Induced Liver Injury: Evidence for Early Interhepatocyte Communication and Information Exchange.

Acetaminophen (APAP)-induced liver injury is clinically significant, and APAP overdose in mice often serves as a model for drug-induced liver injury in humans. By specifying that APAP metabolism, reactive metabolite formation, glutathione depletion, and mitigation of mitochondrial damage within individual hepatocytes are functions of intralobular location, an earlier virtual model mechanism provided the first concrete multiattribute explanation for how and why early necrosis occurs close to the central vein (CV). However, two characteristic features could not be simulated consistently: necrosis occurring first adjacent to the CV, and subsequent necrosis occurring primarily adjacent to hepatocytes that have already initiated necrosis. We sought parsimonious model mechanism enhancements that would manage spatiotemporal heterogeneity sufficiently to enable meeting two new target attributes and conducted virtual experiments to explore different ideas for model mechanism improvement at intrahepatocyte and multihepatocyte levels. For the latter, evidence supports intercellular communication via exosomes, gap junctions, and connexin hemichannels playing essential roles in the toxic effects of chemicals, including facilitating or counteracting cell death processes. Logic requiring hepatocytes to obtain current information about whether downstream and lateral neighbors have triggered necrosis enabled virtual hepatocytes to achieve both new target attributes. A virtual hepatocyte that is glutathione-depleted uses that information to determine if it will initiate necrosis. When a less-stressed hepatocyte is flanked by at least two neighbors that have triggered necrosis, it too will initiate necrosis. We hypothesize that the resulting intercellular communication-enabled model mechanism is analogous to the actual explanation for APAP-induced hepatotoxicity at comparable levels of granularity

Query-Driven Sampling for Collective Entity Resolution

Probabilistic databases play a preeminent role in the processing and management of uncertain data. Recently, many database research efforts have integrated probabilistic models into databases to support tasks such as information extraction and labeling. Many of these efforts are based on batch oriented inference which inhibits a realtime workflow. One important task is entity resolution (ER). ER is the process of determining records (mentions) in a database that correspond to the same real-world entity. Traditional pairwise ER methods can lead to inconsistencies and low accuracy due to localized decisions. Leading ER systems solve this problem by collectively resolving all records using a probabilistic graphical model and Markov chain Monte Carlo (MCMC) inference. However, for large datasets this is an extremely expensive process. One key observation is that, such exhaustive ER process incurs a huge up-front cost, which is wasteful in practice because most users are interested in only a small subset of entities. In this paper, we advocate pay-as-you-go entity resolution by developing a number of query-driven collective ER techniques. We introduce two classes of SQL queries that involve ER operators --- selection-driven ER and join-driven ER. We implement novel variations of the MCMC Metropolis Hastings algorithm to generate biased samples and selectivity-based scheduling algorithms to support the two classes of ER queries. Finally, we show that query-driven ER algorithms can converge and return results within minutes over a database populated with the extraction from a newswire dataset containing 71 million mentions

Adaptive Time- and Process-Aware Information Systems

For the digitized enterprise the proper handling of the temporal aspects of its business processes is vital. Delivery times, appointments and deadlines must be met, processing times and durations be monitored, and optimization objectives shall be pursued. However, contemporary Process-Aware Information Systems (PAISs)--the go-to solution for the computer-aided support of business processes—still lack a sophisticated support of the time perspective. Hence, there is a high demand for a more profound support of temporal aspects in PAISs. Accordingly, both the specification and the operational support of temporal aspects constitute fundamental challenges for the further development and dissemination of PAISs. The aim of this thesis is to propose a framework for supporting the time perspective of business processes in PAISs. As PAISs enable the design, execution and evolution of business processes, the designated framework must support these three fundamental phases of the process life cycle. The ATAPIS framework proposed by this thesis essentially comprises three major com-ponents. First, a universal and comprehensive set of time patterns is provided. Respective time patterns represent temporal concepts commonly found in business processes and are based on empirical evidence. In particular, they provide a universal and comprehensive set of notions for describing temporal aspects in business processes. Moreover, a precise formal semantics for each of the time patterns is provided based on an in-depth analysis of a large set of real-world use cases. Respective formal semantics enable the proper integration of the time patterns into PAISs. In turn, the latter will allow for the specification of time-aware process schemas. Second, a generic framework for implementing the time patterns based on their formal semantics is developed. The framework and its techniques enable the verification of time-aware process schemas regarding their temporal consistency, i. e., their ability to be successfully executed without violating any of their temporal constraints. Subsequently, the framework is extended to consider advanced aspects like the contingent nature of activity durations and alternative execution paths as well. Moreover, an algorithm as well as techniques for executing and monitoring time-aware process instances in PAISs is provided. Based on the presented concepts, it becomes possible to ensure that a time-aware process instance may be executed without violating any of its temporal constraints. Third, a set of change operations for dynamically modifying time-aware process instances during run time is suggested. Respective change operations ensure that a modified time-aware process instance remains temporally consistent after the respective modification. Moreover, to reduce the complexity involved when applying multiple change operations a sophisticated approximation-based technique is presented. Overall, the developed change operations allow providing the flexibility required by business processes in practice. Altogether, the ATAPIS framework provides fundamental concepts, techniques and algorithms for integrating the time perspective into PAISs. As beauty of this framework the specification, execution and evolution of business processes is supported by an integrated approach

A delay-based dynamic scheduling algorithm for bag-of-task workflows with stochastic task execution times in clouds

[EN] Bag-of-Tasks (BoT) workflows are widespread in many big data analysis fields. However, there are very few cloud resource provisioning and scheduling algorithms tailored for BoT workflows. Furthermore, existing algorithms fail to consider the stochastic task execution times of BoT workflows which leads to deadline violations and increased resource renting costs. In this paper, we propose a dynamic cloud resource provisioning and scheduling algorithm which aims to fulfill the workflow deadline by using the sum of task execution time expectation and standard deviation to estimate real task execution times. A bag-based delay scheduling strategy and a single-type based virtual machine interval renting method are presented to decrease the resource renting cost. The proposed algorithm is evaluated using a cloud simulator ElasticSim which is extended from CloudSim. The results show that the dynamic algorithm decreases the resource renting cost while guaranteeing the workflow deadline compared to the existing algorithms. (C) 2017 Elsevier B.V. All rights reserved.The authors would like to thank the reviewers for their constructive and useful comments. This work is supported by the National Natural Science Foundation of China (Grant No. 61602243 and 61572127), the Natural Science Foundation ofJiangsu Province (Grant No. BK20160846), Jiangsu Key Laboratory of Image and Video Understanding for Social Safety (Nanjing University of Science and Technology, Grant No. 30916014107), the Fundamental Research Funds for the Central University (Grant No. 30916015104). Ruben Ruiz is partially supported by the Spanish Ministry of Economy and Competitiveness, under the project "SCHEYARD" (No. DP12015-65895-R) co-financed by FEDER funds.Cai, Z.; Li, X.; Ruiz García, R.; Li, Q. (2017). A delay-based dynamic scheduling algorithm for bag-of-task workflows with stochastic task execution times in clouds. Future Generation Computer Systems. 71:57-72. https://doi.org/10.1016/j.future.2017.01.020S57727