Learn More
BACKGROUND SH2B1β is a signaling adaptor protein that has been shown to promote neuronal differentiation in PC12 cells and is necessary for the survival of sympathetic neurons. However, the mechanism by which SH2B1β may influence cell survival is not known. RESULTS In this study, we investigated the role of SH2B1β in oxidative stress-induced cell death.(More)
The real-time multiframe task model first studied by Mok and Chen assumes that the computation times of a periodic task vary instance by instance. They have derived an utilization bound for verifying the schedulability of multiframe task sets. Their schedulability test has since been improved by other researchers. In this paper we use the information about(More)
Rate monotonic analysis (RMA) has been shown to be effective in the schedulability analysis of various types of system. This paper focuses on reducing the run time of each RMA-tested system. Based on a new concept of tasks, denoted by the lift-utilization tasks, we propose a novel method to reduce the number of iterative calculations in the derivation of(More)
Real-time scheduling for task sets has been studied, and the corresponding schedulability analysis has been developed. Due to the considerable overheads required to precisely analyze the schedulability of a task set (referred to as exact schedulability analysis), the trade-off between precision and efficiency is widely studied. Many efficient but imprecise(More)
Feasibility and schedulability problems have received considerable attention from the real-time systems research community in recent decades. Since the publication of the Liu and Layland bound, many researchers have tried to improve the schedulability bound of the RM scheduling. The LL bound does not make any assumption on the relationship between any of(More)
Real-time systems using Rate Monotonic fixed priority scheduling can be checked for schedulability either by pessimistic schedulability conditions or exact testing. Exact testing provides a more precise result but cannot always be performed in polynomial time. Audsley et al. proposed one of the earliest methods by iteratively deriving the job response(More)
The imprecise computation model is an extension of the traditional real-time processing model. In this model, each imprecise task is logically divided into two portions: a mandatory portion and an optional portion. Since the optional portions of imprecise tasks can be traded for their deadlines and/or the required quality of service (QoS), the resulting(More)