Digest for comp.programming.threads@googlegroups.com - 4 updates in 4 topics

comp.programming.threads@googlegroups.com

Google Groups

Topic digest
View all topics

• I have just read all the following PhD reflections, please read them to become more wise: - 1 Update
• DAY2 - Thinking machines: Summit on artificial intelligence and robotics - 1 Update
• Here is my company in Quebec(Canada) - 1 Update
• Scalable FIFO queues for Linux are here - 1 Update

I have just read all the following PhD reflections, please read them to become more wise:

Intelli2 <intelli2@mama.com>: Oct 31 10:47PM -0400 Hello....     Read this:   I have just read all the following PhD reflections, please read them to become more wise:   https://people.eecs.berkeley.edu/~stephentu/blog/reflections/2016/02/28/list-phd-reflections.html       Thank you, Amine Moulay Ramdane.

Back to top

DAY2 - Thinking machines: Summit on artificial intelligence and robotics

Intelli2 <intelli2@mama.com>: Oct 31 09:05PM -0400 Hello....     DAY2 - Thinking machines: Summit on artificial intelligence and robotics   Look at this interesting video:   https://www.youtube.com/watch?v=EETf0LLNk0I       Thank you, Amine Moulay Ramdane.

Back to top

Here is my company in Quebec(Canada)

Intelli2 <intelli2@mama.com>: Oct 31 07:00PM -0400 Hello.....     Read this:   Here is my company in Quebec(Canada) called CyberNT Communications, i have worked as a software developer and as a network administrator:   https://opencorporates.com/companies/ca_qc/2246777231     Thank you, Amine Moulay Ramdane.

Back to top

Scalable FIFO queues for Linux are here

Intelli2 <intelli2@mama.com>: Oct 31 04:54PM -0400 Hello..   Scalable FIFO queues for Linux are here, the Linux version compiles with FreePascal, and the Windows version compiles with Delphi and FreePascal.   Scalable FIFO queues version 1.01 is here..   Author: Amine Moulay Ramdane   Description:   Those are two scalable FIFO queues, one is bounded and the other unbounded, they use a distributed technic over many FIFO queues and they use scalable counting networks so that to be scalable, you can test them on NUMA systems to notice that they are truly scalable.   And counting networks are truly scalable and are a special type of balancer networks which count.   Look at my port to Delphi and FreePascal of scalable counting networks here:   https://sites.google.com/site/aminer68/scalable-counting-networks-for-delphi-and-freepascal   You can download my scalable FIFO queues from:   https://sites.google.com/site/aminer68/scalable-fifo-queues     - Platform: Windows and Linux(x86)   Required FPC switches: -O3 -Sd -dFPC -dFreePascal   -Sd for delphi mode....   Required Delphi switches: -$H+ -DDelphi   For Delphi XE-XE7 use the -DXE switch   {$DEFINE CPU32} and {$DEFINE Windows32} for 32 bit systems   {$DEFINE CPU64} and {$DEFINE Windows64} for 64 bit systems       Thank you, Amine Moulay Ramdane.

Back to top

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.