Sciweavers

2030 search results - page 230 / 406
» Designing Complex Software Implementation Programs
Sort
View
MAM
2007
157views more  MAM 2007»
15 years 2 months ago
Executing large algorithms on low-capacity FPGAs using flowpath partitioning and runtime reconfiguration
This paper describes a new method of executing a software program on an FPGA for embedded systems. Rather than combine reconfigurable logic with a microprocessor core, this method...
Darrin M. Hanna, Michael DuChene
CASES
2003
ACM
15 years 8 months ago
Clustered calculation of worst-case execution times
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
Andreas Ermedahl, Friedhelm Stappert, Jakob Engblo...
DAC
2000
ACM
16 years 3 months ago
Formal verification of iterative algorithms in microprocessors
Contemporary microprocessors implement many iterative algorithms. For example, the front-end of a microprocessor repeatedly fetches and decodes instructions while updating interna...
Mark Aagaard, Robert B. Jones, Roope Kaivola, Kath...
KBSE
2007
IEEE
15 years 9 months ago
Adaptation hiding modularity
Growth in the complexity of computing systems, in the dynamism of the environments they operate in, and the need for timely adaptations as conditions change, now pose significant...
Yuanyuan Song
ARCS
2005
Springer
15 years 8 months ago
Organic Architectures for Large-Scale Environment-Aware Sensor Networks
This paper examines how methods inspired by biological processes can be applied to the design of large-scale environment-aware sensor networks. Our ultimate goal are systems conta...
Paul Lukowicz, Erhardt Barth, Jan T. Kim