Fri Apr 16 10:02:43 2021
EVENTS
 FREE
SOFTWARE
INSTITUTE

POLITICS
JOBS
MEMBERS'
CORNER

MAILING
LIST

NYLXS Mailing Lists and Archives
NYLXS Members have a lot to say and share but we don't keep many secrets. Join the Hangout Mailing List and say your peice.

DATE 2016-11-01

LEARN

2021-04-16 | 2021-03-16 | 2021-02-16 | 2021-01-16 | 2020-12-16 | 2020-11-16 | 2020-10-16 | 2020-09-16 | 2020-08-16 | 2020-07-16 | 2020-06-16 | 2020-05-16 | 2020-04-16 | 2020-03-16 | 2020-02-16 | 2020-01-16 | 2019-12-16 | 2019-11-16 | 2019-10-16 | 2019-09-16 | 2019-08-16 | 2019-07-16 | 2019-06-16 | 2019-05-16 | 2019-04-16 | 2019-03-16 | 2019-02-16 | 2019-01-16 | 2018-12-16 | 2018-11-16 | 2018-10-16 | 2018-09-16 | 2018-08-16 | 2018-07-16 | 2018-06-16 | 2018-05-16 | 2018-04-16 | 2018-03-16 | 2018-02-16 | 2018-01-16 | 2017-12-16 | 2017-11-16 | 2017-10-16 | 2017-09-16 | 2017-08-16 | 2017-07-16 | 2017-06-16 | 2017-05-16 | 2017-04-16 | 2017-03-16 | 2017-02-16 | 2017-01-16 | 2016-12-16 | 2016-11-16 | 2016-10-16 | 2016-09-16 | 2016-08-16 | 2016-07-16 | 2016-06-16 | 2016-05-16 | 2016-04-16 | 2016-03-16 | 2016-02-16 | 2016-01-16 | 2015-12-16 | 2015-11-16 | 2015-10-16 | 2015-09-16 | 2015-08-16 | 2015-07-16 | 2015-06-16 | 2015-05-16 | 2015-04-16 | 2015-03-16 | 2015-02-16 | 2015-01-16 | 2014-12-16 | 2014-11-16 | 2014-10-16

Key: Value:

Key: Value:

MESSAGE
DATE 2016-11-14
FROM Ruben Safir
SUBJECT Re: [Learn] merge sort in parallel assignment
From learn-bounces-at-nylxs.com Mon Nov 14 21:10:22 2016
Return-Path:
X-Original-To: archive-at-mrbrklyn.com
Delivered-To: archive-at-mrbrklyn.com
Received: from www.mrbrklyn.com (www.mrbrklyn.com [96.57.23.82])
by mrbrklyn.com (Postfix) with ESMTP id 98D1E161312;
Mon, 14 Nov 2016 21:10:22 -0500 (EST)
X-Original-To: learn-at-nylxs.com
Delivered-To: learn-at-nylxs.com
Received: from [10.0.0.62] (flatbush.mrbrklyn.com [10.0.0.62])
by mrbrklyn.com (Postfix) with ESMTP id D3B33160E77
for ; Mon, 14 Nov 2016 21:10:20 -0500 (EST)
To: learn-at-nylxs.com
References: <1d19cb98-d071-2914-bf6a-d8e4d3bc81d9-at-mrbrklyn.com>
<87d1hxvomh.fsf-at-contrapunctus.net>
From: Ruben Safir
Message-ID: <5e3531b5-190c-9d3a-c63b-a59fac5c6c08-at-mrbrklyn.com>
Date: Mon, 14 Nov 2016 21:10:20 -0500
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:45.0) Gecko/20100101
Thunderbird/45.4.0
MIME-Version: 1.0
In-Reply-To: <87d1hxvomh.fsf-at-contrapunctus.net>
Subject: Re: [Learn] merge sort in parallel assignment
X-BeenThere: learn-at-nylxs.com
X-Mailman-Version: 2.1.17
Precedence: list
List-Id:
List-Unsubscribe: ,

