Hierarchical scheduling frameworks (HSFs) are a means for composing complex real-time embedded systems from independently developed and analyzed applications. To support multiple modes in a two-level HSF, the multi-mode adaptive hierarchical scheduling framework MMAHSF has recently been presented. MMAHSF supports application specific mode-change protocols by means of a generic mode-change proto...

Background and Objectives: Operating room (OR) scheduling is key to optimal operating room productivity. The significant uncertainty associated with surgery duration renders scheduling of surgical operation a challenging task. This paper proposes a novel computational stochastic model to optimize scheduling of surgeries with uncertain durations. The model considers various surgical operation co...

O-Plan2 is an AI planning architecture which supports research into a number of aspects of planning, scheduling and control. It is based on earlier work on the O-Plan System which was directed towards plan generation. The paper explores the diierent types of choice ordering decisions which need to be made in an architecture for command and control. The mechanisms for choice ordering and selecti...

Heuristic and task scheduling provide better scheduling solutions for cloud computing by greatly enriching in identifying candidate solutions, ensuring performance optimization and therefore reducing the make span of task scheduling. Several researchers have put forward scheduling and load balancing algorithms for cloud computing systems. However, how to reduce the response latency while effici...

The differentiated services (diffserv) architecture defines a new framework for the support of quality of service (QoS) in IP-based networks. In this paper, we focus on the mechanisms used to implement the Expedited Forwarding (EF) Per-Hop Behavior (PHB). We analyze these mechanisms with respect to two main QoS parameters: Delay and delay variation. Within a diffserv node we study the impact of...

In this work, we explore network traffic shaping mechanisms that deliver packets at pre-determined intervals; allowing the network interface to transition to a lower power consuming sleep state. We focus our efforts on commodity devices, IEEE 802.11b ad hoc mode and popular streaming formats. We argue that factors such as the lack of scheduling clock phase synchronization among the participants...

Dynamic instruction scheduling logic is one of the most critical and cycle-limiting structures in modern superscalar processors, and it is not easily pipelined without significant losses in performance. However, these performance losses are incurred only due to a small fraction of instructions, which are intolerant to the non-atomic scheduling. We first perform an empirical analysis of the inst...

We provide a general scheme for constructing monotone algorithms for a wide class C of scheduling problems Q|prec, rj |γ on related machines with precedence constraints and/or release dates. Our scheme works in the offline and the online setting. It takes as input two approximation/competitive algorithms for the (simpler) scheduling problems P |prec, rj |γ on identical machines and 1|prec, rj |...

Planning and scheduling for agents operating in heterogeneous, multi-agent environments is governed by the nature of the environment and the interactions between agents. Significant efficiency and capability gains can be attained by employing planning and scheduling mechanisms that are tailored to particular agent roles. This paper presents such a framework for a global sensor web that operates...

Although Ada defines a number of mechanisms for specifying scheduling policies, only one, Fifo Within Priorities is guaranteed to be supported by all implementations of the Real-Time Systems Annex. Many applications have a mixture of real-time and non real-time activities. The natural way of scheduling non real-time activities is by time sharing the processor using Round Robin Scheduling. Curre...