This paper presents a general framework for optimal task reallocation in heterogeneous distributed computing systems (DCSs). The framework relies on a rigorous analytical model for the stochastic execution time of a workload. The model takes into account the heterogeneity and randomness of both service times and communication delays, an arbitrary task-reallocation policy as well as the stochast...

Two reconfigurable control allocation (called also as control reallocation) schemes for Unmanned Aerial Vehicle (UAV) under stuck actuator failures have been proposed in this paper. The two control reallocation algorithms include a cascaded generalized inverse algorithm and a fixed-point algorithm. The performance of the two algorithms has been evaluated with a UAV model known as ALTAV (Almost-...

In an abstract model of division problems, we study division rules that are not manipulable through a reallocation of individual characteristic vectors within a coalition (e.g. reallocation of claims in bankruptcy problems). A coalition can be formed under a given communication network, a (non-directed) graph, if members of this coalition are connected on the graph. We offer a characterization ...

Software-defined networking (SDN) as a new paradigm for networking provides efficient resource reallocation platform in emerging cloud data center networks. The dynamic nature of cloud data center network's traffic, as well as the existence of big flows make it necessary to periodically reprogram the network through the SDN controller. Therefore, it is critical for network researchers to minimi...

Reallocating roadspace from general traffic, to improve conditions for pedestrians or cyclists or buses or on-street light rail or other high-occupancy vehicles, is often predicted to cause major traffic problems on neighbouring streets. This paper reports on two phases of research, resulting in the examination of over 70 case studies of roadspace reallocation from eleven countries, and the col...

The following classes of connecting networks, based on their combinatorial properties, have been previously defined: networks nonblocking in the strict sense, networks non blocking in the wide sense, rearrangeable networks, and blocking networks. In this paper we add the class of repackable networks, i.e., networks in which blocking can be avoided by using call repacking control algorithms. The...

Reconfigurable control allocation research is important to multidisciplinary science and engineering applications. In particular, the proposed research plays a significant role in enhancing the safety, reliability and fault tolerance capability of Unmanned Aerial Vehicle (UAV), which is one of the most active research and development areas. The main objective of this paper is to introduce and e...

We consider the Windows Scheduling problem. The problem is a restricted version of Unit-Fractions Bin Packing, and it is also called Inventory Replenishment in the context of Supply Chain. In brief, the problem is to schedule the use of communication channels to clients. Each client ci is characterized by an active cycle and a window wi. During the period of time that any given client ci is act...

In this paper we look at the problem of scheduling tasks on a single-processor system, where each task requires unit time and must be scheduled within a certain time window, and each task can be added to or removed from the system at any time. On each operation, the system is allowed to reschedule any tasks, but the goal is to minimize the number of rescheduled tasks. Our main result is an allo...