Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9319
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGupta, Vikas Kumar-
dc.date.accessioned2014-11-19T07:14:18Z-
dc.date.available2014-11-19T07:14:18Z-
dc.date.issued1995-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9319-
dc.guideKumar, Padam-
dc.description.abstractExploiting parallelism is an increasingly common approach to improve the performance of computer systems. In terms of hardware this typically means providing multiple, simultaneously active processors. In terms of software, this typically means structuring a program as a set of largely independent sub tasks. The structure of programs is usually represented by acyclic precedence graphs (APG's). The nodes of the graph denote the subtasks of the program and the directed arcs denote the precedence relations among the subtasks. The work, reported in this dissertation, evaluates the performance of two popular multiprocessor networks for graph structured programs, through simulation. Performance measures like speedup and efficiency have been studied by varying problem size, number of processors, granularity of task graphs, and degree of task nodes. The simulation system, developed •in this work, generates APG's and simulates the Hypercube and De Bruijn networks. A fast, static scheduling algorithm has been developed to schedule the generated APG on to the target processor networks. Performance measures are then computed for the obtained schedule. A comparative study of the performance of multiprocessor networks is then carried out.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectMULTIPROCESSINGen_US
dc.subjectHYPERCUBEen_US
dc.subjectDE BRUIJN NETWORKSen_US
dc.titleMULTIPROCESSING OF APG's ON HYPERCUBE AND De BRUIJN NETWORKSen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number246847en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD246847.pdf6.77 MBAdobe PDFView/Open


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