List-Archive:
List-Post:
List-Help:
List-Subscribe: ,

Content-Type: text/plain; charset="us-ascii"
Content-Transfer-Encoding: 7bit
Errors-To: learn-bounces-at-nylxs.com
Sender: "Learn"

On 11/14/2016 02:37 PM, Christopher League wrote:
>
> I didn't know about this `std::thread` ... that's a lot easier than
> writing the `pthread` stuff by hand, I guess. Nice selection of the
> names `sinetro` and `dextro`.

I was running out of names. This text I picked up, C++ Concurrency IN
ACTION, Practical Multithreading by Anthony Williams covers the newish
thread lbraries added to C++-11
>
> One piece of advice I've seen for parallel tree algorithms in Haskell is
> that recursing on left/right asynchronously the whole way down the tree
> adds too much overhead.

Yes and I'm sure that is why it bombs when I run it with too large of a
data field for input.

> You want to spawn off threads for maybe the top
> 2-3 layers of subtrees (so 4-8 threads) but then just proceed
> sequentially after that. (You're running on 4-8 cores, so any additional
> threads sitting around waiting are just overhead.)
>

I was considering just that and limiting the thread to 16. I'd need to
write about function that doesn't make threads recursively and replace
it with two other functions, one with serial recursion and the other
that spins off the threads, that calls the recursive one. I'd need to
write a function for each level, actually. Alternately I could create a
global static index that each thread starts up, and stop calling for new
threads when you reach the number you want. Its not perfect, because
threads are in a race condition to read and write to the index, but that
is likely to be of little practical consequence to the program and
currently it bombs with big data.


I can wrap it all up in catch and try.

