+ All Categories
Home > Documents > A Formal Definition of DFG Models

A Formal Definition of DFG Models

Date post: 07-Apr-2018
Category:
Upload: hob3
View: 223 times
Download: 0 times
Share this document with a friend
9
IEEE TRANSACTIONS O N COMPUTERS. VOL. C-35, N O . 1 1, NOVEMBER 1986 A Formal Definition o f Data Flow Graph Models KRISHNA M . KAVI, BILL P. BUCKLES, SENIOR MEMBER, IEEE, AND U. NARAYANBHAT Abstract-In this paper, a n e w model fo r parallel computa- tions a n d parallel computer systems that i s based o n data flow principles i s presented. Uninterpreted data flow graphs c a n beused t o model computer systems including data driven a n d parallel processors. A data flow graph i s defined t o b e a bipartite graph with actors a n d links a s t h e t w o vertex classes. Actors can e considered similar t o transitions i n Petri nets, a n d links similar t o places. T h e nondeterministic nature of uninterpreted data flow graphs necessitates t h e derivation o f liveness conditions. Index Terms-Bipartite graphs, data flow graphs, deadlocks, liveness, parallel computations, Petri nets. I. INTRODUCTION T H E demands f or increasing computation speeds have generated considerable interest in parallel computations, concurrent within computer systems, f or representing parallelism i n algorithms, and n e w programming languages fo r such parallel computers [11], [19]. In addition t o th e design o f parallel machines a n d programming aspects o f parallelism, there h a s been considerable work done i n formu- lating appropriate theoretical models and methods o f analysis under which inherent properties o f parallelism c a n b e precisely defined a n d studied more from viewpoint o f t h e algorithm o r problem than the particular machine, implementation. Generally, t he theoretical work c a n b e divided into t w o categories: 1 ) th e study o f computational aspects o f algorithms (both arithmetic an d control) devised t o make us e o f t he parallelism existing i n parallel systems; o r 2 ) t h e study o f t h e performance an d reliability aspects o f parallel computers. There a r e a number o f different theoretical models proposed f o r representing the computational aspects o f parallel proc- esses, among which Petri n e t models have enjoyed continued interest over t h e past decade. F o r a comparative study o f models o f parallel computation, t h e reader i s referred t o [19]. Performance a n d reliability evaluations o f computer sys- tems; including those with multiple processing elements a n d redundancy, a r e generally based o n probabilistic models a n d their analysis. The techniques used i n this approach involve t h e identification o f underlying stochastic processes a n d th e determination o f their properties. General review of various aspects o f these analysis techniques c a n be found i n [15] a n d [25]. Manuscript received October 3 0, 1984; revised June 8 , 1986. This work wa s supported i n part b y NASA Ames Research Center underGrant NA G 2 - 273. K . M . Kavi a n d B. P . Buckles a r e with the Department o f Computer Science Engineering, T h e University o f Texas, Arlington, TX 76019. U . N . Bhat i s with t h e Department o f Statistics, Southern Methodist University, Dallas, T X 75222. IEEE L o g Number 8610934. Petri n e t models o f parallel a n d asynchronous systems have been extended t o include stochastic aspects [10], [17], [21], [22]. Molloy establishes a n isomorphism between stochastic Petri nets and homogeneous Markov processes, thus making i t possible t o apply Markov techniques f o r the analysis o f stochasticPetri n e t models. In recent years a n e w form o f program representation known a s data flow h as attracted th e attention o f researchers i n t h e United States, England, France, a n d Japan. T h e literature is abundant with proposals f or n e w computer systemsbased o n data flow principles [7], [8], [24], programming languages [1]-[3], distributed computing based o n data flow [18], a s well a s simulation a n d modeling using data flow graphs [9], [12], [23]. Much o f t h e research i n data flow processing has dealt with defining t h e functionality, designing instruction levelarchitec- tures, or specifying programming methodologies. This h a s n o t made urgent t he formalization o f t h e data flow model itself. Formalization i s necessary, however, i n relating data flow t o other computation models, discovering properties o f specific instances o f data flow graphs (e.g., absence o f deadlocks), a n d i n performance evaluation. Formalization also makes possible th e utilization o f data flow graphs a s abstract models o f computation analogous t o Turing machinesand Petri nets. I t i s from this motivation that t h e present work stems. Data flow graphs have been used successfully i n t h e simulation o f computer systems [9], [23]. T he chief advantage o f data flow graphs over other models o f parallel processors is their compactness a n d general amenability t o direct interpreta- tion. That i s , the translation from t h e conceived system t o a data flow graph is straightforward and, once accomplished, i t i s equally straightforward t o determine b y inspection which aspects o f the system a r e represented.Because o f t h e hierarchi- c a l nature a n d the modularity o f data flow graphs, both software tasks a n d hardware units c a n e modeled i n a uniform w a y using data flow graphs [12]. T h e formalism presented here a n d elsewhere [13], [14] c a n b e used to analyze th e performance a n d reliability o f computer systems modeled a s data flow graphs. I n th e remainder of t h e paper, a formal set-relationship definition o f a specific kind of data flow graph (known a s an uninterpreted data flow graph) i s presented. These definitions a r e based o n the data flow model originally presented b y Dennis [6]. An illustration o f its u s e i n describing properties is given i n t h e form o f a liveness theorem. Stochastic aspects a r e introduced t h e model s o that performance a n d reliability o f data flow graph models o f computer systems c an b e analyzed. 0018-9340/86/1 100-0940$01 .0 0 © 1986 IEEE 9 4 0 Authorized licensed use limited to: Universit y of North Texas. Downloaded on July 27, 2009 at 14:42 from IEEE Xplore. Restrictions apply .
Transcript
Page 1: A Formal Definition of DFG Models

8/6/2019 A Formal Definition of DFG Models

http://slidepdf.com/reader/full/a-formal-definition-of-dfg-models 1/9

I E E E T R A N S A C T I O N S O N C O M P U T E R S . V O L . C - 3 5 , N O . 1 1 , N O V E M B E R 1 9 8 6

AFormal D e f i n i t i o n of D a t a Flow Graph Models

KRISHNA M. K A V I , BILL P . BUCKLES, SENIOR MEMBER, IEEE, AND U. NARAYANBHAT

A b s t r a c t - I n t h i s p ap e r , a new m o d e l f o r p a r a l l e l c o m p u t a -t i o n s a n d p a r a l l e l c o m p u t e r s y s t e m s t h a t i s b a s e d o n d a t a f l o wp r i n c i p l e s i s p r e s e n t e d . U n i n t e r p r e t e d d a t a f l o w g r a p h s c a n b e u s e dt o m o d e l c o m p u t e r s y s t e m s i n c l u d i n g d a t a d r i v e n a n d p a r a l l e lp r o c e s s o r s . A d a t a f l o w g r a p h i s d e f i n e d t o b e a b i p a r t i t e g r a p hw i t h a c t o r s a n d l i n k s a s t h e t w o v e r t e x c l a s s e s . A c t o r s c a n b ec o n s i d e r e d s i m i l a r t o t r a n s i t i o n s i n P e t r i n e t s , a n d l i n k s s i m i l a r t op l a c e s . T h e n o n d e t e r m i n i s t i c n a t u r e o f u n i n t e r p r e t e d d a t a f l o wg r a p h s n e c e s s i t a t e s t h e d e r i v a t i o n o f l i v e n e s s c o n d i t i o n s .

I n d e x T e r m s - B i p a r t i t e g r a p h s , d a t a f l o w g r a p h s , d e a d l o c k s ,l i v e n e s s , p a r a l l e l c o m p u t a t i o n s , P e t r i n e t s .

I . I N T R O D U C T I O NTHE d e m a n d s f o r i n c r e a s i n g c o m p u t a t i o n s p e e d s h a v e

g e n e r a t e d c o n s i d e r a b l e i n t e r e s t i n p a r a l l e l c o m p u t a t i o n s ,

c o n c u r r e n t o p e r a t i o n s . w i t h i n c o m p u t e r s y s t e m s , m o d e l s f o rr e p r e s e n t i n g p a r a l l e l i s m i n a l g o r i t h m s , a n d n e w p r o g r a m m i n gl a n g u a g e s f o r s u c h p a r a l l e l c o m p u t e r s [ 1 1 ] , [ 1 9 ] . I n a d d i t i o n t ot h e d e s i g n o f p a r a l l e l m a c h i n e s a n d p r o g r a m m i n g a s p e c t s o fp a r a l l e l i s m , t h e r e h a s b e e n c o n s i d e r a b l e w o r k d o n e i n f o r m u -l a t i n g a p p r o p r i a t e t h e o r e t i c a l m o d e l s a n d m e t h o d s o f a n a l y s i su n d e r w h i c h i n h e r e n t p r o p e r t i e s o f p a r a l l e l i s m c a n b e p r e c i s e l yd e f i n e d a n d s t u d i e d m o r e f r o m t h e v i e w p o i n t o f t h e a l g o r i t h mo r p r o b l e m t h a n t h e p a r t i c u l a r m a c h i n e , i m p l e m e n t a t i o n .

G e n e r a l l y , t h e t h e o r e t i c a l w o r k c a n b e d i v i d e d i n t o t w o

c a t e g o r i e s : 1 ) t h e s t u d y o f c o m p u t a t i o n a l a s p e c t s o f a l g o r i t h m s( b o t h a r i t h m e t i c a n d c o n t r o l ) d e v i s e d t o m a k e u s e o f t h ep a r a l l e l i s m e x i s t i n g i n p a r a l l e l s y s t e m s ; o r 2 ) t h e s t u d y o f t h ep e r f o r m a n c e a n d r e l i a b i l i t y a s p e c t s o f p a r a l l e l c o m p u t e r s .

