A Taxonomy of Workflow Management Systems for Grid Computing

With the advent of Grid and application technologies, scientists and engineers are building more and more complex applications to manage and process large data sets, and execute scientific experiments on distributed resources. Such application scenarios require means for composing and executing complex workflows. Therefore, many efforts have been made towards the development of workflow management systems for Grid computing. In this paper, we propose a taxonomy that characterizes and classifies various approaches for building and executing workflows on Grids. We also survey several representative Grid workflow systems developed by various projects world-wide to demonstrate the comprehensiveness of the taxonomy. The taxonomy not only highlights the design and engineering similarities and differences of state-of-the-art in Grid workflow systems, but also identifies the areas that need further research.Comment: 29 pages, 15 figure

A Systematic Approach to Constructing Incremental Topology Control Algorithms Using Graph Transformation

Communication networks form the backbone of our society. Topology control algorithms optimize the topology of such communication networks. Due to the importance of communication networks, a topology control algorithm should guarantee certain required consistency properties (e.g., connectivity of the topology), while achieving desired optimization properties (e.g., a bounded number of neighbors). Real-world topologies are dynamic (e.g., because nodes join, leave, or move within the network), which requires topology control algorithms to operate in an incremental way, i.e., based on the recently introduced modifications of a topology. Visual programming and specification languages are a proven means for specifying the structure as well as consistency and optimization properties of topologies. In this paper, we present a novel methodology, based on a visual graph transformation and graph constraint language, for developing incremental topology control algorithms that are guaranteed to fulfill a set of specified consistency and optimization constraints. More specifically, we model the possible modifications of a topology control algorithm and the environment using graph transformation rules, and we describe consistency and optimization properties using graph constraints. On this basis, we apply and extend a well-known constructive approach to derive refined graph transformation rules that preserve these graph constraints. We apply our methodology to re-engineer an established topology control algorithm, kTC, and evaluate it in a network simulation study to show the practical applicability of our approachComment: This document corresponds to the accepted manuscript of the referenced journal articl

Beyond the Planck scale

I outline motivations for believing that important quantum gravity effects lie beyond the Planck scale at both higher energies and longer distances and times. These motivations arise in part from the study of ultra-high energy scattering, and also from considerations in cosmology. I briefly summarize some inferences about such ultra-planckian physics, and clues we might pursue towards the principles of a more fundamental theory addressing the known puzzles and paradoxes of quantum gravity.Comment: 11 pages, 1 figure. To appear in the proceedings of the XXV Max Born Symposium, "The Planck Scale," Wroclaw, Polan

Properties of nuclei in the nobelium region studied within the covariant, Skyrme, and Gogny energy density functionals

We calculate properties of the ground and excited states of nuclei in the nobelium region for proton and neutron numbers of 92 <= Z <= 104 and 144 <= N <= 156, respectively. We use three different energy-density-functional (EDF) approaches, based on covariant, Skyrme, and Gogny functionals, each within two different parameter sets. A comparative analysis of the results obtained for odd-even mass staggerings, quasiparticle spectra, and moments of inertia allows us to identify single-particle and shell effects that are characteristic to these different models and to illustrate possible systematic uncertainties related to using the EDF modellingComment: 43 LaTeX pages, 14 figures, accepted in Nuclear Physics A, Special Issue on Superheavy Element

A Systematic Approach to Constructing Families of Incremental Topology Control Algorithms Using Graph Transformation

In the communication systems domain, constructing and maintaining network topologies via topology control (TC) algorithms is an important cross-cutting research area. Network topologies are usually modeled using attributed graphs whose nodes and edges represent the network nodes and their interconnecting links. A key requirement of TC algorithms is to fulfill certain consistency and optimization properties to ensure a high quality of service. Still, few attempts have been made to constructively integrate these properties into the development process of TC algorithms. Furthermore, even though many TC algorithms share substantial parts (such as structural patterns or tie-breaking strategies), few works constructively leverage these commonalities and differences of TC algorithms systematically. In previous work, we addressed the constructive integration of consistency properties into the development process. We outlined a constructive, model-driven methodology for designing individual TC algorithms. Valid and high-quality topologies are characterized using declarative graph constraints; TC algorithms are specified using programmed graph transformation. We applied a well-known static analysis technique to refine a given TC algorithm in a way that the resulting algorithm preserves the specified graph constraints. In this paper, we extend our constructive methodology by generalizing it to support the specification of families of TC algorithms. To show the feasibility of our approach, we reneging six existing TC algorithms and develop e-kTC, a novel energy-efficient variant of the TC algorithm kTC. Finally, we evaluate a subset of the specified TC algorithms using a new tool integration of the graph transformation tool eMoflon and the Simonstrator network simulation framework.Comment: Corresponds to the accepted manuscrip

Galaxy evolution by color-log(n) type since redshift unity in the Hubble Ultra Deep Field

We explore the use of the color-log(n) plane (where n is the global Sersic index) as a tool for subdividing the high redshift galaxy population in a physically-motivated manner. Using a series of volume-limited samples out to z=1.5 in the Hubble Ultra Deep Field (UDF) we confirm the correlation between color-log(n) plane position and visual morphology observed locally and in other high redshift studies in the color and/or structure domain. Via comparison to a low redshift sample from the Millennium Galaxy Catalogue we quantify evolution by color-log(n) type, accounting separately for the specific selection and measurement biases against each. Specifically, we measure decreases in B-band surface brightness of 1.57 +/- 0.22 mag/sq.arcsec and 1.65 +/- 0.22 mag/sq.arcsec for `blue, diffuse' and `red, compact' galaxies respectively between redshift unity and the present day.Comment: 12 pages, 6 figures, to be published in A&A (accepted 29/10/08