Pipeline patterns generated in process algebra

スポンサーリンク

概要

• 論文の詳細を見る

• The language CSP (Communicating Sequential Processes) is theoretically based on process algebra and is useful for the specification and analysis of systems with parallel working components. Assume a typical situation in parallel scheduling in which there are n distinct jobs, each of fixed length, that are to be executed in a certain fixed linear order and this cycle is repeated infinitely often. Then one can exploit the strategy of pipeline for parallelized execution of the whole system. In this paper we show an algorithm which generates all possible patterns of n jobs concerning overlapping of jobs as traces in CSP through calculation in process algebra. The number p(n) of distinct pipeline patterns is known as p(n)=(n-1)!. These patterns will be useful in the refinement of specifications in general.

• 明治大学の論文

著者

• Hikita Teruo

  Department Of Computer Science School Of Science And Technology Meiji University

• GINBAYASHI Jun

  Makuhari System Laboratory, Fujitsu Limited

• TSUJIGADO Makoto

  Department of Computer Science and Communication Engineering Faculty of Engineering, Kogakuin Univer

• Ginbayashi Jun

  Makuhari System Laboratory Fujitsu Limited

• Tsujigado Makoto

  Department Of Computer Science And Communication Engineering Faculty Of Engineering Kogakuin Univers

関連論文

• Pipeline patterns generated in process algebra
• Process Composition and Interleave Reduction in Parallel Process Specification
• On the Average Size of Turner's Translation to Combinator Programs

スポンサーリンク