Results 1 - 10 of 5,780

Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks

by Ros Tassiulas, Anthony Ephremides - IEEE Transactions on Automatic Control , 1992
"... Abstruct-The stability of a queueing network with interdependent servers is considered. The dependency of servers is described by the definition of their subsets that can be activated simultaneously. Multihop packet radio networks (PRN’s) provide a motivation for the consideration of this system. We ..."
Abstract - Cited by 949 (19 self) - Add to MetaCart
. We study the problem of scheduling the server activation under the constraints imposed by the dependency among them. The performance criterion of a scheduling policy m is its throughput that is characterized by its stability region C,, that is, the set of vectors of arrival rates for which the system

Scheduling Policies for an On-Demand Video Server with Batching

by Asit Dan, Dinkar Sitaram, Perwez Shahabuddin - in Proc. of ACM Multimedia , 1994
"... In an on-demand video server environment, clients make requests for movies to a centralized video server. Due to the stringent response time requirements, continuous delivery of a video stream to the client has to be guaranteed by reserving sufficient resources required to deliver a stream. Hence th ..."
Abstract - Cited by 330 (8 self) - Add to MetaCart
be achieved by batching requests for the same movie that arrive within a short duration of time. In this paper, we consider various policies for selecting the movie to be multicast. The choice of a policy depends very much on the customer waiting time tolerance before reneging. We show that an FCFS policy

Scheduling Policies

by P. R. Kumar, Sean P. Meyn
"... Abstract- Usually, the stability of queueing networks is es-tablished by explicitly determining the invariant distribution. Outside of the narrow class of queueing networks possessing a product form solution, however, such explicit solutions are rare, and consequently little is also known concerning ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
concerning stability. We develop here a programmatic procedure for establishing the stability of queueing networks and scheduling policies. The method uses linear or nonlinear programming to determine what is an appropriate quadratic functional to use as a Lyapunov function. If the underlying system

Stability Of Queueing Networks And Scheduling Policies

by P. R. Kumar, Sean P. Meyn - IEEE Transactions on Automatic Control , 1995
"... Usually, the stability of queueing networks is established by explicitly determining the invariant distribution. However, outside of the narrow class of queueing networks possessing a product form solution, such explicit solutions are rare, and consequently little is known concerning stability too. ..."
Abstract - Cited by 132 (16 self) - Add to MetaCart
. We develop here a programmatic procedure for establishing the stability of queueing networks and scheduling policies. The method uses linear or nonlinear programming to determine what is an appropriate quadratic functional to use as a Lyapunov function. If the underlying system is Markovian, our

Scheduling Policies for CIOQ Switches?

by Alex Kesselman, Adi Rosen
"... Combined input and output queued (CIOQ) architectures with a moderate fabric speedup S > 1 have come to play a major role in the design of high performance switches. The switch policy that controls such switches must consist of two components. A buffer management policy that controls admission to ..."
Abstract - Cited by 13 (1 self) - Add to MetaCart
to buffers, and a scheduling policy that is responsible for the transfer of packets from input buffers to output buffers. The goal of the switch policy is to maximize the throughput of the switch. When all packets have a uniform value (or importance), this corresponds to the number of packets sent from

Mechanisms For Specifying Scheduling Policies*

by Schneider And Tr, F. B. Schneider, F. B. Schneider, A. J. Bernstein, A. J. Bernstein
"... Extensions to concur rent programming languages are presented which allow control of scheduling policies previously defined by the run-time support system. It is shown that the use of these mechanisms simplifies the solutions of concurrent programming problems. In addition, the proposed extens ..."
Abstract - Add to MetaCart
Extensions to concur rent programming languages are presented which allow control of scheduling policies previously defined by the run-time support system. It is shown that the use of these mechanisms simplifies the solutions of concurrent programming problems. In addition, the proposed

Randomizing Dispatch Scheduling Policies

by Vincent A. Cicirello, Stephen F. Smith - In Using Uncertainty Within Computation: Papers from the 2001 AAAI Fall Symposium, Technical Report FS-01-04 , 2001
"... The factory is a complex dynamic environment and scheduling operations for such an environment is a challenging problem. In practice, dispatch scheduling policies are commonly employed, as they offer an efficient and robust solution. However, dispatch scheduling policies are generally myopic, an ..."
Abstract - Cited by 4 (4 self) - Add to MetaCart
The factory is a complex dynamic environment and scheduling operations for such an environment is a challenging problem. In practice, dispatch scheduling policies are commonly employed, as they offer an efficient and robust solution. However, dispatch scheduling policies are generally myopic

Lottery Scheduling: Flexible Proportional-Share Resource Management

by Carl A. Waldspurger, William E. Weihl , 1994
"... This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations. Such control is beyond the capabilities of conventional schedulers, and is desirable in systems that ..."
Abstract - Cited by 480 (5 self) - Add to MetaCart
that service requests of varying importance, such as databases, media-based applications, and networks. Lottery scheduling also supports modular resource management by enabling concurrent modules to insulate their resource allocation policies from one another. A currency abstraction is introduced to flexibly

Lecture 25: Scheduling Policies: Part III:

by unknown authors
"... Preemptive scheduling policies not based on job size ..."
Abstract - Add to MetaCart
Preemptive scheduling policies not based on job size

Performance Bounds for Queueing Networks and Scheduling Policies

by Sunil Kumar, P. R. Kumar , 1994
"... Except for the class of queueing networks and scheduling policies admitting a product form solution for the steady--state distribution, little is known about the performance of such systems. For example, if the priority of a part depends on its class (e.g., the buffer that the part is located in), t ..."
Abstract - Cited by 82 (16 self) - Add to MetaCart
Except for the class of queueing networks and scheduling policies admitting a product form solution for the steady--state distribution, little is known about the performance of such systems. For example, if the priority of a part depends on its class (e.g., the buffer that the part is located in
Results 1 - 10 of 5,780