Wormhole deadlock prediction

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Article , Conference object 01 Jan 1997 English Publisher:Springer Berlin HeidelbergJournal:Parallel Processing Letters, volume 10, pages 295-303 (issn: 0129-6264, eissn: 1793-642X,

Copyright policy )

Authors: Miriam Di Ianni;

doi: 10.1007/bfb0002733 , 10.1142/s0129626400000287

Wormhole deadlock prediction

- Summary
- Metrics

Abstract

Deadlock prevention is usually realized by forbidding transmissions that could eventually cause a deadlock to occur. However, an optimal routing algorithm with respect to channel utilization forbids transmissions only when they would bring the network into a configuration that will necessarily evolve into a deadlock. Hence, optimal deadlock prevention is closely related to deadlock prediction. In this paper it is shown that wormhole deadlock and livelock prediction is a hard problem for both oblivious and adaptive routing.

Related Organizations

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	2
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average