405 search results - page 34 / 81 » A Parallel Priority Data Structure with Applications |
127
Voted
HPDC
2007
IEEE
15 years 7 months ago
2007
IEEE
Grid applications often need to distribute large amounts of data efficiently from one cluster to multiple others (multicast). Existing methods usually arrange nodes in optimized t...
125
click to vote
PPOPP
2010
ACM
16 years 16 days ago
2010
ACM
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
134
click to vote
JPDC
2007
15 years 3 months ago
2007
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
138
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Dynamic memory management is one of the most expensive but ubiquitous operations in many C/C++ applications. Additional features such as security checks, while desirable, further w...
102
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Random binary matrices have found many applications in signal processing and coding. Rateless codes, for example, are based on the random generation of codewords by means of inner...