T h e r e a r e a n u m b e r o f d i f f e r e n t t h e o r e t i c a l m o d e l s p r o p o s e df o r r e p r e s e n t i n g t h e c o m p u t a t i o n a l a s p e c t s o f p a r a l l e l p r o c -

e s s e s , a m o n g w h i c h P e t r i n e t m o de l s h a v e e n j o y e d c o n t i n u e di n t e r e s t o v e r t h e p a s t d e c a d e . F o r a c o m p a r a t i v e s t u d y o f

m o d e l s o f p a r a l l e l c o m p u t a t i o n , t h e r e a d e r i s r e f e r r e d t o [ 1 9 ] .P e r f o r m a n c e a n d r e l i a b i l i t y e v a l u a t i o n s o f c o m p u t e r s y s -

t e m s ; i n c l u d i n g t h o s e w i t h m u l t i p l e p r o c e s s i n g e l e m e n t s a n dr e d u n d a n c y , a r e g e n e r a l l y b a s e d o n p r o b a b i l i s t i c m o d e l s a n dt h e i r a n a l y s i s . T h e t e c h n i q u e s u s e d i n t h i s a p p r o a c h i n v o l v et h e i d e n t i f i c a t i o n o f u n d e r l y i n g s t o c h a s t i c p r o c e s s e s a n d t h ed e t e r m i n a t i o n o f t h e i r p r o p e r t i e s . G e n e r a l r e v i e w o f v a r i o u sa s p e c t s o f t h e s e a n a l y s i s t e c h n i q u e s c a n b e f o u nd i n [ 1 5 ] a n d[ 2 5 ] .

M a n u s c r i p t r e c e i v e d O c t o b e r 3 0 , 1 9 8 4 ; r e v i s e d J u n e 8 , 1 9 8 6 . T h i s w o r kw a s s u p p o r t e d i n p a r t b y NASA Ames R e s e a r c h C e n t e r u n de r G r an t NA G 2 -2 7 3 .

K . M . K a v i a n d B . P . B u c k l e s a r e w i t h t h e D e p a r t m e n t o f C o m p u t e rS c i e n c e E n g i n e e r i n g , T h e U n i v e r s i t y o f T e x a s , A r l i n g t o n , TX 7 6 0 1 9 .

U . N . B h a t i s w i t h t h e D e p a r t m e n t o f S t a t i s t i c s , S o u t h e r n M e t h o d i s t

U n i v e r s i t y , D a l l a s , TX 7 5 2 2 2 .I E E E L o g N u m b e r 8 6 1 0 9 3 4 .

P e t r i n e t m o d e l s o f p a r a l l e l a n d a s y n c h r o n o u s s y s t e m s h a v eb e e n e x t e n d e d t o i n c l u d e s t o c h a s t i c a s p e c t s [ 1 0 ] , [ 1 7 ] , [ 2 1 ] ,[ 2 2 ] . M o l l o y e s t a b l i s h e s a n i s o m o r p h i s m b e t w e e n s t o c h a s t i cP e t r i n e t s a n d h o m o g e n e o u s M a r k o v p r o c e s s e s , t h u s m a k i n g i tp o s s i b l e t o a p p l y M a r k o v t e c h n i q u e s f o r t h e a n a l y s i s o f

s t o c h a s t i c P e t r i n e t m o d e l s .I n r e c e n t y e a r s a new f o r m o f p r o g r a m r e p r e s e n t a t i o n

k n o w n a s d a t a f l o w h a s a t t r a c t e d t h e a t t e n t i o n o f r e s e a r c h e r s i nt h e U n i t e d S t a t e s , E n g l a n d , F r a n c e , a n d J a p a n . T h e l i t e r a t u r ei s a b u n d a n t w i t h p r o p o s a l s f o r n e w c o m p u t e r s y s te m s b a se d o nd a t a f l o w p r i n c i p l e s [ 7 ] , [ 8 ] , [ 2 4 ] , p r o g r a m m i n g l a n g u a g e s

[ 1 ] - [ 3 ] , d i s t r i b u t e d c o m p u t i n g b a s e d o n d a t a f l o w [ 1 8 ] , as w e l la s s i m u l a t i o n a n d m o d e l i n g u s i n g d a t a f l o w g r a p h s [ 9 ] , [ 1 2 ] ,[ 2 3 ] .

Much o f t h e r e s e a r c h i n d a t a f l o w p r o c e s s i n g h a s d e a l t w i t hd e f i n i n g t h e f u n c t i o n a l i t y , d e s i g n i n g i n s t r u c t i o n l e v e l a r c h i t e c -t u r e s , o r s p e c i f y i n g p r o g r a m m i n g m e t h o d o l o g i e s . T h i s h a s n o tm a d e u r g e n t t h e f o r m a l i z a t i o n o f t h e d a t a f l o w m o d e l i t s e l f .F o r m a l i z a t i o n i s n e c e s s a r y , h o w e v e r , i n r e l a t i n g d a t a f l o w t oo t h e r c o m p u t a t i o n m o d e l s , d i s c o v e r i n g p r o p e r t i e s o f s p e c i f i ci n s t a n c e s o f d a t a f l o w g r a p h s ( e . g . , a b s e n c e o f d e a d l o c k s ) , a n di n p e r f o r m a n c e e v a l u a t i o n . F o r m a l i z a t i o n a l s o m a k e s p o s s i b l et h e u t i l i z a t i o n o f d a t a f l o w g r a p h s a s a b s t r a c t m o d e l s o f

c o m p u t a t i o n a n a l o g o u s t o T u r i n g m ac h i n e s a n d P e t r i n e t s . I t i s

f r o m t h i s m o t i v a t i o n t h a t t h e p r e s e n t w o r k s t e m s .D a t a f l o w g r a p h s h a v e b e e n u s e d s u c c e s s f u l l y i n t h e

s i m u l a t i o n o f c o m p u t e r s y s t e m s [ 9 ] , [ 2 3 ] . T h e c h i e f a d v a n t a g eo f d a t a f l o w g r a p h s o v e r o t h e r m o d e l s o f p a r a l l e l p r o c e s s o r s i st h e i r c o m p a c t n e s s a n d g e n e r a l a m e n a b i l i t y t o d i r e c t i n t e r p r e t a -t i o n . T h a t i s , t h e t r a n s l a t i o n f r o m t h e c o n c e i v e d s y s t e m t o ad a t a f l o w g r a p h i s s t r a i g h t f o r w a r d a n d , o n c e a c c o m p l i s h e d , i ti s e q u a l l y s t r a i g h t f o r w a r d t o d e t e r m i n e b y i n s p e c t i o n w h i c ha s p e c t s o f t h e s y s t e m a r e r e p r e s e n t e d . B e c a u s e o f t h e h i e r a r c h i -c a l n a t u r e a n d t h e m o d u l a r i t y o f d a t a f l o w g r a p h s , b o t hs o f t w a r e t a s k s a n d h a r d w a r e u n i t s c a n b e m o d e l e d i n a u n i f o r mw a y u s i n g d a t a f l o w g r a p h s [ 1 2 ] . T h e f o r m a l i s m p r e s e n t e dh e r e a n d e l s e w h e r e [ 1 3 ] , [ 1 4 ] c a n b e u s e d t o a n a l y z e t h ep e r f o r m a n c e a n d r e l i a b i l i t y o f c o m p u t e r s y s t e m s m o d e l e d a sd a t a f l o w g r a p h s .

I n t h e r e m ai n de r o f t h e p a p e r , a f o r m a l s e t - r e l a t i o n s h i pd e f i n i t i o n o f a s p e c i f i c k i nd o f d a t a f l o w g r a p h ( k n o w n a s a n

u n i n t e r p r e t e d d a t a f l o w g r a p h ) i s p r e s e n t e d . T h e s e d e f i n i t i o n sa r e b a s e d o n t h e d a t a f l o w m o d e l o r i g i n a l l y p r e s e n t e d b yD e n n i s [ 6 ] . An i l l u s t r a t i o n o f i t s u s e i n d e s c r i b i n g p r o p e r t i e s i s

g i v e n i n t h e f o r m o f a l i v e n e s s t h e o r e m . S t o c h a s t i c a s p e c t s a r e

i n t r o d u c e d i n t o t h e m o d e l s o t h a t p e r f o r m a n c e a n d r e l i a b i l i t yo f d a t a f l o w g r a p h m o d e l s o f c o m p u t e r s y s t e m s c a n b e

a n a l y z e d .

0 0 1 8 - 9 3 4 0 / 8 6 / 1 1 0 0 - 0 9 4 0 $ 0 1 . 0 0 © 1 9 8 6 I E E E

9 4 0

Authorized licensed use limited to: University of North Texas. Downloaded on July 27, 2009 at 14:42 from IEEE Xplore. Restrictions apply.

Page 2: A Formal Definition of DFG Models

8/6/2019 A Formal Definition of DFG Models

http://slidepdf.com/reader/full/a-formal-definition-of-dfg-models 2/9

K A V I e t a l . : DATA FLOW GRAPH MODELS

I I . T H E DATA FLOW C O N C E P T

A d a t a f l o w g r a p h i s a b i p a r t i t e d i r e c t e d g r a p h i n w h i c h t h et w o t y p e s o f n o d e s a r e c a l l e d l i n k s a n d a c t o r s [ 6 ] . I n D e n n i s 'm o d e l , a c t o r s d e s c r i b e o p e r a t i o n s w h i l e l i n k s r e c e i v e d a t af r o m a s i n g l e a c t o r a n d t r a n s m i t v a l u e s t o o n e o r m o r e a c t o r sb y w a y o f a r c s . ( A r c s c a n b e c o n s i d e r e d a s c h a n n e l s o f

