|
| 1 | +opam-version: "2.0" |
| 2 | + |
| 3 | +authors: "Francois Berenger" |
| 4 | +license: "LGPL-2.0-or-later" |
| 5 | +homepage: "https://github.com/UnixJunkie/parany" |
| 6 | +bug-reports: "https://github.com/UnixJunkie/parany/issues" |
| 7 | +dev-repo: "git+https://github.com/UnixJunkie/parany.git" |
| 8 | +depends: [ |
| 9 | + "base-unix" |
| 10 | + "cpu" |
| 11 | + "dune" {>= "1.6.0"} |
| 12 | + "ocaml" {>= "4.03.0"} |
| 13 | +] |
| 14 | +available: os != "win32" |
| 15 | +build: [ |
| 16 | + ["dune" "build" "-p" name "-j" jobs] |
| 17 | + ["dune" "build" "-p" name "-j" jobs "src/test.exe"] {with-test} |
| 18 | + ["./test.sh"] {with-test} |
| 19 | +] |
| 20 | +synopsis: "Parallelize any computation" |
| 21 | +description: """ |
| 22 | +Generalized map reduce for parallel computers (not distributed computing). |
| 23 | +Can process in parallel an infinite stream of elements. |
| 24 | + |
| 25 | +Can process a very large file in parallel on a multicore computer; |
| 26 | +provided there is a way to cut your file into independent blocks |
| 27 | +(the 'demux' function). |
| 28 | +The processing function is called 'work'. |
| 29 | +The function gathering the results is called 'mux'. |
| 30 | +The number of processors running your computation in parallel is called |
| 31 | +'nprocs'. |
| 32 | +The chunk size (number of items) processed by one call to the 'work' function |
| 33 | +is called 'csize'. |
| 34 | + |
| 35 | +There is a minimalist Parmap module, if you want to switch |
| 36 | +to/from Parmap easily. |
| 37 | + |
| 38 | +Read the corresponding ocamldoc before using. |
| 39 | + |
| 40 | +USING THIS LIBRARY IN A MISSION CRITICAL, LONG-RUNNING SOFTWARE |
| 41 | +THAT IS NEVER SUPPOSED TO CRASH IS NOT ADVIZED. |
| 42 | +WHILE THIS LIBRARY IS HIGH PERFORMANCE, IT IS ALSO DANGEROUS. |
| 43 | +USE AT YOUR OWN RISKS. |
| 44 | +""" |
| 45 | +url { |
| 46 | + src: "https://github.com/UnixJunkie/parany/archive/v14.0.1.tar.gz" |
| 47 | + checksum: "md5=56275cac64d97cbe2a703ef59b1c570d" |
| 48 | +} |
0 commit comments