Deadlock detection for distributed process networks

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn V, Issue , 2005, Pages

  Olson, Alex G ^a   Evans, Brian L ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; CONCURRENT ENGINEERING; DATA TRANSFER; QUEUEING THEORY; SCHEDULING;

DEADLOCK DETECTION; FUNCTIONAL PARALLELISM; MULTI-THREADED TARGETS; PROCESS NETWORK (PN) MODEL;

TELECOMMUNICATION NETWORKS;

EID: 33646786119     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2005.1416243     Document Type: Conference Paper

References (15)

1. G. Kahn, "The semantics of a simple language for parallel programming," Information Processing, pp. 471-475, 1974.
2. G. E. Allen and B. L. Evans, "Real-time sonar beamforming on workstations using Process Networks and POSIX threads," in IEEE Trans. Signal Processing, Mar. 2000, pp. 921-926.
3. A. Amar, P. Boulet, J.-L. Dekeyser, and F. Theeuwen, "Distributed Process Networks using half FIFO queues in CORBA," INRIA, Tech. Rep. RR-4765, Mar. 2003. [Online]. Available: http://www.inria.fr/rrrt/rr-4765.html
4. T. Parks and D. Roberts, "Distributed Process Networks in Java," in International Workshop on Java for Parallel and Distributed Computing, Nice, France, Apr. 2003.
5. J. Vayssière, D. Webb, and A. Wendelborn, "Distributed Process Networks," University of Adelaide, Australia, Tech. Rep. TR 99-03, Oct. 1999, draft. [Online]. Available: http://www.cs.adelaide.edu.au/~dpn/ documents/tr9904.ps
6. T. M. Parks, "Bounded scheduling of Process Networks," Ph.D. dissertation, University of California at Berkeley, 1995. [Online]. Available: citeseer.ist.psu.edu/parks95bounded.html
7. J. T. Buck, "Scheduling dynamic dataflow graphs with bounded memory using the token flow model," Ph.D. dissertation, University of California at Berkeley, 1993. [Online]. Available: citeseer.ist.psu.edu/buck93scheduling. html
8. M. Geilen and T. Basten, "Requirements on the execution of Kahn Process Networks," in Programming Languages and Systems, 12th European Symposium on Programming, vol. 2618. Berlin, Germany: Springer-Verlag, 2003. [Online]. Available: http://www.ics.ele.tue.nl/~mgeilen/publications/esop03.pdf
9. R. M. Karp and R. E. Miller, "Properties of a model for parallel computations: Determinacy, termination, queueing," in SIAM Journal, vol. 14, Nov. 1966, pp. 1390-1411.
10. M. Goel, "Process Networks in Ptolemy II," Master's thesis, University of California at Berkeley, Dec. 1998. [Online]. Available: http://ptolemy.eecs.berkeley.edu/publications/papers/98/PNinPtolemyII/
11. B. Vaidyanathan, "Artificial deadlock detection and correction in bounded scheduling of Process Networks," Oct. 1999, uT Austin EE 382C-9 Embedded Software Systems Course Project. [Online]. Available: http://www.ece.utexas.edu/~bevans/courses/ee382c/projects/fal199
12. R. Stevens, M. Wan, P. Laramie, T. M. Parks, and E. A. Lee, "Implementation of Process Networks in Java," University of California, EECS Dept, Berkeley, CA, Tech. Memo. No. M97/84, 1997. [Online]. Available: http://www.ait.nrl.navy.mil/pgmt/PNpaper.pdf
13. E. A. de Kock, W. J. M. Smits, P. van der Wolf, J.-Y. Brunel, W. M. Kruijtzer, P. Lieverse, K. A. Vissers, and G. Essink, "Yapi: application modeling for signal processing systems," in IEEE Int. Design Automation Conference. ACM Press, 2000, pp. 402-405.
14. K. M. Chandy, J. Misra, and L. M. Hass., "Distributed deadlock detection," in ACM Trans. on Comp. Systems, vol. 1, no. 2, May 1983, pp. 144-156.
15. D. P. Mitchell and M. J. Merritt, "A distributed algorithm for deadlock detection and resolution," in ACM Symposium on Principles of Distributed Computing, 1984, pp. 282-284.