Sciweavers

6897 search results - page 7 / 1380
» Parallelization of Modular Algorithms
Sort
View
PODC
2010
ACM
13 years 11 months ago
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
James Aspnes
ACL
1998
13 years 8 months ago
A Simple Hybrid Aligner for Generating Lexical Correspondences in Parallel Texts
We present an algorithm for bilingual word alignment that extends previous work by treating multi-word candidates on a par with single words, and combining some simple assumptions...
Lars Ahrenberg, Mikael Andersson, Magnus Merkel
ISVLSI
2002
IEEE
104views VLSI» more  ISVLSI 2002»
14 years 11 days ago
Scalable VLSI Architecture for GF(p) Montgomery Modular Inverse Computation
Modular inverse computation is needed in several public key cryptographic applications. In this work, we present two VLSI hardware implementations used in the calculation of Montg...
Adnan Abdul-Aziz Gutub, Alexandre F. Tenca, &Ccedi...
PLDI
2012
ACM
11 years 10 months ago
Parallelizing top-down interprocedural analyses
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, Sri...
ARITH
2003
IEEE
14 years 23 days ago
A VLSI Algorithm for Modular Multiplication/Division
We propose an algorithm for modular multiplication/division suitable for VLSI implementation. The algorithm is based on Montgomery’s method for modular multiplication and on the...
Marcelo E. Kaihara, Naofumi Takagi