The performance of asynchronous algorithms on hypercubes | Zendy

David E. Womble | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The performance of asynchronous algorithms on hypercubes

Author(s) -

David E. Womble

Publication year - 1988

Publication title -

osti oai (u.s. department of energy office of scientific and technical information)

Language(s) - English

Resource type - Reports

DOI - 10.2172/6548901

Subject(s) - asynchronous communication , hypercube , computer science , parallel computing , implementation , algorithm , parallel algorithm , node (physics) , theoretical computer science , computer network , programming language , structural engineering , engineering

Many asynchronous algorithms have been developed for parallel computers. Most implementations of asynchronous algorithms, however, have been for shared memory machines. In this paper, we study the implementation and performance of some common asynchronous algorithms on the NCUBE/ten, a 1024 node hypercube. In addition, we summarize existing theoretical work and discuss some classes of algorithms that can be made asynchronous and some that cannot. 16 refs., 3 figs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research