On Stochastic Scheduling with In-Tree Precedence Constraints
We consider the problem of optimal scheduling of a set of jobs obeying in-tree precedence constraints, when a number $M$ of processors is available. It is assumed that the service times of different j...
We consider the problem of optimal scheduling of a set of jobs obeying in-tree precedence constraints, when a number $M$ of processors is available. It is assumed that the service times of different j...
Complexity of Views: Tree and Cyclic Schemas
In relational databases a view definition is a query against the database, and a view materialization is the result of applying the view definition to the current database. A view materialization over...
In relational databases a view definition is a query against the database, and a view materialization is the result of applying the view definition to the current database. A view materialization over...
You are not logged in to this journal. Log in
Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers
SIAM J. Comput. Volume 16, Issue 1, pp. 7-16 (1987)
Issue Date: 1987
Connotea
CiteULike
del.icio.us
BibSonomy
The paper presents a sublinear time parallel algorithm for computing the greatest common divisor of two integers. Its running time on two $n$ bit integers is $O({{n\log \log n} / {\log n}})$ using the weak concurrent read concurrent write model.
©1987 Society for Industrial and Applied Mathematics
| History: | Received 1985-09-23; accepted 1986-05-26 |
| Permalink: | http://dx.doi.org/10.1137/0216002 |
KEYWORDS and AMS
PUBLICATION DATA
0097-5397 (print)
1095-7111 (online)
SIAM