Manufacturing scheduling is a difficult problem, particularly when it takes place in an open, dynamic environment. Agent-based technology has recently been used in attempts to resolve this problem. A bidding mechanism based on Contract Net protocol is often proposed as a key solution component. Our approach is to combine a bidding mechanism based on Contract Net protocol with a mediation mechan...

Even though real-time systems have the stringent constraint of completing tasks before their deadlines, many existing real-time operating systems do not implement fault tolerance capabilities. In this paper we summarize fault tolerant real-time scheduling policy for dynamic tasks with ready times and deadlines. Our focus in this paper is the implementation, which includes fault-tolerant schedul...

The existing scheduling algorithms cannot adequately support modern embedded real-time applications. An important challenge for future research is how to model and introduce control mechanisms to real-time systems to improve real-time performance, and to allow the system to adapt to changes in the environment, the workload, or to changes in the system architecture due to failures. In this paper...

Tessellation is a manycore OS predicated on two central ideas: Space-Time Partitioning (STP) and Two-Level Scheduling. STP exploits novel hardware and software mechanisms to provide performance isolation and strong partitioning of resources (such as cores or memory bandwidth) among interacting software components, called “Cells”. Two-Level Scheduling separates global decisions about the allocat...

A simple modification of existing divisible load scheduling algorithms, boosting link speed by M for M parallel channels per link, allows time optimal load scheduling and performance prediction for parallel channel systems. The situation for multicore models is more complex but can be handled by a substitution involving equivalent processor speed. These modifications yield upper bounds on such ...

Packet scheduling attracted extensive research in the past years since it can significantly improve the performance of many Quality of Service (QoS) control mechanisms, either open-loop control or closed-loop control. In this report, I give the background information behind packet scheduling and a survey of several typical packet scheduling algorithms. After that, a general server model, named ...

We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints. We propose a fair scheduling which assigns dynamic weights to the flows such that the weights depend on the congestion in the neighborhood and schedule the flows which constitute a maximum weighted matching. It is possi...

This paper explores interactions between congestion control mechanisms at the transport layer and scheduling algorithms at the physical layer in the High-Speed Down-link Packet Access extension to WCDMA. Two different approaches to congestion control – TCP SACK and TFRC – are studied. We find that TCP SACK and TFRC in most respects perform the same way. SIR scheduling give a higher system throu...

Scheduling in the context of parallel systems is often thought of in terms of assigning tasks in a program to processors, so as to minimize the makespan. This formulation assumes that the processors are dedicated to the program in question. But when the parallel system is shared by a number of users, this is not necessarily the case. In the context of multiprogrammed parallel machines, scheduli...

Scheduling in the context of parallel systems is often thought of in terms of assigning tasks in a program to processors, so as to minimize the makespan. This formulation assumes that the processors are dedicated to the program in question. But when the parallel system is shared by a number of users, this is not necessarily the case. In the context of multiprogrammed parallel machines, scheduli...