Bharath, N and Nandy, SK (2004) A Runtime Mechanism for Detection of Artificial Deadlocks in Process Networks. In: The 2004 47th Midwest Symposium on Circuits and Systems. MWSCAS '04, 25-28 July, Hiroshima,Japan, Vol.2, 437-440.
Kahn process network (KPN) is a popular model of computation for describing streaming applications arising in media and signal processing. KPN is a collection of sequential processes that communicate through unidirectional unbounded FIFOs. The illusion of unbounded FIFOs has to be met with finite memory in real implementations. This could potentially lead to a violation of Kahn semantics, thereby resulting in "artificial deadlocks". In this paper, we address this issue and present a runtime mechanism for early detection and resolution of such artificial deadlocks.
|Item Type:||Conference Paper|
|Additional Information:||©1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Information Sciences > Supercomputer Education & Research Centre|
|Date Deposited:||13 Dec 2005|
|Last Modified:||19 Sep 2010 04:22|
Actions (login required)