Design a bounded lock-based queue implementation using an array instead of a linked list. 1.Allow parallelism by using two separate locks for head and tail. 2.Try to transform your algorithm to be...

Design a bounded lock-based queue implementation using an array instead of a linked list.

1.Allow parallelism by using two separate locks for head and tail. 2.Try to transform your algorithm to be lock-free. Where do you run into difficulty?

10.4.In the deq()method of the unbounded lock-based queue is it necessary to hold the lock when checking that the queue is not empty? Explain.