adplus-dvertising
frame-decoration

Question

A processor that continuously tries to acquire the locks, spinning around a loop till it reaches its success, is known as

a.

Spin locks

b.

Store locks

c.

Link locks

d.

Store operational

Posted under Computer Architecture

Answer: (a).Spin locks

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. A processor that continuously tries to acquire the locks, spinning around a loop till it reaches its success, is known as

Similar Questions

Discover Related MCQs

Q. The straight-forward model used for the memory consistency, is called

Q. One assigned operation for building synchronized operations, is called the

Q. To update the cached copies of the data item; is the alternative protocol which is known as

Q. One that programming model which allows for having a more efficient implementation, is to suppose that programs are

Q. When the home node being the local node, the copies may exist in a third node, called

Q. A remote node is being the node which has a copy of a

Q. Cases where variables gets updated without the order of the synchronization are called

Q. Plotting performance versus number of processors, is refered to as

Q. The alternative way of a snooping-based coherence protocol, is called a

Q. All writing procedures for same location are seen having same order; the stated property is called

Q. Private data that is used by a single-processor, then shared data are used by

Q. The requesting node sending the requested data starting from the memory, and the requestor which has made the only sharing node, known as

Q. The term which is named as shared memory with both SMP and DSM referring that the address space is

Q. Server clusters grow to 10th of thousands and beyond, are called

Q. In the coherent multiprocessor, caches that is present provides both the migration and

Q. The pair of instructions including a special load known as a load-linked or load-locked with a special store called a

Q. The directory must be tracking the group of nodes which have a copy of the block; then the used set is called

Q. For achieving a speedup up to 80 with 100 processors. What original computation fraction can be sequential

Q. Multiple-applications independently running, are typically called

Q. Fetch-and-increment is another task of the