100 search results - page 20 / 20 » Optimising Graph Partitions Using Parallel Evolution |
191
Voted
ASPLOS
2008
ACM
15 years 8 months ago
2008
ACM
The recent shift in the industry towards chip multiprocessor (CMP) designs has brought the need for multi-threaded applications to mainstream computing. As observed in several lim...
188
Voted
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
177
Voted
IWMM
2009
Springer
16 years 28 days ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
178
Voted
SIAMSC
2010
15 years 1 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
164
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...