Implementation of Process Networksin JavaArnab Basu&H.P. Vijay KishenProcess NetworksConcurrent computation model, excellent for use in Computation IntensiveReal time applications in Signal and Image processing.Kahn PN -• Represented as Directed graphs. Nodes (processes) are connected by a setof Arcs (FIFO queues). Processes’ are seen as Mapping functions of datafrom the I/P to the O/P queue.• Blocking reads. Shown to be determinate, run in infinite memory.• Deadlock occurs when all nodes are blocked on read.• Model proves that the deadlock occurs irrespective of schedule chosen.Dataflow PN -• Leads to bounded memory execution eventually, if one exists.• Additional constraints of queues with token limit and blocking writes.• Artificial Deadlocks resolved by increasing the capacities of thequeues.Computation Graphs -• Have a threshold level(Tp) associated with each queue which decidewhen the associated sink function can execute.• Due to the restrictions placed on the model, it is proved that thegraphs terminate and that queue lengths are bounded.• It is also proved that irrespective of the sequence of firings of thenodes the output tokens that are produced remain the same.JavaFeatures- Object oriented, Strongly typed.- Support for threads, Exception Handling and Runtime checking.- Garbage collection.- Embedded JavaTM allows API’ to be configured as needed.- Tools to provide efficient translation of java into embedded
View Full Document
Unlocking...