synchronization

Is there a way to implement a lock in Python for multithreading purposes whose acquire method can have an arbitrary timeout? The only working solutions I found so far use polling, which I find inelegant and inefficient Doesn't preserve the bounded waiting / progress guarantee of the lock as a solution to the critical section problem Is there a better way to implement this? to elaborate on Steven's comment suggestion: import threading import time lock = threading.Lock() cond = threading.Condition(threading.Lock()) def waitLock(timeout): with cond: current_time = start_time = time.time() while

I'm looking to create a high frequency callback thread. Essentially I need a function to execute at a regular high frequency (up to 100Hz) interval. I realize that windows has a normal thread execution slice is ~15ms. I would like to specify a regular interval that can be faster than 15ms. This is what I'm trying to accomplish. I have an external device that needs to be messaged at a certain interval. The interval is variable depending on the situation. I expect that I would not ever need more than a 100Hz (10ms) message rate. I can of course implement a spin loop, however, I was hoping there

I'm using LinkedBlockingQueue between two different threads. One thread adds data via add , while the other thread receives data via take . My question is, do I need to synchronize access to add and take . Is LinkedBlockingQueue 's insert and remove methods thread safe? Matthew Flaschen Yes. From the docs : "BlockingQueue implementations are thread-safe. All queuing methods achieve their effects atomically using internal locks or other forms of concurrency control. However, the bulk Collection operations addAll, containsAll, retainAll and removeAll are not necessarily performed atomically

How can i order threads in the order they were instantiated.e.g. how can i make the below program print the numbers 1...10 in order. public class ThreadOrdering { public static void main(String[] args) { class MyRunnable implements Runnable{ private final int threadnumber; MyRunnable(int threadnumber){ this.threadnumber = threadnumber; } public void run() { System.out.println(threadnumber); } } for(int i=1; i<=10; i++){ new Thread(new MyRunnable(i)).start(); } } } Sounds like you want ExecutorService.invokeAll , which will return results from worker threads in a fixed order, even though they

I'm on a little quest of merging the structure of two MySql databases. Is there a tool for this with the might of Red-Gate's SQL Compare? Are there any free alternatives? Brian Boatright I've been using SQLyog for years now. Recently they released v8.0 which includes an updated interface and two very cool features the Query Profiler and SQL Formatter. The formatter was the reason I upgraded this year. http://www.webyog.com/en/sqlyog_feature_list.php Blog post with video and animated gif of the SQL Formatter in action http://www.webyog.com/blog/2009/02/02/profile-and-format-mysql-queries-with