1490 search results - page 126 / 298 » Models and Algorithms for Optical and Optoelectronic Paralle... |
GD
2003
Springer
14 years 1 months ago
2003
Springer
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
As high-end computer systems present users with rapidly increasing numbers of processors, possibly also incorporating attached co-processors, programmers are increasingly challeng...
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the firs...
ISCA
2000
IEEE
14 years 13 days ago
2000
IEEE
Spatial-lattice computations with finite-range interactions are an important class of easily parallelized computations. This class includes many simple and direct algorithms for ...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...