57 search results - page 2 / 12 » Matrix Computations on Heterogeneous Reconfigurable Systems |
IPPS
1999
IEEE
13 years 10 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....
DATE
2008
IEEE
14 years 14 days ago
2008
IEEE
Embedded systems are becoming increasingly complex. Besides the additional processing capabilities, they are characterized by high diversity of computational models coexisting in ...
ICPADS
2006
IEEE
14 years 1 days ago
2006
IEEE
—Recently, high-end reconfigurable computing systems that employ Field-Programmable Gate Arrays (FPGAs) as hardware accelerators for general-purpose processors have been built. T...
IPPS
2007
IEEE
14 years 9 days ago
2007
IEEE
When reconfigurable devices are used in modern embedded systems and their capability to adapt to changing application requirements becomes an issue, comprehensive modeling and de...
FPL
2007
Springer
14 years 5 days ago
2007
Springer
Today’s heterogeneous embedded systems combine components from different domains, such as software, analogue hardware and digital hardware. The design and implementation of thes...