Aims: The present study was carried out to evaluate the relationship between the grades of pre-clinical and clinical courses of endodontics, fixed prosthodontics and restorative dentistry achieved by dental students entering Tabriz Faculty of Dentistry in 2009, 2010 and 2011. Materials and methods: The subjects in this retrospective cross-sectional study consisted of dental students entering Ta...

since the report from the national high blood pressure (bp) education program working group on bp in children and adolescents and the introduction of a new description called prehypertension many data have been provided on its rate of progression to hypertension, its prevalence and association with other cardiovascular (cv) risk factors and its therapy. making a diagnosis of prehypertension in ...

Standard analysis for fixed priority scheduling assumes that all the computations for each task must be completed by the task’s deadline. In practice this is rarely the case. The deadline is more correctly associated with the last observable event of the task, interval events and kernel overheads (such as the context switch away from the task) can occur after the deadline. New analysis is prese...

Tasks can be classi ed as either periodic which execute every some time units or vice versa as aperiodic. Sporadic tasks are a special case of aperiodic tasks which are guaranteed to have a minimum spacing between consecutive instances of the same task. Sporadic tasks sets can be handled by modeling them as periodic tasks and therefore we will concentrate on the former two types of tasks. Sched...

The problem of effectively scheduling soft tasks whilst guaranteeing the behaviour of hard tasks has been addressed in many papers and a large number of techniques have been proposed. The dual priority mechanism is an intuitively simple method with low overheads. A hard task is assigned two priorities. Upon invocation, the task starts executing with a low priority and it is promoted to a high p...

In this paper we present a low-cost Slack-Stealing method, named Fast Slack, to be employed in a Fixed Priority scheduling mechanism. The slack obtained is intended to improve the execution of non-critical tasks without jeopardizing the schedulability of the critical ones. The method is compared with the most important one in the realtime theory. We show that the complexity of this method is su...

In this paper, we present a new strategy for providing flexibility in hard real-time systems. This approach, based on dual priorities, retains the offline guarantees afforded to crucial tasks by fixed priority scheduling. Further, it provides an efficient method of responsively scheduling soft tasks and a means of providing online guarantees for tasks with firm deadlines. An effective O (n ) ac...

The Largest Empty Circle problem seeks the largest circle centered within the convex hull of a set P of n points in R2 and devoid of points from P . In this paper, we introduce a query version of this well-studied problem. In our query version, we are required to preprocess P so that when given a query line Q, we can quickly compute the largest empty circle centered at some point on Q and withi...

Scheduling contexts allow flattening hierarchical schedules in virtualized mixed-criticality setups. However, their expressiveness in terms of supported higher-level scheduling algorithms is not yet well understood. This paper makes a first step in this direction by investigating how recently proposed mixed-criticality algorithms can be mapped to fixed-priority scheduling contexts and how sched...

This paper considers the problem of fixed priority scheduling of periodic tasks where each task’s execution priority may vary. Periodic tasks are decomposed into serially executed subtasks. where each subtask is characterized by an execution time and a fixed priority, and is permitted to have a deadline. A method for determining the schedulability of each task is presented along with its theore...