| bleachbot <bleachbot@httrack.com>: Jun 21 07:59PM +0200 |
| bleachbot <bleachbot@httrack.com>: Jun 21 10:33PM +0200 |
| bleachbot <bleachbot@httrack.com>: Jun 21 11:00PM +0200 |
| Ramine <ramine@1.1>: Jun 21 02:00PM -0700 Hello, My unit that implements processor groups on windows I have implemented a unit that implements processors groups, this unit contains a class that easy for you to support processor groups on windows that allows you to use more than 64 logical processors on windows, this class doesn't exist in C++, i have implemented it in Object Pascal with the Delphi and FreePascal compilers. Please look inside the zip file of the Threadpool engine that scales well , its source code is inside the ProcessorGroups.pas file. To know how to use it, please look at the test2.pas example inside the zip file and look inside the source code to understand more my class. You can download it from here: https://sites.google.com/site/aminer68/an-efficient-threadpool-engine-that-scales-well Thank you, Amine Moulay Ramdane. |
| Ramine <ramine@1.1>: Jun 21 01:35PM -0700 Hello, A new algorithm of an efficient Threadpool engine that scales well I have implemented this new algrithm of a Threadpool engine that scales well, i have enhanced it to support processor groups on windows, so that it scales with more that 64 logical cores, and i have also minimized at best the contention so that it scales well. The following have been added to my efficient Threadpool engine: - The worker threads enters in a wait state when there is no job in the concurrent FIFO queues - for more efficiency - - You can distribute your jobs to the worker threads and call any method with the threadpool's execute() method. - It uses work-stealing to be more efficient. - You can configure it to use stacks or FIFO queues , when you use stacks it will be cache efficient. - Now it can use processor groups on windows, so that it can use more than 64 logical processors and it scales well. - Now it distributes the jobs on multiple FIFO queues or stacks so that it scales well. - You can wait for the jobs to finish with the wait() method. - And it is portable to many operating systems. You can download my efficient Threadpool engine version 3.0 that scales well from: https://sites.google.com/site/aminer68/an-efficient-threadpool-engine-that-scales-well Thank you, Amine Moulay Ramdane. |
| Ramine <ramine@1.1>: Jun 21 10:59AM -0700 Hello... Chip makes parallel programs run faster with less code "Multicore systems are really hard to program," says Daniel Sanchez, an assistant professor in MIT's Department of Electrical Engineering and Computer Science. "You have to explicitly divide the work that you're doing into tasks, and then you need to enforce some synchronization between tasks accessing shared data. What this architecture does, essentially, is to remove all sorts of explicit synchronization, to make parallel programming much easier." Please read more here: https://www.sciencedaily.com/releases/2016/06/160620120349.htm Thank you, Amine Moulay Ramdane. |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.programming.threads+unsubscribe@googlegroups.com. |
No comments:
Post a Comment