Asynchronous Algorithms for Shared Memory Machines
Wu, Michael M.
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/75707
Description
Title
Asynchronous Algorithms for Shared Memory Machines
Author(s)
Wu, Michael M.
Issue Date
1991-12
Keyword(s)
Communication protocols
Communicating finite-state machines
Parallel algorithms
Asynchronous algorithms
Graph algorithms
Connected components
Minimum spanning tree
Publisher
Applied Computation Theory, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.