Paper Info
Title
Allocation and mapping based reliability analysis of multistage interconnection networks
Abstract
Task allocation using cubic partitioning of multistage interconnection networks (MINs) offers several advantages over random allocation of resources. The objective of this paper is to analyze MIN reliability considering the cubic allocation algorithm. A comprehensive analytical model is derived for predicting reliability of MIN-based systems where tasks are allocated using the buddy strategy. System reliability with the free list allocation policy is computed via simulation. It is shown that the system reliability is dependent on the allocation algorithm and the free list policy is superior to the buddy scheme in this respect. Two types of mapping algorithms known as conventional and bit reversal are used on a baseline MIN to show that the same allocation algorithm can result in different reliability and performance. A performance-related reliability measure is analyzed using probability of acceptance as the performance measure to demonstrate the trade-offs between performance and reliability.
Year
DOI
Venue
1996
10.1109/12.509911
Computers, IEEE Transactions
Keywords
Field
DocType
fault tolerant computing,multistage interconnection networks,reliability,resource allocation,MIN reliability,bit reversal,cubic allocation algorithm,cubic partitioning,multistage interconnection networks,performance measure,reliability,reliability analysis,task allocation
Resource management,Free list,Algorithm design,Computer science,Parallel computing,Real-time computing,Allocation algorithm,Multistage interconnection networks,Fault tolerance,Resource allocation,Mapping algorithm
Journal
Volume
Issue
ISSN
45
5
0018-9340
Citations 
PageRank 
References 
1
0.36
10
Authors
3
Name
Order
Citations
PageRank
Prasant Mohapatra14344304.46
Chansu Yu2435.31
Chita R. Das325828.49