In this paper, we study the problem of scheduling periodic tasks on multiple periodic resources. We take two step approach by first integrating multiple periodic resources to an equivalent single periodic resource so that existing real-time scheduling theorems on single periodic resource can be applied. Second, we extend the schedulability tests of periodic tasks on a single periodic resource i...

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines. Each job is characterized by a fixed order of operations, each of which is to be processed on a specific machine for a specified duration. Each machine can process at most one job at a time and once a job initiates processing on a given machine it must complete processing uninterrupted. A sc...

We present a sample implementation of a run-time sched-uler, split between hardware and software, controlling a real-time robotics application. The hardware part of the run-time scheduler, implemented as a Finite State Machine (FSM), schedules the tasks for the application and can be readily extended to include additional tasks in hardware or in software. The software part executes tasks based ...

We present a comparison of behavioral equivalences for nondeterministic and probabilistic processes whose activities are all observable. In particular, we consider trace-based, testing, and bisimulation-based equivalences. For each of them, we examine the discriminating power of three variants stemming from three approaches that differ for the way probabilities of events are compared when nonde...

This paper focuses on transient characteristics of natural gas flow in the coordinated scheduling of security-constrained electricity and natural gas infrastructures. The paper takes into account the slow transient process in the natural gas transmission systems. Considering their transient characteristics, natural gas transmission systems are modeled as a set of partial differential equations ...

Transmitting video over slow fading wireless channels with good perceptual quality is a challenging task because no time-diversity can be exploited to combat channel variations, especially when the frequency diversity and spatial diversity is not available due to the wireless system implementation. While quality-scalable video coding techniques make video source-rate adaptation possible, determ...

Tabled evaluation ensures termination for programs with finite models by keeping track of which subgoals have been called. Given several variant subgoals in an evaluation, only the first one encountered will use program-clause resolution; the rest will resolve with the answers generated by the first subgoal. This use of answer resolution prevents infinite looping that sometimes happens in SLD. ...

A novel cross-layer wireless resource allocation algorithm called DBMQT is proposed which distributes the resource based on dynamic buffer allocation mechanism for orthogonal frequency division multiplex access (OFDMA) system. The aim of allocation algorithm is to maximize system throughput while satisfying the QoS requirement for multi-user and multi-service. The algorithm consists of two step...

Machine SUIF is a retargetable compiler backend designed by the HUBE research group at Harvard University. It extends the SUIF compilation system for machine-specific compilation and optimization. In this paper, we present one such optimization phase, global instruction scheduling for acyclic graphs. In a single scheduling framework, we are implementing both trace-based and DAG-based scheduling...