3616 search results - page 308 / 724 » Conditional Memory Ordering |
176
click to vote
PARA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
142
click to vote
SAS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
124
click to vote
SAT
2004
Springer
15 years 10 months ago
2004
Springer
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
161
click to vote
DATE
2003
IEEE
15 years 10 months ago
2003
IEEE
Reduction of both the test suite size and the download time of test vectors is important in today's System-On-a-Chip designs. In this paper, a method for compressing the scan...
131
Voted
DATE
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper details the first step of the Design Trotter framework for design space exploration applied to dedicated SOCs. The aim of this step is to provide metrics in order to gu...