A Scheduling Method to Reduce Waiting Time on Immersive Contents Broadcasting

Disk scheduling changes the sequence order to serve the requests that are waiting in the queue. While data placement reduces the access time of a disk request, scheduling reduces the waiting time of a request. Thus, the response time is found as: Response time = Waiting time + Access time The longer the waiting queue, the more useful is the scheduling method. When there is no waiting queue, any scheduling methods perform the same. Expected waiting time and queue length can be found using queueing theory. The queueing theory is out of the scope of this book. In general, a disk scheduling policy changes the service order of waiting requests. A disk scheduling policy accepts the waiting requests and serves them in the new service sequence. Notice that the service sequence may or may not be the same as the incoming order of the waiting requests. In this chapter, we shall describe two common disk scheduling methods. First, we shall describe the simple first-in-first-out method. After that, we shall describe the efficient SCAN algorithm in the following sections.

Download Full-text

A Scheduling Method to Reduce Waiting Time for Close-Range Broadcasting

Mobile Information Systems ◽

10.1155/2012/768269 ◽

2012 ◽

Vol 8 (4) ◽

pp. 303-314 ◽

Cited By ~ 3

Author(s):

Yusuke Gotoh ◽

Tomoki Yoshihisa ◽

Hideo Taniguchi ◽

Masanori Kanazawa ◽

Wenny Rahayu ◽

...

Keyword(s):

Waiting Time ◽

Continuous Media ◽

Main Program ◽

Available Bandwidth ◽

Scheduling Method ◽

Close Range ◽

Digital Broadcasting ◽

Broadcast Schedule ◽

Media Data ◽

Continuous Media Data

Due to the recent popularization of digital broadcasting systems, close-range broadcasting using continuous media data, i.e. audio and video, has attracted great attention. For example, in a drama, after a user watches interesting content such as a highlight scene, he/she will watch the main program continuously. In close-range broadcasting, the necessary bandwidth for continuously playing the two types of data increases. Conventional methods reduce the necessary bandwidth by producing an effective broadcast schedule for continuous media data. However, these methods do not consider the broadcast schedule for two types of continuous media data. When the server schedules two types of continuous media data, waiting time that occurs from finishing the highlight scene to starting the main scene, may increase. In this paper, we propose a scheduling method to reduce the waiting time for close-range broadcasting. In our proposed method, by dividing two types of data and producing an effective broadcast schedule considering the available bandwidth, we can reduce the waiting time.

Download Full-text

The Patient Admission Scheduling of an Ophthalmic Hospital Using Genetic Algorithm

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.756-759.1423 ◽

2013 ◽

Vol 756-759 ◽

pp. 1423-1432 ◽

Cited By ~ 1

Author(s):

Li Ming Zhang ◽

Hui You Chang ◽

Rui Tian Xu

Keyword(s):

Genetic Algorithm ◽

Mathematical Model ◽

Length Of Stay ◽

Waiting Time ◽

Patient Admission ◽

Scheduling Method ◽

Hospital Resources ◽

Evaluation Mechanism ◽

Ophthalmic Hospital

Currently, FCFS scheduling method is widely used in hospitals for patient admission scheduling, which ignores the impacts of patient length of stay and surgery arrangement on the usage of hospital resources. This paper proposes a more comprehensive mathematical model and evaluation mechanism for the patient admission scheduling of an ophthalmic hospital. A genetic algorithm (GA) is proposed to optimize the model, which can provide detailed scheduling of patient admission in the hospital for everyday. The result is compared with that of the traditional FCFS method, which indicates that the GA helps to reduce the preoperative waiting time for patients. Besides, GA can provide different kinds of scheduling for the hospital to select by adjusting the relative weights of different objectives in the algorithm.

Download Full-text