WORMHOLE DEADLOCK PREDICTION

Autor:	Miriam Di Ianni
Rok vydání:	2000
Předmět:	Hardware and Architecture Distributed computing Channel (programming) Edge chasing Routing algorithm Software_PROGRAMMINGTECHNIQUES Adaptive routing Deadlock Wormhole Deadlock prevention algorithms Software Theoretical Computer Science Mathematics
Zdroj:	Parallel Processing Letters. 10:295-303
ISSN:	1793-642X 0129-6264
DOI:	10.1142/s0129626400000287
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::a6859979d3fc6a773a363508554988b4 https://doi.org/10.1142/s0129626400000287 Zobrazit plný text záznamu