Computation of Minimum Firing Time for General Self-Cleaning SWITCH-Less Program Nets(Special Section of Papers Selected from ITC-CSCC'97)

スポンサーリンク

概要

• 論文の詳細を見る

• A data-flow program net is a graph representation of data-flow programs consisting of three types of nodes, AND-node, OR-node and SWITCH-node, which represent arithmetic/logical, data merge and context switch operations respectively. Minimum firing(completion)time T__- of a program net is an important element in computing parallel degree PARAdeg residing in a data-flow program and is defined as the minimum time when the program net is executed by enough many processors. In this paper, we propose algorithms to efficiently compute T__- by contracting AND-nodes generally for self-cleaning SWITCH-less program nets with arbitrary node firing time and give the experimental results of the algorithms to show the efficiency.

• 一般社団法人電子情報通信学会の論文
• 1998-06-25

著者

• GE Qi-Wei

  the Faculty of Education, Yamaguchi University

• Ge Qi-wei

  The Faculty Of Education Yamaguchi University

• Onaga Kenji

  the Faculty of Engineering, University of the Ryukyus

• Onaga Kenji

  The Faculty Of Engineering University Of The Ryukyus

• Onaga Kenji

  The Faculty Of Engineering Hiroshima University

• Yanagida H

  Fujitsu Ten Limited

• YANAGIDA Hidenori

  Fujitsu Ten Limited

関連論文

• Performance Evaluation on Transient Time of Dynamic Workflow Changes(Special Section on Concurrent Systems Technology)
• Performance Evaluation on Change Time of Dynamic Workflow Changes (Special Section on Concurrent Systems Technology)
• A Petri Net Based Public-Key Cryptography:PNPKC(Special Section on Papers Selected from ITC-CSCC 2000)
• Design of a Dynamic Mutual Exclusion Algorithm for a Distributed Network of Autonomous Nodes (Special Section on the 5th Karuizawa Workshop on Circuits and Systems)
• Qualitative Analysis of Periodic Schedules for Deterministically Timed Petri Net Systems (Special Section on Discrete Mathematics and Its Applications)
• Two-Processor Scheduling of General Acyclic SWITCH-less Program Nets via Hybrid Priority Lists (Special Section of Selected Papers from the 12th Workshop on Circuit and Systems in Karuizawa)
• A New Proposal to Two-Processor Scheduling Problem for SWITCH-less Program Nets(Concurrent Systems)(Concurrent Systems and Hybrid Systems)
• Computation of Minimum Firing Time for General Self-Cleaning SWITCH-Less Program Nets(Special Section of Papers Selected from ITC-CSCC'97)
• A Computation Method of LSN for Extended 2-b-SPGs(Special Section on Concurrent Systems Technology)
• Incorporation of Cycles and Inhibitory Arcs into the Timed Petri Net Model of Signaling Pathway

スポンサーリンク