Related papers: Comments on "Gang EDF Schedulability Analysis"
This article examines the significant challenges encountered in implementing sharding within distributed replication systems. It identifies the impediments of achieving consensus among large participant sets, leading to scalability,…
The various versions of cond-mat/0312353 discuss results obtained by me&coworkers in the last decade. I have received requests to comment on the paper and the comments are collected here, including some that I tried to point in the course…
With the large-scale integration of electric vehicles (EVs) in the distribution grid, the unpredictable nature of EV charging introduces considerable uncertainties to the grid's real-time operations. This can exacerbate load fluctuations,…
Scheduling with testing is a recent online problem within the framework of explorable uncertainty motivated by environments where some preliminary action can influence the duration of a task. Jobs have an unknown processing time that can be…
The original version of the paper was published in Contemporary Mathematics 378 ``Groups, Languages, Algorithms''; 2005, pp. 319-348. This is a modified version with Appendix that holds a corrected formulation of Proposition 4.1.
Overheating has been acknowledged as a major issue in testing complex SOCs. Several power constrained system-level DFT solutions (power constrained test scheduling) have recently been proposed to tackle this problem. However, as it will be…
Baker and Cirinei introduced an exact but naive algorithm, based on solving a state reachability problem in a finite automaton, to check whether sets of sporadic hard real-time tasks are schedulable on identical multiprocessor platforms.…
The demand for distributed applications has significantly increased over the past decade, with improvements in machine learning techniques fueling this growth. These applications predominantly utilize Cloud data centers for high-performance…
The LPC EFT workshop was held April 25-26, 2024 at the University of Notre Dame. The workshop was organized into five thematic sessions: "how far beyond linear" discusses issues of truncation and validity in interpretation of results with…
The problem of scheduling with testing in the framework of explorable uncertainty models environments where some preliminary action can influence the duration of a task. In the model, each job has an unknown processing time that can be…
In this small note we correct an error made by Mohammadi et al. in their paper entitled "On Skew Cyclic Codes Over A Finite Ring" ( Iranian Jl. Math. Sci. Inform. Vol 14 (1) (2019), 135-145).
This note corrects some omissions in section 2 of the paper "Lipschitz connectivity and filling invariants in solvable groups and buildings."
In this paper we formulate an optimization approach to schedule electrical loads given a short term prediction of time-varying power production and the ability to store only a limited amount of electrical energy. The proposed approach is…
Weakly hard real-time systems can, to some degree, tolerate deadline misses, but their schedulability still needs to be analyzed to ensure their quality of service. Such analysis usually occurs at early design stages to provide…
We study the problem of scheduling jobs on fault-prone machines communicating via a shared channel, also known as multiple-access channel. We have $n$ arbitrary length jobs to be scheduled on $m$ identical machines, $f$ of which are prone…
This work studies fixed priority (FP) scheduling of real-time jobs with end-to-end deadlines in a distributed system. Specifically, given a multi-stage pipeline with multiple heterogeneous resources of the same type at each stage, the…
In a recent Phys. Rev. E Rapid Communication, the authors, Silvestrov and Beenakker, introduce a way to lengthen the Ehrenfest time, $\tau$, for fully chaotic systems. We disagree with several statements made in their paper, and address the…
In this paper, we address the scheduling problem of multi-mode real-time systems upon uniform multiprocessor platforms. We propose two transition protocols, specified together with their schedulability test, and provide the reader with two…
I consider quantum protocols for clock synchronization, and investigate in particular whether entanglement distillation or quantum error-correcting codes can improve the robustness of these protocols. I also draw attention to some…
We reply to the comment cond-mat/0008098 by Yang, Sun, and Chang on our paper "Theory of Diluted Magnetic Semiconductor Ferromagnetism", Phys. Rev. Lett. 84, 5628 (2000).