Related papers: Comments on "Gang EDF Schedulability Analysis"

This report summarizes two general frameworks, namely k2Q and k2U, that have been recently developed by us. The purpose of this report is to provide detailed evaluations and comparisons of these two frameworks. These two frameworks share…

This paper describes a new approach to experimentally estimate the application schedulability for various processor frequencies. We use additional workload generated by an artificial high priority routine to simulate the frequency decrease…

Given a program and a time deadline, does the program finish before the deadline when executed on a given platform? With the requirement to produce a test case when such a violation can occur, we refer to this problem as the worst-case…

In this note, the correction to the proof of one theorem in some our previous paper [arXiv:1302.0589] will be given.

This paper addresses the problem of scheduling tasks with different criticality levels in the presence of I/O requests. In mixed-criticality scheduling, higher criticality tasks are given precedence over those of lower criticality when it…

In sections 1 and 2 we review Event Enhanced Quantum Theory (EEQT). In section 3 we discuss applications of EEQT to tunneling time, and compare its quantitative predictions with other approaches, in particular with B\"uttiker-Larmor and…

Gates et al (astro-ph/9606132) have raised several issues in their Comment on our Letter (Phys. Rev. Lett. Vol. 76, p.3886 (1996); astro-ph/9605001). We clarify these issues and show that our results are robust, and there is no…

The report from the working group on '\gamma\gamma Event Generators' of the LEP 2 workshop

In this paper we review algorithms for checking diagnosability of discrete-event systems and timed automata. We point out that the diagnosability problems in both cases reduce to the emptiness problem for (timed) B\"uchi automata. Moreover,…

Real-time systems increasingly use multicore processors in order to satisfy thermal, power, and computational requirements. To exploit the architectural parallelism offered by the multicore processors, parallel task models, scheduling…

We close a gap appearing at the same time in the author's thesis "Iterated rings of bounded elements and generalizations of Schm\"udgen's theorem" [1] and in the author's article "Iterated rings of bounded elements and generalizations of…

Parallel machine scheduling has been extensively studied in the past decades, with applications ranging from production planning to job processing in large computing clusters. In this work we study some of these fundamental optimization…

We propose a virtual-gang based parallel real-time task scheduling approach for multicore platforms. Our approach is based on the notion of a virtual-gang, which is a group of parallel real-time tasks that are statically linked and…

As an environment-friendly substitute for conventional fuel-powered vehicles, electric vehicles (EVs) and their components have been widely developed and deployed worldwide. The large-scale integration of EVs into power grid brings both…

This short paper introduces a model for the specification and verification of real-time system design: timed state transition diagrams.

The title paper is discussed critically. There are major problems with incorrect statements, irrelevant citations, incorrect mathematics leading to incorrect results, which are compared with our own simulations.

This paper is a set of notes that we wrote concerning the first version of Emergent Gravity [gr-qc/0602022]. It is our version of an exercise that we proposed to some of our students. The idea was to find mathematical errors and…

We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism. We prove that the time-complexity of the feasibility problem…

Energy-efficient real-time task scheduling has been actively explored in the past decade. Different from the past work, this paper considers schedulability conditions for stochastic real-time tasks. A schedulability condition is first…

Conditions for the detectability of topology variations in dynamical networks are developed in a recent article in the IEEE Transactions on Control of Network Systems [1]. Here, an example is presented which illustrates an error in the…