Edit Question - KnowledgeHub

Title Body

I have been searching for some days for solid information on the possibility to accelerate LINQ queries using a GPU. Technologies I have "investigated" so far: Microsoft Accelerator Cudafy Brahma In short, would it even be possible at all to do an in-memory filtering of objects on the GPU? Let´s say we have a list of some objects and we want to filter something like: var result = myList.Where(x => x.SomeProperty == SomeValue); Any pointers on this one? Thanks in advance! UPDATE I´ll try to be more specific about what I am trying to achieve :) The goal is, to use any technology, which is able to filter a list of objects (ranging from ~50 000 to ~2 000 000), in the absolutely fastest way possible. The operations I perform on the data when the filtering is done (sum, min, max etc) is made using the built in LINQ-methods and is already fast enough for our application, so that´s not a problem. The bottleneck is "simply" the filtering of data. UPDATE Just wanted to add that I have tested about 15 databases, including MySQL (checking possible cluster approach / memcached solution), H2, HSQLDB, VelocityDB (currently investigating further), SQLite, MongoDB etc, and NONE is good enough when it comes to the speed of filtering data (of course, the NO-sql solutions do not offer this like the sql ones, but you get the idea) and/or the returning of the actual data. Just to summarize what I/we need: A database which is able to sort data in the format of 200 columns and about 250 000 rows in less than 100 ms. I currently have a solution with parallellized LINQ which is able (on a specific machine) to spend only nano -seconds on each row when filtering AND processing the result! So, we need like sub- nano -

Tags (comma-separated) Cancel