Approximating schedules for dynamic process graphs efficiently

A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.

In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.

In this paper we study a subclass of dynamic process graphs called -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion.     

Methodological reflections on a three-step-design combining observation,stimulated recall and interview

In this paper a tripartite qualitative design combining abservation, stimulated recall and interview is presented and discussed. This three-step-design makes it possible to get insight into the interaction of internal and external processes when solving mathematical tasks. The data analysis depends on the research question and the methodological approach. In the light of two research projects in mathematics education two different methods of data analysis are presented and methodologically reflected.     

Multiple-scattering-theory analysis of XANES spectra of SO2 adsorbed on Cu(100)

The sulphur K-edge x-ray absorption spectra of SO₂ multilayer and of SO₂ submonolayer adsorbed on Cu(100) are analysed. It is found that the dominant spectral features are of a molecular origin. The results support earlier findings that the SO₂ molecule stands perpendicular to the surface. Use of non-selfconsistent potentials does not lead to a good quantitative agreement between theory and experiment.     

Particle Characterization by Projected Area Determination

The projected areas of non-spherical particles do not represent an unambiguous particle characteristic. Depending on the orientation towards a constant observational direction, different projected areas result. The spectrum of all projected area values of a particle, if determined representatively, gives the probability with which a certain value is obtained by a single measurement. In this work, the frequency distributions of different examples of test objects were both calculated and measured. The objects were a cube, a rectangular parallelepiped and also three model agglomerates consisting of spheres of the same size. Instead of just one projected area, during each measuring procedure three projected areas from three orthogonal directions can be obtained. A mean value is then calculated to reduce the ambiguity of the particle characteristic and enhance the resolution. A suitable measurement set-up is introduced. The results of calculation and measurement are compared for observation from just one direction and also simultaneous observation from three directions. The frequency distributions of the equivalent diameters of the particle projected areas show a characteristic trend of the total curve with remarkable properties. The simultaneous measurement of three values from mutually orthogonal directions and their mean value calculation result in a much narrower distribution. In this case, a non-sphericity factor can additionally be calculated, whose frequency distribution contains information in a characteristic manner about the degree to which the particle shape differs from a sphere.     

Runge–Kutta Methods for Itô Stochastic Differential Equations with Scalar Noise

A general class of stochastic Runge–Kutta methods for Itô stochastic differential equation systems w.r.t. a one-dimensional Wiener process is introduced. The colored rooted tree analysis is applied to derive conditions for the coefficients of the stochastic Runge–Kutta method assuring convergence in the weak sense with a prescribed order. Some coefficients for new stochastic Runge–Kutta schemes of order two are calculated explicitly and a simulation study reveals their good performance.