PeECE III - Pelagic Ecosystem CO2 Enrichment Study, Raunefjord, Bergen, Norway, 2005

The effects of CO2-induced seawater acidification on plankton communities were also addressed in a series of 3 mesocosm experiments, called the Pelagic Ecosystem CO2 Enrichment (PeECE I-III) studies, which were conducted in the Large-Scale Mesocosm Facilities of the University of Bergen, Norway in 2001, 2003 and 2005, respectively. Each experiment consisted of 9 mesocosms, in which CO2 was manipulated to initial concentrations of 190, 350 and 750 µatm in 2001 and 2003, and 350, 700 and 1050 µatm in 2005. The present dataset concerns PeECE III.

Effectiveness of abstract interpretation in automatic parallelization: a case study in logic programming

We report on a detailed study of the application and effectiveness of program analysis based on abstract interpretation to automatic program parallelization. We study the case of parallelizing logic programs using the notion of strict independence. We first propose and prove correct a methodology for the application in the parallelization task of the information inferred by abstract interpretation, using a parametric domain. The methodology is generic in the sense of allowing the use of different analysis domains. A number of well-known approximation domains are then studied and the transformation into the parametric domain defined. The transformation directly illustrates the relevance and applicability of each abstract domain for the application. Both local and global analyzers are then built using these domains and embedded in a complete parallelizing compiler. Then, the performance of the domains in this context is assessed through a number of experiments. A comparatively wide range of aspects is studied, from the resources needed by the analyzers in terms of time and memory to the actual benefits obtained from the information inferred. Such benefits are evaluated both in terms of the characteristics of the parallelized code and of the actual speedups obtained from it. The results show that data flow analysis plays an important role in achieving efficient parallelizations, and that the cost of such analysis can be reasonable even for quite sophisticated abstract domains. Furthermore, the results also offer significant insight into the characteristics of the domains, the demands of the application, and the trade-offs involved.