Intra-type migrative scheduling of implicit-deadline sporadic tasks on two- type heterogeneous multiprocessor

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform. Each processor is either of type-1 or type-2 with each task having different execution time on each processor type. Jobs can migrate between processors of same type (referred to as intra-type migration) but cannot migrate between processors of different types. We present a new scheduling algorithm namely, LP-Relax(THR) which offers a guarantee that if a task set can be scheduled to meet deadlines by an optimal task assignment scheme that allows intra-type migration then LP-Relax(THR) meets deadlines as well with intra-type migration if given processors 1/THR as fast (referred to as speed competitive ratio) where THR <= 2/3.

Self-similarity principle: the reduced description of randomness

A new general fitting method based on the Self-Similar (SS) organization of random sequences is presented. The proposed analytical function helps to fit the response of many complex systems when their recorded data form a self-similar curve. The verified SS principle opens new possibilities for the fitting of economical, meteorological and other complex data when the mathematical model is absent but the reduced description in terms of some universal set of the fitting parameters is necessary. This fitting function is verified on economical (price of a commodity versus time) and weather (the Earth’s mean temperature surface data versus time) and for these nontrivial cases it becomes possible to receive a very good fit of initial data set. The general conditions of application of this fitting method describing the response of many complex systems and the forecast possibilities are discussed.

Global-EDF scheduling of multimode real- time systems considering mode independent tasks

Embedded real-time systems often have to support the embedding system in very different and changing application scenarios. An aircraft taxiing, taking off and in cruise flight is one example. The different application scenarios are reflected in the software structure with a changing task set and thus different operational modes. At the same time there is a strong push for integrating previously isolated functionalities in single-chip multicore processors. On such multicores the behavior of the system during a mode change, when the systems transitions from one mode to another, is complex but crucial to get right. In the past we have investigated mode change in multiprocessor systems where a mode change requires a complete change of task set. Now, we present the first analysis which considers mode changes in multicore systems, which use global EDF to schedule a set of mode independent (MI) and mode specific (MS) tasks. In such systems, only the set of MS tasks has to be replaced during mode changes, without jeopardizing the schedulability of the MI tasks. Of prime concern is that the mode change is safe and efficient: i.e. the mode change needs to be performed in a predefined time window and no deadlines may be missed as a function of the mode change.

A 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources

We present a 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources.

Scheduling sporadic tasks on multiprocessors with mutual exclusion constraints

Consider the problem of scheduling sporadic tasks on a multiprocessor platform under mutual exclusion constraints. We present an approach which appears promising for allowing large amounts of parallel task executions and still ensures low amounts of blocking.

Assigning real-time tasks on heterogeneous multiprocessors with two types of processors

Consider the problem of scheduling a set of implicitdeadline sporadic tasks on a heterogeneous multiprocessor so as to meet all deadlines. Tasks cannot migrate and the platform is restricted in that each processor is either of type-1 or type-2 (with each task characterized by a different speed of execution upon each type of processor). We present an algorithm for this problem with a timecomplexity of O(n·m), where n is the number of tasks and m is the number of processors. It offers the guarantee that if a task set can be scheduled by any non-migrative algorithm to meet deadlines then our algorithm meets deadlines as well if given processors twice as fast. Although this result is proven for only a restricted heterogeneous multiprocessor, we consider it significant for being the first realtime scheduling algorithm to use a low-complexity binpacking approach to schedule tasks on a heterogeneous multiprocessor with provably good performance.

A pseudo-medium-wide 8-competitive interface for two-level compositional real-time scheduling of constrained- deadline sporadic tasks on a uniprocessor

Compositional real-time scheduling clearly requires that ”normal” real-time scheduling challenges are addressed but challenges intrinsic to compositionality must be addressed as well, in particular: (i) how should interfaces be described? and (ii) how should numerical values be assigned to parameters constituting the interfaces? The real-time systems community has traditionally used narrow interfaces for describing a component (for example, a utilization/bandwidthlike metric and the distribution of this bandwidth in time). In this paper, we introduce the concept of competitive ratio of an interface and show that typical narrow interfaces cause poor performance for scheduling constrained-deadline sporadic tasks (competitive ratio is infinite). Therefore, we explore more expressive interfaces; in particular a class called medium-wide interfaces. For this class, we propose an interface type and show how the parameters of the interface should be selected. We also prove that this interface is 8-competitive.

Conjecture about global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks: the utilization bound of SM-US(sqrt(2)-1) is sqrt(2)-1

Consider global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks. I conjecture that the utilization bound of SM-US(√2−1) is √2-1.

Optimising and adapting the QoS of a dynamic set of inter-dependent tasks

Due to the growing complexity and adaptability requirements of real-time systems, which often exhibit unrestricted Quality of Service (QoS) inter-dependencies among supported services and user-imposed quality constraints, it is increasingly difficult to optimise the level of service of a dynamic task set within an useful and bounded time. This is even more difficult when intending to benefit from the full potential of an open distributed cooperating environment, where service characteristics are not known beforehand and tasks may be inter-dependent. This paper focuses on optimising a dynamic local set of inter-dependent tasks that can be executed at varying levels of QoS to achieve an efficient resource usage that is constantly adapted to the specific constraints of devices and users, nature of executing tasks and dynamically changing system conditions. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves as the algorithms are given more time to run, with a minimum overhead when compared against their traditional versions.

Democratic dialogue and collective learning in the context of self-managed teams

