A scheduling mechanism of general service order sequence and limited service discipline for a distributed switching software

Author

Chang, Chung-Ju ; Hwang, Lain-Chyr

Author_Institution

Dept. of Commun. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan

fYear

1994

fDate

22-26 Aug 1994

Firstpage

378

Abstract

The general service order sequence and the limited service discipline can make the system software real-time, flexible and fair according to the system requirements. The system is studied by an embedded Markov chain analysis, and a recursive method is innovated to help derive the mean waiting time of a task. An optimal service order and service discipline pattern is searched by means of a genetic algorithm

Keywords

Markov processes; distributed processing; electronic switching systems; genetic algorithms; scheduling; telecommunication computing; distributed switching software; embedded Markov chain analysis; fairness; flexibility; general service order sequence; genetic algorithm; limited service discipline; mean task waiting time; real-time software; recursive method; scheduling mechanism; searching; system requirements; Communication switching; Genetics; Legged locomotion; Operating systems; Pattern analysis; Real time systems; Software performance; Software systems; Switching systems; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

TENCON '94. IEEE Region 10's Ninth Annual International Conference. Theme: Frontiers of Computer Technology. Proceedings of 1994

Print_ISBN

0-7803-1862-5

Type

conf

DOI

10.1109/TENCON.1994.369275

Filename

369275