Related papers: Comments on "Gang EDF Schedulability Analysis"
A comment on the paper "Truncated Schwinger-Dyson Equations and Gauge Covariance in QED3", Few-Body Syst. 41, 185 (2007) [hep-ph/0511291].
The conditions of tests and calibrations described in the article E.E Kading et al. [Phys. Rev. Res. 2, 023279 (2020)] show striking flaws. The interpretation and extraction of quantitative results from this experiment are considered…
It has been pointed out by counterexamples in a 2013 paper in the IEEE Transactions on Computers [1], that there is an error in the previously ibid.\ in 2005 published paper [2] on the construction of valid digit selection tables for SRT…
In this paper we formally analyze the software methodology called (iterated) Test Driven Development (TDD). We formally define Specification, Software, Testing, Equivalence Partitions, Coupling, to argue about the nature of the software…
Claims by Kroha and Zawadowski in cond-mat/0105026 on inadequate approximations and an incorrect statement in cond-mat/0102150 are shown to be based on oversimplified estimates and a false quotation.
This paper presents an evaluation framework that attempts to quantify the "degree of realism" of simulated financial time series, whatever the simulation method could be, with the aim of discover unknown characteristics that are not being…
I summarise a method to quantitatively assess the consistency of power-counting proposals in Effective Field Theories which are non-perturbative at leading order. It uses the fact that the Renormalisation Group evolution of an observable…
This paper focuses on the analysis of real-time non preemptive multiprocessor scheduling with precedence and several latency constraints. It aims to specify a schedulability condition which enables a designer to check a priori -without…
The measurement apparatus proposed in the titled paper, "Energy-Time Uncertainty Relations in Quantum Measurements" [Found. Phys. 46, 1522-1550 (2016)] was examined. A simple proof was presented for the non-existence of the apparatus.
As illustrated by the emergence of a class of new languages and runtimes, it is expected that a large portion of the programs to run on extreme scale computers will need to be written as graphs of event-driven tasks (EDTs). EDT runtime…
Mini-Proceedings ECT*: Speakable in quantum mechanics: atomic, nuclear and subnuclear physics tests, ECT*-Trento, 29 August - 2 September, 2011
Recently, the paper B. Georgeot and D.L. Shepelyansky, Phys. Rev. Lett._86_, 5393 (2001) has been criticized [C. Zalka, quant-ph/0110019; L. Di'osi, quant-ph/0110026]. The Letter claims an exponential speedup and reduction in error…
In this paper I have study to Reduce the time Complexity of Earliest Deadline First (EDF), a global scheduling scheme for Earliest Deadline First in Real Time System tasks on a Multiprocessors system. Several admission control algorithms…
A recent paper (Phys. Rev A. 75, 022513 (2007), arXiv:cond-mat/0602020) challenges exact time-dependent density functional theory (TDDFT) on several grounds. We explain why these criticisms are either irrelevant or incorrect, and that TDDFT…
In this work, we investigate the potential utility of parallelization for meeting real-time constraints and minimizing energy. We consider malleable Gang scheduling of implicit-deadline sporadic tasks upon multiprocessors. We first show the…
Scheduling parallel sessions of an academic meeting is a complicated task. If each presentation is assigned to an appropriate session, an antiferromagnetic Potts model can be used for semi-automatic timetabling. The timetabling method…
This paper proposes a new scheduler applying the concept of non-uniform laxity to Earliest deadline first (EDF) approach for aperiodic tasks. This scheduler improves task utilisation (Execution time / deadline) and also increases the number…
We investigate the recoverable robust single machine scheduling problem under interval uncertainty. In this setting, jobs have first-stage processing times p and second-stage processing times q and we aim to find a first-stage and…
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has been done, the problem reduces to well understood uniprocessor…
A method to quantitatively assess the consistency of power-counting proposals in Effective Field Theories (EFT) which are non-perturbative at leading order is presented. The Renormalisation Group evolution of an observable predicts the…