Abstract: A computing device, including a hardware accelerator configured to receive a first matrix and receive a second matrix. The hardware accelerator may, for a plurality of partial matrix regions, in a first iteration, read a first submatrix of the first matrix and a second submatrix of the second matrix into a front-end processing area. The hardware accelerator may multiply the first submatrix by the second submatrix to compute a first intermediate partial matrix. In each of one or more subsequent iterations, the hardware accelerator may read an additional submatrix into the front end processing area. The hardware accelerator may compute an additional intermediate partial matrix as a product of the additional submatrix and a submatrix reused from an immediately prior iteration. The hardware accelerator may compute each partial matrix as a sum of two or more of the intermediate partial matrices and may output the plurality of partial matrices.

Abstract: A system for executing instructions is presented. In some embodiments, among others, the system comprises functional units, local multiplexers, local register files, and a global register file, which are communicatively coupled to each other and arranged to accommodate shortened instruction words in multiple-issue processors. These components are arranged to permit greater access to registers by instructions, thereby permitting reduction of the word length, as compared to conventional very long instruction word (VLIW) processors.

Abstract: Systems and methods are presented in which nodes are interconnected using both a wide ring and a narrow ring. The wide ring has a data capacity that is greater than the data capacity of the narrow ring. Each node transmits and receives data over both the wide ring and the narrow ring, depending on the size of the data packets. The narrow ring is used to transport data having a relatively small data capacity, while the wide ring is used to transport data having a packet size that exceeds the data capacity of the narrow ring. In some embodiments, a “pull” mechanism is employed in order to avoid deadlocks in data transport.