Sciweavers

1528 search results - page 26 / 306
» On Signatures for Communication Graphs
Sort
View
MICRO
2009
IEEE
132views Hardware» more  MICRO 2009»
14 years 2 months ago
Finding concurrency bugs with context-aware communication graphs
Incorrect thread synchronization often leads to concurrency bugs that manifest nondeterministically and are difficult to detect and fix. Past work on detecting concurrency bugs ...
Brandon Lucia, Luis Ceze
HPCC
2011
Springer
12 years 7 months ago
Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
Abhinav Bhatele, Laxmikant V. Kalé
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 7 months ago
Communication-Efficient Construction of the Plane Localized Delaunay Graph
Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4 3 9 -spanner of the unit-disk graph UDG(V ). This algorithm makes only one ...
Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Dam...
IJNSEC
2006
98views more  IJNSEC 2006»
13 years 7 months ago
Comment on Improvement of the Miyazaki-Takaragi Threshold Digital Signature Scheme
To enhance applications of smart cards, Miyazaki and Takaragi proposed a (t, n) threshold digital signature scheme based on the security of elliptic curve discrete logarithm (ECDL...
Zuhua Shao
INFORMATICALT
2010
170views more  INFORMATICALT 2010»
13 years 4 months ago
A Provably Secure Proxy Signature Scheme in Certificateless Cryptography
A proxy signature scheme enables an original signer to delegate its signing capability to a proxy signer and then the proxy signer can sign a message on behalf of the original sign...
Hu Xiong, Fagen Li, Zhiguang Qin