DocumentCode
301712
Title
A distributed process scheduling algorithm based on statistical heuristic search
Author
Gyires, Tibor
Author_Institution
Illinois State Univ., Normal, IL, USA
Volume
4
fYear
1995
fDate
22-25 Oct 1995
Firstpage
3374
Abstract
The problem of process distribution in a computer network can be formulated as a distributed search process. The goal is to find those processors which can execute the processes in the most cost-efficient way. We present a modified version of the AO* algorithm using statistical data as a heuristic function. Based on previous observations of processors´ efficiency in process execution the search will focus on the most promising search path to locate appropriate processors
Keywords
computer networks; heuristic programming; processor scheduling; search problems; statistical analysis; AO* algorithm; computer network; cost-efficiency; distributed process scheduling algorithm; distributed search process; heuristic function; process distribution; process execution; statistical data; statistical heuristic search; Computer networks; Costs; Decision making; Delay; Distributed computing; IEEE news; Performance gain; Resource management; Scheduling algorithm; Telecommunication traffic;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century., IEEE International Conference on
Conference_Location
Vancouver, BC
Print_ISBN
0-7803-2559-1
Type
conf
DOI
10.1109/ICSMC.1995.538307
Filename
538307
Link To Document