Scheduling (computing)

About: Scheduling (computing) is a research topic. Over the lifetime, 78638 publications have been published within this topic receiving 1341254 citations. The topic is also known as: sched & schedule.

Method and system for scheduling execution of activities

Abstract: A method (300) and system for scheduling execution of activities, such as jobs of a batch processing. An estimated duration of each job is predicted (365-367) as a running average of the measured durations of completed instances of the job executed previously. The method of the invention uses historical data to identify (375-385) repeatable patterns for the job duration; for example, a decision tree is inducted using the completed instances of the job as training examples. The decision tree is applied for classifying (325) each new instance of the job to be executed, according to its planned time of execution; the estimated duration of the job is revised (330) using an adjustment factor associated with the class assigned to the new instance of the job.

Robustness results concerning EDF scheduling upon uniform multiprocessors

Abstract: Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes (s /spl times/ t) units of execution. The earliest deadline first (EDF) scheduling of hard-real-time systems upon uniform multiprocessor machines is considered. It is known that online algorithms tend to perform very poorly in scheduling such hard-real-time systems on multiprocessors; resource-augmentation techniques are presented here that permit online algorithms in general (EDF in particular) to perform better than may be expected given these inherent limitations. It is shown that EDF scheduling upon uniform multiprocessors is robust with respect to both job execution requirements and processor computing capacity.

Design of a generalized priority queue manager for ATM switches

Abstract: Meeting quality of service (QoS) requirements for various services in ATM networks has been very challenging to network designers. Various control techniques at either the call or cell level have been proposed. In this paper, we deal with cell transmission scheduling and discarding at the output buffers of an ATM switch. We propose a generalized priority queue manager (GPQM) that uses per-virtual-connection queueing to support multiple QoS requirements and achieve fairness in both cell transmission and discarding. It achieves the ultimate goal of guaranteeing the QoS requirement for each connection. The GPQM adopts the earliest due date (EDD) and self-clocked fair queueing (SCFQ) schemes for scheduling cell transmission and a new self-calibrating pushout (SCP) scheme for discarding cells. The GPQM's performance in cell loss rate and delay is presented. An implementation architecture for the GPQM is also proposed, which is facilitated by a new VLSI chip called the priority content-addressable memory (PCAM) chip.

A scheduling algorithm minimizing voids generated by arriving bursts in optical burst switched WDM network

Abstract: We propose a scheduling algorithm minimizing voids generated by arriving bursts in an optical burst switched WDM network. In the proposed scheduling algorithm, when the burst which has arrived at an optical core router at a certain time can be transmitted in some data channels by using unused data channel capacity (called a void), our proposed scheduling algorithm selects the data channel in which a void newly generated after the burst transmission becomes minimum. We compare, by computer simulations, the performance of our proposed scheduling algorithm with that of the conventional one with respect to burst loss ratio. It is shown that our proposed algorithm can improve burst loss ratio.