synchronization

we have two threads accessing one list via a synchronized method. Can we a) rely on the run time to make sure that each of them will receive access to the method based on the order they tried to or b) does the VM follow any other rules c) is there a better way to serialize the requests? No, synchronized will give access in any order (Depends on the JVM implementation). This could even cause Threads to starve in some scenarios. You can ensure the order by using ReentrantLock (since Java 5.0) with the fair=true option. ( Lock lock = new ReentrantLock(true); ) No you cannot be sure that two calls

I'm trying to implement a critical section in CUDA using atomic instructions, but I ran into some trouble. I have created the test program to show the problem: #include <cuda_runtime.h> #include <cutil_inline.h> #include <stdio.h> __global__ void k_testLocking(unsigned int* locks, int n) { int id = threadIdx.x % n; while (atomicExch(&(locks[id]), 1u) != 0u) {} //lock //critical section would go here atomicExch(&(locks[id]),0u); //unlock } int main(int argc, char** argv) { //initialize the locks array on the GPU to (0...0) unsigned int* locks; unsigned int zeros[10]; for (int i = 0; i < 10; i++

I've been developing in JavaScript for quite some time but net yet a cowboy developer, as one of the many things that always haunts me is synching JavaScript's callbacks. I will describe a generic scenario when this concern will be raised: I have a bunch of operations to perform multiple times by a for loop, and each of the operations has a callback. After the for loop, I need to perform another operation but this operation can only execute successfully if all the callbacks from the for loop are done. Code Example: for ... in ... { myFunc1(callback); // callbacks are executed asynchly }