Hardware / software partitioning for custom instruction processors
| dc.contributor | Ph.D. Program in Computer Engineering. | |
| dc.contributor.advisor | Özturan, Can. | |
| dc.contributor.advisor | Dündar, Günhan, | |
| dc.contributor.author | Atasu, Kubilay. | |
| dc.date.accessioned | 2023-03-16T10:13:30Z | |
| dc.date.available | 2023-03-16T10:13:30Z | |
| dc.date.issued | 2007. | |
| dc.description.abstract | In this thesis, we describe an integer linear programming (ILP) based system called CHIPS for identifying custom instructions given the available data bandwidth and transfer latencies between the base processor and the custom logic. Our approach, which involves a baseline machine supporting architecturally visible custom state registers, enables designers to optionally constrain the number of input and output operands for custom instructions. We describe a comprehensive design flow to identify the most promising area, performance, and code size trade-offs. We study the effect of the constraints on the number of input/output operands and on the number of register file ports. Additionally, we explore compiler transformations such as if-conversion and loop unrolling. Our experiments show that, in most of the cases, the highest performing solutions are identified when the input/output constraints are removed. However, input/output constraints help our algorithms identify frequently used code segments, reducing the overall area overhead. We provide detailed results for eleven benchmarks covering cryptography and multimedia. We obtain speed-ups between 1.7 and 6.6 times, code size reductions between six per cent and 72 per cent, and area costs that range between 12 adders and 256 adders for maximal speed-up. We demonstrate that our ILP based solution scales well, and benchmarks with very large basic blocks consisting of up to 1000 instructions can be optimally solved, most of the time within a few seconds. We show that the state of the art techniques fail to find the optimal solutions on the same problem instances within reasonable time limits. We provide examples of solutions identified by our algorithms that are not covered by the existing methods. | |
| dc.format.extent | 30cm. | |
| dc.format.pages | xv, 107 leaves; | |
| dc.identifier.other | CMPE 2007 A83 PhD | |
| dc.identifier.uri | https://digitalarchive.library.bogazici.edu.tr/handle/123456789/12545 | |
| dc.publisher | Thesis (Ph.D.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2007. | |
| dc.relation | Includes appendices. | |
| dc.relation | Includes appendices. | |
| dc.subject.lcsh | Compilers (Computer programs) | |
| dc.subject.lcsh | Linear programming. | |
| dc.subject.lcsh | Integer programming. | |
| dc.title | Hardware / software partitioning for custom instruction processors |
Files
Original bundle
1 - 1 of 1