165 search results - page 1 / 33 » Optimizing Matrix Multiplication on Heterogeneous Reconfigur... |
PARCO
2007
13 years 6 months ago
2007
FCCM
2008
IEEE
13 years 11 months ago
2008
IEEE
DATE
2010
IEEE
13 years 5 months ago
2010
IEEE
—Due to increase in demand for reconfigurability in embedded systems, real-time task scheduling is challenged by non-negligible reconfiguration overheads. If such overheads are n...
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....
ARC
2008
Springer
13 years 6 months ago
2008
Springer
As embedded applications are getting more complex, they are also demanding highly diverse computational capabilities. The majority of all previously proposed reconfigurable archite...