Sciweavers

1185 search results - page 67 / 237
» An Improved Parallel Thinning Algorithm
Sort
View
COCOON
2000
Springer
15 years 2 months ago
Recent Progress and Prospects for Integer Factorisation Algorithms
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
Richard P. Brent
IPPS
1999
IEEE
15 years 2 months ago
Fault-Tolerant Routing Algorithms for Hypercube Networks
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
Keiichi Kaneko, Hideo Ito
ICPP
1992
IEEE
15 years 1 months ago
A unifying Framework for Distributed Routing Algorithms
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
Alan Rooks, Bruno R. Preiss
IPPS
2003
IEEE
15 years 3 months ago
Dual Priority Algorithm to Schedule Real-Time Tasks in a Shared Memory Multiprocessor
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard realtime periodic tasks and soft-aperiodic tasks in shared memory multiproce...
Josep M. Banús, Alex Arenas, Jesús L...
PDP
2010
IEEE
15 years 3 months ago
DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm
Abstract—Among the numerous DAG scheduling heuristics suitable for heterogeneous systems, the Heterogeneous Earliest Finish Time (HEFT) heuristic is known to give good results in...
Luiz F. Bittencourt, Rizos Sakellariou, Edmundo R....