Please use this identifier to cite or link to this item: http://localhost:8081/jspui/handle/123456789/9075
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSharma, Dinesh Chandra-
dc.date.accessioned2014-11-18T08:39:10Z-
dc.date.available2014-11-18T08:39:10Z-
dc.date.issued1986-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9075-
dc.guideSingh, Kuldeep-
dc.description.abstractMany applications needs processing speed which cannot be achieved by•a single processing element. Concurrent processing is considered a proper approach for increasing speed. Interconnection network helps in performing this operation. In this thesis, an attempt has been made to represent the delta network in the form of a matrix, to develop a control algorithm which facilitates to connect a desired source to a desired destination and to provide a conflict resolution algorithm. Fault Diagnosis and Fault Tolerance of Delta network is considered. Dynamic full access property is used to examine the behaviour of delta network La.. the presence of a fault. The work is concluded by proposing a fault tolerant structure of delta network, termed extra stage delta network. In the proposed network, the Fault tolerance is achieved by providing multiple disjoint paths between every input and output. Additional paths are obtained by adding an extra stage of switching elements to the delta network. The ability of extra stage delta network to operate with single and multiple faults in examined.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.titleON SOME ASPECTS OF DELTA NETWORKen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number178937en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD178937.pdf3.82 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.