c o m m u n i c a t i o n . ) I n i t s b a s i c f o r m , n o d e s ( a c t o r s a n d l i n k s ) a r ee n a b l e d f o r e x e c u t i o n w h e n a l l i n p u t a r c s c o n t a i n t o k e n s a n dn o o u t p u t a r c s c o n t a i n t o k e n s . An e n a b l e d n o d e c o n s u m e st o k e n s o n i n p u t a r c s a n d p r o d u c e s t o k e n s o n o u t p u t a r c s . A r c sc a n b e c o n t r o l o r d a t a a r c s . I n t h e c a s e o f c o n t r o l a r c s ( w h i c he n t e r o r l e a v e c o n t r o l l i n k s ) , t h e t o k e n s a r e o f t h e t y p e B o o l e a n( t r u e o r f a l s e ) ; f o r d a t a a r c s ( w h i c h e n t e r o r l e a v e d a t a l i n k s ) ,t h e t o k e n s a r e o f t h e t y p e i n t e g e r , r e a l , o r c h a r a c t e r . C o n t r o l

t o k e n s a r e i n t r o d u c e d t o i n d i c a t e t h e p r e s e n c e o f s e q u e n c ec o n t r o l ; c e r t a i n a c t o r s a r e e n a b l e d o n l y w h e n t h e r i g h t c o n t r o lv a l u e s a p p e a r o n t h e i n p u t c o n t r o l a r c s . F o r a c o m p l e t ed e s c r i p t i o n o f d a t a f l o w c o n c e p t s , t h e r e a d e r i s r e f e r r e d t o[ 2 4 ] .

T h e d a t a f l o w m o d e l o f c o m p u t a t i o n i s n e i t h e r b a s e d o nm e m o r y s t r u c t u r e s t h a t r e q u i r e i n h e r e n t s t a t e t r a n s i t i o n s n o r

d o e s i t d e p e n d o n h i s t o r y s e n s i t i v i t y . T h u s , i t e l i m i n a t e s some

o f t h e i n h e r e n t v o n N e u m a n n p i t f a l l s d e s c r i b e d b y B a c k u s [ 4 ] .S e v e r a l e x t e n s i o n s t o b a s i c d a t a f l o w h a v e b e e n p r o p o s e d s o

t h a t d a t a f l o w t e c h n i q u e s c a n b e u s e d i n a v a r i e t y o f

a p p l i c a t i o n s . I n h i s d i s s e r t a t i o n , L a n d r y [ 1 6 ] s u r v e y e d s o m e o f

t h e s e e x t e n s i o n s . One i s d i s c u s s e d h e r e .

A . F i r i n g S e m a n t i c S e t s ( F S S )

T h e b a s i c f i r i n g r u l e a d o p t e d b y m o s t d a t a f l o w r e s e a r c h e r sr e q u i r e s t h a t a l l i n p u t a r c s c o n t a i n t o k e n s a n d t h a t n o t o k e n s b e

p r e s e n t o n t h e o u t p u t a r c s . T h i s p r o v i d e s a n a d e q u a t es e q u e n c i n g c o n t r o l m e c h a n i s m w h e n t h e n o d e s i n d a t a f l o wg r a p h s r e p r e s e n t p r i m i t i v e o p e r a t i o n s . H o w e v e r , i f t h e n o d e s

a r e c o m p l e x p r o c e d u r e s , o r d a t a f l o w s u b g r a p h s , m o r eg e n e r a l i z e d f i r i n g c o n t r o l f o r b o t h i n p u t a n d o u t p u t a r c s i sr e q u i r e d . L a n d r y [ 1 6 ] d i s c u s s e d a c o m p r e h e n s i v e i n p u t f i r i n gs e m a n t i c s p e c i f i c a t i o n f o r d a t a f l o w n o d e s . T h e ( i n p u t ) f i r i n gs e m a n t i c s e t r e f e r s t o a s u b s e t o f i n p u t a r c s t h a t m u s t c o n t a i nt o k e n s t o e n a b l e t h e n o d e . S i m i l a r l y , a n o u t p u t s e m a n t i c s e tc a n b e d e f i n e d a s t h e s u b s e t o f o u t p u t a r c s t h a t m u s t b e e m p t y .When t h e n o d e i s f i r e d , t o k e n s a r e r e m o v e d f r o m a r c s o f t h ei n p u t f i r i n g s e m a n t i c s e t a n d n ew t o k e n s a r e p l a c e d o n a r c s o f

t h e o u t p u t f i r i n g s e m a n t i c s e t . F o r d i f f e r e n t i n s t a n c e s o f t h e

e x e c u t i o n o f a n o d e , t h e f i r i n g s e t s may d i f f e r , t h u s i n t r o d u c -i n g n o n d e t e r m i n a c y . T h e f o r m a l m o d e l o f d a t a f l o w g r a p h sd e s c r i b e d i n t h i s p a p e r i n c o r p o r a t e s t h i s g e n e r a l i z e d f i r i n gs p e c i f i c a t i o n .

I I I . DATA FLOW F O R M A L I S M

D e f i n i t i o n 1 : A d a t a f l o w g r a p h i s a b i p a r t i t e l a b e l e dg r a p h w h e r e t h e t w o t y p e s o f n o d e s a r e c a l l e d a c t o r s a n dl i n k s .

G=(A UL,E) ( 1 )

w h e r e

L={l, 1 2 , , I m } i s t h e s e t o f l i n k s

E C (AxL) U (LxA) i s t h e s e t o f e d g e s .

A c t o r s r e p r e s e n t f u n c t i o n s a n d l i n k s a r e t r e a t e d a s p l a c eh o l d e r s o f d a t a v a l u e s ( t o k e n s ) a s t h e y f l o w f r o m a c t o r s t oa c t o r s . E d g e s a r e t h e c h a n n e l s o f c o m m u n i c a t i o n ( l i k e a r c s i n

D e n n i s ' m o d e l ) . S i s a s u b s e t o f l i n k s c a l l e d t h e s t a r t i n g s e t( i n p u t l i n k s ) ; t h e s e l i n k s r e p r e s e n t e x t e r n a l i n p u t s t o a d a t af l o w g r a p h ( o r s u b g r a p h ) .

- ( 2 )T i s a s u b s e t o f l i n k s c a l l e d t h e t e r m i n a t i n g s e t ( o u t p u t l i n k s ) ;t h e s e l i n k s r e p r e s e n t o u t p u t s f r o m a d a t a f l o w g r a p h ( o rs u b g r a p h ) .

T={l E L I ( l , a ) e E , v a E A } . ( 3 )

T h e s e t o f i n p u t l i n k s t o a n a c t o r a , a n d t h e o u t p u t l i n k s f r o ma n a c t o r a a r e d e n o t e d b y I ( a ) a n d O ( a ) .

( 4 )

( 5 )

S i m i l a r l y , I ( l ) a n d 0 ( 1 ) f o r l i n k s c a n b e d e f i n e d .T h e t r a n s i t i v e c l o s u r e o n t h e s e s e t s , I ( a ) + , I ( l ) + , 0 ( a ) + ,

0 ( 1 ) + a r e d e f i n e d i n t h e u s u a l m a n n e r . F o r e x a m p l e , I ( a ) +d e n o t e s t h e s e t o f l i n k s t h a t a r e i n p u t s t o a c t o r a o r t h e i n p u tl i n k s t h a t a r e i n p u t s t o t h e a c t o r s t h a t f e e d t h e i n p u t l i n k s o f a ,a n d s o o n .

I ( a ) +=I E L I t E I ( a ) o r 1 E I ( I ( I ( a ) ) ) , } . ( 6 )

I f B C A i s a s u b s e t o f a c t o r s t h e n I ( B ) a n d O ( B ) d e f i n e t h es e t s o f l i n k s t h a t a r e i n p u t s a n d o u t p u t s o f a c t o r s b e l o n g i n g t oB .

( 7 )

( 8 )

A . U n i n t e r p r e t e d D a t a Flow G r a p h s

F o r t h e purpose o f s t u d y i n g t h e p e r f o r m a n c e o f d a t a f l o w

g r a p h m o d e l s o f c o m p u t e r s y s t e m s , t h e a c t u a l meaning o f t h ef u n c t i o n s p e r f o r m e d b y a c t o r s a n d s e m a n t i c s o f t h e d a t a t o k e n sare n o t r e l e v a n t . T h e presence o f t o k e n s i n l i n k s a c t a s

t r i g g e r i n g s i g n a l s t o e n ab l e n o de s . S u c h d a t a f l o w g r a p h s w i l l

b e known as u n i n t e r p r e t e d d a t a f l o w g r a p h s . T h r o u g h o u t t h i spaper t h e t e r m d a t a f l o w g r a p h i s u s e d t o mean an u n i n t e r -p r e t e d d a t a f l o w g r a p h .

T h e d a t a flow g r a p h s i n t h i s f o r m a l m o d e l s a t i s f y t h ef o l l o w i n g c o n d i t i o n s .

I I ( a ) >0 f o r a l l a c t o r s a E - A

I I ( 1 ) 1 = 0 or 1 f o r a l l l i n k s 1 E L

1 0 ( a ) l > 0 f o r a l l a c t o r s a E A

| 0 ( 1 ) | = 0 or 1 f o r a l l l i n k s 1 E L . ( 9 )

A l t h o u g ht h i s appears r e s t r i c t i v e

s i n c et h e l i n k s c an h a v e a t

S={l E L j ( a , 1 ) 1 : E , v a E A } .

I ( a ) = { l eE(l, a ) E}

0 ( a ) = { l E L I ( a , 1 ) E E } .

I ( B ) = { I l E L l l E I ( b ) f o r b E B}

O ( B ) = { I l E L l l E O ( b ) f o r b E B } .

9 4 1

A = = l a , , a 2 ,. . .

,

a n I i s t h es e t o f a c t o r s

Authorized licensed use limited to: University of North Texas. Downloaded on July 27, 2009 at 14:42 from IEEE Xplore. Restrictions apply.

Page 3: A Formal Definition of DFG Models

8/6/2019 A Formal Definition of DFG Models