> CL
>
> Ruben Safir writes:
>
>> So in terms of the HW this is done, although I'm not happy this the
>> code. It errors on me when the merge is too large, likely due to a
>> combination of compile deficiency and my coding not doing enough error
>> checking. It might help to define the standard c++ to 11, but I'm not
>> certain of that. I need some sleep.
>>
>> Reuvain
>>
>> --
>> So many immigrant groups have swept through our town
>> that Brooklyn, like Atlantis, reaches mythological
>> proportions in the mind of the world - RI Safir 1998
>> http://www.mrbrklyn.com
>>
>> DRM is THEFT - We are the STAKEHOLDERS - RI Safir 2002
>> http://www.nylxs.com - Leadership Development in Free Software
>> http://www2.mrbrklyn.com/resources - Unpublished Archive
>> http://www.coinhangout.com - coins!
>> http://www.brooklyn-living.com
>>
>> Being so tracked is for FARM ANIMALS and and extermination camps,
>> but incompatible with living as a free human being. -RI Safir 2013
>> /*
>> * =====================================================================================
>> *
>> * Filename: msort.h
>> *
>> * Description: Header File for Parrell Msort algorthm
>> *
>> * Version: 1.0
>> * Created: 11/09/2016 04:28:51 AM
>> * Revision: none
>> * Compiler: gcc
>> *
>> * Author: Ruben Safir
>> * Company: NYLXS Inc
>> *
>> * =====================================================================================
>> */
>> #ifndef MSORT_INC
>> #define MSORT_INC
>>
>> namespace merge{
>>
>>
>> int min(int x, int y);
>> void track(int , int, int * );
>> void merge(int j, int l, int m, int k, int * parent);
>> }
>> #endif /* ----- #ifndef MSORT_INC ----- */
>>
>> CXX:=g++
>> CXXFLAGS:=-Wall -ggdb -pg -pthread
>>
>> LDFLAGS:=-L/usr/local/lib/mysql -lmysqlpp -lmysqlclient
>>
>> msort : msort.o main.o
>> ${CXX} ${CXXFLAGS} -o msort msort.o main.o
>>
>> main.o : main.cpp
>> ${CXX} ${CXXFLAGS} -o main.o -c main.cpp
>>
>> msort.o : msort.cpp msort.h
>> ${CXX} ${CXXFLAGS} -c msort.cpp
>>
>> clean :
>> rm nodes *.o make.deps
>> touch *.cpp *.h
>>
>> include make.deps
>> make.deps: *.cpp ; gcc -M *.cpp >$-at-
>> #include "msort.h"
>> #include
>> #include
>> namespace merge{
>>
>> int min(int x, int y){
>> int ret;
>> x>> std::cout << x << ":" << y << "==>" << ret << std::endl;
>> return ret;
>> }
>>
>> void merge(int j, int l, int m, int k, int * value){
>> int size = (k-j) + 1;
>> std::cout << "Allocating scratch ==>" << size << std::endl;
>> int * scratch = new int[size];
>> int l_pos1 = j;
>> int l_pos2 = l;
>> int r_pos1 = m;
>> int r_pos2 = k;
>> int i = 0;
>> std::cout << "Scratch index: " << i << std::endl;
>> std::cout << "l_pos1: " << l_pos1 << "\tr_pos1: " << r_pos1 << std::endl;
>> std::cout << "l_pos2: " << l_pos2 << "\tr_pos2: " << r_pos2 << std::endl;
>> int l_next = l_pos1;
>> int r_next = r_pos1;
>> int cur = -1;//cursor rest position
>> int cursor[3] = {cur, l_next, r_next};
>> while((cursor[1] <= l_pos2) && (cursor[2] <= r_pos2)) {
>> std::cout << "Positions" << cursor[0] << ":" << cursor[1] << ":" << cursor[2] << std::endl;
>> std::cout << "Values " << value[cursor[1]] << ":" << value[cursor[2]] << std::endl;
>> if(value[cursor[1]] <= value[cursor[2]]) {
>> scratch[i] = value[cursor[1]];
>> cursor[0] = cursor[1];
>> cursor[1]++;
>> }else if(value[cursor[1]] > value[cursor[2]]){
>> scratch[i] = value[cursor[2]];
>> cursor[0] = cursor[2];
>> cursor[2]++;
>> }
>> std::cout << "Positions" << cursor[0] << ":" << cursor[1] << ":" << cursor[2] << std::endl;
>> std::cout << "Values " << value[cursor[1]] << ":" << value[cursor[2]] << std::endl;
>> i++;
>> }
>> //we hit the top
>> while(1){
>> std::cout << "clearing data...";
>> if(cursor[2] <= r_pos2 ){
>> scratch[i] = value[cursor[2]];
>> i++;
>> cursor[2]++;
>> }else if(cursor[1] <= l_pos2){
>> scratch[i] = value[cursor[1]];
>> i++;
>> cursor[1]++;
>> }else{
>> break;
>> }
>> }
>> std::cout << "done" << std::endl;
>> //copy scratch to the array
>> std::cout << "copying scratch" << std::endl;
>> for(int pos = j, i=0; i <= (k-j); pos++, i++){
>> std::cout << i << " : " << scratch[i] <<" to position " << pos << std::endl;
>> value[pos] = scratch[i];
>> }
>> std::cout << "free scratch" << std::endl;
>> delete[] scratch;
>> std::cout << "done with scratch" << std::endl;
>> return;
>> }
>>
>> //j is far left of array
>> //k is far right of array
>> //l is middle of array - right of left child array
>> //m is middle + 1 of the array - left of right child array
>> //
>> // j l m k
>> //_____________________________________
>> //| 0| 1| 2| 3| 4| 5| 6| 7| 8| 9| 10| 11|
>> //--------------------------------------
>> //
>>
>>
>> void track(int j, int k, int * parent )
>> {
>> //std::cout << "\n j is far left of array\n k is far right of array\n l is middle of array - right of left child array\n m is middle + 1 of the array - left of right child array\n\n j l m k\n _____________________________________\n | 0| 1| 2| 3| 4| 5| 6| 7| 8| 9| 10| 11|\n --------------------------------------\n ";
>>
>> std:: cout << "======================" << std::endl;
>>
>> std::cout << "|| __NEW NODE__ ||\n|| j =>" << j << " " << "k=> " << k << " ||" << std::endl;
>> std:: cout << "======================" << std::endl;
>> int length = k - j;
>> int l = j + (length / 2);
>> int m = l + 1;
>>
>>
>> if(j == k )
>> {
>> std::cout << "\n\n\n**********RETURN**********" << std::endl;
>> return;
>> }
>>
>> std::cout << "Left Branch: j =>" << j << "\t" << "l => " << l << std::endl;
>> std::cout << "Right Branch: m =>" << m << "\t" << "k => " << k << std::endl;
>> std::cout << std::endl;
>> std::cout << std::endl;
>> std::cout << std::endl;
>> std::cout << "***Enter left : j =>" << j << "\t" << "l => " << l << "***" << std::endl;
>> std::thread sinetro( track, j, l, parent ) ;
>> std::cout << "Returned to Node j => " << j << "\tk=> " << k << " From the left" << std::endl;
>> std::cout << std::endl;
>>
>> std::cout << "***Enter right : m =>" << m << "\t" << "k => " << k << std::endl;
>> std::thread dextro( track, m, k, parent);
>> std::cout << "Returned to Node j => " << j << "\tk=> " << k << " From the right" << std::endl;
>> std::cout << "**********MERGE**********" << std::endl;
>> sinetro.join();
>> dextro.join();
>> merge(j,l,m,k, parent);
>>
>> }
>>
>> }//end namespace
>> /*
>> * =====================================================================================
>> *
>> * Filename: main.cpp
>> *
>> * Description: merge sort main
>> *
>> * Version: 1.0
>> * Created: 11/09/2016 09:33:20 AM
>> * Revision: none
>> * Compiler: gcc
>> *
>> * Author: Ruben Safir
>> * Company: NYLXS
>> *
>> * =====================================================================================
>> */
>> #include
>> #include "msort.h"
>> #include
>> #include
>> #include
>> #define SIZE 10000
>>
>> int main(int argv, char **argc)
>> {
>> using namespace std;
>>
>> int *data = new int[SIZE];
>> // int *cache = new int[SIZE];
>> struct timespec now;
>> clock_gettime(CLOCK_REALTIME, &now);
>> long seed = now.tv_nsec;
>> srand( (unsigned int) seed);
>> for(int i = 0; i < SIZE; i++){
>> data[i] = rand() % 1000000;
>> cout << data[i] << "\t";
>> }
>> cout << endl;
>>
>> cout << "________________________________________________________" << endl;
>>
>> cout << "***Size of Array " << SIZE << "****" << endl;
>> cout << "____________________" << endl;
>> cout << "Array Before" << endl;
>> for(int i = 0; i < SIZE; i++){
>> cout << "--------------------" << endl;
>> cout << "| " << i << " ==> " << data[i] << "\t |" << endl;
>> }
>> cout << "--------------------" << endl;
>> cout << "--------------------" << endl;
>>
>>
>> merge::track(0, SIZE - 1, data);
>>
>> cout << "____________________" << endl;
>> cout << "Array AFTER" << endl;
>> for(int i = 0; i < SIZE; i++){
>> cout << "--------------------" << endl;
>> cout << "| " << i << " ==> " << data[i] << "\t |" << endl;
>> }
>> cout << "--------------------" << endl;
>> cout << "--------------------" << endl;
>>
>>
>> return 0;
>>
>> }
>>
>> _______________________________________________
>> Learn mailing list
>> Learn-at-nylxs.com
>> http://lists.mrbrklyn.com/mailman/listinfo/learn
>
>
>
> _______________________________________________
> Learn mailing list
> Learn-at-nylxs.com
> http://lists.mrbrklyn.com/mailman/listinfo/learn
>


