Contribution of traffic and tobacco smoke in the distribution of polycyclic aromatic hydrocarbons on outdoor and indoor PM2.5

Traffic emissions and tobacco smoke are considered two main sources of polycyclic aromatic hydrocarbons (PAHs) in indoor and outdoor air. In this study, the impact of these sources on the level of fine particulate matter (PM2.5) and on the distribution of 15 PAHs regarded as priority pollutants by the US-EPA on PM2.5 were evaluated and compared. Outdoor and indoor PM2.5 samples were collected during winter 2008 in Oporto city in Portugal, for sampling periods of 12 and 24 hours, respectively. The outdoor PM2.5 were sampled at one site directly influenced by traffic emissions and the indoor PM2.5 samples were collected at one home directly influenced by tobacco smoke and another one without smoke. A methodology based on microwave-assisted extraction and liquid chromatography with fluorescence detection was applied for the efficient PAHs determination in indoor and outdoor PM2.5. PAHs in indoor PM2.5 concentrations were significantly influenced by the presence of traffic and tobacco smoking emissions. The mean of ΣPAHs in the outdoor traffic PM2.5 was not significantly different from the value attained in the indoor without smoking site. The tobacco smoke increased significantly PAHs concentrations on average about 1000 times more, when compared with the outdoor profile samples suggesting that tobacco smoking may be the most important source of indoor PAHs pollution.

Analysis of polycyclic aromatic hydrocarbons in atmospheric particulate samples by microwaveassisted extraction and liquid chromatography

A methodology based on microwave-assisted extraction (MAE) and LC with fluorescence detection (FLD) was investigated for the efficient determination of 15 polycyclic aromatic hydrocarbons (PAHs) regarded as priority pollutants by the US Environmental Protection Agency and dibenzo(a,l)pyrene in atmospheric particulate samples. PAHs were successfully extracted from real outdoor particulate matter (PM) samples with recoveries ranging from 81.4±8.8 to 112.0±1.1%, for all the compounds except for naphthalene (62.3±18.0%) and anthracene (67.3±5.7%), under the optimum MAE conditions (30.0 mL of ACN for 20 min at 110ºC). No clean-up steps were necessary prior to LC analysis. LOQs ranging from 0.0054 ng/m3 for benzo( a)anthracene to 0.089 ng/m3 for naphthalene were reached. The validated MAE methodology was applied to the determination of PAHs from a set of real world PM samples collected in Oporto (north of Portugal). The sum of particulate-bound PAHs in outdoor PM ranged from 2.5 and 28 ng/m3.

Air pollution from traffic emissions in Oporto, Portugal: health and environmental implications

Air pollution represents a serious risk not only to environment and human health, but also to historical heritage. In this study, air pollution of the Oporto Metropolitan Area and its main impacts were characterized. The results showed that levels of CO, PM10 and SO2 have been continuously decreasing in the respective metropolitan area while levels of NOx and NO2 have not changed significantly. Traffic emissions were the main source of the determined polycyclic aromatic hydrocarbons (PAHs; 16 PAHs considered by U.S. EPA as priority pollutants, dibenzo[a,l]pyrene and benzo[j]fluoranthene) in air of the respective metropolitan area. The mean concentration of 18 PAHs in air was 69.9±39.7 ng m−3 with 3–4 rings PAHs accounting for 75% of the total ΣPAHs. The health risk analysis of PAHs in air showed that the estimated values of lifetime lung cancer risks considerably exceeded the health-based guideline level. Analytical results also confirm that historical monuments in urban areas act as passive repositories for air pollutants present in the surrounding atmosphere. FTIR and EDX analyses showed that gypsum was the most important constituent of black crusts of the characterized historical monument Monastery of Serra do Pilar classified as “UNESCO World Cultural Heritage”. In black crusts, 4–6 rings compounds accounted approximately for 85% of ΣPAHs. The diagnostic ratios confirmed that traffic emissions were the major source of PAHs in black crusts; PAH composition profiles were very similar for crusts and PM10 and PM2.5.

Evaluation of atmospheric deposition and patterns of polycyclic aromatic hydrocarbons in façades of historic monuments of Oporto (Portugal)

Atmospheric pollution by motor vehicles is considered a relevant source of damage to architectural heritage. Thus the aim of this work was to assess the atmospheric depositions and patterns of polycyclic aromatic hydrocarbons (PAHs) in façades of historical monuments. Eighteen PAHs (16 PAHs considered by US EPA as priority pollutants, dibenzo[a,l]pyrene and benzo[j]fluoranthene) were determined in thin black layers collected from façades of two historical monuments: Hospital Santo António and Lapa Church (Oporto, Portugal). Scanning electron microscopy (SEM) was used for morphological and elemental characterisation of thin black layers; PAHs were quantified by microwave-assisted extraction combined with liquid chromatography (MAE-LC). The thickness of thin black layers were 80–110 μm and they contained significant levels of iron, sulfur, calcium and phosphorus. Total concentrations of 18 PAHs ranged from 7.74 to 147.92 ng/g (mean of 45.52 ng/g) in thin black layers of Hospital Santo António, giving a range three times lower than at Lapa Church (5.44– 429.26 ng/g; mean of 110.25 ng/g); four to six rings compounds accounted at both monuments approximately for 80–85% of ΣPAHs. The diagnostic ratios showed that traffic emissions were significant source of PAHs in thin black layers. Composition profiles of PAHs in thin black layers of both monuments were similar to those of ambient air, thus showing that air pollution has a significant impact on the conditions and stone decay of historical building façades. The obtained results confirm that historical monuments in urban areas act as passive repositories for air pollutants present in the surrounding atmosphere.