http://slidepdf.com/reader/full/a-formal-definition-of-dfg-models 3/9

IEEE TRANSACTIONS ON COMPUTERS, VOL. C - 3 5 , NO . 1 1 , NOVEMBER 1 9 8 6

m o s t o n e i n p u t a c t o r a n d o n e o u t p u t a c t o r , t h e a u t h o r s h a v es u c c e s s f u l l y t r a n s l a t e d a l l d a t a f l o w g r a p h s b y i n t r o d u c i n gdummy a c t o r s ( f o r e x a m p l e , t o d u p l i c a t e a n i n p u t t o k e n o n t os e v e r a l o u t p u t l i n k s ) . T h i s r e s t r i c t i o n a l l o w s f o r a s i m p l e rd e f i n i t i o n o f m a r k i n g s [ s e e ( 1 0 ) - ( 1 3 ) ] .

D e f i n i t i o n 2 : A m a r k i n g i s a m a p p i n g

M: L-{0, 1 } .

a ) . C o n j u n c t i v e

F 1 ( a , f l ) = I ( a )

( 1 0 )b ) . D i s j u n c t i v e

I F 1 ( a , M ) IA l i n k i s s a i d t o c o n t a i n a t o k e n i n a m a r k i n g Mi f M ( l ) =

1 . An i n i t i a l m a r k i n g Mo i s a m a r k i n g i n w h i c h a s u b s e t o f t h es t a r t i n g s e t o f l i n k s c o n t a i n t o k e n s . A t e r m i n a l m a r k i n g M , i sa m a r k i n g i n w h i c h a s u b s e t o f t h e t e r m i n a t i n g s e t o f l i n k sc o n t a i n t o k e n s .

B . F i r i n g a n d F i r i n g S e m a n t i c S e t s

A s s o c i a t e d w i t h e a c h a c t o r ar e t w o s e t s o f l i n k s c a l l e d i n p u tf i r i n g s e m a n t i c s e t F 1 a n d o u t p u t f i r i n g s e m a n t i c s e t F 2

F 1 ( a , M) c I ( a )

= 1

c ) . C o l l e c t i v e

F ( a , M ) C I ( a )

F 2 ( a , M) C 0 ( a ) . ( 1 1 )

T h e i n p u t f i r i n g s e m a n t i c s e t r e f e r s t o t h e s u b s e t o f i n p u t l i n k st h a t m u s t c o n t a i n t o k e n s t o e n a b l e t h e a c t o r ; t h e o u t p u t f i r i n gs e m a n t i c s e t r e f e r s t o t h e s u b s e t o f l i n k s t h a t r e c e i v e t o k e n sw h e n t h e a c t o r i s f i r e d .

D e f i n i t i o n 3 : A f i r i n g i s a p a r t i a l m a p p i n g f r o m m a r k i n g st o m a r k i n g s . An a c t o r a i s f i r a b l e a t a m a r k i n g M i f t h ef o l l o w i n g c o n d i t i o n s h o l d .

M ( l ) = 1 f o r a l l I E F 1 ( a , M)

M ( l ) = 0 f o r a l l I E F 2 ( a , M ) .

d ) . S e l e c t i v e

F 2 ( a , M ) j= 1

I | e ) . D i s t r i b u t i v e

, * F 2 ( a M ) = 0 ( a )

F i g . 1 . F i r i n g r u l e s .

( 1 2 )

When t h e a c t o r i s f i r e d , t o k e n s f r o m t h e f i r i n g s e t F 1 ( a , M ) o fl i n k s ar e c o n s u m e d a n d new t o k e n s ar e p l a c e d o n e a c h l i n kb e l o n g i n g t o t h e o u t p u t f i r i n g s e m a n t i c s e t F 2 ( a , M ) . T h u s , a

n e w m a r k i n g M ' r e s u l t i n g f r o m t h e f i r i n g o f a n a c t o r a a tm a r k i n g Mc a n b e d e r i v e d a s f o l l o w s .

S e l e c t i v e : When a f i r e s , o n l y o n e o f t h e o u t p u t l i n k sr e c e i v e s a t o k e n . T h a t i s ,

I F 2 ( a , M ) I = I f o r a l l M. ( 1 7 )

D i s t r i b u t i v e : When a f i r e s , a l l t h e o u t p u t l i n k s r e c e i v et o k e n s . T h a t i s ,

i f I E F 1 ( a , M ) a n d 1e F 2 ( a , M )i f 1 E F 2 ( a , M) ( 1 3 )o t h e r w i s e .

Afiring of anactor is indicated by

D e p e n d i n g on w h e t h e r F 1 a n d F 2 s e l e c t o n l y o n e , a proper

s u b s e t or t h e e n t i r e s e t o f i n p u t a n d o u t p u t l i n k s t h e f o l l o w i n ga c t o r f i r i n g r u l e s a p p l y .

C o n j u n c t i v e : A l l t h e i n p u t l i n k s must c o n t a i n t o k e n s f o r t h e

a c t o r t o f i r e . T h a t i s ,

F 1 ( a , M)=I(a) f o r a l l M. ( 1 4 )

D i s j u n c t i v e : O n l y on e o f t h e i n p u t l i n k s m u s t c o n t a i n a

t o k e n f o r t h e a c t o r t o f i r e . T h a t i s ,

I F , ( a , M ) I = I f o r a l l M . ( 1 5 )

C o l l e c t i v e : One or more o f t h e i n p u t l i n k s may c o n t a i n

t o k e n s f o r t h e a c t o r t o f i r e . T h a t i s ,

F 1 ( a , M) C I ( a ) f o r a l l M.

F 2 ( a , M)=0(a) f o r a l l M. ( 1 8 )

G r a p h i c a l r e p r e s e n t a t i o n o f t h e s e p o s s i b i l i t i e s are shown i n

F i g . 1 .

C . N o n d e t e r m i n i s t i c F i r i n g S e m a n t i c s

S i n c e u n i n t e r p r e t e d d a t a f l o w g r a p h s are u s e d h e r e , t h e

f i r i n g s e m a n t i c s e t s F 1 a n d F 2 are n o n d e t e r m i n i s t i c ; f o r

d i f f e r e n t i n s t a n c e s o f e x e c u t i o n o f an a c t o r t h e f i r i n g s e m a n t i c

s e t s c an b e d i f f e r e n t . T h i s e l i m i n a t e s t h e n e e d f o r c o n t r o l arcs

i n d a t a f l o w g r a p h m o d e l s . Th e c h o i c e a r i s i n g d u e t o c o n t r o l

t o k e n s are i n c o r p o r a t e d i n t o F , a n d F 2 b y a s s o c i a t i n gp r o b a b i l i t y d i s t r i b u t i o n s w i t h t h e f i r i n g s e m a n t i c s e t s . For

e x a m p l e , t h e t g a t e [ 6 ] shown i n F i g . 2 ( a ) i s r e p l a c e d b y t h e

a c t o r i n F i g . 2 ( b ) . Th e f i r i n g s e t s F 1 and F 2 are d e f i n e d as

F 1 ( t , M ) = I ( t ) = { 1 }

F 2 ( t , M) =0 ( t ) ={ 1 2 } w i t h p r o b a b i l i t y p

=+ w i t h p r o b a b i l i t y -p. ( 1 9 )

M' ( l ) = {

M ( l )

9 4 2

( 1 6 )

Authorized licensed use limited to: University of North Texas. Downloaded on July 27, 2009 at 14:42 from IEEE Xplore. Restrictions apply.

Page 4: A Formal Definition of DFG Models

8/6/2019 A Formal Definition of DFG Models

http://slidepdf.com/reader/full/a-formal-definition-of-dfg-models 4/9

KAVI e t a l . : DATA FLOW GRAPH M ODELS

t I

p

