[Kc] Threads/fork/Event-based programming oh my (anyevent/coro)

[Garrett Goebel]

Questions...

What is the expected range regarding the number of numbers to be sorted on
each line?
How many processors are available?
What would serve as a primary key for database storage?


If the number of numbers is small... you may want to look at using a
quicksort. Otherwise mergesort.







On Thu, Nov 1, 2012 at 11:50 PM, <djgoku at gmail.com> wrote:

> I haven't started writing code yet, but wanted input on where to start.
>
> What I want to do is read in an input file, splice the input into
> configurable amount of chunks. Create a number of workers also configurable
> that go off and do work returning results or maybe even saving results to a
> database. After finishing wait for more work until all work is done and the
> last worker is finished and exit.
>
> Input (variable number of inputs, but each line/row will be in a queue
> that the worker will get work from):
> 4,2,1,5,6
> 1,2,5,6,8,3
> 9,9,1,3,5,4
> 7,3,5,2,8
>
> Output is sorted rows in ascending order for each line:
> 1,2,4,5,6
> 1,2,3,5,6,8
> 1,3,4,5,9,9
> 2,3,5,7,8
>
> Jonathan Otsuka
> _______________________________________________
> kc mailing list
> kc at pm.org
> http://mail.pm.org/mailman/listinfo/kc
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.pm.org/pipermail/kc/attachments/20121102/14b840f5/attachment.html>