A strategy for scheduling tightly coupled parallel applications on clusters

Although various strategies have been developed for scheduling parallel applications with independent tasks, very little work exists for scheduling tightly coupled parallel applications on cluster environments. In this paper, we compare four different strategies based on performance models of tightly coupled parallel applications for scheduling the applications on clusters. In addition to algorithms based on existing popular optimization techniques, we also propose a new algorithm called Box Elimination that searches the space of performance model parameters to determine the best schedule of machines. By means of real and simulation experiments, we evaluated the algorithms on single cluster and multi-cluster setups. We show that our Box Elimination algorithm generates up to 80% more efficient schedule than other algorithms. We also show that the execution times of the schedules produced by our algorithm are more robust against the performance modeling errors.

A generalized Linear Programming based approach to optimal divisible load scheduling

In this paper we propose a general Linear Programming (LP) based formulation and solution methodology for obtaining optimal solution to the load distribution problem in divisible load scheduling. We exploit the power of the versatile LP formulation to propose algorithms that yield exact solutions to several very general load distribution problems for which either no solutions or only heuristic solutions were available. We consider both star (single-level tree) networks and linear daisy chain networks, having processors equipped with front-ends, that form the generic models for several important network topologies. We consider arbitrary processing node availability or release times and general models for communication delays and computation time that account for constant overheads such as start up times in communication and computation. The optimality of the LP based algorithms is proved rigorously.

Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems

In this paper, a novel genetic algorithm is developed by generating artificial chromosomes with probability control to solve the machine scheduling problems. Generating artificial chromosomes for Genetic Algorithm (ACGA) is closely related to Evolutionary Algorithms Based on Probabilistic Models (EAPM). The artificial chromosomes are generated by a probability model that extracts the gene information from current population. ACGA is considered as a hybrid algorithm because both the conventional genetic operators and a probability model are integrated. The ACGA proposed in this paper, further employs the ``evaporation concept'' applied in Ant Colony Optimization (ACO) to solve the permutation flowshop problem. The ``evaporation concept'' is used to reduce the effect of past experience and to explore new alternative solutions. In this paper, we propose three different methods for the probability of evaporation. This probability of evaporation is applied as soon as a job is assigned to a position in the permutation flowshop problem. Experimental results show that our ACGA with the evaporation concept gives better performance than some algorithms in the literature.

S-nets: A Petri net based model for performance evaluation of real-time scheduling algorithms

A new class of nets, called S-nets, is introduced for the performance analysis of scheduling algorithms used in real-time systems Deterministic timed Petri nets do not adequately model the scheduling of resources encountered in real-time systems, and need to be augmented with resource places and signal places, and a scheduler block, to facilitate the modeling of scheduling algorithms. The tokens are colored, and the transition firing rules are suitably modified. Further, the concept of transition folding is used, to get intuitively simple models of multiframe real-time systems. Two generic performance measures, called �load index� and �balance index,� which characterize the resource utilization and the uniformity of workload distribution, respectively, are defined. The utility of S-nets for evaluating heuristic-based scheduling schemes is illustrated by considering three heuristics for real-time scheduling. S-nets are useful in tuning the hardware configuration and the underlying scheduling policy, so that the system utilization is maximized, and the workload distribution among the computing resources is balanced.

Improved preprocessing methods for modulo scheduling algorithms

Instruction scheduling with an automaton-based resource conflict model is well-established for normal scheduling. Such models have been generalized to software pipelining in the modulo-scheduling framework. One weakness with existing methods is that a distinct automaton must be constructed for each combination of a reservation table and initiation interval. In this work, we present a different approach to model conflicts. We construct one automaton for each reservation table which acts as a compact encoding of all the conflict automata for this table, which can be recovered for use in modulo-scheduling. The basic premise of the construction is to move away from the Proebsting-Fraser model of conflict automaton to the Muller model of automaton modelling issue sequences. The latter turns out to be useful and efficient in this situation. Having constructed this automaton, we show how to improve the estimate of resource constrained initiation interval. Such a bound is always better than the average-use estimate. We show that our bound is safe: it is always lower than the true initiation interval. This use of the automaton is orthogonal to its use in modulo-scheduling. Once we generate the required information during pre-processing, we can compute the lower bound for a program without any further reference to the automaton.

ELISA: An Estimated Load Information Scheduling Algorithm for Distributed Computing Systems

In this paper, we present a decentralized dynamic load scheduling/balancing algorithm called ELISA (Estimated Load Information Scheduling Algorithm) for general purpose distributed computing systems. ELISA uses estimated state information based upon periodic exchange of exact state information between neighbouring nodes to perform load scheduling. The primary objective of the algorithm is to cut down on the communication and load transfer overheads by minimizing the frequency of status exchange and by restricting the load transfer and status exchange within the buddy set of a processor. It is shown that the resulting algorithm performs almost as well as a perfect information algorithm and is superior to other load balancing schemes based on the random sharing and Ni-Hwang algorithms. A sensitivity analysis to study the effect of various design parameters on the effectiveness of load balancing is also carried out. Finally, the algorithm's performance is tested on large dimensional hypercubes in the presence of time-varying load arrival process and is shown to perform well in comparison to other algorithms. This makes ELISA a viable and implementable load balancing algorithm for use in general purpose distributed computing systems.

Real-World Extensions To Scheduling Algorithms Based On Lagrangian Relaxation

