2432 search results - page 73 / 487 » Using simple abstraction to reinvent computing for paralleli... |
109
click to vote
PARA
2004
Springer
15 years 3 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...
CONCUR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
PPOPP
2003
ACM
15 years 3 months ago
2003
ACM
In an intelligent memory architecture, the main memory of a computer is enhanced with many simple processors. The result is a highly-parallel, heterogeneous machine that is able t...
DAC
1999
ACM
15 years 2 months ago
1999
ACM
: In this work we propose a technique for spatial and temporal partitioning of a logic circuit based on the nodes activity computed by using a simulation at an higher level of ion....
PDP
2005
IEEE
15 years 3 months ago
2005
IEEE
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...