1686 search results - page 277 / 338 » Programs as polygraphs: computability and complexity |
DAC
1997
ACM
15 years 1 months ago
1997
ACM
This paper examines the problem of statically analyzing the performance of embedded software. This problem is motivated by the increasing growth of embedded systems and a lack of ...
AVI
2008
15 years 2 days ago
2008
Computer visualization and networking have advanced dramatically over the last few years, partially driven by the exploding video game market. 3D hardware acceleration has reached...
SODA
2000
ACM
14 years 11 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
The realization of a control unit can be done using a complex circuitry or microprogramming. The latter may be considered as an alternative method of implementation of machine ins...
190
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...