Analysis of concurrent constraint logic programs with a fixed scheduling rule

The analysis of concurrent constraint programs is a challenge due to the inherently concurrent behaviour of its computational model. However, most implementations of the concurrent paradigm can be viewed as a computation with a fixed scheduling rule which suspends some goals so that their execution is postponed until some condition awakens them. For a certain kind of properties, an analysis defined in these terms is correct. Furthermore, it is much more tractable, and in addition can make use of existing analysis technology for the underlying fixed computation rule. We show how this can be done when the starting point is a framework for the analysis of sequential programs. The resulting analysis, which incorporates suspensions, is adequate for concurrent models where concurrency is localized, e.g. the Andorra model. We refine the analysis for this particular case. Another model in which concurrency is preferably encapsulated, and thus suspensions are local to parts of the computation, is that of CIAO. Nonetheless, the analysis scheme can be generalized to models with global concurrency. We also sketch how this could be done, and we show how the resulting analysis framework could be used for analyzing typical properties, such as suspensión freeness.

Priority function methods for job-lot scheduling.

"Prepared while the author was under contract to Logistics Branch, Office of Naval Research..."

Effects of the pendulum appliance, cervical headgear, and 2 premolar extractions followed by fixed appliances in patients with Class II malocclusion

Introduction: In this retrospective study, we compared the cephalometric effects, the dental-arch changes, and the efficiency of Class II treatment with the pendulum appliance, cervical headgear, or extraction of 2 maxillary premolars, all associated with fixed appliance therapy. Methods: The sample of 82 patients with Class II malocclusion was divided into 3 groups: group 1 patients (n = 22; treatment time, 3.8 years) were treated with the pendulum appliance and fixed orthodontic appliances. Group 2 patients (n = 30; treatment time, 3.2 years) were treated with cervical headgear followed by fixed appliances; group 3 patients (n = 30; treatment time, 2.1 years) were treated with 2 maxillary premolar extractions and fixed appliances. The average starting ages of the groups ranged from 13.2 to 13.8 years. Data were obtained from serial cephalometric measurements and dental casts. The dental casts were analyzed with the treatment priority index. The treatment efficiency index was also used. Results: The 3 treatment protocols produced similar cephalometric effects, especially skeletally. Comparisons among the 2 distalizing appliances (pendulum and cervical headgear) and extraction of 2 maxillary premolars for Class II treatment showed changes primarily in the maxillary dentoalveolar component and dental relationships. The facial profile was similar after treatment, except for slightly more retrusion of the upper lip in the extraction patients. The treatment priority index demonstrated that occlusal outcomes also were similar among the groups. The treatment efficiency index had higher values for the extraction group. Conclusions: The effects of treatment with the pendulum appliance or cervical headgear and extraction of 2 maxillary premolars associated with fixed appliances were similar from both occlusal and cephalometric standpoints. Class II treatment with extraction of maxillary teeth was more efficient because of the shorter treatment time. Differences in maxillary incisor retraction should be noted, but these differences might have been due to greater maxillary dentoalveolar protrusion in the extraction group before treatment. (Am J Orthod Dentofacial Orthop 2009;136:833-42)

Comparison of the effects produced by headgear and pendulum appliances followed by fixed orthodontic treatment

This study compared the effects produced by two different molar distalizers, namely cervical headgear (CHG) and the intraoral pendulum appliance, associated with fixed orthodontic appliances. The headgear group comprised 30 patients (19 females, 11 males), with an initial age of 13.07 years [standard deviation (SD) = 1.3], treated with CHG and fixed orthodontic appliances for a mean period of 3.28 years, and the pendulum group 22 patients (15 females, 7 males), with initial age of 13.75 years (SD = 1.86), treated with the pendulum appliance followed by fixed orthodontic appliances for a mean period of 4.12 years. Lateral cephalograms were taken at the start (T1) and on completion (T2) of orthodontic treatment. The pendulum and CHG groups were similar as to initial age, severity of the Class II malocclusion, gender distribution, initial cephalometric characteristics, and initial and final treatment priority index (TPI). Only treatment time was not similar between the groups, with a need for annualization for data for the pendulum group. The data were compared with independent t-tests. There was significantly greater restriction of maxillary forward growth and improvement of the skeletal maxillomandibular relationship in the CHG group (P < 0.05). The maxillary molars were more mesially tipped and extruded and the mandibular molars more uprighted in the CHG group compared with the pendulum group (P < 0.05). There was more labial tipping of the mandibular incisors and greater overbite reduction in the pendulum group. The pendulum appliance produced only dentoalveolar effects, different from the CHG appliance, which restricted maxillary forward displacement, thus improving the skeletal maxillomandibular relationship.

