The following fundamental issues in establishing sound architectures for object-oriented (OO) real-time (RT) distributed computing systems (DCS's) are briefly discussed in this paper: (1) How much is the fixed priority assignment relevant to the activities of distributed object designers? (2

Abstract—Global fixed-priority scheduling of constrained-deadline sporadic tasks systems is important not only for CPU scheduling but also in other domains, for example, scheduling real-time flows in WirelessHART networks designed for industrial process control and monitoring. In this paper, we

. Second, we propose a new priority assignment algorithm which can be used, together with the schedulability analysis, to improve system fault resilience. These achievements come from the observation that traditional priority assignment policies may no longer be appropriate when faults are being considered

Abstract—In global real-time multiprocessor scheduling, a recent analysis technique for Task-level Fixed-Priority (TFP) scheduling has been shown to outperform many of the analyses for Job-level Fixed-Priority (JFP) scheduling on average. Since JFP is a generalization of TFP scheduling, and the TFP

. Unfortunately, these two goals conflict with each other and are difficult to be achieved at the same time. To address this update and application transaction co-scheduling problem, in this paper, we propose a fixed priority scheduling algorithm called Periodic Co-Scheduling (PCS). PCS uses periodic update

Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent

assignment form and the control dependence graph have been proposed to represent data flow and control flow propertiee of programs. Each of these previously unrelated techniques lends efficiency and power to a useful class of program optimization. Although both of these structures are attractive

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at

The paper presents exact schedulability analyses for real-time systems scheduled at run-time with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions

Abstract not found