v F(b 2

( b )

£ 2

( a )F i g . 2 . R e p r e s e n t a t i o n o f a t g a t e u s i n g n o n d e t e r m i n i s t i c f i r i n g s e m a n t i c s .

T h e p r o b a b i l i t y p d e p e n d s o n t h e f r e q u e n c y o f h a v i n g a TRUEv a l u e o n t h e c o n t r o l l i n k o f t h e t g a t e .

P [ F 1 ( a , M) = f i ] i s t h e p r o b a b i l i t y t h a t i n m a r k i n g M, f iC I ( a ) i s t h e i n p u t f i r i n g s e m a n t i c s e t . T h e p r o b a b i l i t yd e t e r m i n e s w h i c h s u b s e t o f t o k e n s o n i n p u t l i n k s ( s h o u l d a

c h o i c e b e m a d e ) w i l l b e c o n s u m e d w h e n t h e a c t o r a i s f i r e d i nm a r k i n g M. T h i s p r o b a b i l i t y d i s t r i b u t i o n f u n c t i o n i s s i g n i f i -c a n t f o r c o l l e c t i v e a c t o r s o n l y . S i m i l a r l y , P [ F 2 ( a , M ) ] i s t h ep r o b a b i l i t y d i s t r i b u t i o n o n t h e o u t p u t f i r i n g s e m a n t i c s e t ; w h e nt h e a c t o r a f i r e s i n M, t h e l i n k s i n f 2 O( a ) w i l l r e c e i v et o k e n s w i t h a p r o b a b i l i t y P [ F 2 ( a , M ) - f 2 ] . C o n d i t i o n a l

p r o b a b i l i t i e s c a n a l s o b e d e f i n e d f o r t h e f i r i n g s e m a n t i c s e t sw h e n P [ F , ( a , M)] a n d P [ F 2 ( a , M ) ] d e p e n d o n t h e f i r i n g s e t ss e l e c t e d b y o t h e r a c t o r s .

D e f i n i t i o n 4 : A f i r i n g s e q u e n c e a i s a s e q u e n c e o f a c t o r s ,i n t h e o r d e r i n w h i c h t h e a c t o r s ar e e n a b l e d . When a c t o r s c a n

b e f i r e d c o n c u r r e n t l y , t h e o r d e r i s a r b i t r a r y . An a c t o r a i s s a i dt o b e l o n g t o a i f a i s f i r e d a t l e a s t o n c e i n t h e f i r i n g s e q u e n c e a .We s a y Ml e a d s t o M ' v i a a i f M' i s t h e n e w m a r k i n g t h a t i s

d e r i v e d f r o m t h e m a r k i n gM

w h e n t h ea c t o r s

i n t h e f i r i n gs e q u e n c e a a r e f i r e d . T h i s i s d e n o t e d b y M M'. T h e s e t o f

m a r k i n g s g e n e r a t e d b y a f i r i n g s e q u e n c e a w i l l b e k n o w n as

m a r k i n g s e t M U .

MU= { M ' IM + M' f o r a n y s u b s e q u e n c e Et h a t i s a p r e f i x o f a ) . ( 2 0 )

I f M - Y - + M f o r some n o n e m p t y f i r i n g s e q u e n c e a , t h e n t h ef i r i n g s e q u e n c e i s k n o w n a s a f i r i n g c y c l e .A f o r w a r d m a r k i n g c l a s s Mo f a m a r k i n g Mi s t h e s e t o f

m a r k i n g s w h i c h c a n b e d e r i v e d ( o r r e a c h e d ) f r o m Mv i a s o m ef i r i n g s e q u e n c e .

M ={M'1M 0 M ' f o r some f i r i n g s e q u e n c e a l . ( 2 . 1 )

F o r s o m e a c t o r a E A a n d a m a r k i n g s e t M U ,

F 1 ( a , M ) U a = { l E L J 1 E F 1 ( a , M') w h e r e

D . An E x a m p l e

B a e r [ 5 , p . 7 1 ] g i v e s a P e t r i n e t m o d e l r e p r e s e n t i n g t h ec o n t r o l f l o w i n t h e e x e c u t i o n o f a n i n s t r u c t i o n i n a s i n g l ea c c u m u l a t o r a r i t h m e t i c a n d l o g i c u n i t . F i g . 3 s h o w s a d a t af l o w e q u i v a l e n t o f t h e P e t r i n e t g i v e n b y B a e r . T h e a c t o r s a r ei n t e n t i o n a l l y n a m e d b y t h e e v e n t s i n o r d e r t o f a c i l i t a t e

i n t e r p r e t a t i o n . T h e d a t a f l o w g r a p h c o n s i s t s o f c o n j u n c t i v e ,d i s j u n c t i v e , s e l e c t i v e , a n d d i s t r i b u t i v e a c t o r s . A c t o r s l a b e l e da s " d u p l i c a t e " ar e i n t r o d u c e d t o s a t i s f y t h e r e q u i r e m e n t t h a tl i n k s h a v e o n l y o n e i n p u t a n d o n e o u t p u t .

G=(A U L , E )

w h e r e

A ={ a 1 , a 2 , a 3 , *, a 2 2 )

L = I{ l o 1 1 , 1 2 , * , 1 3 2 }

S = { l o }

T= { 1 3 2 } 1

T h e m a r k i n g s f o r t h e d a t a f l o w g r a p h a r e l i s t e d i n F i g . 4 .O n e s i n d i c a t e t h e p r e s e n c e o f t o k e n s i n l i n k s a n d b l a n k s( a c t u a l l y z e r o s ) r e p r e s e n t a b s e n c e o f t o k e n s i n l i n k s . Whenm u l t i p l e a c t o r s a r e e n a b l e d i n a m a r k i n g , t h e y a r e a s s u m e d t of i r e c o n c u r r e n t l y l e a d i n g t o t h e n e x t m a r k i n g . Mo i s t h e i n i t i a lm a r k i n g a n d M 1 4 i s t h e t e r m i n a l m a r k i n g . T h e f i r i n g s e m a n t i cs e t s f o r a l l a c t o r s ( i n t h e m a r k i n g s i n w h i c h t h e y a r e e n a b l e d )a r e s h o w n i n F i g . 5 . P r o b a b i l i t i e s a s s o c i a t e d w i t h t h e o u t p u tf i r i n g s e m a n t i c s e t o f s e l e c t i v e a c t o r s a r e a l s o s h o w n i n F i g . 5 .

T h r e e f i r i n g c y c l e s c a n b e i d e n t i f i e d .

a ' = { a l , a 2 , a 3 , a 4 , a 5 , a 8 , a 2 l , a 1 o , a l l ,

a 1 3 , a 1 4 , a 1 6 , a 2 2 )

M' = { M l , M 2 , M 3 , M 4 , M 5 , M 8 , M 9 , M A 1 0 ,

M l 1 , M 1 2 , A 1 3 , M 1 4 , M l 1 5 , M 1 6 )

o r f 2 = { a , , a 2 , q 3 , a 4 , a 6 , a 1 l , a 1 5 , a 1 4 , a 1 7 ,

a 1 6 , a 1 8 , a l 9 , a 2 l , a 2 2 )

Mu 2 { M 1 , M 2 , M 3 , M 4 , M 6 , M I 3 , M I 4 ,

M 1 7 , M 1 8 , M 1 g , M 2 0 , M 2 1 , M 2 2 }

a F { a , , a 2 , a 3 , a 4 , a 7 , a 9 , a 1 l , a 1 4 , a 1 2 , a 1 5 ,

a 1 6 , a 1 7 , a 1 8 , a 2 0 , a 2 l , a 2 2 )

M' E M a n d a i s f i r a b l e i n M'} ( 2 2 ) M1 ={M1, M 2 , M 3 , M 4 , M 7 , M 1 3 , M 1 4 , M 2 3 , M 2 4 ,

F 2 ( a , M U ) = { l E L I l E F 2 ( a , M') w h e r e

M ' E M a n d a i s f i r a b l e i n M ' } . ( 2 3 )

F 1 ( B , M U ) a n d F 2 ( B , M U ) w h e n B i s a s u b s e t o f a c t o r s c a n b e

d e f i n e d s i m i l a r l y .

M 2 5 , M 2 6 , M 2 7 , M 2 8 , M 2 9 , M 3 0 } .

T h e f o r w a r d m a r k i n g c l a s s o f t h e i n i t i a l m a r k i n g Mo i s t h ee n t i r e s e t o f m a r k i n g s

M O = { M O ,M 1 ,

* * . , M 3 0 } @

9 4 3

Authorized licensed use limited to: University of North Texas. Downloaded on July 27, 2009 at 14:42 from IEEE Xplore. Restrictions apply.

Page 5: A Formal Definition of DFG Models

8/6/2019 A Formal Definition of DFG Models

http://slidepdf.com/reader/full/a-formal-definition-of-dfg-models 5/9

IEEE TRANSACTIONS O N COMPUTERS, V O L . C - 3 5 , N O . 1 1 , NOVEMBER 1 9 8 6

F i g . 3 . A d a t a f l o w d i a g r a m o f a s i m p l e c o m p u t e r .

E . D e a d l o c k s and L i v e n e s s i n Data Flow G r a p h s

We s h o u l d b e a b l e t o i d e n t i f y s i t u a t i o n s i n w h i c h an a c t o r

c a n n o t f i r e . D e a d l o c k s can b e a v o i d e d i n d a t a f l o w m a c h i n e s

b y p r o v i d i n g f e e d b a c k u s i n g c o n t r o l t o k e n s [ 2 0 ] . To i l l u s t r a t e

t h i s , a p a r t o f F i g . 3 i s r e d r a w n w i t h c o n t r o l arcs a n d l i n k s( F i g . 6 ) . A s c an b e s e e n , t h e presence o f t h e same v a l u e on

c o n t r o l l i n k s a t a c t o r s a 4 , a 1 5 , a l 1 8 , a n d a 2 l p e r m i t s t h e s e l e c t i o no f t h e proper p a t h f o r t h e f l o w o f t o k e n s . S i n c e t h e m o d e l

p r e s e n t e d h e r e o m i t s c o n t r o l t o k e n s , i t i s necessary t o d e r i v el i v e n e s s c o n d i t i o n s .

D e f i n i t i o n 5 : An a c t o r i s p o t e n t i a l l y f i r a b l e i n a m a r k i n g

M ( * - M , ) , i f t h e r e e x i s t s a m a r k i n g M' E Ms u c h t h a t a i s

e n a b l e d i n M'.An a c t o r i s s a i d t o b e b l o c k e d i n a m a r k i n g Mi f f o r a l l

m a r k i n g s M' E M, a i s n o t f i r a b l e .An a c t o r i s l i v e i n M i f a i s p o t e n t i a l l y f i r a b l e i n a l l

m a r k i n g s M' E M, e x c e p t w h e n M' i s a t e r m i n a l m a r k i n g .D e f i n i t i o n 6 : A f i r i n g s e q u e n c e a i s s a i d t o b e l i v e i n a

m a r k i n g Mi f a l l t h e a c t o r s i n a a r e , l i v e i n t h e m a r k i n g s M 0 .F i r i n g s e q u e n c e s c o n s i d e r e d h e r e a r e a s s u m e d r e a c h a b l e

f r o m a n i n i t i a l m a r k i n g ( t h a t i s , M a n M* 4 ) . I f t h e r e a r e n o

i n i t i a l m a r k i n g s i n t h e d a t a f l o w g r a p h , t h e n a f i r i n g s e q u e n c e

i s a s s u m e d t o b e i n i t i a t e d i na

m a r k i n gM E M o .

F i r i n g

9 4 4

Authorized licensed use limited to: University of North Texas. Downloaded on July 27, 2009 at 14:42 from IEEE Xplore. Restrictions apply.

Page 6: A Formal Definition of DFG Models

8/6/2019 A Formal Definition of DFG Models

http://slidepdf.com/reader/full/a-formal-definition-of-dfg-models 6/9

KAVI e t a l . : DATA FLOW GRAPH M O D ELS

1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 3 3 3012345678901234567890123456789012

0 1 ( i n i t i a l )1 12 13 1

4 15 16 17 18 1 19 11011 1 11 21 3 11 4 ( t e r m i n a l )1 5 11 6 11 7 1111 8 1 1 11 9 1 12 0 1 12 1 1 12 2 12 3 1 12 4 1 12 52 62 72 82 93 0

F i g . 4 . M a r k i n g s f o r t h e d a t a f l o w e x a m p l e .

F 1 ( a , , M j )

( a , , M 0 ) = l o( a l , M I ) = 1 1( a 2 , M 2 ) = 1 2( a 3 , M 3 ) = 1 3( a 4 , M 4 ) = 1 4

( a 5 , M 5 ) = 1 5( a 6 , M 6 ) = 1 6( a 7 , M 7 ) = 1 7( a 8 , M 8 ) = 1 8( a 9 , M 2 3 ) = 1 1 4( a 1 o , l M g ) = 1 1 5

( a 1 I , A M l ' I ) = 1 1( a 1 1 l ' s - , , ) = 1 1 0( a , l , , M I 7 ) = 1 1 0( a 1 1 , M 2 3 ) = 1 1 3( a 1 2 , M 2 4 ) = 1 1 6( a I 3 , M l O ) = 1 1 7( a 1 4 , M l 1 5 ) = ' 1 9( a I 4 , M 1 8 ) = 1 1 9( a 1 4 , M 2 4 ) = 1 1 9( a 1 5 , M l 1 7 ) = 1 1 2( a 1 5 , M 2 8 ) = 1 2 0( a l 6 , M l 2 ) = 1 2 2( a l 6 , M l 1 6 ) = 1 2 3( a 1 6 , M l 1 9 ) = 1 2 3( a l 6 , M 2 5 ) = 1 2 3( a 1 7 , M 1 8 ) = 1 2 4( a 1 7 , M 2 6 ) = 1 2 4

( a 1 8 , M 1 9 ) = 1 2 6

( a 1 8 , M 2 7 ) =

( a 1 g , M 2 0 ) =( a 2 0 , M 2 8 ) =( a 2 1 , M 8 ) =( a 2 1 , M 2 2 ) =( a 2 1 , M 3 0 ) =

( a 2 2 , M l 1 3 ) =

1 2 6

' I I I 1 2 71 2 1 , 1 2 81 9

1 2 91 3 01 2 5 , 1 3 1

F 2 ( a i , M j )

( a t , M o ) = 1 2( a 1 , M l ) = 1 2( a 2 , M 2 ) = 1 3( a 3 , M 3 ) = 1 4( a 4 , M 4 ) = 1 5 w i t h p 1

= ' 6 w i t h P 2= l 7 w i t h p 3

( a 5 , M 5 ) = 1 8 , 1 9( a 6 , l6) = 1 1 0 , 1/ 1 , 1 1 2( a 7 , l7) = 1 1 3 , 1 4( a 7 , M) =1 5( a s , M 2 3 ) = 1 1 6( a 1 o , M g ) = 1 1 7 w i t h p 4

= / 1 8 w i t h p 5( a , 1 , M l , l ) = l 1 9( a 1 , A l 1 7 ) = 1 1 9( a 1 , M 2 3 ) = / 1 9( a 1 2 , M 2 4 ) = 1 2 0 , 1 2 1( a 1 3 , M l o ) = 1 2 2( a l 4 , M l 1 5 ) = 1 2 3( a l 4 , M l 1 8 ) = 1 2 3( a 1 4 , M 2 4 ) = 1 2 3( a ] 5 , M A 1 7 ) = 1 2 4( a l 5 , M 2 8 ) = 1 2 0( a 1 6 , M 1 2 ) = 1 2 5( a l 6 , M l 1 6 ) = 1 2 5( a 1 6 , M l 1 9 ) = 1 2 5( a 1 6 , M 2 5 ) = 1 2 5( a 1 7 , M l 1 8 ) = 1 2 6( a 1 7 , M 2 6 ) = 1 2 6

( a 1 8 , M l 1 9 ) = 1 2 7 w i t h P 6= 1 2 8 w i t h p 7

( a 1 8 , M 2 7 ) = 1 2 7 w i t h P o= 1 2 8 w i t h p q

( a l g , M 2 0 ) = 1 2 9( a 2 0 , M 2 8 ) = 1 3 0( a 2 l , M A ) = 1 3 1( a 2 l , M 2 2 ) = 1 3 1( a 2 l , M 3 0 ) = 1 3 1( a 2 2 , M 2 3 ) = 1 1 w i t h P l o

= 1 3 2 w i t h P 1 1

s e q u e n c e s t h a t a r e n o t r e a c h a b l e f r o m a n i n i t i a l m a r k i n g( i m p l y i n g t h a t t h e d a t a f l o w g r a p h i s n o t s t r o n g l y c o n n e c t e d o r

p e r m a n e n t l y d i s a b l e d ) d o n o t c o n t r i b u t e t o t h e l i v e n e s s o f a

d a t a f l o w g r a p h .T h e o r e m 1 : L e t B ' A b e t h e s u b s e t o f a c t o r s t h a t b e l o n g

t o a f i r i n g c y c l e a . T h e f i r i n g c y c l e a i s l i v e i n Mi f a n d o n l y i f

F 1 ( B , Mc)=F2(B, M U ) . ( 2 4 )

P r o o f : N e c e s s a r y c o n d i t i o n . I f t h e f i r i n g s e q u e n c e a i sl i v e t h e n ( 2 4 ) h o l d s . T h i s i s p r o v e d b y c o n t r a d i c t i o n .

S u p p o s e t h a t a i s l i v e , b u t

F 1 ( B , Ml)* F 2 ( B , M l ) .

C a s e 1 : T h e r e e x i s t s a l i n k 1 E F 1 ( B , M U ) b u t 1 e F 2 ( B ,M U ) . S i n c e o n l y a c t o r s i n B a n d f i r a b l e i n f i r i n g c y c l e a , o n l yF 2 ( B , MU) c a n r e c e i v e t o k e n s i n a l l m a r k i n g s M' E M U . T h i s

i m p l i e s t h a t t h e r e e x i s t s a n a c t o r b E B a n d a m a r k i n g M' EM U , s u c h t h a t I E F 1 ( b , M') d o e s n o t c o n t a i n a t o k e n . T h e n

