Determination of PAH, PCB, and OCP in water from the Three Gorges Reservoir accumulated by semipermeable membrane devices (SPMD)

Bioavailable water concentrations of polycyclic aromatic hydrocarbons (PAH), polychlorinated biphenyls (PCB) and organochlorine pesticides (OCP) were measured in the water column from Three Gorges Reservoir (TGR) collected in May 2008 using semipermeable membrane devices (SPMDs). The sampling sites spanned the whole reservoir from the upstream Chongqing to the great dam covering more than 600 km long distance with water flow velocities ranging from <0.05 to 1.5 m s(-1). This is the first experience of SPMD application in the biggest reservoir in the world. The results of water sampling rates based on performance reference compounds (PRC) were tested to be significantly correlated with water flow velocities in the big river. Results of back-calculated aqueous concentrations based on PRC showed obvious regional variations of PAH, PCB and OCP levels in the reservoir. Total PAH ranged from 13.8 to 97.2 ng L-1, with the higher concentrations occurring in the region of upstream and near the dam. Phenanthrene, fluoranthene, pyrene and chrysene were the predominant PAH compounds in TGR water. Total PCB ranged from 0.08 to 0.51 ng L-1, with the highest one occurring in the region near the dam. PCB 28, 52, 101, 138, 153, 180, 118 were the most abundant PCB congeners in the water. The total OCP ranged from 2.33 to 3.60 ng L-1 and the levels showed homogenous distribution in the whole reservoir. HCH, DDT and HCB, PeCB were the major compounds of OCP fingerprints. Based on water quality criteria, the TGR water could be designated as being polluted by HCB and PAH. Data on PAH, PCB and OCP concentrations found in this survey can be used as reference levels for future POP monitoring programmes in TGR. (C) 2009 Elsevier Ltd. All rights reserved.

Performance optimization for parallel processing on a multiple-CPU server

Symmetric multi-processor (SMP) systems, or multiple-CPU servers, are suitable for implementing parallel algorithms because they employ dedicated communication devices to enhance the inter-processor communication bandwidth, so that a better performance can be obtained. However, the cost for a multiple-CPU server is high and therefore, the server is usually shared among many users. The work-load due to other users will certainly affect the performance of the parallel programs so it is desirable to derive a method to optimize parallel programs under different loading conditions. In this paper, we present a simple method, which can be applied in SPMD type parallel programs, to improve the speedup by controlling the number of threads within the programs.

A Parallel Progressive Refinement Image Rendering Algorithm on a Scalable Multithreaded VLSI Processor Array

In this paper we develop a multithreaded VLSI processor linear array architecture to render complex environments based on the radiosity approach. The processing elements are identical and multithreaded. They work in Single Program Multiple Data (SPMD) mode. A new algorithm to do the radiosity computations based on the progressive refinement approach[2] is proposed. Simulation results indicate that the architecture is latency tolerant and scalable. It is shown that a linear array of 128 uni-threaded processing elements sustains a throughput close to 0.4 million patches/sec.

Petri net based performance modeling for effective DVFS for multithreaded programs

Dynamic Voltage and Frequency Scaling (DVFS) is a very effective tool for designing trade-offs between energy and performance. In this paper, we use a formal Petri net based program performance model that directly captures both the application and system properties, to find energy efficient DVFS settings for CMP systems, that satisfy a given performance constraint, for SPMD multithreaded programs. Experimental evaluation shows that we achieve significant energy savings, while meeting the performance constraints.

Converting best manual practice into generic automatable strategies for unstructured mesh parallelisation

The manual effort required to convert sequential computational mechanics programs into a useful, scalable parallel form is considerable. Tools that can assist in the conversion process are clearly required. Computer aided parallelisation tools (CAPTools) have been developed to generate efficient parallel code for real world structured grid application codes such as Computational Fluid Dynamics. Automatable single-program multi-data (SPMD) overlapping domain decomposition (DD) techniques established for structured grid codes have been adapted by the authors to manually parallelise unstructured mesh applications. Inspector loops have been used to provide generic techniques for the run-time support necessary to extend the capabilities of CAPTools to automatic implementation of SPMD DD techniques in the parallelisation of unstructured mesh codes. Copyright © 1999 John Wiley & Sons, Ltd.

A scalable strategy for the parallelization of multiphysics unstructured mesh-iterative codes on distributed-memory systems

