Explanation of two non-blocking shared-variable communication algorithms

ISSN： 0934-5043

Source： Formal Aspects of Computing, Vol.25, Iss.6, 2013-11, pp. : 893-931

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

Related content

A two-level queueing network model with blocking and non-blocking messages

By Ramesh S. Perros H.G.

Annals of Operations Research, Vol. 93, Iss. 1-4, 2000-01 ,pp. : 357-372

Springer Publishing Company

Access to resources Recommend Favorite

A Non-Blocking Buffer Mechanism for Real-Time Event Message Communication

By Kim K.

Real-Time Systems, Vol. 32, Iss. 3, 2006-03 ,pp. : 197-211

Springer Publishing Company

Access to resources Recommend Favorite

Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory Multiprocessors

By Michael M.M. Scott M.L.

Journal of Parallel and Distributed Computing, Vol. 51, Iss. 1, 1998-05 ,pp. : 1-26

Academic Press

Access to resources Recommend Favorite

Optimal Algorithms for All-to-All Personalized Communication on Rings and Two Dimensional Tori

By Lam C.C. Huang C.-.H. Sadayappan P.

Journal of Parallel and Distributed Computing, Vol. 43, Iss. 1, 1997-05 ,pp. : 3-13

Academic Press

Access to resources Recommend Favorite

Systems of Communication: Information, Explanation, and Imagination

International Journal of Knowledge and Systems Science (IJKSS), Vol. 2, Iss. 2, 2011-04 ,pp. : 1-15

IGI Global_journal

Access to resources Recommend Favorite