Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Wait based (non spin lock) semaphore in Java.

IP.com Disclosure Number: IPCOM000012523D
Publication Date: 2003-May-13
Document File: 4 page(s) / 685K

Publishing Venue

The IP.com Prior Art Database

Abstract

Semaphore is well known concurrency control mechanism/structure. Semaphore is also one of the most generic concurrency control constructs as this can be used as a mutex, a conditional variable etc. Spin lock based semaphores consume computational resources and are not preferred. So there is need for an efficient non spin lock based semaphore in Java that does not consume computational resources (CPU cycles) during the wait time.

This text was extracted from a Microsoft Word document.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 54% of the total text.

MODALITY:� GEMS-IT/RS        � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � �

INVENTION TITLE: Wait based (non spin lock) semaphore in Java.

PROBLEM/BACKGROUND:

        � � � � � � � � � � � Java programming language is the foremost among the new age programming languages that have provided concurrent programming capability at the programming language level.� Concurrent programming is supported in Java programming language through the mechanism of Threads.� Since Java is object oriented programming language the usage of threads necessitates the usage of the synchronization mechanisms (concurrency control mechanisms) to ensure consistency in the data accessed.� The concurrent programming model supported by Java also needs other concurrency control mechanisms.

        � � � � � � � � � � � � � � � Semaphore is well known concurrency control mechanism/structure.� Semaphore is also one of the most generic concurrency control constructs as this can be used as a mutex, a conditional variable etc. Spin lock based semaphores consume computational resources and are not preferred. So there is need for an efficient non spin lock based semaphore in Java that does not consume computational resources (CPU cycles) during the wait time.

        � � � � � � � � � � � � � � � The design describes a unique way of creating a generic Semaphore in a non-spinlock based way.

Notes:

Spin lock: A process/thread gets allocated the processor time. That process/thread is waiting for a resource to become free. Instead of relinquishing the processor, as it is not ready; the process/thread occupies the processor executing empty (no op) instructions. This� � locks up the useful processor time and wastes the resource.

Mutex: A programming construct that is used to ensure only one user gains access to a shared resource at any point in time.

Conditional Variable: A programming construct tha...