Static-priority scheduling of sporadic messages on a wireless channel

Consider the problem of scheduling sporadic messages with deadlines on a wireless channel. We propose a collision-free medium access control (MAC) protocol which implements static-priority scheduling and present a schedulability analysis technique for the protocol. The MAC protocol allows multiple masters and is fully distributed; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to receive an incoming bit from the channel while transmitting to the channel.

Evaluating P-NET message's response time with fixed priority queuing at application process level

P-NET is a multi-master fieldbus standard based on a virtual token passing scheme. In P-NET each master is allowed to transmit only one message per token visit. In the worst-case, the communication response time can be derived considering that, in each token cycle, all stations use the token to transmit a message. In this paper, we define a more sophisticated P-NET model, which considers the actual token utilisation. We then analyse the possibility of implementing a local priority-based scheduling policy to improve the real-time behaviour of P-NET.

Adding local priority-based dispatching mechanisms to P-NET networks: a fixed priority approach

In this paper we address the real-time capabilities of P-NET, which is a multi-master fieldbus standard based on a virtual token passing scheme. We show how P-NET’s medium access control (MAC) protocol is able to guarantee a bounded access time to message requests. We then propose a model for implementing fixed prioritybased dispatching mechanisms at each master’s application level. In this way, we diminish the impact of the first-come-first-served (FCFS) policy that P-NET uses at the data link layer. The proposed model rises several issues well known within the real-time systems community: message release jitter; pre-run-time schedulability analysis in non pre-emptive contexts; non-independence of tasks at the application level. We identify these issues in the proposed model and show how results available for priority-based task dispatching can be adapted to encompass priority-based message dispatching in P-NET networks.

Extending fixed task-priority schedulability by interference limitation

While the earliest deadline first algorithm is known to be optimal as a uniprocessor scheduling policy, the implementation comes at a cost in terms of complexity. Fixed taskpriority algorithms on the other hand have lower complexity but higher likelihood of task sets being declared unschedulable, when compared to earliest deadline first (EDF). Various attempts have been undertaken to increase the chances of proving a task set schedulable with similar low complexity. In some cases, this was achieved by modifying applications to limit preemptions, at the cost of flexibility. In this work, we explore several variants of a concept to limit interference by locking down the ready queue at certain instances. The aim is to increase the prospects of schedulability of a given task system, without compromising on complexity or flexibility, when compared to the regular fixed task-priority algorithm. As a final contribution, a new preemption threshold assignment algorithm is provided which is less complex and more straightforward than the previous method available in the literature.

Combining RTSJ with Fork/Join: a priority-based model

This paper discusses the increased need to support dynamic task-level parallelism in embedded real-time systems and proposes a Java framework that combines the Real-Time Specification for Java (RTSJ) with the Fork/Join (FJ) model, following a fixed priority-based scheduling scheme. Our work intends to support parallel runtimes that will coexist with a wide range of other complex independently developed applications, without any previous knowledge about their real execution requirements, number of parallel sub-tasks, and when those sub-tasks will be generated.

Enhanced Race-to-halt: a leakage-aware energy management approach for dynamic priority systems

With progressing CMOS technology miniaturization, the leakage power consumption starts to dominate the dynamic power consumption. The recent technology trends have equipped the modern embedded processors with the several sleep states and reduced their overhead (energy/time) of the sleep transition. The dynamic voltage frequency scaling (DVFS) potential to save energy is diminishing due to efficient (low overhead) sleep states and increased static (leakage) power consumption. The state-of-the-art research on static power reduction at system level is based on assumptions that cannot easily be integrated into practical systems. We propose a novel enhanced race-to-halt approach (ERTH) to reduce the overall system energy consumption. The exhaustive simulations demonstrate the effectiveness of our approach showing an improvement of up to 8 % over an existing work.

Resource sharing in global fixed-priority preemptive multiprocessor scheduling

In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritance protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called reasonable priority-assignments.

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.

Static-priority scheduling over wireless networks with multiple broadcast domains

We propose a wireless medium access control (MAC) protocol that provides static-priority scheduling of messages in a guaranteed collision-free manner. Our protocol supports multiple broadcast domains, resolves the wireless hidden terminal problem and allows for parallel transmissions across a mesh network. Arbitration of messages is achieved without the notion of a master coordinating node, global clock synchronization or out-of-band signaling. The protocol relies on bit-dominance similar to what is used in the CAN bus except that in order to operate on a wireless physical layer, nodes are not required to receive incoming bits while transmitting. The use of bit-dominance efficiently allows for a much larger number of priorities than would be possible using existing wireless solutions. A MAC protocol with these properties enables schedulability analysis of sporadic message streams in wireless multihop networks.

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.