Related papers: Comments on "Gang EDF Schedulability Analysis"
In end-to-end distributed real time systems, a task may be executed sequentially on different processors. The end-toend task response time must not exceed the end-to-end task deadline to consider the task a schedulable task. In transient…
In this paper, we report some on-going focused research, but are further keen to set it in the context of a proposed bigger picture, as follows. There is a certain depressing pattern about the attitude of industry to spreadsheet error…
The parallel session on "Relativistic and Particle Astrophysics" was held on 14th December 2015. Here a short summary of each presentation of this parallel session is given.
In this note we document a gap in an argument in the above paper, and point to new work in the literature giving a complete proof of the main result.
Unfortunately, the article "A Comparative Study to Benchmark Cross-project Defect Prediction Approaches" has a problem in the statistical analysis which was pointed out almost immediately after the pre-print of the article appeared online.…
Critical comments on the recent papers supporting the idea of resilient quantum computations are presented.
This is a progress report on a preliminary feasibility study of experimental setups for preparing and probing a gravitational cat state [1].
Strategies that artificially tighten high-criticality task deadlines in low-criticality behaviors have been successfully employed for scheduling mixed-criticality systems. Although efficient scheduling algorithms have been developed for…
We respond to the comment arXiv:1809.03931 put forward by Li-Han Chen, Zhen Liu, and Jian-Tin Zheng on our work Kiesel, Platt, and Thomale, Phys. Rev. Lett. 110, 126405 (2013). All misunderstandings and misconceptions communicated in the…
This paper studies charging scheduling problem of electric vehicles (EVs) in the scale of a microgrid (e.g., a university or town) where a set of charging stations are controlled by a central aggregator. A bi-objective optimization problem…
Logs of real-life processes often feature uncertainty pertaining the recorded timestamps, data values, and/or events. We consider the problem of checking conformance of uncertain logs against data-aware reference processes. Specifically, we…
Synthesis of models and strategies is a very important problem in software engineering. The main element here is checking the satisfiability of formulae expressing the specification of a system to be implemented. This paper puts forward a…
Communication scheduling aims to reduce communication bottlenecks in data parallel training (DP) by maximizing the overlap between computation and communication. However, existing schemes fall short due to three main issues: (1) hard data…
This report considers a sporadic real-time task system with $n$ sporadic tasks on a uniprocessor platform, in which the lowest-priority task is a segmented self-suspension task and the other higher-priority tasks are ordinary sporadic…
In this study, we investigate a scheduling problem on identical machines in which jobs require initial setup before execution. We assume that an algorithm can dynamically form a batch (i.e., a collection of jobs to be processed together)…
In line with its terms of reference the ICFA Neutrino Panel has developed a roadmapfor the international, accelerator-based neutrino programme. A "roadmap discussion document" was presented in May 2016 taking into account the…
We consider non-preemptive scheduling problems on parallel identical machines where machines change their status from being available to being unavailable and vice versa along the time horizon. The particular form of unavailability we…
Comment on Phys. Rev. A 79, 052312 (2009), http://pra.aps.org/abstract/PRA/v79/i5/e052312
We consider a parallel system of $m$ identical machines prone to unpredictable crashes and restarts, trying to cope with the continuous arrival of tasks to be executed. Tasks have different computational requirements (i.e., processing time…
We present a federated, asynchronous, memory-limited algorithm for online task scheduling across large-scale networks of hundreds of workers. This is achieved through recent advancements in federated edge computing that unlocks the ability…