Git Product home page Git Product logo

gcbenchmarks's Introduction

Garbage Collection Test Suite

This package contains various test programs which measure the efficiency of Garbage Collection (GC) in Julia.

Running

Usage:
    run_benchmarks.jl (serial|multithreaded|slow) (all|<category> [<name>]) [options]
    run_benchmarks.jl -h | --help
    run_benchmarks.jl --version
Options:
    -n <runs>, --runs=<runs>              Number of runs for each benchmark [default: 10].
    -t <threads>, --threads=<threads>     Number of mutator threads to use [default: 1].
    --gcthreasds=<gcthreads>              Number of GC threads to use [default: 1].
    -s <max>, --scale=<max>               Maximum number of GC threads for scaling test.
    -h, --help                            Show this screen.
    --version                             Show version.

Classes

There are three classes of benchmarks:

  • Serial benchmarks run on a single mutator thread.
  • Multithreaded benchmarks may run on multiple mutator threads.
  • Slow benchmarks are long-running in comparison with the other two classes.

Examples

  • Run all serial benchmarks 5 times each using 1 mutator thread and 1 GC thread:

    julia --project=. run_benchmarks.jl serial all -n 5

  • Run the binary tree benchmarks 10 times each with 1, 2, 4 and 8 GC threads (and 8 mutator threads):

    julia --project=. run_benchmarks.jl multithreaded binary_tree -t 8 -s 8

  • Run the red-black tree benchmark once using 1 mutator thread and 4 GC threads:

    julia --project=. run_benchmarks.jl slow rb_tree rb_tree -n 1 --gcthreads 4

The benchmarks

Class Category Name Description
Serial TimeZones TimeZones.jl Creation of timezones which involve repeated short String allocations.
append append.jl Repeatedly growing Vectors.
bigint pollard.jl Tests small BigInts.
linked list.jl Small pointer-heavy data structure.
tree.jl Small pointer-heavy data structure.
strings strings.jl
Multithreaded binary_tree tree_immutable.jl Small pointer-heavy data structure.
tree_mutable.jl Small pointer-heavy data structure.
Slow rb_tree rb_tree.jl Pointer graph whose minimum linear arrangement has cost Ī˜(nĀ²).
pidigits.jl Tests large BigInts.

gcbenchmarks's People

Contributors

oscardssmith avatar vchuravy avatar d-netto avatar kpamnany avatar chriselrod avatar gbaraldi avatar nhdaly avatar seelengrab avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    šŸ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. šŸ“ŠšŸ“ˆšŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ā¤ļø Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.