IMPLEMENTATION OFPROCESS NETWORKS INJAVAArnab BasuVijay KishenEE382C-9Embedded Software SystemsInstructor: Dr Brian EvansUniversity of Texas at AustinProject GoalszDesign and Implementation of a PNFrameworkzDeadlock Detection and ResolutionzTest Framework with ActorszPerformance EvaluationApproach and ImplementationzQueues–Enqueue, Dequeue–increaseSizezEvent Based Programming–EventObject - PNBlockedEvent–Listeners - PNBlockedEventListenerzActor–listens for blocked events–deadlock/write block resolutionTest Framework with ActorszComputational PN Actors - GregAllen.zThe PN Demo from Ptolemy IIDeadlock Resolution andPerformance EvaluationSet Up: IBM PC AMDK6 400MHz, 128 Mbytes RAM, OS: WIN98QueueSize10 100 1000ParksTime(secs)Memory319.334718326.255378368.179541KahnTime(secs)Memory115.845015150.65879183.3215681ConclusionszPark’s PN implementation assuresbounded execution but at the cost ofexecution speedzSelection of initial capacity of queuesis of critical importance can beimproved with “tweaking”zTrade off execution time and memoryReferenceszPtolemy II design Documentationhttp://ptolemy.eecs.berkeley.edu/publications/papers/99/HMADzGreg Allen’s Computational ProcessNetwork Source
View Full Document