Wait-free implementations in message-passing systems

Author： Chaudhuri S. Herlihy M. Tuttle M.R.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.220, Iss.1, 1999-06, pp. : 211-245

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Deadlock-Free Incremental Replay of Message-Passing Programs

By Zambonelli F. Netzer R.H.B.

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 5, 2001-05 ,pp. : 667-678

Academic Press

Access to resources Recommend Favorite

Bounded time-stamping in message-passing systems

By Mukund M. Narayan Kumar K. Sohoni M.

Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. : 221-239

Elsevier

Access to resources Recommend Favorite

Finite-State Self-Stabilizing Protocols in Message-Passing Systems

By Howell R.R. Nesterenko M. Mizuno M.

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 5, 2002-05 ,pp. : 792-817

Academic Press

Access to resources Recommend Favorite

Message-passing environments for metacomputing

By Brune M.A. Fagg G.E. Resch M.M.

Future Generation Computer Systems, Vol. 15, Iss. 5, 1999-10 ,pp. : 699-712

Elsevier

Access to resources Recommend Favorite

Collective operations for wide-area message-passing systems using adaptive spanning trees

By Saito Hideo Taura Kenjiro Chikayama Takashi

International Journal of High Performance Computing and Networking, Vol. 5, Iss. 3, 2008-10 ,pp. : 179-188

Inderscience Publishers

Access to resources Recommend Favorite