Aplicação de redes neuronais artificiais à deteção e isolamento de falhas em processos industriais

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia Mecânica

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning real-time tasks on a heterogeneous multiprocessor platform comprising two different types of processors — such a platform is referred to as two-type platform. We present two linearithmic timecomplexity algorithms, SA and SA-P, each providing the follow- ing guarantee. For a given two-type platform and a given task set, if there exists a feasible task-to-processor-type assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type, then (i) using SA, it is guaranteed to find such a feasible task-to- processor-type assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding 2 a feasible task-to-processor assignment where tasks are not allowed to migrate between processors but given a platform in which processors are 1+α/times faster, where 0<α≤1. The parameter α is a property of the task set — it is the maximum utilization of any task which is less than or equal to 1.

EMMON - EMbedded MONitoring

Despite the steady increase in experimental deployments, most of research work on WSNs has focused only on communication protocols and algorithms, with a clear lack of effective, feasible and usable system architectures, integrated in a modular platform able to address both functional and non–functional requirements. In this paper, we outline EMMON [1], a full WSN-based system architecture for large–scale, dense and real–time embedded monitoring [3] applications. EMMON provides a hierarchical communication architecture together with integrated middleware and command and control software. Then, EM-Set, the EMMON engineering toolset will be presented. EM-Set includes a network deployment planning, worst–case analysis and dimensioning, protocol simulation and automatic remote programming and hardware testing tools. This toolset was crucial for the development of EMMON which was designed to use standard commercially available technologies, while maintaining as much flexibility as possible to meet specific applications requirements. Finally, the EMMON architecture has been validated through extensive simulation and experimental evaluation, including a 300+ nodes testbed.

The generalized multiprocessor periodic resource interface model for hierarchical multiprocessor scheduling

Composition is a practice of key importance in software engineering. When real-time applications are composed it is necessary that their timing properties (such as meeting the deadlines) are guaranteed. The composition is performed by establishing an interface between the application and the physical platform. Such an interface does typically contain information about the amount of computing capacity needed by the application. In multiprocessor platforms, the interface should also present information about the degree of parallelism. Recently there have been quite a few interface proposals. However, they are either too complex to be handled or too pessimistic.In this paper we propose the Generalized Multiprocessor Periodic Resource model (GMPR) that is strictly superior to the MPR model without requiring a too detailed description. We describe a method to generate the interface from the application specification. All these methods have been implemented in Matlab routines that are publicly available.

Real-time scheduling with resource sharing on uniform multiprocessors

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a uniform multiprocessor platform where each task may access at most one of |R| shared resources and at most once by each job of that task. The resources have to be accessed in a mutually exclusive manner. We propose an algorithm, GIS-vpr, which offers the guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that allows a task to migrate only when it accesses or releases a resource, then our algorithm also meets the deadlines with the same restriction on the task migration, if given processors 4 + 6|R| times as fast. The proposed algorithm, by design, limits the number of migrations per job to at most two. To the best of our knowledge, this is the first result for resource sharing on uniform multiprocessors with proven performance guarantee.

A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee but for a stronger adversary.We conjecture that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast. We illustrate this with an example.

Two-type heterogeneous multiprocessor scheduling: Is there a phase transition? (Extended Abstract)

Consider the problem of non-migratively scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform. We ask the following question: Does there exist a phase transition behavior for the two-type heterogeneous multiprocessor scheduling problem? We also provide some initial observations via simulations performed on randomly generated task sets.

Provably good task assignment on heterogeneous multiprocessor platforms for a restricted case but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We consider a restricted case where the maximum utilization of any task on any processor in the system is no greater than one. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee for this restricted case but for a stronger adversary. We show that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast.

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.

Dinossáurios Eocretácicos de Lagosteiros

