Efficient Synchronization Algorithms Using Fetch and Add on Multiple Bitfield Integers (Classic Reprint) - Tapa blanda

Sinopsis

Excerpt from Efficient Synchronization Algorithms Using Fetch and Add on Multiple Bitfield Integers

Harrison (see [harrison 86, has proposed the use of combining positive bitfield increments to special add and X processors which would have been substituted for memory. These add and x processors would directly support synchronizations primitives. The value returned by an add and X operation would indicate the state of some lock rather than the actual value of a memory cell modified by fetch-and-add. In contrast, the algorithms presented in this paper do not utilize any special hardware except fetch-and-add.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

"Sinopsis" puede pertenecer a otra edición de este libro.