Real-time computing paradigm is being pervasively deployed in many critical and non-critical applications such as aerospace and telecommunication systems. Most of these systems employ a preemptive Fixed Priority Scheduling (FPS) policy to schedule real-time tasks. Fixed priority scheduling is known for its implementation simplicity and low run-time overheads. However, FPS may not be able to use...

We consider Priority Algorithm [BNR03] as a syntactic model of formulating the concept of greedy algorithm for Job Scheduling, and we study the computation of optimal priority algorithms. A Job Scheduling subproblem S is determined by a (possibly infinite) set of jobs, every finite subset of which potentially forms an input to a scheduling algorithm. An algorithm is optimal for S, if it gains o...

In this paper we introduce Causeway, operating system support facilitating the development of metaapplications, like priority scheduling and performance debugging, that control and analyze the execution of distributed programs. Meta-applications use Causeway to inject and access metadata on application execution paths to implement their specific goals. Causeway has two components: (1) interface...

0140-3664/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.comcom.2010.01.018 * Corresponding author. Tel.: +65 67904512; fax: + E-mail addresses: [email protected] (Y. Yi Poo). Ethernet passive optical networks (EPONs) are being designed to deliver different quality of service (QoS) to carry heterogeneous traffic of end users. For this purpose, hierarchical scheduling is needed for up...

In real-time systems, the capability to achieve short or even predictable reaction times is essential. In this paper, we take a pragmatic approach by proposing priority-based scheduling in SDL combined with a mechanism to suspend and resume SDL agents. More specifically, we define adequate syntactical extensions of SDL and show that they are compliant with the formal SDL semantics. We have impl...

Outline 1 Fixed priority 2 Priority assignment 3 Scheduling analysis 4 A necessary and sufficient test 5 Sensitivity 6 Hyperplane analysis 7 Conclusions 8 Esercizi Calcolo del tempo di risposta Calcolo del tempo di risposta con aperiodici Hyperplane analysis

CSP is a fundamental concept for developing software for distributed real-time systems. The CSP paradigm constitutes a natural addition to Object Orientation and offers higher-order multithreading constructs. The CSP channel concept that has been implemented in Java deals with singleand multi-processor environments and also takes care of the real-time priority scheduling requirements. For this,...

This paper presents the advances in developing a dynamic scheduling technique suitable for automating digital publishing workflows. Traditionally scheduling in digital publishing has been limited to timing criteria. The proposed scheduling strategy takes into account contingency and priority fluctuations. The new scheduling algorithm, referred to as QB-MUF, gives high priority to jobs with low ...

— Ad hoc networks formed without the aid of any established infrastructure are typically multi-hop networks. Location dependent contention and " hidden terminal " problem make priority scheduling in multi-hop networks significantly different from that in wireless LANs. Most of the prior work related to priority scheduling addresses issues in wireless LANs. In this paper, priority scheduling in ...

While the modern graphics processing unit (GPU) offers massive parallel compute power, the ability to influence the scheduling of these immense resources is severely limited. Therefore, the GPU is widely considered to be only suitable as an externally controlled co-processor for homogeneous workloads which greatly restricts the potential applications of GPU computing. To address this issue, we ...