ﻻ يوجد ملخص باللغة العربية
In this paper we study the scheduling of (m,k)-firm synchronous periodic task systems using the Distance Based Priority (DBP) scheduler. We first show three phenomena: (i) choosing, for each task, the initial k-sequence 1^k is not optimal, (ii) we can even start the scheduling from a (fictive) error state (in regard to the initial k-sequence) and (iii) the period of feasible DBP-schedules is not necessarily the task hyper-period. We then show that any feasible DBP-schedule is periodic and we upper-bound the length of that period. Lastly, based on our periodicity result we provide an exact schedulability test.
The main result of this paper is a new and direct proof of the natural transformation from the surgery exact sequence in topology to the analytic K-theory sequence of Higson and Roe. Our approach makes crucial use of analytic properties and new ind
We present interferometric diameter measurements of 21 K- and M- dwarfs made with the CHARA Array. This sample is enhanced by literature radii measurements to form a data set of 33 K-M dwarfs with diameters measured to better than 5%. For all 33 star
Myopic is a hard real-time process scheduling algorithm that selects a suitable process based on a heuristic function from a subset (Window)of all ready processes instead of choosing from all available processes, like original heuristic scheduling al
We study the processes e+e- --> K+ K- pi+pi-gamma, K+ K- pi0pi0gamma, and K+ K- K+ K-gamma, where the photon is radiated from the initial state. About 84000, 8000, and 4200 fully reconstructed events, respectively, are selected from 454 fb-1 of BaBar
We study the processes $e^+ e^-to K^+ K^- pi^+pi^-gamma$, $K^+K^-pi^0pi^0gamma$ and $K^+ K^- K^+ K^-gamma$, where the photon is radiated from the initial state. About 34600, 4400 and 2300 fully reconstructed events, respectively, are selected from 23