Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/6701
Full metadata record
DC FieldValueLanguage
dc.contributor.authorOuld-Khaoua, Adel-Salah-
dc.contributor.authorTerranti, Hichem-
dc.date.accessioned2020-11-08T09:58:24Z-
dc.date.available2020-11-08T09:58:24Z-
dc.date.issued2020-
dc.identifier.urihttp://di.univ-blida.dz:8080/jspui/handle/123456789/6701-
dc.descriptionill., Bibliogr.fr_FR
dc.description.abstractThe main objective of this project is to evaluate the performance of some well-known topologies that have been proposed for Networks-on-Chip including the mesh and torus. Whereas existing studies have focused on the graph-theoretical merits of such topologies, our study examines the performance of networks-on-chip taking into account the constraints imposed by implementation technology. The most relevant constraint for networks-on-chip is the wiring density of the chip. To achieve our goal, we have developed a simulation model using the discrete-event simulation technique. Extensive simulation experiments have been performed and the collected results indicate that while the bidirectional torus has superior performance when technological constraints are ignored due to its richer connectivity, its performance degrades considerably compared to the mesh once technological constraints are considered. Our results also indicate that the 2D topologies are more suitable for networks-on-chip than their 3D counterparts as they are a better fit for practical implementations.fr_FR
dc.language.isoenfr_FR
dc.publisherUniversité Blida 1fr_FR
dc.subjectPerformance Evaluationfr_FR
dc.subjectNetworks On-chip Topologiesfr_FR
dc.subjecttopologie:fr_FR
dc.subjectthe torusfr_FR
dc.subjectthe meshfr_FR
dc.titlePerformance Evaluation of Networks On-chip Topologiesfr_FR
dc.typeThesisfr_FR
Appears in Collections:Mémoires de Master

Files in This Item:
File Description SizeFormat 
Ould-Khaoua Adel Salah et Terranti Hichem.pdf1,41 MBAdobe PDFView/Open


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