Cultural organizations and communication in portuguese decentralization policy

This paper intends to show the Portuguese municipalities’ commitment, since the first decade of this century, in cultural facilities of municipal management and how it provided 12 of the 18 district capitals of mainland Portugal with cultural equipment, but after all we want to know if this effort resulted in a regular, diverse, and innovative schedule. Investing in urban regeneration, local governments have tried to convert cities’ demographic changes (strengthening of the most educated and professionally qualified groups) in effective cultural demands that consolidate the three axes of development competitiveness-innovation-creativity. What the empirical study to the programming and communication proposals of those equipment shows is that it is not enough to provide cities with facilities; to escape to a utilitarian conception of culture, there is a whole work to be done so that such equipment be experienced and felt as new public sphere. Equipment in which proposals go through a fluid bind, constructed through space and discourse with local community, devoted a diversified and innovative bet full filling development axis. This paper presents in a systematic way what contributes to this binding on the analyzed equipment.

Cultural organizations and communication in portuguese decentralization policy

This presentation intends to show to what extent the Portuguese municipalities’ commitment, from the first decade of this century, in cultural facilities of municipal management and which has provided 12 of the 18 district capitals of mainland Portugal with equipment, resulted in a regular, diverse and innovative schedule. Investing in urban regeneration, local government has tried to convert cities’ demographic changes (strengthening of the most educated and professionally qualified groups) in effective cultural demands that consolidate the three axes of development competitiveness-innovation-creativity. What the empirical study to the programming and communication proposals of those equipment shows is that it is not enough to provide cities with facilities; to escape to a utilitarian conception of culture, there is a whole work to be done so that such equipment be experienced and felt as new public sphere. Equipment in which proposals go through a fluid bind, constructed through space and discourse with local community, devotes a diversified and innovative bet full filling development axis. This paper presents in a systematic way what contributes to this binding on the analyzed equipment.

Portuguese newspapers’ front-page and the coverage of European Cultural Capital: Porto 2001 and Guimarães 2012

Portugal hosted in the last thirteen years, two editions of the event European Cultural Capital; this paper intends to illustrate the coverage that Portuguese newspapers (daily newspapers Público, Diário de Notícias, Correio da Manhã and Jornal de Notícias, a weekly newsmagazine Visão and a weekly newspaper Expresso) made, through referrals in front-page and respective developments within the editions, to each of the events and that allows us to define the main moments that marked each of them, patterns of action, the major players, planning and programming types. The European Cultural Capital project elects, from year to year, cities of different EU member states with the main goal of “contributing to bring together the Europe´s people" (words of Mélina Mercouri, Greek Minister of Culture who, in 1985, proposed the launch of this initiative) and encouraging the elected urban space to present new cultural paradigms. In the genesis of this model is the cultural decentralization’s vector, a possibility to medium-sized cities of funding public works, restoring heritage and promoting themselves in touristic terms, of giving visibility to cities away from cultural and creative industries’ major distribution centers. A crucial factor to achieve this goal is media coverage. This paper outline the information that the Portuguese press ran over the two years that elapsed the latest editions of the European Cultural Capital in Portugal, namely that media coverage have deviated from the disclosure of the events’ schedule to suggest itineraries of visit and little or not even question the role that cities, promoting such initiatives, have as places of innovation in terms of cultural policies, artistic production and innovation, in urban and environmental regeneration, in economic revitalization, in training and creating new artists and new audiences and in boosting the confidence of local communities. The content analysis performed to articles shows how press is essential to the promotion of cities as cultural/touristic destinations as it stimulates consumption among residents and attracts visitors, with the possible dire consequence of turning the cultural journalist into an agent of touristic instead of cultural promotion.

Newspaper coverage impact on cultural events: Porto 2001 and Guimarães 2012: European Cultural Capitals

Artigo baseado na comunicação proferida no 1st International Symposium on Media Studies, realizado na Akdeniz Universitesi Yayınları, Antalya, Turquia, 21-23 de novembro de 2013

Distributed computing for the factory-floor: a real-time approach using WorldFIP networks

