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. 相似文献
A simple and accurate algorithm (phase scanning method) is proposed for 3D surface contouring and dynamic response determination of a vibrating object. A sinusoidal fringe pattern is projected onto a low-frequency vibrating object by a programmable liquid crystal display projector. The fringe patterns are captured by a high-speed CCD camera with a telecentric gauging lens. Phase values are evaluated point by point using phase scanning method. From the phase values of each point on the object, the contour of the specimen at different instants of vibration can be retrieved. In this paper, a small vibrating coin is used to demonstrate the validity of the method and the experimental results are compared with test results on a stationary coin using four-step phase shifting and fast Fourier transform methods. The technique is especially useful in applications where the vibrating object has a complicated shape. 相似文献
A review of the optimal stopping problem with more than a single decision maker (DM) is presented in this paper. We classify
the existing literature according to the arrival of the offers, the utility of the DMs, the length of the sequence of offers,
the nature of the game and the number of offers to be selected. We enumerate various definitions for this problem and describe
some dynamic approaches.
Fouad Ben Abdelaziz is on leave from the Institut Superieur de Gestion, University of Tunis, Tunisia e-mail: foued.benabdelaz@isg.run.tn. 相似文献
Interfacial rheological properties and their suitability for foam production and stability of two vegetable proteins were studied and compared to β-casein. Proteins used ranged from flexible to rigid/globular in the order of β-casein, gliadin and soy glycinin. Experiments were performed at pH 6.7. Network forming properties were characterised by the surface dilational modulus (determined with the ring trough) and the critical falling film length (Lstill) at which a stagnant protein film will break. Gliadin had the highest dilational modulus, followed by glycinin and β-casein, whereas glycinin formed the strongest film against fracture in the overflowing cylinder. The rate of decrease in the surface tension was studied at the air–water (Wilhelmy plate method) and the oil–water interface (bursting membrane) and the dynamic surface tension during compression and expansion in the caterpillar. Gliadin had the lowest equilibrium interfacial tensions and β-casein the lowest dynamic surface tension during expansion. Hardly any foam could be formed at a concentration of 0.1 g/l by shaking. At a concentration of 1.4 g/l most foam was formed by β-casein, followed by gliadin and glycinin. It seems that in the first place the rate of adsorption is important for foam formation. For the vegetable proteins, adsorption was slow. This resulted in lower foamability, especially for glycinin. 相似文献