This paper provides a longitudinal, empirical view of the multifaceted and reciprocal processes of organizational learning in a context of self-managed teams. Organizational learning is seen as a social construction between people and actions in a work setting. The notion of learning as situated (Brown & Duguid 1989, Lave& Wenger 1991, Gherardi & al. 1998, Easterby-Smith & Araujo 1999, Abma 2003) opens up the possibility for placing the focus of research on learning in the community rather than in individual learning processes. Further, in studying processes in their social context, we cannot avoid taking power relations into consideration (Contu & Willmott 2003). The study is based on an action research with a methodology close to the ‘democratic dialogue’ presented by Gustavsen (2001). This gives a ground for research into how the learning discourse developed in the case study organization over a period of 5 years, during which time the company abandoned a middle management level of hierarchy and the teams had to figure out how to work as self-managed units. This paper discusses the (re)construction of power relations and its role in organizational learning. Power relations are discussed both in vertical and horizontal work relations. A special emphasis is placed on the dialectic between managerial aims and the space for reflection on the side of employees. I argue that learning is crucial in the search for the limits for empowerment and that these limits are negotiated both in actions and speech. This study unfolds a purpose-oriented learning process, constructing an open dialogue, and describes a favourable context for creative, knowledge building communities.

Psychological well-being and perception of disease severity in people with multiple sclerosis, who underwent a program of self-regulation to promote physical activity

Rehabilitation is very important for in the results of treatment in individuals with multiple sclerosis. Rehabilitation processes occur through gradual changes. These changes integrate intrinsic and extrinsic mechanisms of the individual, promoting adaptations to the needs and activities of daily living according to individual goals. Recommendations for exercise in multiple sclerosis: these recommendations apply only to patients with EDSS less than 7; moderate intensity aerobic exercise for a total of 20 to 30 minutes, twice or three times for week; the resistance training with low or moderate intensity is well tolerated by patients with MS; associated with these exercises were recommended flexibility exercises of moderate intensity, as well as strengthening exercises. The aim of this study is to examine the implications of the program of self-regulation in the perception of illness and mental health (psychological well-being domain) in multiple sclerosis patients.

Exact admission-control for integrated aperiodic and periodic tasks

Admission controllers are used to prevent overload in systems with dynamically arriving tasks. Typically, these admission controllers are based on suÆcient (but not necessary) capacity bounds in order to maintain a low computational complexity. In this paper we present how exact admission-control for aperiodic tasks can be eÆciently obtained. Our rst result is an admission controller for purely aperiodic task sets where the test has the same runtime complexity as utilization-based tests. Our second result is an extension of the previous controller for a baseload of periodic tasks. The runtime complexity of this test is lower than for any known exact admission-controller. In addition to presenting our main algorithm and evaluating its performance, we also discuss some general issues concerning admission controllers and their implementation.

A framework for the response time analysis of fixed-priority tasks with stochastic inter-arrival times

Real-time scheduling usually considers worst-case values for the parameters of task (or message stream) sets, in order to provide safe schedulability tests for hard real-time systems. However, worst-case conditions introduce a level of pessimism that is often inadequate for a certain class of (soft) real-time systems. In this paper we provide an approach for computing the stochastic response time of tasks where tasks have inter-arrival times described by discrete probabilistic distribution functions, instead of minimum inter-arrival (MIT) values.

Self-reported diabetes in older people: comparison of prevalences and control measures

OBJECTIVE The objective of this study was to analyze the prevalence of diabetes in older people and the adopted control measures.METHODS Data regarding older diabetic individuals who participated in the Health Surveys conducted in the Municipality of Sao Paulo, SP, ISA-Capital, in 2003 and 2008, which were cross-sectional studies, were analyzed. Prevalences and confidence intervals were compared between 2003 and 2008, according to sociodemographic variables. The combination of the databases was performed when the confidence intervals overlapped. The Chi-square (level of significance of 5%) and the Pearson’s Chi-square (Rao-Scott) tests were performed. The variables without overlap between the confidence intervals were not tested.RESULTS The age of the older adults was 60-69 years. The majority were women, Caucasian, with an income of between > 0.5 and 2.5 times the minimum salary and low levels of schooling. The prevalence of diabetes was 17.6% (95%CI 14.9;20.6) in 2003 and 20.1% (95%CI 17.3;23.1) in 2008, which indicates a growth over this period (p at the limit of significance). The most prevalent measure adopted by the older adults to control diabetes was hypoglycemic agents, followed by diet. Physical activity was not frequent, despite the significant differences observed between 2003 and 2008 results. The use of public health services to control diabetes was significantly higher in older individuals with lower income and lower levels of education.CONCLUSIONS Diabetes is a complex and challenging disease for patients and the health systems. Measures that encourage health promotion practices are necessary because they presented a smaller proportion than the use of hypoglycemic agents. Public health policies should be implemented, and aimed mainly at older individuals with low income and schooling levels. These changes are essential to improve the health condition of older diabetic patients.

Trends in public health policies addressing violence against women

OBJECTIVE To analyze the content of policies and action plans within the public healthcare system that addresses the issue of violence against women.METHODS A descriptive and comparative study was conducted on the health policies and plans in Catalonia and Costa Rica from 2005 to 2011. It uses a qualitative methodology with documentary analysis. It is classified by topics that describe and interpret the contents. We considered dimensions, such as principles, strategies, concepts concerning violence against women, health trends, and evaluations.RESULTS Thirteen public policy documents were analyzed. In both countries’ contexts, we have provided an overview of violence against women as a problem whose roots are in gender inequality. The strategies of gender policies that address violence against women are cultural exchange and institutional action within the public healthcare system. The actions of the healthcare sector are expanded into specific plans. The priorities and specificity of actions in healthcare plans were the distinguishing features between the two countries.CONCLUSIONS The common features of the healthcare plans in both the counties include violence against women, use of protocols, detection tasks, care and recovery for women, and professional self-care. Catalonia does not consider healthcare actions with aggressors. Costa Rica has a lower specificity in conceptualization and protocol patterns, as well as a lack of updates concerning health standards in Catalonia.