--
So many immigrant groups have swept through our town
that Brooklyn, like Atlantis, reaches mythological
proportions in the mind of the world - RI Safir 1998
http://www.mrbrklyn.com

DRM is THEFT - We are the STAKEHOLDERS - RI Safir 2002
http://www.nylxs.com - Leadership Development in Free Software
http://www2.mrbrklyn.com/resources - Unpublished Archive
http://www.coinhangout.com - coins!
http://www.brooklyn-living.com

Being so tracked is for FARM ANIMALS and and extermination camps,
but incompatible with living as a free human being. -RI Safir 2013
_______________________________________________
Learn mailing list
Learn-at-nylxs.com
http://lists.mrbrklyn.com/mailman/listinfo/learn

  1. 2016-11-01 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] how is it indexing in cuda
  2. 2016-11-01 Ruben Safir <ruben.safir-at-my.liu.edu> Re: [Learn] not adequately speced of explained
  3. 2016-11-01 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] how is it indexing in cuda
  4. 2016-11-01 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] not adequately speced of explained
  5. 2016-11-02 Christopher League <league-at-contrapunctus.net> Re: [Learn] Fitch Algorithm - C++
  6. 2016-11-02 Ruben Safir <mrbrklyn-at-panix.com> Re: [Learn] Fitch Algorithm - C++
  7. 2016-11-02 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] how is it indexing in cuda
  8. 2016-11-02 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fitch Algorithm - C++
  9. 2016-11-02 IEEE Computer Society <csconnection-at-computer.org> Subject: [Learn] Hear Google's John Martinis Take on Quantum Computing at
  10. 2016-11-02 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] opencl
  11. 2016-11-02 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] scheduled for tommorw
  12. 2016-11-02 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] threads tutorial
  13. 2016-11-03 Ruben Safir <mrbrklyn-at-panix.com> Re: [Learn] Fitch Algorithm - C++
  14. 2016-11-03 Ruben Safir <mrbrklyn-at-panix.com> Re: [Learn] Fitch Algorithm - C++
  15. 2016-11-03 Ruben Safir <mrbrklyn-at-panix.com> Re: [Learn] Fitch Algorithm - C++
  16. 2016-11-03 Christopher League <league-at-contrapunctus.net> Re: [Learn] huffman code
  17. 2016-11-03 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] huffman code
  18. 2016-11-03 Ruben Safir <ruben.safir-at-my.liu.edu> Re: [Learn] huffman code
  19. 2016-11-03 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fitch algorithm from the beginning
  20. 2016-11-03 From: <mrbrklyn-at-panix.com> Subject: [Learn] huffman code
  21. 2016-11-03 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Phenology meeting
  22. 2016-11-03 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] relevant hackathon
  23. 2016-11-03 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] relevant hackathon
  24. 2016-11-04 Ruben Safir <mrbrklyn-at-panix.com> Re: [Learn] huffman code
  25. 2016-11-04 Christopher League <league-at-contrapunctus.net> Subject: [Learn] Fitch/Sankoff
  26. 2016-11-05 Christopher League <league-at-contrapunctus.net> Re: [Learn] Fwd: templates within templates
  27. 2016-11-05 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: Re: const T vs T const
  28. 2016-11-05 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: Template Library files and Header linking troubles
  29. 2016-11-05 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: templates within templates
  30. 2016-11-06 Ruben Safir <mrbrklyn-at-panix.com> Re: [Learn] Fwd: templates within templates
  31. 2016-11-06 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] Fwd: templates within templates
  32. 2016-11-06 Ruben Safir <mrbrklyn-at-panix.com> Re: [Learn] Fwd: templates within templates
  33. 2016-11-06 Christopher League <league-at-contrapunctus.net> Re: [Learn] Fwd: templates within templates
  34. 2016-11-06 Ruben Safir <mrbrklyn-at-panix.com> Re: [Learn] Fwd: templates within templates
  35. 2016-11-06 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] Fwd: templates within templates
  36. 2016-11-06 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] Fwd: templates within templates
  37. 2016-11-06 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] GNU Parallel 20161022 ('Matthew') released [stable]
  38. 2016-11-07 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] templates and ostream for future reference
  39. 2016-11-08 Christopher League <league-at-contrapunctus.net> Re: [Learn] C++ signature ambiguity
  40. 2016-11-08 Ruben Safir <ruben.safir-at-my.liu.edu> Re: [Learn] C++ signature ambiguity
  41. 2016-11-08 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] C++ signature ambiguity
  42. 2016-11-08 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: Invitation: Phylogeny meeting -at- Weekly from 10:15 to
  43. 2016-11-08 Ruben Safir <mrbrklyn-at-panix.com> Subject: [Learn] Fwd: [nylug-talk] RSVP open: Wed Nov 16,
  44. 2016-11-09 Christopher League <league-at-contrapunctus.net> Re: [Learn] merge sort parallel hw
  45. 2016-11-09 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] merge sort parallel hw
  46. 2016-11-09 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] merge sort parallel hw
  47. 2016-11-09 Christopher League <league-at-contrapunctus.net> Re: [Learn] merge sort parallel hw
  48. 2016-11-09 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] mergesort tutorial
  49. 2016-11-09 Christopher League <league-at-contrapunctus.net> Re: [Learn] mergesort tutorial
  50. 2016-11-09 Christopher League <league-at-contrapunctus.net> Re: [Learn] namespace and external files confusion
  51. 2016-11-09 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] namespace and external files confusion
  52. 2016-11-09 From: "Carlos R. Mafra" <crmafra-at-gmail.com> Re: [Learn] Question about a small change
  53. 2016-11-09 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] =?utf-8?q?C++_call_of_overloaded_=E2=80=98track=28int*=26?=
  54. 2016-11-09 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: lost arguments
  55. 2016-11-09 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: [dinosaur] Dating origins of dinosaurs,
  56. 2016-11-09 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] merge sort parallel hw
  57. 2016-11-09 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] mergesort tutorial
  58. 2016-11-09 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] namespace and external files confusion
  59. 2016-11-10 Christopher League <league-at-contrapunctus.net> Re: [Learn] merge sort parallel hw
  60. 2016-11-10 Ruben Safir <mrbrklyn-at-panix.com> Re: [Learn] merge sort parallel hw
  61. 2016-11-10 Ruben Safir <mrbrklyn-at-panix.com> Re: [Learn] merge sort parallel hw
  62. 2016-11-10 Ruben Safir <ruben.safir-at-my.liu.edu> Re: [Learn] merge sort parallel hw
  63. 2016-11-10 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] [Hangout-NYLXS] mergesort tutorial
  64. 2016-11-10 Ruben Safir <mrbrklyn-at-panix.com> Subject: [Learn] Fwd: [Hangout-NYLXS] ease your mind- everything in the
  65. 2016-11-10 Ruben Safir <ruben.safir-at-my.liu.edu> Subject: [Learn] Fwd: [Hangout-NYLXS] R Programming Workshop
  66. 2016-11-10 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Paleocast phenogenetic tree building
  67. 2016-11-11 Christopher League <league-at-contrapunctus.net> Re: [Learn] merge sort parallel hw
  68. 2016-11-12 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] HW of mergesort in parallel
  69. 2016-11-13 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] merge sort in parallel assignment
  70. 2016-11-14 Christopher League <league-at-contrapunctus.net> Re: [Learn] merge sort in parallel assignment
  71. 2016-11-14 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] merge sort in parallel assignment
  72. 2016-11-14 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] merge sort parallel hw
  73. 2016-11-14 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] CUDA and video
  74. 2016-11-14 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] PNG Graphic formats and CRCs
  75. 2016-11-15 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: PNG coding
  76. 2016-11-15 ruben safir <ruben.safir-at-my.liu.edu> Subject: [Learn] Fwd: PNG Coding
  77. 2016-11-16 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] Fwd: lost arguments
  78. 2016-11-16 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] relevant hackathon
  79. 2016-11-16 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] C++ Workshop Announcement
  80. 2016-11-16 Ruben Safir <mrbrklyn-at-panix.com> Subject: [Learn] Fwd: Re: ref use
  81. 2016-11-16 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] ref use
  82. 2016-11-16 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] why use a reference wrapper int his example
  83. 2016-11-17 Ruben Safir <mrbrklyn-at-panix.com> Re: [Learn] [Hangout-NYLXS] at K&R now
  84. 2016-11-17 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: [Hangout-NYLXS] Fwd: PNG Coding
  85. 2016-11-18 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] C++ workshop and usenet responses
  86. 2016-11-19 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: ref use
  87. 2016-11-20 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] when is the constructor called for an object
  88. 2016-11-21 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: creating a binary tree
  89. 2016-11-21 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: hidden static
  90. 2016-11-21 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: ISBI 2017 Call for Abstracts and Non-Author
  91. 2016-11-21 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: PNG coding
  92. 2016-11-21 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: Re: the new {} syntax
  93. 2016-11-21 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: when is the constructor called for an object
  94. 2016-11-21 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: when is the constructor called for an object
  95. 2016-11-21 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: [dinosaur] Eoconfuciusornis feather keratin and
  96. 2016-11-21 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] look what I found
  97. 2016-11-22 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Cuccuency book
  98. 2016-11-22 ruben safir <ruben.safir-at-my.liu.edu> Subject: [Learn] declare a func or call an object
  99. 2016-11-22 Ruben Safir <ruben.safir-at-my.liu.edu> Subject: [Learn] Fwd: Re: Using CLIPS as a library
  100. 2016-11-23 Ruben Safir <ruben.safir-at-my.liu.edu> Subject: [Learn] Fwd: Simple C++11 Wrapper for CLIPS 6.30
  101. 2016-11-23 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Parrelel Programming HW2 with maxpath
  102. 2016-11-24 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] great research news for big data
  103. 2016-11-24 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] mapping algorithms
  104. 2016-11-24 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Todays meeting
  105. 2016-11-25 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: [dinosaur] Flightless theropod phylogenetic variation
  106. 2016-11-26 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] Note to self for Thursday
  107. 2016-11-26 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fitch etc
  108. 2016-11-26 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Note to self for Thursday
  109. 2016-11-26 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] operator<<() overloading details and friend
  110. 2016-11-27 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] 130 year old feathers analysis
  111. 2016-11-27 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: ACM/SPEC ICPE 2017 - Call for Tutorial Proposals
  112. 2016-11-27 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: ACM/SPEC ICPE 2017 - Call for Workshop Proposals
  113. 2016-11-27 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: CfP 22nd Conf. Reliable Software Technologies,
  114. 2016-11-27 ruben safir <ruben-at-mrbrklyn.com> Subject: [Learn] Fwd: Seeking contributors for psyche-c
  115. 2016-11-29 Christopher League <league-at-contrapunctus.net> Re: [Learn] Look at this exciting output by my test program
  116. 2016-11-29 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] Look at this exciting output by my test program
  117. 2016-11-29 Ruben Safir <ruben-at-mrbrklyn.com> Re: [Learn] Look at this exciting output by my test program
  118. 2016-11-29 Christopher League <league-at-contrapunctus.net> Re: [Learn] Quantum Entanglement
  119. 2016-11-29 Ruben Safir <mrbrklyn-at-panix.com> Re: [Learn] Quantum Entanglement
  120. 2016-11-29 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Here is the paper I was talking out
  121. 2016-11-29 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Look at this exciting output by my test program
  122. 2016-11-29 nylxs <mrbrklyn-at-optonline.net> Subject: [Learn] Look at this exciting output by my test program
  123. 2016-11-29 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] Quantum Entanglement
  124. 2016-11-29 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] The Death of PBS
  125. 2016-11-29 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] witmer lab ohio and 3d imaging
  126. 2016-11-30 Ruben Safir <ruben-at-mrbrklyn.com> Subject: [Learn] phylogenetic crawler

NYLXS are Do'ers and the first step of Doing is Joining! Join NYLXS and make a difference in your community today!