Realizing scalable performance on high performance computing systems is not straightforward for single-phenomenon codes (such as computational fluid dynamics [CFD]). This task is magnified considerably when the target software involves the interactions of a range of phenomena that have distinctive solution procedures involving different discretization methods. The problems of addressing the key issues of retaining data integrity and the ordering of the calculation procedures are significant. A strategy for parallelizing this multiphysics family of codes is described for software exploiting finite-volume discretization methods on unstructured meshes using iterative solution procedures. A mesh partitioning-based SPMD approach is used. However, since different variables use distinct discretization schemes, this means that distinct partitions are required; techniques for addressing this issue are described using the mesh-partitioning tool, JOSTLE. In this contribution, the strategy is tested for a variety of test cases under a wide range of conditions (e.g., problem size, number of processors, asynchronous / synchronous communications, etc.) using a variety of strategies for mapping the mesh partition onto the processor topology.

An automatable generic strategy for dynamic load balancing in parallel structured mesh CFD codes

Parallel computing is now widely used in numerical simulation, particularly for application codes based on finite difference and finite element methods. A popular and successful technique employed to parallelize such codes onto large distributed memory systems is to partition the mesh into sub-domains that are then allocated to processors. The code then executes in parallel, using the SPMD methodology, with message passing for inter-processor interactions. In order to improve the parallel efficiency of an imbalanced structured mesh CFD code, a new dynamic load balancing (DLB) strategy has been developed in which the processor partition range limits of just one of the partitioned dimensions uses non-coincidental limits, as opposed to coincidental limits. The ‘local’ partition limit change allows greater flexibility in obtaining a balanced load distribution, as the workload increase, or decrease, on a processor is no longer restricted by the ‘global’ (coincidental) limit change. The automatic implementation of this generic DLB strategy within an existing parallel code is presented in this chapter, along with some preliminary results.

The implementation of an aeronautical CFD flow code onto distributed memory parallel systems

The parallelization of an industrially important in-house computational fluid dynamics (CFD) code for calculating the airflow over complex aircraft configurations using the Euler or Navier–Stokes equations is presented. The code discussed is the flow solver module of the SAUNA CFD suite. This suite uses a novel grid system that may include block-structured hexahedral or pyramidal grids, unstructured tetrahedral grids or a hybrid combination of both. To assist in the rapid convergence to a solution, a number of convergence acceleration techniques are employed including implicit residual smoothing and a multigrid full approximation storage scheme (FAS). Key features of the parallelization approach are the use of domain decomposition and encapsulated message passing to enable the execution in parallel using a single programme multiple data (SPMD) paradigm. In the case where a hybrid grid is used, a unified grid partitioning scheme is employed to define the decomposition of the mesh. The parallel code has been tested using both structured and hybrid grids on a number of different distributed memory parallel systems and is now routinely used to perform industrial scale aeronautical simulations. Copyright © 2000 John Wiley & Sons, Ltd.

Three parallel programming paradigms: Comparisons on an archetypal PDE computation

Three paradigms for distributed-memory parallel computation that free the application programmer from the details of message passing are compared for an archetypal structured scientific computation -- a nonlinear, structured-grid partial differential equation boundary value problem -- using the same algorithm on the same hardware. All of the paradigms -- parallel languages represented by the Portland Group's HPF, (semi-)automated serial-to-parallel source-to-source translation represented by CAP-Tools from the University of Greenwich, and parallel libraries represented by Argonne's PETSc -- are found to be easy to use for this problem class, and all are reasonably effective in exploiting concurrency after a short learning curve. The level of involvement required by the application programmer under any paradigm includes specification of the data partitioning, corresponding to a geometrically simple decomposition of the domain of the PDE. Programming in SPMD style for the PETSc library requires writing only the routines that discretize the PDE and its Jacobian, managing subdomain-to-processor mappings (affine global-to-local index mappings), and interfacing to library solver routines. Programming for HPF requires a complete sequential implementation of the same algorithm as a starting point, introduction of concurrency through subdomain blocking (a task similar to the index mapping), and modest experimentation with rewriting loops to elucidate to the compiler the latent concurrency. Programming with CAPTools involves feeding the same sequential implementation to the CAPTools interactive parallelization system, and guiding the source-to-source code transformation by responding to various queries about quantities knowable only at runtime. Results representative of "the state of the practice" for a scaled sequence of structured grid problems are given on three of the most important contemporary high-performance platforms: the IBM SP, the SGI Origin 2000, and the CRAYY T3E.

CAPLib - A 'thin layer' message passing library to support computational mechanics codes on distributed memory parallel systems