According to an ancient folkloric legend, Our Lady, stepping down from the sea, would have rided on a mule to the platform above the cliffs named Pedra da Mua at Lagosteiros'bay, near Espichel cape. Mule's footprints, regarded by fishermen as evidence, would be clearly recognizable on exposed surfaces of the rocks. Indeed there are footprints but from Dinosaurs of latest Jurassic, Portlandian age, this spectacular locality being specially rich in giant Sauropod tracks (that have seldom been found elsewhere in Europe). As we proceeded to its study, another locality with Dinosaur footprints, Lower Cretaceous (Hauterivian) in age, was found on the northern cliffs at Lagosteiros. It is probably the richest one in european Lower Cretaceous and the only of this age known in Portugal, so we decided to give priority to its study. Dinosaur tracks have been printed on calciclastic sands in a lagoonal environment protected by fringing coral reefs. There have been emersion episodes; beaches were frequented by Dinosaurs. Later on, the marine barremian ingression restablished a gulf and such animals could not come here any more. Under a paleogeographical viewpoint, the evidence of a marine regression near the end of Hauterivian is to be remarked. Five types of tracks and footprints have been recognized: - Neosauropus lagosteirensis, new morphogenus and species, tracks from a giant Sauropod, perhaps from Camarasaurus; with its proportions the total length of the author would be about 15,5 m. These are the only Sauropod tracks known till now in Europe's Lower Cretaceous. - tracks from a not so big quadruped, maybe a Sauropod (young individual?); however it is not impossible that they were produced by Stegosaurians or Ankylosaurians. -Megalosauropus (?Eutynichnium) gomesi new morphospecies, four Theropod tracks most probably produced by megalosaurs. - Iguanodon sp., represented by some footprints and specially by a set corresponding to the feet and tail from an individual standing in a rest position. - problematical, quite small-sized biped (maybe an Ornithopod related to Camptosaurus). Evidence points to a richer fauna than that known in barremian "Dinosaur sandstones" from a nearby locality, Boca do Chapim. Lagosteiros' association clearly indicates the predominance of herbivores, which required large amounts of vegetable food in the neighbourhood. This is an indirect evidence of the vegetal wealth, also suggested by associations of plant macrofossils, polen and spores found in early Cretaceous sediments at the same region. The relatively high proportion of Theropoda is related to the wealth of the whole fauna, which comprised a lot of the prey needed by such powerful flesh-eaters. The evidence, as a whole, points out to a warm and moist climate. All the tracks whose direction could be measured are directed to the southern quadrants, this being confirmed by the approximative direction of other footprints. Massive displacements (migration?) could take place during a brief emersion episode. This may result from the ingression of barremian seas, flooding the region and restablishing here a small gulf. Even if the arrival of the waters damaged certain footprints it has not destroyed them completely, thus allowing the preservation of such evidence from a remote past.

Faciès, biostratigraphie et paléogéographie du Jurassique portugais

The facies distribution along the Jurassic stages in an already well established stratigraphic frame is defined for the three portuguese basins: North of Tagus, Santiago de Cacém and Algarve. The deposits are organized in two sedimentary cycles. The first one from the Liassic to Calovian shows, in the Tagus Basin, a transgression from NW which did not surpass the Meseta present limits. The iniatilly brackish deposits only changed to marine by the end of Lotharingian. The sedimentation, mainly marly during the Liassic became more calcareous since the Aalenian. During the Dogger the basin differentiated into platform deposits towards East and South and open sea zone towards West. This zone underwent a progressive reduction and, during the Callovian, two small basins were individualized: Cabo Mondego basin in the North and Serra de El-Rei-Montejunto in the South. It is from the latter that the second sedimentary cycle (Middle Oxfordian-Portlandian) developed with open sea deposits along the Sintra–Torres Vedras axis surrounded by platform and litoral brackish formations. During the first sedimentary cycle only litoral platform deposits are known in Santiago de Cacém and Algarve basins. During the second sedimentary cycle temporary sea open deposits are known in Santiago de Cacém and Central Algarve.

Slotted wiDom: schedulability analysis and its experimental validation

WiDom is a wireless prioritized medium access control protocol which offers a very large number of priority levels. Hence, it brings the potential to employ non-preemptive static-priority scheduling and schedulability analysis for a wireless channel assuming that the overhead of WiDom is modeled properly. One schedulability analysis for WiDom has already been proposed but recent research has created a new version of WiDom (we call it: Slotted WiDom) with lower overhead and for this version of WiDom no schedulability analysis exists. In this paper we propose a new schedulability analysis for slotted WiDom and extend it to work also for message streams with release jitter. We have performed experiments with an implementation of slotted WiDom on a real-world platform (MicaZ). We find that for each message stream, the maximum observed response time never exceeds the calculated response time and hence this corroborates our belief that our new scheduling theory is applicable in practice.

Experiences on the implementation of a cooperative embedded system framework

As the complexity of embedded systems increases, multiple services have to compete for the limited resources of a single device. This situation is particularly critical for small embedded devices used in consumer electronics, telecommunication, industrial automation, or automotive systems. In fact, in order to satisfy a set of constraints related to weight, space, and energy consumption, these systems are typically built using microprocessors with lower processing power and limited resources. The CooperatES framework has recently been proposed to tackle these challenges, allowing resource constrained devices to collectively execute services with their neighbours in order to fulfil the complex Quality of Service (QoS) constraints imposed by users and applications. In order to demonstrate the framework's concepts, a prototype is being implemented in the Android platform. This paper discusses key challenges that must be addressed and possible directions to incorporate the desired real-time behaviour in Android.

Contratos de futuros sobre taxas de juro : estudo de caso sobre a Euribor a 3 meses

Mestrado em Contabilidade e Análise Financeira

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.