Difference between revisions of "Nxt-python-threads"
(→Basics of threads in Python: - Start) |
(Objects Added) |
||
Line 15: | Line 15: | ||
==== Modules ==== | ==== Modules ==== | ||
* <b>[http://docs.python.org/library/thread.html thread]</b> - low level thread library | * <b>[http://docs.python.org/library/thread.html thread]</b> - low level thread library | ||
− | * <b>[http://docs.python.org/library/threading.html threading]</b> - higher level library built on thread (addressed on this page) | + | * <b>[http://docs.python.org/library/threading.html threading]</b> - higher level library built on thread (addressed on this page) ([http://effbot.org/zone/thread-synchronization.htm excellent resource ]) |
====Thread Objects==== | ====Thread Objects==== | ||
Line 34: | Line 34: | ||
If you want to pass arguments to the thread at initialization, define the constructor function: <code>__init__()</code>. | If you want to pass arguments to the thread at initialization, define the constructor function: <code>__init__()</code>. | ||
+ | import threading | ||
+ | |||
class hello_world_thread( threading.Thread ): | class hello_world_thread( threading.Thread ): | ||
− | def __init__( self, message= | + | |
+ | def __init__( self, message = 'Hello World!' ): # default value for message | ||
threading.Thread.__init__( self ) # init the thread | threading.Thread.__init__( self ) # init the thread | ||
self.message = message | self.message = message | ||
− | + | ||
− | + | def run( self ): | |
print self.message | print self.message | ||
>>> hello_world_thread().start() # initialize and run | >>> hello_world_thread().start() # initialize and run | ||
Hello World! | Hello World! | ||
− | + | ||
>>> hello_world_thread('Hola Mundo!").start() # init and run with argument | >>> hello_world_thread('Hola Mundo!").start() # init and run with argument | ||
Hola Mundo! | Hola Mundo! | ||
+ | |||
+ | ==== Lock Objects ==== | ||
+ | Locks are the simplest synchronization primitive. They should be used when more than one thread can read or modify a resource. | ||
+ | |||
+ | Locks have two states: locked and unlocked; and they can be blocking or non-blocking. When trying to acquire a lock with blocking enabled (the default behavior), a thread will wait until it is available. | ||
+ | |||
+ | # defined globally | ||
+ | hammer = threading.Lock() | ||
+ | saw = threading.Lock() | ||
+ | |||
+ | # within a thread's run() function | ||
+ | hammer.acquire() | ||
+ | saw.acquire | ||
+ | |||
+ | try: | ||
+ | # do some work with hammer and saw | ||
+ | |||
+ | finally: # release lock, no matter what | ||
+ | hammer.release() | ||
+ | saw.release() | ||
+ | |||
+ | The try clause is not strictly necessary, but a safety feature that prevents an error in one thread from preventing another thread from acquiring the lock. | ||
+ | |||
+ | There is another type of lock called an RLock (Re-entrant Lock). See the section called [http://effbot.org/zone/thread-synchronization.htm#problems-with-simple-locking Problems with Simple Locking] for a good example of why this more complex lock is sometimes desirable. | ||
+ | |||
+ | ==== Semaphore Objects ==== | ||
+ | Semaphores are a locking mechanism that can be used to keep a count of resources available based on the number of times it has been acquired and released | ||
+ | |||
+ | Imagine a queue of people standing outside a restaurant. There is a limited number of available tables in the restaurant (kept track of by a semaphore). When a group of diners are seated (table is acquired), the semaphore is decremented and when the diners leave(table released), it is incremented. | ||
+ | |||
+ | When the number of available tables reaches zero, the diners trying to acquire a table are blocked and must wait until a table becomes available. | ||
+ | |||
+ | import threading | ||
+ | |||
+ | # defined globally | ||
+ | available_table = threading.BoundedSemaphore( 10 ) # 10 tables in restaurant | ||
+ | |||
+ | # in thread's run function | ||
+ | available_table.acquire() | ||
+ | try: | ||
+ | # eat | ||
+ | finally: | ||
+ | available_table.release() | ||
+ | |||
+ | Using a bounded semaphore, as in the above example is usually the best practice since it will throw an error when releasing more than the value it was initialized with (usually indicating a bug). In the above example, it would mean that an error would be generated if a table was released when none were acquired (i.e. making an 11th table available). The regular semaphore object will continue to increment the count no matter how many times it is called. | ||
+ | |||
+ | ==== Event Objects ==== | ||
+ | Event objects can be used for thread synchronization. There are three class functions: <code>set()</code>, <code>clear()</code> and <code>wait()</code>. | ||
+ | |||
+ | When a thread calls <code>wait()</code> for an event that is set, it will continue on immediately. When a thread calls <code>wait()</wait> for an event, it will wait until that event is set. More than one thread can be looking for the same event. | ||
+ | |||
+ | import threading | ||
+ | |||
+ | # globally defined | ||
+ | green_light = threading.Event() | ||
+ | |||
+ | # in traffic controller thread's run function | ||
+ | if driver_is_late(): | ||
+ | green_light.clear() | ||
+ | sleep( way_too_long ) | ||
+ | green_light.set() | ||
+ | |||
+ | # in driver thread's run function | ||
+ | green_light.wait() # block until green_light is set | ||
+ | # drive on | ||
+ | |||
+ | ==== Condition Objects ==== | ||
+ | Condition objects are closely related to locks. You can create a condition using an existing lock or a re-entrant lock will be created if one is not specified. | ||
+ | |||
+ | More than one thread can wait for a condition to be true (indefinitely or with a timeout). If a queue of objects is being processed by multiple threads, a condition can be used to | ||
− | + | is_alive() | |
− | + | self.name | |
− | + | ==== Timer Objects ==== | |
− | |||
− | Timer Objects |
Revision as of 00:20, 25 February 2010
Back to Robotics Main Page
Contents
Thread Basics
- Computing device - CPU, RAM, persistant store (two ARM CPUs, etc. in the NXT)
- Stored program; Fetch, decode, execute
- Execution context - instructions, data, program counter, stack
- Processes have all 4 (instructions, data, program counter, stack)
- Threads have PC and stack with shared ins and data
- Workshop analogy
- Concurrency and locking
- Issues and how they can be addressed
- Race conditions
- Deadlock
Basics of threads in Python
Modules
- thread - low level thread library
- threading - higher level library built on thread (addressed on this page) (excellent resource )
Thread Objects
When creating a thread, you will must always define a class function called run()
. This is the code that will be executed by the thread. When the run()
function exits, the thread is no longer alive.
import threading class hello_world_thread( threading.Thread ): def run( self ): print "Hello World!"
Starting the above thread is done by calling the start()
function. This will execute the run() function you've defined.
>>> hw = hello_world_thread() # initialize >>> hw.start() # run Hello World!
If you want to pass arguments to the thread at initialization, define the constructor function: __init__()
.
import threading class hello_world_thread( threading.Thread ): def __init__( self, message = 'Hello World!' ): # default value for message threading.Thread.__init__( self ) # init the thread self.message = message def run( self ): print self.message
>>> hello_world_thread().start() # initialize and run Hello World! >>> hello_world_thread('Hola Mundo!").start() # init and run with argument Hola Mundo!
Lock Objects
Locks are the simplest synchronization primitive. They should be used when more than one thread can read or modify a resource.
Locks have two states: locked and unlocked; and they can be blocking or non-blocking. When trying to acquire a lock with blocking enabled (the default behavior), a thread will wait until it is available.
# defined globally hammer = threading.Lock() saw = threading.Lock() # within a thread's run() function hammer.acquire() saw.acquire try: # do some work with hammer and saw finally: # release lock, no matter what hammer.release() saw.release()
The try clause is not strictly necessary, but a safety feature that prevents an error in one thread from preventing another thread from acquiring the lock.
There is another type of lock called an RLock (Re-entrant Lock). See the section called Problems with Simple Locking for a good example of why this more complex lock is sometimes desirable.
Semaphore Objects
Semaphores are a locking mechanism that can be used to keep a count of resources available based on the number of times it has been acquired and released
Imagine a queue of people standing outside a restaurant. There is a limited number of available tables in the restaurant (kept track of by a semaphore). When a group of diners are seated (table is acquired), the semaphore is decremented and when the diners leave(table released), it is incremented.
When the number of available tables reaches zero, the diners trying to acquire a table are blocked and must wait until a table becomes available.
import threading # defined globally available_table = threading.BoundedSemaphore( 10 ) # 10 tables in restaurant # in thread's run function available_table.acquire() try: # eat finally: available_table.release()
Using a bounded semaphore, as in the above example is usually the best practice since it will throw an error when releasing more than the value it was initialized with (usually indicating a bug). In the above example, it would mean that an error would be generated if a table was released when none were acquired (i.e. making an 11th table available). The regular semaphore object will continue to increment the count no matter how many times it is called.
Event Objects
Event objects can be used for thread synchronization. There are three class functions: set()
, clear()
and wait()
.
When a thread calls wait()
for an event that is set, it will continue on immediately. When a thread calls wait()</wait> for an event, it will wait until that event is set. More than one thread can be looking for the same event.
import threading
# globally defined
green_light = threading.Event()
# in traffic controller thread's run function
if driver_is_late():
green_light.clear()
sleep( way_too_long )
green_light.set()
# in driver thread's run function
green_light.wait() # block until green_light is set
# drive on
Condition Objects
Condition objects are closely related to locks. You can create a condition using an existing lock or a re-entrant lock will be created if one is not specified.
More than one thread can wait for a condition to be true (indefinitely or with a timeout). If a queue of objects is being processed by multiple threads, a condition can be used to
is_alive()
self.name
Timer Objects