Recently, efficient scheduling algorithms based on Lagrangian relaxation have been proposed for scheduling parallel machine systems and job shops. In this article, we develop real-world extensions to these scheduling methods. In the first part of the paper, we consider the problem of scheduling single operation jobs on parallel identical machines and extend the methodology to handle multiple classes of jobs, taking into account setup times and setup costs, The proposed methodology uses Lagrangian relaxation and simulated annealing in a hybrid framework, In the second part of the paper, we consider a Lagrangian relaxation based method for scheduling job shops and extend it to obtain a scheduling methodology for a real-world flexible manufacturing system with centralized material handling.

Multiphase models for simulating hot and slightly miscible DNAPL (dense non-aqueous phase fluids) in a saturated rock fracture under deformation

In the present study a two dimensional model is first developed to show the behaviour of dense non-aqueous phase liquids (DNAPL) within a rough fracture. To consider the rough fracture, the fracture is imposed with variable apertures along its plane. It is found that DNAPL follows preferential pathways. In next part of the study the above model is further extended for non-isothermal DNAPL flow and DNAPL-water interphase mass transfer phenomenon. These two models are then coupled with joint deformation due to normal stresses. The primary focus of these models is specifically to elucidate the influence of joint alteration due to external stress and fluid pressures on flow driven energy transport and interphase mass transfer. For this, it is assumed that the critical value for joint alteration is associated with external stress and average of water and DNAPL pressures in multiphase system and the temporal and spatial evolution of joint alteration are determined for its further influence on energy transport and miscible phase transfer. The developed model has been studied to show the influence of deformation on DNAPL flow. Further this preliminary study demonstrates the influence of joint deformation on heat transport and phase miscibility via multiphase flow velocities. It is seen that the temperature profile changes and shows higher diffusivity due to deformation and although the interphase miscibility value decreases but the lateral dispersion increases to a considerably higher extent.

Electrochemical phase formation (ECPF): Nucleation growth vis-a-vis adsorption models

The nucleataon growth model of electrochemical phase formation is analysed for the hnear potential sweep input Apart from deducing diagnostic criteria and method~ of estimating model parameters, the predictions of the nucleation growth model are compared and contrasted with those of a sample adsorption model A dastlnCtlOn is made possible between adsorption and phase transition, which seems useful for understanding the nature of ECPF phenomena, especially underpotentlal deposition (UPD).

Comparison of Interproton Distances in DNA Models with Nuclear Overhauser Enhancement Data

The conformational flexibility inherent in the polynucleotide chain plays an important role in deciding its three-dimensonal structure and enables it to undergo structural transitions in order to fulfil all its functions. Following certain stereochemical guidelines, both right and left handed double-helical models have been built in our laboratory and they are in reasonably good agreement with the fibre patterns for various polymorphous forms of DNA. Recently, nuclear magnetic resonance spectroscopy has become an important technique for studying the solution conformation and polymorphism of nucleic acids. Several workers have used 1H nuclear magnetic resonance nuclear Overhauser enhancement measurements to estimate the interproton distances for the various DNA oligomers and compared them with the interproton distances for particular models of A and Β form DNA. In some cases the solution conformation does not seem to fit either of these models. We have been studying various models for DNA with a view to exploring the full conformational space allowed for nucleic acid polymers. In this paper, the interproton distances calculated for the different stereochemically feasible models of DNA are presented and they are compared and correlated against those obtained from 1Η nuclear magnetic resonance nuclear Overhauser enhancement measurements of various nucleic acid oligomers.

Relativistic particle models with separable interactions

We present relativistic, classical particle models that possess Poincaré invariance, invariant world lines, particle interaction, and separability.

Optimal scheduling of hydro-thermal power systems under shortage

The problem of optimal scheduling of the generation of a hydro-thermal power system that is faced with a shortage of energy is studied. The deterministic version of the problem is first analyzed, and the results are then extended to cases where the loads and the hydro inflows are random variables.

Adsorption isotherms for neutral organic compounds - A hierarchy in modelling: Part V. Models for the inner layer potential difference in the presence of dipolar adsorption

The relations for the inner layer potential &fference (E) in the presence of adsorbed orgamc molecules are derived for three hterarchlcal models, m terms of molecular constants like permanent &pole moments, polarlzablhtles, etc It is shown how the experimentally observed patterns of the E vs 0 plots (hnear m all ranges of $\sigma^M$, non-linear in one or both regions of o M, etc ) can be understood in a serm-quantltatlve manner from the simplest model in our hierarchy, viz the two-state site panty version Two-state multi-site and three-state (sxte panty) models are also analysed and the slope (3E/80),,M tabulated for these also The results for the Esm-Markov effect are denved for all the models and compared with the earlier result of Parsons. A comparison with the GSL phenomenologlcal equation is presented and its molecular basis, as well as the hmltatlons, is analysed. In partxcular, two-state multa-slte and three-state (site panty) models yield E-o M relations that are more general than the "umfied" GSL equation The posslblhty of vaewlng the compact layer as a "composite medium" with an "effective dlelectnc constant" and obtaimng novel phenomenological descnptions IS also indicated.

Classical and Cosserat plasticity and viscoplasticity models for slow granular flow

We consider models for the rheology of dense, slowly deforming granular materials based of classical and Cosserat plasticity, and their viscoplastic extensions that account for small but finite particle inertia. We determine the scale for the viscosity by expanding the stress in a dimensionless parameter that is a measure of the particle inertia. We write the constitutive relations for classical and Cosserat plasticity in stress-explicit form. The viscoplastic extensions are made by adding a rate-dependent viscous stress to the plasticity stress. We apply the models to plane Couette flow, and show that the classical plasticity and viscoplasticity models have features that depart from experimental observations; the prediction of the Cosserat viscoplasticity model is qualitatively similar to that of Cosserat plasticity, but the viscosities modulate the thickness of the shear layer.