NUST Institutional Repository

C-SLOW BASED MICROPROGRAMMED FINITE STATE MACHINE FOR PARALLE THREAD EXECUTION.pdf

Show simple item record

dc.contributor.author AKRAM, MUHAMMAD ADEEL
dc.date.accessioned 2023-08-19T05:08:59Z
dc.date.available 2023-08-19T05:08:59Z
dc.date.issued 2010
dc.identifier.other 2007‐NUST‐MS PhD‐ComE‐03
dc.identifier.uri http://10.250.8.41:8080/xmlui/handle/123456789/36929
dc.description Supervisor: DR SHOAB A.KHAN en_US
dc.description.abstract To increase the throughput of system is the requirement of many designs. Normally for FPGA based designs pipelining is used to increase the throughput of the system. Pipelining increases the throughput of the system by introducing multiple inputs in a pipeline. Pipeline increases latency for single computation. But the total number of outputs per unit time increases. Pipelining has advantages for the designs which have only feed forward circuits. The designs where feedback loops also part of the design, pipelining cannot perform well. In those scenarios, c‐slow is the better approach. C‐slow increases the throughput of the system even in the presence of feedback loops. C‐slow increases the throughput by taking the advantage of parallel computation i.e. multiple threads are executed in parallel. For this purpose each register in the design is replaced with C number of registers. en_US
dc.language.iso en en_US
dc.publisher College of Electrical & Mechanical Engineering (CEME), NUST en_US
dc.title C-SLOW BASED MICROPROGRAMMED FINITE STATE MACHINE FOR PARALLE THREAD EXECUTION.pdf en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

  • MS [329]

Show simple item record

Search DSpace


Advanced Search

Browse

My Account