The Computer Aided Parallelisation Tools (CAPTools) [Ierotheou, C, Johnson SP, Cross M, Leggett PF, Computer aided parallelisation tools (CAPTools)-conceptual overview and performance on the parallelisation of structured mesh codes, Parallel Computing, 1996;22:163±195] is a set of interactive tools aimed to provide automatic parallelisation of serial FORTRAN Computational Mechanics (CM) programs. CAPTools analyses the user's serial code and then through stages of array partitioning, mask and communication calculation, generates parallel SPMD (Single Program Multiple Data) messages passing FORTRAN. The parallel code generated by CAPTools contains calls to a collection of routines that form the CAPTools communications Library (CAPLib). The library provides a portable layer and user friendly abstraction over the underlying parallel environment. CAPLib contains optimised message passing routines for data exchange between parallel processes and other utility routines for parallel execution control, initialisation and debugging. By compiling and linking with different implementations of the library, the user is able to run on many different parallel environments. Even with today's parallel systems the concept of a single version of a parallel application code is more of an aspiration than a reality. However for CM codes the data partitioning SPMD paradigm requires a relatively small set of message-passing communication calls. This set can be implemented as an intermediate `thin layer' library of message-passing calls that enables the parallel code (especially that generated automatically by a parallelisation tool such as CAPTools) to be as generic as possible. CAPLib is just such a `thin layer' message passing library that supports parallel CM codes, by mapping generic calls onto machine specific libraries (such as CRAY SHMEM) and portable general purpose libraries (such as PVM an MPI). This paper describe CAPLib together with its three perceived advantages over other routes: - as a high level abstraction, it is both easy to understand (especially when generated automatically by tools) and to implement by hand, for the CM community (who are not generally parallel computing specialists); - the one parallel version of the application code is truly generic and portable; - the parallel application can readily utilise whatever message passing libraries on a given machine yield optimum performance.

Profil de pratique des médecins omnipraticiens en santé mentale au Québec

Au Québec, face à la prévalence élevée des problèmes de santé mentale et à la pénurie de médecins psychiatres, le médecin omnipraticien (MO) occupe une place primordiale dans la prise en charge et le suivi des soins de santé mentale. Dans le contexte de réforme du système de santé mentale axée sur un renforcement de la collaboration entre les MO, les psychiatres et les équipes de santé mentale, notre étude vise à mieux comprendre la pratique clinique et la pratique collaborative développée par les MO, leur appréciation des outils de travail et de la qualité des services de santé mentale, dans le but d’améliorer la complémentarité des soins au niveau primaire. Cette étude transversale impliquait 1415 MO de neuf territoires de centre de santé et de services sociaux (CSSS) du Québec. L’échantillon final était constitué de 398 MO représentatifs de lieux de pratique diversifiés et le taux de réponse était de 41%. Nos résultats mettent en évidence que la pratique clinique et la pratique collaborative des MO diffère selon le degré de gravité des problèmes de santé mentale des patients rencontrés, c’est à dire, trouble transitoire/modéré de santé mentale (TTM.SM) ou trouble grave de santé mentale (TG.SM), et que les MO sont favorables au fait de travailler en collaboration avec les autres professionnels de la santé mentale. Ainsi, il apparaît important de renforcer l’accessibilité des MO aux professionnels de la santé mentale, particulièrement les psychiatres, et de les informer de l’existence des autres acteurs en santé mentale sur leur territoire, pour renforcer la collaboration et la qualité des soins primaires de santé mentale.

Facteurs de risque liés à la criminalité violente chez les contrevenants psychotiques des prisons québécoises

Au cours des dernières décennies, de nombreuses études ont confirmé l’existence d’une relation entre les troubles mentaux graves et persistants (TMGP) et la commission de crimes violents. Les facteurs de risque associés à la violence chez les gens atteints de TMGP sont la consommation d’alcool ou de drogues, la dépression et les troubles de personnalité. Cependant, aucune étude n’a été faite auprès des détenus des prisons québécoises, c’est-à-dire, des détenus qui purgent des sentences de courte durée, afin de voir si ces constats s’appliquent aussi à cette population. La présente étude tente de vérifier si les mêmes facteurs de risque sont liés à la violence chez les détenus psychotiques des prisons du Québec. Les dossiers de la RAMQ et du système DACOR de 121 détenus ont été analysés afin de répondre à la question de recherche. Tout d’abord, des analyses statistiques descriptives et bivariées ont été effectuées. Par la suite, des régressions logistiques ont été menées afin d’identifier les meilleurs prédicteurs de comportements violents chez les contrevenants psychotiques des prisons québécoises. Il semble que ce soit davantage les antécédents judiciaires ainsi que la médication psychotrope qui a été prescrite, plutôt que les diagnostics de troubles mentaux comorbides, qui distinguent les détenus psychotiques violents des non-violents dans les prisons québécoises. Une explication possible à cette observation est que les médecins prescriraient plus en fonction de la présence de certains symptômes spécifiques qu’en fonction des diagnostics de l’axe I ou de l’axe II. Enfin, des différences significatives sont présentes entre les hommes et les femmes.