Non pre-emptive scheduling of messages on SMTV token-passing networks

Fieldbus communication networks aim to interconnect sensors, actuators and controllers within distributed computer-controlled systems. Therefore, they constitute the foundation upon which real-time applications are to be implemented. A specific class of fieldbus communication networks is based on a simplified version of token-passing protocols, where each station may transfer, at most, a single message per token visit (SMTV). In this paper, we establish an analogy between non-preemptive task scheduling in single processors and the scheduling of messages on SMTV token-passing networks. Moreover, we clearly show that concepts such as blocking and interference in non-preemptive task scheduling have their counterparts in the scheduling of messages on SMTV token-passing networks. Based on this task/message scheduling analogy, we provide pre-run-time schedulability conditions for supporting real-time messages with SMTV token-passing networks. We provide both utilisation-based and response time tests to perform the pre-run-time schedulability analysis of real-time messages on SMTV token-passing networks, considering RM/DM (rate monotonic/deadline monotonic) and EDF (earliest deadline first) priority assignment schemes

Scheduling real-time communications with P-NET

In this paper we address the P-NET Medium Access Control (MAC) ability to schedule traffic according to its real-time requirements, in order to support real-time distributed applications. We provide a schedulability analysis based on the P-NET standard, and propose mechanisms to overcome priority inversion problems resulting from the use of FIFO outgoing buffers

Real-time scheduling of parallel tasks in the Linux Kernel

This paper proposes a global multiprocessor scheduling algorithm for the Linux kernel that combines the global EDF scheduler with a priority-aware work-stealing load balancing scheme, enabling parallel real-time tasks to be executed on more than one processor at a given time instant. We state that some priority inversion may actually be acceptable, provided it helps reduce contention, communication, synchronisation and coordination between parallel threads, while still guaranteeing the expected system’s predictability. Experimental results demonstrate the low scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Dynamic global scheduling of parallel real-time tasks

High-level parallel languages offer a simple way for application programmers to specify parallelism in a form that easily scales with problem size, leaving the scheduling of the tasks onto processors to be performed at runtime. Therefore, if the underlying system cannot efficiently execute those applications on the available cores, the benefits will be lost. In this paper, we consider how to schedule highly heterogenous parallel applications that require real-time performance guarantees on multicore processors. The paper proposes a novel scheduling approach that combines the global Earliest Deadline First (EDF) scheduler with a priority-aware work-stealing load balancing scheme, which enables parallel realtime tasks to be executed on more than one processor at a given time instant. Experimental results demonstrate the better scalability and lower scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Server-based scheduling of parallel real-time tasks

Multicore platforms have transformed parallelism into a main concern. Parallel programming models are being put forward to provide a better approach for application programmers to expose the opportunities for parallelism by pointing out potentially parallel regions within tasks, leaving the actual and dynamic scheduling of these regions onto processors to be performed at runtime, exploiting the maximum amount of parallelism. It is in this context that this paper proposes a scheduling approach that combines the constant-bandwidth server abstraction with a priority-aware work-stealing load balancing scheme which, while ensuring isolation among tasks, enables parallel tasks to be executed on more than one processor at a given time instant.

Runtime CRPD management for rate-based scheduling

Temporal isolation is an increasingly relevant con- cern in particular for ARINC-351 and virtualisation- based systems. Traditional approaches like the rate- based scheduling framework RBED do not take into account the impact of preemptions in terms of loss of working set in the acceleration hardware (e.g. caches). While some improvements have been suggested in the literature, they are overly heavy in the presence of small high-priority tasks such as interrupt service routines. Within this paper we propose an approach enabling adaptive assessment of this preemption delay in a tem- poral isolation framework with special consideration of capabilities and limitations of the approach.