Related papers: Buffer Centering for bittide Synchronization via F…
During the last decades, significant advances have been made in the area of power system stability and control. Nevertheless, when this analysis is carried out by means of decentralized conditions in a general network, it has been based on…
Integrated with a high share of Inverter-Based Resources (IBRs), microgrids face increasing complexity of frequency dynamics, especially after unintentional islanding from the maingrid. These IBRs, on the other hand, provide more control…
In the current landscape of large models, the Transformer stands as a cornerstone, playing a pivotal role in shaping the trajectory of modern models. However, its application encounters challenges attributed to the substantial computational…
For popular websites most important concern is to handle incoming load dynamically among web servers, so that they can respond to their client without any wait or failure. Different websites use different strategies to distribute load among…
The Breadth First Search (BFS) algorithm is the foundation and building block of many higher graph-based operations such as spanning trees, shortest paths and betweenness centrality. The importance of this algorithm increases each day due…
The peculiar congestion patterns in data centers are caused by the bursty and composite nature of traffic, the small bandwidth-delay product, and the tiny switch buffers. It is not practical to modify TCP to adapt to data centers,…
The stability of AC power grids relies on ancillary services that mitigate frequency fluctuations. The electromechanical inertia of large synchronous generators is currently the only resource to absorb frequency disturbances on sub-second…
This paper presents a distributed frequency control method for power grids with high penetration of inverter-connected resources under low and time-varying inertia due to renewable energy (RE). We provide a distributed virtual inertia (VI)…
We consider the problem of network stability in finite-buffer systems. We observe that finite buffer may affect stability even in simplest network structure, and we propose an ordinary differential equation (ODE) model to capture the…
In this paper, a new and novel data structure is proposed to dynamically insert and delete segments. Unlike the standard segment trees[3], the proposed data structure permits insertion of a segment with interval range beyond the interval…
The overall performance of a distributed system is highly dependent on the communication efficiency of the system. Although network resources (links, bandwidth) are becoming increasingly more available, the communication performance of data…
The ``Pulse Synchronization'' problem can be loosely described as targeting to invoke a recurring distributed event as simultaneously as possible at the different nodes and with a frequency that is as regular as possible. This target…
A low and stable buffer occupancy is critical to achieve high throughput, low packet drop rate, low latency, and low jitter for data center networks. It also allows switch chips to support higher port density, larger lookup tables, or…
This paper examines synchronization of computer clocks connected via a data network and proposes a skewless algorithm to synchronize them. Unlike existing solutions, which either estimate and compensate the frequency difference (skew) among…
This paper proposes an original solution to input saturation and dead zone of fractional order system. To overcome these nonsmooth nonlinearities, the control input is decomposed into two independent parts by introducing an intermediate…
Distributed Software Defined Networking (SDN) controllers aim to solve the issue of single-point-of-failure and improve the scalability of the control plane. Byzantine and faulty controllers, however, may enforce incorrect configurations…
Phase, frequency, and time synchronization are crucial requirements for many applications, such as multi-static remote sensing and communication systems. Moreover, the synchronization solution becomes even more challenging when the nodes…
This paper presents a new strategy for scheduling soft real-time tasks on multiple identical cores. The proposed approach is based on partitioned CPU reservations and it uses a reclaiming mechanism to reduce the number of missed deadlines.…
This paper discusses distributed optimization over a directed graph. We begin with some well known algorithms which achieve consensus among agents including FROST [1], which possesses the quickest convergence to the optimum. It is a well…
With the gradual transformation of power generation towards renewables, distributed energy resources are becoming more and more relevant for grid stabilization. In order to involve all participants in the joint solution of this challenging…