By Topic

Design of steady-state behavior of concurrent repetitive processes: an algebraic approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
M. B. Zaremba ; Dept. d''Inf., Quebec Univ., Hull, Que., Canada ; K. J. Jedrzejek ; Z. A. Banaszak

This paper addresses the problem of designing the steady-state behavior of a set of repetitive processes competing for access to common resources. Its objective is to develop algebraic formulae that express system behavior as a function of the characteristics of the component processes and synchronization protocols involved. Based on a matrix representation proposed, conditions are developed that guarantee that the system will achieve a steady state. A composition operator-a tool for synthesizing a chain of repetitive processes-is defined, and its application to the design of repetitive systems with required parameters is considered. It is also shown that the composition operator supplemented with an appropriate synchronization protocol makes it possible to prevent starvation occurrence. Finally, extension of the results to other selected topologies is discussed

Published in:

IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans  (Volume:28 ,  Issue: 2 )