a c t o r b w i l l b e b l o c k e d w h i c h i s c o n t r a r y t o t h e a s s u m p t i o nt h a t a c t o r s i n B a r e l i v e .C a s e 2 : T h e r e e x i s t s a l i n k I E F 2 ( B , M U ) , b u t I E F I ( B ,

M U ) . S i n c e o n l y a c t o r s i n B c a n f i r e i n a l l t h e m a r k i n g s M' EM U , o n l y t o k e n s o n l i n k s F 1 ( B , M U ) a r e c o n s u m e d . S i n c e I eF 1 ( B , M U ) , 1 w i l l c o n t a i n a n u n c o n s u m e d t o k e n . T h i s i m p l i e st h a t a n a c t o r b E B w i l l b e b l o c k e d i n a m a r k i n g M ' E MUw h e r e I E F 2 ( b , M ' ) . T h i s i s a g a i n c o n t r a r y t o t h e a s s u m p t i o nt h a t a c t o r s i n B a r e l i v e . H e n c e , F 1 ( B , M U ) = F 2 ( B , M U ) .

S u f f i c i e n t C o n d i t i o n . I f ( 2 4 ) h o l d s , t h e n t h e f i r i n g s e -q u e n c e a i s l i v e . T h i s i s p r o v e d b y c o n t r a d i c t i o n . T h a t i s ,F 1 ( B , M) = F 2 ( B , M), b u t t h e f i r i n g s e q u e n c e a i s n o t l i v e .L e t b E B b e a n a c t o r t h a t i s n o t l i v e i n MU ( t h a t i s , t h e r e

e x i s t s a m a r k i n g M' E MU s u c h t h a t b i s n o t p o t e n t i a l l yf i r a b l e i n M ' ) .C a s e 3 : T h e a c t o r i s n o t f i r a b l e b e c a u s e some l i n k I E F I ( b ,

M') d o e s n o t c o n t a i n a t o k e n . S i n c e F 2 ( B , M U ) i s t h e o n l y s e to f l i n k s t h a t c a n r e c e i v e t o k e n s i n M U , I e F 2 ( B , M U ) . T h i s i sa c o n t r a d i c t i o n s i n c e w e a s s u m e d t h a t ( 2 4 ) h o l d s .

C a s e 4 : T h e a c t o r b i s n o t f i r a b l e i n M' b e c a u s e a l i n k I EF 2 ( b , M') c o n t a i n s a n u n c o n s u m e d t o k e n . S i n c e o n l y t o k e n s

o n F 1 ( B , M U ) c a n b e c o n s u m e d , 1 e F I ( B , M U ) . T h i s i s a g a i nc o n t r a r y t o t h e a s s u m p t i o n t h a t ( 2 4 ) h o l d s . T h u s , i f

F 1 ( B , M) = F 2 ( B , MU)

- t h e n t h e f i r i n g s e q u e n c e a i s l i v e i n M. Q . E . D .D e f i n i t i o n 7 : A d a t a f l o w g r a p h i s l i v e ( d e a d l o c k f r e e ) i n a

m a r k i n g Mi f a l l a c t o r s a E A a r e l i v e i n M.T h e o r e m 2 : A d a t a f l o w g r a p h i s l i v e i n a m a r k i n gMi f a n d

o n l y i f a l l f i r i n g s e q u e n c e s a ar e l i v e i n M.P r o o f : N e c e s s a r y c o n d i t i o n . I f t h e d a t a f l o w g r a p h i s l i v e

i n M, t h e n a l l f i r i n g s e q u e n c e s ar e l i v e i n M.S u p p o s e t h a t t h e d a t a f l o w g r a p h i s l i v e i n M, b u t t h e r e

e x i s t s a f i r i n g s e q u e n c e a t h a t i s n o t l i v e i n M. B y D e f i n i t i o n 6 ,t h e r e e x i s t s a n a c t o r a E a t h a t i s n o t l i v e i n m a r k i n g M' EM U . T h e n b y D e f i n i t i o n 7 , t h e d a t a f l o w g r a p h i s n o t l i v e i n M.

S u f f i c i e n t C o n d i t i o n . I f a l l f i r i n g s e q u e n c e s a a r e l i v e i n M ,

t h e n t h e d a t a f l o w g r a p h i s l i v e i n M. S u p p o s e t h a t a l l f i r i n g

9 4 5

N o t e : P + P 2 + A 3 = J 4 + P s = P 6 + P 7 = P A + P 9 = P I o + P I = 1 -

F i g . 5 . F i r i n g s e m a n t i c s e t s f o r t h e e x a m p l e .

Authorized licensed use limited to: University of North Texas. Downloaded on July 27, 2009 at 14:42 from IEEE Xplore. Restrictions apply.

Page 7: A Formal Definition of DFG Models

8/6/2019 A Formal Definition of DFG Models

http://slidepdf.com/reader/full/a-formal-definition-of-dfg-models 7/9

Page 8: A Formal Definition of DFG Models

8/6/2019 A Formal Definition of DFG Models

http://slidepdf.com/reader/full/a-formal-definition-of-dfg-models 8/9

KAVI e t a l . : DATA FLOW GRAPH MODELS

whereBs the set of actors belonging to a l . The f i r i n g

sequence a' is live in M, since

F l ( B , M , t ) = F 2 ( B , M , 1 ) -Forthefiring c ycle a 2 ,

F,(C, M, 2)= { 1 1 , 1 2 , 1 3 , 1 4 , 1 6 , '10, i l l , 12,

1 1 9 , 1 2 3 , 124, 1 2 5 , 1 2 6 , 127, 1 2 9 ,

1 3 1 }

F 2 C , M ]) { , 1 2 , 1 3 , 1 4 , 1 6 , 1 1 0 , 1 1 1 , 1 1 2 ,

'19, 123, 124, 1 2 5 , 1 2 6 , 127, 128, 129, 131}

whereCs the set of actors belonging to a 2 . Ascan be s e e n

F,(C, M _ 2 ) # F 2 ( C , M_2)

andhencethe f i r i n g s e q u e n c e a 2 is not live in M,. S i m i l a r l y ,the f i r i n g s e q u e n c e a3 is not live in M,. These f i r i n g s e q u e n c ecanbemade live b y s e p a r a t i n g the two f i r i n g c y c l e s ( b ycreating twodistinct execute actors for arithmetic and store

instructions).

Remarks:Theorem 1 must be a p p l i e d to check if f i r i n gin a data flow graph are l i v e , given t hat the c y c l e s are

Thus, in the above example, F 2 ( a 4 , M 4 ) = { 1 5 } ,{ 1 6 } , { 1 7 } , f o r t h e f i r i n g c y c l e s a I , a 2 , a 3 , r e s p e c t i v e l y .Thef i r i n g cycle a 2 becomes live if the conditional p r o b a b i l -

t y P[F2(a18, M 1 9 ) =1 2 7 / F 2 ( a 4 , M 4 ) = 1 6 1 = 1 . This i s t h e

whencontrol links and control arcs are used t o eliminate

ks in data flow graphs [ 2 0 1 .

The theorems pr esent ed here do not g u a r a n t e e that t h e

of tokens flowing through a data flow g r a p h remains

but that the tokens are conserved over a f i r i n g c y c l e .allows for some actors

consumingmoretokens

than t h e yand others producing moretokens than t h e y consume.

in a nonterminating deadlock-free data flow g r a p h , a l l

s e q u e n c e s are r e p e a t a b l e .Before using thedeadlocktheorems, a data flow g r a p h must

etransformed to conform to the d efi ni tio ns p r e s e n t e d in t h i s

The control arcs and links must be removed. F i r i n gmay be discovered b y examining circuits in the g r a p h .the liveness of the f i r i n g c y c l e s can be v erified.

IV. CONCLUSIONS

In this paper a formal definition of data flow g r a p h s i sThe definition is based on t h e data

flow modelo r i g i n a l l y b y Dennis [ 6 ] . N e c e s s a r y and s u f f i c i e n t

for liveness in data flow g r a p h s are derived. The

data flow graph can be used to model c o m p u t e rand the performance and r e l i a b i l i t y of th e modeledcan be analyzed b y i n t r o d u c i n g stochastic p r o p e r t i e s

data flow g r a p h s . I s o m o r p h i c m a p p i n g s b e t w e e n P e t r i

anddata flow graphs are p r e s e n t e d in a s e p a r a t e p a p e r .mappings enable the mathematical formulations u s e d f o r

tri nets to beemployed in a n a l y z i n g data flow g r a p h models.

REFERENCES

[ 1 ] W.B.Ackernann, "Dataflowlanguages," in Proc. 1979NCC, New

York,

p p.1087-1095.

[2] , "Dataflow languages," IEEEComputer, p p . 1 5 - 2 5 , Feb.1982.

3 ] Arvind, K. P. Gost elow, and W. Pflouffe, "An asynchronous

94 7

p r o g r a m m i n g l a n g u a g e a n d c o m p u t i n g m a c h i n e , " D e p . I n f o r m . Com-p u t . S c i . , U n i v . C a l i f o r n i a , I r v i n e , T e c h . R e p . 1 1 4 a , D e c . 1 9 7 8 .

[ 4 ] J . B a c k u s , "Can p r o g r a m s b e l i b e r a t e d f r o m v o n Neumann s t y l e ? Af u n c t i o n a l s t y l e a n d i t s a l g e b r a o f p r o g r a m s , " CACM, p p . 6 1 3 - 6 4 1 ,A u g . 1 9 7 8 .

[ 5 ] J . L . B a e r , C o m p u t e r S y s t e m s A r c h i t e c t u r e . R o c k v i l l e , MD:C o m p u t e r S c i e n c e , 1 9 8 0 .

[ 6 ] J . B . D e n n i s , " F i r s t v e r s i o n o f d a t a f l o w p r o c e d u r a l l a n g u a g e , "L e c t u r e N o t e s i n C o m p u t e r S c i e n c e , V o l . 1 9 . B e r l i n : S p r i n g e r -V e r l a g , 1 9 7 4 .

[ 7 ] J . B . D e n n i s a n d D . P . M i s u n a s , "A p r e l i m i n a r y a r c h i t e c t u r e f o r ab a s i c d a t a f l o w p r o c es s o r ," i n P r o c . 2nd S y m p . C o m p u t . A r c h i t e c t . ,H o u s t o n , T X , 1 9 7 5 , p p . 1 2 6 - 1 3 2 .

[ 8 ] J . B . D e n n i s , " D a t a f l o w s u p e r c o m p u t e r s , " IEEE C o m p u t e r , p p . 4 8 -5 6 , N o v . 1 9 8 0 . .

[ 9 ] J . - L . G a u d i o t a n d M . D . E rc eg o v a c, " P e r f o r m an c e a n a l y s i s o f d a t af l o w c o m p u t e r s w i t h v a r i a b l e r e s o l u t i o n a c t o r s , " i n P ro c . 4 t h I n t .C o n f . D i s t r i b . C o m p u t . S y s t . , S a n F r a n c i s c o , C A , May 1 9 8 4 , p p . 2 -9 .

[ 1 0 ] J . B . D u g a n , K . S . T r i v e d i , R . G e i s t , a n d V . F . N i c o l a , " E x t e n d e ds t o c h a s t i c P e t r i n e t s : A p p l i c a t i o n s a n d a n a l y s i s , " P e r f o r m a n c e 8 4 , E .G e l e n e b e , E d . A m s t e r d a m , T h e N e t h e r l a n d s : N o r t h H o l l a n d , 1 9 8 4 .

[ 1 1 ] R . M. K a r p a n d R . E . M i l l e r , " P r o p e r t i e s o f a m o d e l f o r p a r a l l e lc o m p u t a t i o n s : D e t e r m i n a c y , t e r m i n a t i o n , a n d q u e u e i n g , " SIAM J .A p p l . M a t h . , v o l . 1 4 , p p . 1 3 9 0 - 1 4 1 1 , N o v . 1 9 6 6 .

[ 1 2 ] K . M. K a v i , " D a t a f l o w m o d e l i n g t e c h n i q u e s , " i n P r o c . I A S T E D I n t .S y m p . S i m u l a t i o n and M o d e l i n g , O r l a n d o , F L, N o v . 1 9 8 3 , p p . 1 - 4 .

[ 1 3 ] K . M. K a v i , B . P . B u c k l e s , a n d U . N . B h a t , " I s o m o r p h i s m s b e t w e e nP e t r i n e t s a n d d a t a f l o w g r a p h s , " IEEE T r a n s . S o f t w a r e E n g . , t o b ep u b l i s h e d .

[ 1 4 ] , " R e l i a b i l i t y a n a l y s i s o f d a t a f l o w g r a p h m o d e l s , " D e p . C o m p u t .S c i . E n g . , U n i v . T e x a s , A r l i n g t o n , T e c h . R e p . C S E - 8 5 - 0 0 3 , 1 9 8 5 .

[ 1 5 ] L . K l e i n r o c k , Q u e u e i n g S y s t e m s , V o l . 2 . C o m p u t e r A p p l i c a t i o n s .Ne w Y o r k : W i l e y , 1 9 7 6 .

[ 1 6 ] S . P . L a n d r y , " S y s t e m o r i e n t e d e x t e n s i o n s t o d a t a f l o w , " P h . D .d i s s e r t a t i o n , D e p . C o m p u t . S c i . , U n i v . S o u t h w e s t e r n L o u i s i a n a ,L a f a y e t t e , May 1 9 8 1 .

[ 1 7 ] M. A . M a r s o n , G . B a l b o , a n d G . C o n t e , "A c l a s s o f g e n e r a l i z e ds t o c h a s t i c P e t r i n e t s f o r t h e p e r f o r m a n c e e v a l u a t i o n o f m u l t i p r o c e s s o rs y s t e m s , " i n P r o c . ACM SIGMETRICS C o n f . M e a s u r e m e n t a n dM o d e l i n g , 1 9 8 3 .

[ 1 8 ] M. M e a s u r e s , B . D . S h r i v e r , a n d P . A .C a r r , "A d i s t r i b u t e d o p e r a t i n gs y s t e m b a s e d o n d a t a f l o w p r i n c i p l e s , " i n P r o c . COMPCON, S e p t .

1 9 8 2 , p p . 1 0 6 - 1 1 5 .[ 1 9 ] R . E . M i l l e r , "A c o m p a r i s o n o f s o m e t h e o r e t i c a l m o d e l s o f p a r a l l e l

c o m p u t a t i o n , " IEEE T r a n s . C o m p u t . , v o l . C - 2 2 , p p . 7 1 0 - 7 1 7 , A u g .1 9 7 3 .

[ 2 0 ] D . P . M i s u n a s , " D e a d l o c k a v o i d a n c e i n d a t a f l o w a r c h i t e c t u r e , " i nP r o c . S y m p . A u t o m a t . C o m p u t a t i o n a n d C o n t r . , M i l w a u k e e , W I ,A p r . 1 9 7 5 , p p . 3 3 7 - 3 4 3 .

[ 2 1 ] M. K . M o l l o y , "On t h e i n t e g r a t i o n o f d e la y ed t h r ou g h p u t m e a s u r e s i nd i s t r i b u t e d p r o c e s s i n g m o d e l s , " P h . D . d i s s e r t a t i o n , U n i v . C a l i f o r n i a ,L o s A n g e l e s , 1 9 8 1 .

[ 2 2 ] , " P e r f o r m a n c e a n a l y s i s u s i n g s t o c h a s t i c P e t r i n e t s , " IEEET r a n s . C o m p u t , v o l . C - 3 1 , p p . 9 1 3 - 9 1 7 , S e p t . 1 9 8 2 .

[ 2 3 ] V . P . S r i n i a n d J . F . A s e n j o , " A n a l y s i s o f C r a y I S a r c h i t e c t u r e , " i nP r o c . 1 0 t h S y m p . C o m p u t . A r c h i t e c t . , S t o c k h o l m , S w e d e n , p p . 1 9 4 -

2 0 6 , J u n e 1 9 8 3 .[ 2 4 ] P . C . T r e l e a v e n , D . R . B r o w n b r i d g e , a n d R . P . H o p k i n s , " D a t a d r i v e na n d d e m a n d d r i v e n c o m p u t e r a r c h i t e c t u r e , " ACM C o m p u t . S u r v . ,M a r . 1 9 8 2 , p p . 9 3 - 1 4 3 .

[ 2 5 ] K . S . T r i v e d i , " A n a l y t i c a l m o d e l i n g o f c o m p u t e r s y s t e m s , " IEEEC o m p u t e r , p p . 3 8 - 5 6 , O c t . 1 9 7 8 .

K r i s h n a M. K a v i r e c e i v e d t h e B . E . d e g r e e i ne l e c t r i c a l e n g i n e e r i n g f r o m t h e I n d i a n I n s t i t u t e o fS c i e n c e , t h e M . S . a n d P h . D . d e g r e e s i n c o m p u t e rs c i e n c e f r o m S o u t h e r n M e t h o d i s t U n i v e r s i t y , D a l l a s ,T X , i n 1 9 7 5 , 1 9 7 7 , a n d 1 9 8 0 , r e s p e c t i v e l y .

He i s a n A s s o c i a t e P r o f e s s o r a t t h e U n i v e r s i t y o fT e x a s , A r l i n g t o n . P r i o r t o j o i n i n g t h e f a c u l t y o f t h e

U n i v e r s i t y o f T e x a s , h e was w i t h t h e U n i v e r s i t y o fS o u t h w e s t e r n L o u i s i a n a , L a f a y e t t e . H i s i n t e r e s t si n c l u d e d a t a f l o w a r c h i t e c t u r e , h i g h - l e v e l l a n g u a g ea r c h i t e c t u r e , d i s t r i b u t e d o p e r a t i n g s y s t e m s , a n d

Page 9: A Formal Definition of DFG Models

8/6/2019 A Formal Definition of DFG Models

http://slidepdf.com/reader/full/a-formal-definition-of-dfg-models 9/9

IEEE TRANSACTIONS ON COMPUTERS, VOL. C - 3 5 , N O . 1 1 , NOVEMBER 1 9 8 6

p e r f o r m a n c e e v a l u a t i o n o f c o m p u t e r s y s t e m s . A s s o c i a t i o n f o r Computing Machinery, an d t h e I n t e r n a t i o n a l Fu z z y Systems

D r . K a v i i s a member o f t h e I E E E C o m p u t e r S o c i e t y , A s s o c i a t i o n f o r A s s o c i a t i o n .

C o m p u t i n g M a c h i n e r y , S i g m a X i , a n d U p s i l o n P i E p s i l o n .

Bill P. Buckles (SM'82) received the M.A. degreei n o p e r a t i o n s r e s e a r c h , t h e M . A . d e g r e e i n com-

p u t e r s c i e n c e , a n d t h e P h . D . d e g r ee i n o p e r a t i o n sresearch from the University of Alabama, Hunts-

v i l l e , A L .

l P r e s e n t l y , he is anAssociate Professor ofCom-

p u t e r Science Engin e ering at the University ofl_ Texas, A r l i n g t o n . Prior t o his a p p o i n t m e n t , he was

a T e c h n i c a l S t a f f Member at C o m p u t e r S c i e n c e

Corporation, Science Applications Inc., and Gen-

e r a l R e s e a r c h C o r p o r a t i o n . He h as s er v ed a s P r i n c i -p a l I n v e s t i g a t o r on v a r i o u s N a t i o n a l S c i e n c e F o u n d a t i o n f u n d e d p r o j e c t s a s

w e l l a s , t h o s e s u p p o r t e d b y i n d u s t r i a l r e s e a r c h l a b o r a t o r i e s . He h a s over on e

d o z e n j o u r n a l p u b l i c a t i o n s . C u r r e n t l y , h i s i n t e r e s t s are P e t r i n e t m o d e l i n g a s i tr e l a t e s t o p a r a l l e l c o m p u t i n g a n d u n c e r t a i n t y r e p r e s e n t a t i o n i n d a t a b a s e s u s i n gf u z z y s e t t h e o r y .

D r . B u c k l e s i s a s e n i o r m e m b e r o f t h e IEEE C o m p u t e r S o c i e t y , t h e

U . N ar a y an B h a t r e c e i v e d t h e B . A . d e g r e e i nM at h em at i cs f r o m M a d r a s U n i v e r s i t y , I n d i a , t h eM.A. d e g r e e i n s t a t i s t i c s f r o m K a r n a t a k U n i v e r s i t y ,I n d i a , a n d t h e P h . D . d e g r e e i n s t a t i s t i c s f r o m t h eU n i v e r s i t y o f W e s t e r n A u s t r a l i a , P e r t h , i n 1 9 5 3 ,1 9 5 8 , a n d 1 9 6 5 , r e s p e c t i v e l y .

He has h e l d f a c u l t y p o s i t i o n s i n K a r n a t a k U n i v e r -

s i t y , 1 9 5 8 - 1 9 6 1 , t h e U n i v e r s i t y o f W e s t e r n A u s t r a -l i a , 1 9 6 5 , M f i c h i g a n S t a t e U n i v e r s i t y , E a s t L a n s i n g ,1 9 6 5 - 1 9 6 6 , C a s e W e s t e r n R e s e r v e U n i v e r s i t y ,C l e v e l a n d , OH 1 9 6 6 - 1 9 6 9 , a n d S o u t h e r n M e t h o d -

i s t U n i v e r s i t y , D a l l a s , T X , f r o m 1 9 6 9 t o t h e p r e s e n t , w h e r e h e i s a P r o f e s s o ro f S t a t i s t i c s a n d O p e r a t i o n s R e s e a r c h . He h a s a l s o h e l d v a r i o u s a d m i n i s t r a t i v ep o s i t i o n s a t SMUb e t w e e n 1 9 7 6 - 1 9 8 2 , t h e l a s t b e i n g t h e V i c e P r o v o s t a n d t h eD e a n f o r G r a d u a t e S t u d i e s . H i s r e s e a r c h i n t e r e s t s are i n t h e a r e a o f a p p l i e dp r o b a b i l i t y w i t h p a r t i c u l a r r e f e r e n c e t o s t o c h a s t i c m o d e l i n g o f q u e u e i n g ,r e l i a b i l i t y , a n d c o m p u t e r s y s t e m s . He i s t h e a u t h o r or c o a u t h o r o f t h r e e b o o k sa n d more t h a n 5 0 r e s e a r c h a r t i c l e s .

D r . B h a t i s a m e m b e r o f s e v e r a l p r o f e s s i o n a l s o c i e t i e s i n c l u d i n g t h eA m e r i c a n S t a t i s t i c a l A s s o c i a t i o n , O p e r a t i o n s R e s e a r c h S o c i e t y o f A m e r i c a ,a n d t h e I n s t i t u t e o f M a n a g e m e n t S c i e n c e s .

9 4 8


Recommended