For maximum efficiency in a multiprocessor system the load should be shared evenly over all processors, that is, there should be no idle processors when tasks are available. The delay in a load sharing algorithm is the larger of the maximum time that any processor can be idle before a task is assigned to it, and the maximum time that it must wait to be relieved of an excess task. A simple paral...

This paper focuses on the design of autonomous and collaborative control strategies to govern the relative distances among multiple spacecraft in formation with no ground intervention. A coordinate load-sharing control structure for formation flying and a methodology to control their dynamic models with slow t ime-varymg and uncertain parameters are the main objectives of this work. The method ...

Adaptive algorithms for load-sharing usually comprise two basic functions: state information dissemination and decision making (control). This paper describes a flexible load-sharing algorithm, FLS, which includes a third function introduced for scalability purposes, that of partitioning into domains. The system partitioning function at a node is responsible for the selection of other nodes to ...

Heterogeneity of processor speed and time availability is introduced to the paradigm of load sharing among a number of autonomous and independently scheduled heterogeneous computers that communicate via a message-passing interconnection system. A divisible job originating at one of the system sites is to be partitioned and executed concurrently on a suite of selected processors, to the extent o...

In this paper, we study Demand Response (DR) problematics for different levels of information sharing in a smart grid. We propose a dynamic pricing scheme incentivizing consumers to achieve an aggregate load profile suitable for utilities, and study how close they can get to an ideal flat aggregate demand profile depending on how much information they share. When customers can share all their l...

Load sharing algorithms can use sender-initiated, receiver-initiated, or symmetrically-initiated schemes to improve performance in distributed systems. The relative performance of these schemes has been shown to depend on the system load. We propose an adaptive symmetrically-initiated scheme where all nodes alternate between a sender-initiated and a receiver-initiated algorithm depending on the...

Three policies, namely optimal repacking, least load routing, and Bernoulli splitting, are considered for dynamic resource allocation in load sharing networks with standard Erlang type statistics. Large deviations principles are established for the three policies in a simple network of three consumer types and two resource locations and are used to identify the network overflow exponents. The o...

We consider the problem of how to design resource allocation policies that both provide good performance at predicted environmental conditions and are robust against changes or misprediction of the environmental conditions. We evaluate various common threshold-based allocation policies within a simple model, where there is a clear tradeoff between the (conflicting) goals of good performance and...

Load sharing is key to the efficient operation of distributed systems. This paper investigates load sharing policies in a heterogeneous distributed system, where half of the total processors have double the speed of the others. Processor performance is examined and compared under a variety of workloads. Two job classes are considered. Programs of the first class are dedicated to fast processors...

Load sharing can improve performance in distributed systems by transferring work from heavily loaded nodes to lightly loaded nodes. We propose a lter component to be included in a load sharing algorithm to detect short-lived jobs not worth considering for remote execution. One lter, called History, detects short-lived jobs by using job names and statistics based on previous executions. Job trac...