PROCESS SEMAPHORE PLANNING IS A ENTIRE NEW PLANNING METHOD

摘要：

Process management in OS is used to solve planning problem and a new algorithm is proposed, named Process semaphore planning (PSP). Technique of process has been mature. If it is used in planning, it will promote development of planning. First, a planning problem must be translated to a planning operation through signal quantification. A planning operation contains four sets, namely action-process set, semaphore set, initial semaphore set and objective semaphore set. PSP has pre-dealing and main part. Pre-dealing classifies action-processes to assign priority. Pre-dealing uses transcendental information which improves speed of algorithm. Main part determinates sequence of action-processes by exclusion and synchronization. Exclusion and synchronization are redefined in this paper. Synchronization determinates which action-process should execute before another. Exclusion determinates which action-process could not execute with another together. New definition, non-spending semaphore, are proposed. If two action-processes just compete for non-spending semaphore, they can run concurrently. Non-spending semaphore improves concurrency of PSP.

关键词： Process semaphore planning Planning operation Non-spending semaphore Ezclusion Synchronization

作者: BING LI WEN-XIANG GU

作者单位: Postgraduate2006 department of computer science, Northeast Normal University, JiLin, China Department of computer science, Northeast Normal University, JiLin, China

会议类型: 国际会议

会议名称: 2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)

会议地点: 昆明

会议语种:英文

页码: 2094-2098

在线出版日期: 2008-07-12（万方平台首次上网日期，不代表论文的发表时间）