Projects tagged ‘sorting’

IMAPFilter

I

Analyzed about 4 hours ago

IMAPfilter is mail filtering utility, that connects to remote mailservers over the IMAP protocol and processes messages based on user defined filters. IMAPFilter uses the Lua programming language as a configuration and extension language.

6.7K lines of code

1 current contributors

8 months since last commit

2 users on Open Hub

Very Low Activity

0 Reviews

I Use This

Mostly written in C

Licenses: mit

cudpp

C

Analyzed about 4 hours ago

CUDPP is the CUDA Data Parallel Primitives Library. CUDPP is a library of data-parallel algorithm primitives such as parallel prefix-sum (”scan”), parallel sort and parallel reduction. Primitives such as these are important building blocks for a wide variety of data-parallel algorithms, including ... [More]

33.9K lines of code

0 current contributors

about 9 years since last commit

2 users on Open Hub

Inactive

0 Reviews

I Use This

Mostly written in C

Licenses: bsd

Tags algorithms cuda data-parallelalgorithms gpu gpucomputing parallelcomputing sorting

NITSkmOS/algo

Analyzed about 18 hours ago

In case you want to contribute, ping on https://gitter.im/NITSkmOS/algo.

2.77K lines of code

13 current contributors

about 5 years since last commit

1 users on Open Hub

Inactive

0 Reviews

I Use This

Mostly written in C++

Licenses: mit

Tags algo algorithm algorithms datastructure datastructures python sorting sortingalgorithm

maildirproc

M

Analyzed about 21 hours ago

maildirproc is a program that processes one or several existing mail boxes in the maildir format. It is primarily focused on mail sorting — i.e., moving, copying, forwarding and deleting mail according to a set of rules. It can be seen as an alternative to procmail, but instead of being a delivery ... [More]

3.08K lines of code

2 current contributors

2 months since last commit

1 users on Open Hub

Very Low Activity

0 Reviews

I Use This

Mostly written in Python

Licenses: gpl

Tags email filter mail maildir sorting utilities

Data Structure 2011

No analysis available

Project on Data Structure 2011

0 lines of code

0 current contributors

0 since last commit

1 users on Open Hub

Activity Not Available

0 Reviews

I Use This

Mostly written in language not available

Licenses: AGPL3_or_...

Tags list sorting tree

Plugin SPIP : Tri Mots

P

No analysis available

This plugin for SPIP provides a simple interface to provide different ordering of SPIP articles and sections based on keywords they are associated to.

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available

0 Reviews

I Use This

Mostly written in language not available

Licenses: gpl

Tags keywords ordering plugin prototypejs ranking sorting spip tags

cl_ops

C

Analyzed 1 day ago

A library of common OpenCL operations.

3.64K lines of code

0 current contributors

over 9 years since last commit

0 users on Open Hub

Inactive

0 Reviews

I Use This

Mostly written in C

Licenses: gpl3, lgpl3

Tags cpu gpu gpucomputing gpuprogramming library opencl parallelprogramming prng randomnumbergenerator scientificcomputing sorting

Sort this messy list

No analysis available

A collection of sorting algorithms (merge sort, bubble sort, fast sort, etc.) written in Python. Tested with Python 3.2.

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available

0 Reviews

I Use This

Mostly written in language not available

Licenses: gpl3_or_l...

Tags algorithm benchmark sorting

Plugin Spip : Tri Auteur

P

No analysis available

This plugin for SPIP provides a simple way to sort the author of an article. It can be used for publications where the author order is important and should be different from the alphabetical sorting.

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available

0 Reviews

I Use This

Mostly written in language not available

Licenses: No declared licenses

Tags author order plugin publication ranking sorting spip

string-sorting

Analyzed about 4 hours ago

A collection of string sorting algorithm implementationsThis collection features several string sorting algorithm implementations, that have been tuned to take better advantage of modern hardware. Classic implementations tend to optimize instruction counts, but when sorting large collections of ... [More] strings, we also need to focus on memory issues. All algorithms are implemented using C and C++, and are released under the MIT license. Technical details: All of the implementations sort the strings by raw byte values. This means that they are mainly intended for research use. Includes several variants of known and efficient (string) sorting algorithms, such as MSD radix sort, burstsort and multi-key-quicksort. Emphasis on reducing cache misses and memory stalls. Includes the tools to create an extensive HTML based report, that can be used to compare the different implementations. The report includes technical details, such as TLB, L1 and L2 cache misses, run times and memory peak usage. Supports Linux huge pages. For more information, see below. RequirementsLinux Boost CMake Requirements to create the HTML based reportOProfile for most measurements, probably also requires root privileges. The default settings use Intel Core 2 specific events. When profiling on other platforms, you will most likely need to modify the scripts in the report/ directory. /usr/bin/memusage for measuring the memory peak usage. This is a GNU libc utility. CompilationCompiling with GCC $ svn checkout http://string-sorting.googlecode.com/svn/trunk/ string-sorting-read-only $ mkdir string-sorting-read-only-build $ cd string-sorting-read-only-build $ cmake -DCMAKE_BUILD_TYPE=release ../string-sorting-read-only $ make $ ./sortstringCompiling with ICCThe option USE_ICC can be used to select the Intel C/C++ compiler (ICC) easily. This sets up the proper compiler for C and C++ files, and selects some ICC specific compiler options. $ svn checkout http://string-sorting.googlecode.com/svn/trunk/ string-sorting-read-only $ mkdir icc-build $ cd icc-build $ cmake -DCMAKE_BUILD_TYPE=release -DUSE_ICC=true ../string-sorting-read-only $ make $ ./sortstringDebug buildA separate binary can be built for easier debugging. In this build, runtime assertions from the algorithm implementations and libraries (ie. Boost) are enabled. Some implementations also print out lots of debugging messages. You can use either GCC (default) or ICC (-DUSE_ICC=true). $ svn checkout http://string-sorting.googlecode.com/svn/trunk/ string-sorting-read-only $ mkdir debug-build $ cd debug-build $ cmake -DCMAKE_BUILD_TYPE=debug ../string-sorting-read-only $ make $ ./sortstringHuge pagesThe default page size on x86 processors is quite small, something like four kilobytes. When working with large data sets, this means that the input is spread to thousands of memory pages. Unfortunately random access in thousands of pages can be slow (see e.g. http://en.wikipedia.org/wiki/Translation_lookaside_buffer). Using a larger page size can alleviate the problem. If the page size is in the order of megabytes or even gigabytes, most data sets can fit into a much smaller amount of memory pages. In this program, huge pages can be enabled using the --hugetlb-text and --hugetlb-ptrs options. The former option places the input data (i.e. the actual strings from the given file) into huge pages, and the latter option places the string pointer array into huge pages. Using huge pages in Linux requires a recent kernel version, CPU support, and properly adjusted kernel settings. libhugetlbfs (http://libhugetlbfs.ozlabs.org/) can be used to replace all calls to malloc to use huge pages. [Less]

13.8K lines of code

1 current contributors

almost 4 years since last commit

0 users on Open Hub

Inactive

0 Reviews

I Use This

Mostly written in C++

Licenses: mit

Tags sorting

Tags : Browse Projects