Related papers: Comments on "Gang EDF Schedulability Analysis"

Embedded systems have pervaded all walks of our life. With the increasing importance of mobile embedded systems and flexible applications, considerable progress in research has been made for power management. Power constraints are…

This article serves as errata of the book "Energy of knots and conformal geometry", Series on Knots and Everything Vol. 33, World Scientific, Singapore, 304 pages, (2003). (ver. 27/05/2007)

This paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph and no two jobs connected by an edge are allowed to be assigned to the same machine. In particular, we study the case where the…

This paper also has excessove overlap with the following papers also written by the authors or their collaborators: gr-qc/0502060, gr-qc/0606028, gr-qc/0511095, gr-qc/0505078, gr-qc/0603044, gr-qc/0608014, gr-qc/0510123, gr-qc/0607109,…

This paper presents a novel idea for the general case of the Common Due-Date (CDD) scheduling problem. The problem is about scheduling a certain number of jobs on a single or parallel machines where all the jobs possess different processing…

Synchronization problem for linear coupled networks is a hot topic in recent decade. However, until now, some confused concepts and results still puzzle people. To avoid further misleading researchers, it is necessary to point out these…

This paper indicates two errors in the formulation of the main optimization model in the article "Dynamic power management in energy-aware computer networks and data intensive computing systems" by Niewiadomska-Szynkiewicz et al. [FGCS,…

This paper considers the scheduling of stochastic jobs on parallel identical machines to minimize the expected total weighted completion time. While this is a classical problem with a significant body of research on approximation algorithms…

This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints according to classical complexity hypothesis ($\mathcal{P} \neq \mathcal{NP}$,…

In this paper we consider the problem of scheduling on parallel machines with a presence of incompatibilities between jobs. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of…

We study scheduling problems on a machine with varying speed. Assuming a known speed function we ask for a cost-efficient scheduling solution. Our main result is a PTAS for minimizing the total weighted completion time in this setting. This…

This research addresses the multiprocessor scheduling problem of hard real-time systems, and it especially focuses on optimal and global schedulers when practical constraints are taken into account. First, we propose an improvement of the…

Low-latency communication has recently attracted considerable attention owing to its potential of enabling delay-sensitive services in next-generation industrial cyber-physical systems. To achieve target average or maximum delay given…

We study the early work scheduling problem on identical parallel machines in order to maximize the total early work, i.e., the parts of non-preemptive jobs executed before a common due date. By preprocessing and constructing an auxiliary…

In this correspondence, it is given a correction to Theorem 4 in Y. Hu, and G. Xiao, "Generalized Self-Shrinking Generator," IEEE Transactions on Information Theory, vol. 50, No. 4, pp. 714-719, April 2004.

The community of program optimisation and analysis, code performance evaluation, parallelisation and optimising compilation has published since many decades hundreds of research and engineering articles in major conferences and journals.…

Now that ITER is under construction, interest is increasing in the specification and design of the successor machine, a Demonstration Power Plant (DEMO), which in Europe is coordinated by the EFDA Power Plant Physics and Technology…

Schedulability is a fundamental problem in real-time scheduling, but it has to be approximated due to the intrinsic computational hardness. As the most popular algorithm for deciding schedulability on multiprocess platforms, the speedup…

I briefly summarize the parallel sessions on Automated Calculation and Simulation Systems for high energy particle physics phenomenology at ACAT 2002 (Moscow State University, June 2002) and present a short overview over the current status…

This paper considers an opportunistic scheduling problem over a renewal system. A controller observes a random event at the beginning of each renewal frame and then chooses an action in response to the event, which affects the duration of…