822 search results - page 111 / 165 » Contention in shared memory algorithms |
113
Voted
ICALP
1994
Springer
15 years 6 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
131
click to vote
IWOMP
2007
Springer
15 years 8 months ago
2007
Springer
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
126
click to vote
ACSD
2005
IEEE
15 years 8 months ago
2005
IEEE
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed processes in digital systems. In previous work, syst...
124
Voted
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
We present a method for the automatic generation of oligonucleotide probe sets for DNA microarrays. This approach is well suited particularly for specificity evaluation of design...
105
Voted
DATE
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper, we present an efficient methodology to validate high performance algorithms and prototype them using reconfigurable hardware. We follow a strict topdown Hardware/So...