Divisible load theory has become a popular area of research during the past two decades. Based on divisible load theory the computations and communications can be divided into some arbitrarily independent parts and each part can be processed independently by a processor. Existing divisible load scheduling algorithms do not consider any priority for allocating fraction of load. In some situation...

In this paper the equivalence between various divisible load-scheduling policies and continuous time Markov chains is demonstrated. This provides a basic unification of both data parallel divisible load scheduling and Markov chain models for the first time in 16 years of research. Such equivalence is demonstrated for divisible scheduling on linear daisy chains and single and two level tree netw...

In this paper, we consider the problem of scheduling distributed biological sequence comparison applications. This problem lies in the divisible load framework with negligible communication costs. Thus far, very few results have been proposed in this model. We discuss and select relevant metrics for this framework: namely max-stretch and sumstretch. We explain the relationship between our model...

There is a one-to-one correspondence between classical one-dimensional infinitely divisible distributions and free infinitely divisible distributions. In this work we study the free infinitely divisible distributions corresponding to the one-dimensional type  distributions. A new characterization of classical type  distributions is given first and the class of type  classical infinitely divi...

We give a precise characterization of two important classes of conditionally positive definite (CPD) kernels in terms of integral transforms of infinitely divisible distributions. In particular, we show that for any stationary CPD kernel A(x, y) = f(x − y), f is the log-characteristic function of a uniquely determined infinitely divisible distribution; further, for any additive CPD kernel A(x, ...

Convention: all base schemes will be in characteristic p. Writing k or we will assume k = k F p , respectively = F p. We will write X ! S for a p-divisible group over a base S (and sometimes will say \a family of p-divisible groups"), while we tend to write X when we consider a p-divisible group over a base eld (but we are not strict in this convention). Instead of \p-divisible group" one can a...

The divisible load scheduling is a paradigm in the area of distributed computing. The traditional divisible load theory is based on the fact that, the communications and computations are obedient and do not cheat the algorithm. The literature of review shows that the divisible load model fail to achieve its optimal performance, if the processors do not report their true computation rates. The d...

Group divisible designs are the most important class of partially balanced incomplete block (PBIB) designs. A list of new group divisible designs with r, k ⩽ 10 is provided.