No! You have to write your own busy-waiting-algorithm while the operating system provides you a semaphore.
A busy-waiting-algorithm can be compared with a two-state-semaphore (lock or unlock) but the concept of the semaphore is must more powerful. In theory an infinite number of states is possible. Thus you can control the access to a resource in different levels. Am Mittwoch, 6. Oktober 2004 10:55 schrieben Sie: > but this is like semaphore? > > thanks again > > ankit > > --- Robin Doer <[EMAIL PROTECTED]> wrote: > > Good morning! > > > > Ankit Jain ([EMAIL PROTECTED]) schrieb: > > > hi > > > > > > what is spin lock? > > > > http://en.wikipedia.org/wiki/Spin_lock > > > > aka "busy waiting". A thread is polling <something> > > until <something> says > > "ok" and the thread continues working. > > > > > thanks > > > > > > ankit > > > > Have fun, > > Robin > > > > - > > To unsubscribe from this list: send the line > > "unsubscribe linux-newbie" in > > the body of a message to [EMAIL PROTECTED] > > More majordomo info at > > http://vger.kernel.org/majordomo-info.html > > Please read the FAQ at > > http://www.linux-learn.org/faqs > > ________________________________________________________________________ > Yahoo! Messenger - Communicate instantly..."Ping" > your friends today! Download Messenger Now > http://uk.messenger.yahoo.com/download/index.html
pgpX2zkaWy6Xc.pgp
Description: PGP signature
