Sciweavers

3047 search results - page 479 / 610
» Randomized Parallel Selection
Sort
View
136
Voted
IACR
2011
106views more  IACR 2011»
14 years 2 months ago
Hash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Bart Mennink, Bart Preneel
HPDC
2007
IEEE
15 years 9 months ago
Failure-aware checkpointing in fine-grained cycle sharing systems
Fine-Grained Cycle Sharing (FGCS) systems aim at utilizing the large amount of idle computational resources available on the Internet. Such systems allow guest jobs to run on a ho...
Xiaojuan Ren, Rudolf Eigenmann, Saurabh Bagchi
129
Voted
ICPP
2007
IEEE
15 years 9 months ago
ASAP: An Advertisement-based Search Algorithm for Unstructured Peer-to-peer Systems
— Most of existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a query and the query message is repeate...
Peng Gu, Jun Wang, Hailong Cai
131
Voted
IEEEPACT
2007
IEEE
15 years 9 months ago
Performance Portable Optimizations for Loops Containing Communication Operations
Effective use of communication networks is critical to the performance and scalability of parallel applications. Partitioned Global Address Space languages like UPC bring the pro...
Costin Iancu, Wei Chen, Katherine A. Yelick
120
Voted
IPPS
2007
IEEE
15 years 9 months ago
Optimizing Sorting with Machine Learning Algorithms
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
Xiaoming Li, María Jesús Garzar&aacu...