Search Results

Search found 3 results on 1 pages for 'samg'.

Page 1/1 | 1 

• Spacebar on Samsung Series 7 Chronos Not Working

  - by Samg

  The spacebar on my Series 7 Chronos does not register half the time. I'll be typing along and my words end up lookinglikethis. After further investigation, I noticed the spacebar does not response when pressed at the edges. Basically, the areas under the "C" key and the "M" key do not respond to a press It's weird, the bar physically "clicks" down (like it should), but does not register. No matter how hard I press, It won't register in that area. I noticed some complaints online about a 'sticky' or 'loose' spacebar, but they didn't mention it not registering. We took it back to the store we bought it at and they noticed the same problem on the floor model. Does anyone know how to fix this?

  Read the article

• Seeking help with a MT design pattern

  - by SamG

  I have a queue of 1000 work items and a n-proc machine (assume n = 4).The main thread spawns n (=4) worker threads at a time ( 25 outer iterations) and waits for all threads to complete before processing the next n (=4) items until the entire queue is processed for(i= 0 to queue.Length / numprocs) for(j= 0 to numprocs) { CreateThread(WorkerThread,WorkItem) } WaitForMultipleObjects(threadHandle[]) The work done by each (worker) thread is not homogeneous.Therefore in 1 batch (of n) if thread 1 spends 1000 s doing work and rest of the 3 threads only 1 s , above design is inefficient,becaue after 1 sec other 3 processors are idling. Besides there is no pooling - 1000 distinct threads are being created How do I use the NT thread pool (I am not familiar enough- hence the long winded question) and QueueUserWorkitem to achieve the above. The following constraints should hold The main thread requires that all worker items are processed before it can proceed.So I would think that a waitall like construct above is required I want to create as many threads as processors (ie not 1000 threads at a time) Also I dont want to create 1000 distinct events, pass to the worker thread, and wait on all events using the QueueUserWorkitem API or otherwise Exisitng code is in C++.Prefer C++ because I dont know c# I suspect that the above is a very common pattern and was looking for input from you folks.

  Read the article

• Using Hadoop, are my reducers guaranteed to get all the records with the same key?

  - by samg

  I'm running a hadoop job (using hive actually) which is supposed to uniq lines in a lot of text file. More specifically it chooses the most recently timestamped record for each key in the reduce step. Does hadoop guarantee that every record with the same key, output by the map step, will go to a single reducer, even if there are many reducers running across a cluster? I'm worried that the mapper output might be split after the shuffle happens, in the middle of a set of records with the same key.

  Read the article

1