Field communication systems (fieldbuses) are widely used as the communication support for distributed computer-controlled systems (DCCS) within all sort of process control and manufacturing applications. There are several advantages in the use of fieldbuses as a replacement for the traditional point-to-point links between sensors/actuators and computer-based control systems, within which the most relevant is the decentralisation and distribution of the processing power over the field. A widely used fieldbus is the WorldFIP, which is normalised as European standard EN 50170. Using WorldFIP to support DCCS, an important issue is “how to guarantee the timing requirements of the real-time traffic?” WorldFIP has very interesting mechanisms to schedule data transfers, since it explicitly distinguishes periodic and aperiodic traffic. In this paper, we describe how WorldFIP handles these two types of traffic, and more importantly, we provide a comprehensive analysis on how to guarantee the timing requirements of the real-time traffic.

Simulation model for driving dynamics, energy use and power supply

Dissertação para obtenção do grau de Mestre em Engenharia Electrotécnica Ramo de Energia

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.

Job phasing aware preemption deferral

Preemptions account for a non-negligible overhead during system execution. There has been substantial amount of research on estimating the delay incurred due to the loss of working sets in the processor state (caches, registers, TLBs) and some on avoiding preemptions, or limiting the preemption cost. We present an algorithm to reduce preemptions by further delaying the start of execution of high priority tasks in fixed priority scheduling. Our approaches take advantage of the floating non-preemptive regions model and exploit the fact that, during the schedule, the relative task phasing will differ from the worst-case scenario in terms of admissible preemption deferral. Furthermore, approximations to reduce the complexity of the proposed approach are presented. Substantial set of experiments demonstrate that the approach and approximations improve over existing work, in particular for the case of high utilisation systems, where savings of up to 22% on the number of preemption are attained.

Implementing slot-based task-splitting multiprocessor scheduling

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task-splitting scheduling algorithm. Task-splitting (also called semi-partitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A particular type of task-splitting algorithms, called slot-based task-splitting dispatching, is of particular interest because of its ability to schedule tasks with high processor utilizations. Unfortunately, no slot-based task-splitting algorithm has been implemented in a real operating system so far. In this paper we discuss and propose some modifications to the slot-based task-splitting algorithm driven by implementation concerns, and we report the first implementation of this family of algorithms in a real operating system running Linux kernel version 2.6.34. We have also conducted an extensive range of experiments on a 4-core multicore desktop PC running task-sets with utilizations of up to 88%. The results show that the behavior of our implementation is in line with the theoretical framework behind it.

Practical aspects of slot-based task- splitting dispatching in its schedulability analysis

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a tasksplitting scheduling algorithm. Task-splitting (also called semipartitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.

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 compositional scheduling framework for digital avionics systems

ARINC specification 653-2 describes the interface between application software and underlying middleware in a distributed real-time avionics system. The real-time workload in this system comprises of partitions, where each partition consists of one or more processes. Processes incur blocking and preemption overheads and can communicate with other processes in the system. In this work we develop compositional techniques for automated scheduling of such partitions and processes. At present, system designers manually schedule partitions based on interactions they have with the partition vendors. This approach is not only time consuming, but can also result in under utilization of resources. In contrast, the technique proposed in this paper is a principled approach for scheduling ARINC-653 partitions and therefore should facilitate system integration.

LLF schedulability analysis on multiprocessor platforms

LLF (Least Laxity First) scheduling, which assigns a higher priority to a task with smaller laxity, has been known as an optimal preemptive scheduling algorithm on a single processor platform. However, its characteristics upon multiprocessor platforms have been little studied until now. Orthogonally, it has remained open how to efficiently schedule general task systems, including constrained deadline task systems, upon multiprocessors. Recent studies have introduced zero laxity (ZL) policy, which assigns a higher priority to a task with zero laxity, as a promising scheduling approach for such systems (e.g., EDZL). Towards understanding the importance of laxity in multiprocessor scheduling, this paper investigates the characteristics of ZL policy and presents the first ZL schedulability test for any work-conserving scheduling algorithm that employs this policy. It then investigates the characteristics of LLF scheduling, which also employs the ZL policy, and derives the first LLF-specific schedulability test on multiprocessors. It is shown that the proposed LLF test dominates the ZL test as well as the state-of-art EDZL test.

Competitive analysis of partitioned scheduling on uniform multiprocessors

Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. We propose an algorithm which can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are three times faster.

Competitive analysis of static-priority partitioned scheduling on uniform multiprocessors

Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. On each processor, tasks are scheduled according to rate-monotonic. We propose an algorithm that can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are √2 / √2−1 ≈ 3.41 times faster. No such guarantees are previously known for partitioned static-priority scheduling on uniform multiprocessors.