Learn More
Divisible load theory is a methodology involving the linear and continuous modeling of partitionable computation and communication loads for parallel processing. It adequately represents an important class of problems with applications in parallel and distributed system scheduling, various types of data processing, scientific and engineering computation,(More)
—Large-scale distributed applications are subject to frequent disruptions due to resource contention and failure. Such disruptions are inherently unpredictable and, therefore, robustness is a desirable property for the distributed operating environment. In this work, we describe and evaluate a robust topology for applications that operate on a spanning tree(More)
In this paper, we apply divisible load theory to model the Grid scheduling problem involving multiple sources to multiple sinks, and present an optimized scheduling technique for this scenario. This scheduling technique can be easily extended to schedule resources with buffer space constraints. We provide a step-wise scheduling algorithm for these(More)
In this paper, we design a multiprocessor strategy that exploits the computational characteristics of the algorithms used for biological sequence comparison proposed in the literature. We employ divisible load theory (DLT) that is suitable for handling large scale processing on network based systems. For the first time in the domain of DLT, the problem of(More)