Abstract | ||
---|---|---|
Both deadlock avoidance and recovery techniques suffer from severe performance degradation when the network is close to or beyond saturation. This performance degradation appears because messages block in the network faster than they are drained by the escape paths in the deadlock avoidance strategies or the deadlock recovery mechanism. Many parallel applications produce bursty traffic that may saturate the network during some intervals, significantly increasing execution time. Therefore, the use of techniques that prevent network saturation are of crucial importance. Although several mechanisms have been proposed in the literature to reach this goal, some of them introduce some penalty when the network is not fully saturated, require complex hardware to be implemented or do not behave well under all network load conditions. In this paper we propose a new mechanism to avoid network saturation that overcomes these drawbacks |
Year | DOI | Venue |
---|---|---|
2000 | 10.1109/IPDPS.2000.846043 | IPDPS |
Keywords | Field | DocType |
different end,wormhole networks,low latency,deadlock recovery,multiprocessor interconnection networks,network interface card micro-architectures,concurrency control,network saturation,resident queues design,performance degradation,design spectrum,high bandwidth user-level message,computer networks,multi-user environment,deadlock avoidance,efficient mechanism,prevent saturation,routing,hardware,read only memory,degradation,intelligent networks | Read-only memory,Saturation (chemistry),Concurrency control,Computer science,Parallel computing,Deadlock,Computer network,Recovery mechanism,Execution time,Intelligent Network,Wormhole,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-0574-0 | 19 | 0.99 |
References | Authors | |
14 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Baydal, E. | 1 | 19 | 0.99 |
Pedro López | 2 | 639 | 64.48 |
José Duato | 3 | 3481 | 294.85 |