zach-brockway

Keybase proof

I hereby claim:

• I am antiuniverse on github.
• I am neverender (https://keybase.io/neverender) on keybase.
• I have a public key ASDfqovfOEy5yT3KoG1ycigo2oYUgtGTJakCAbaqIaPToQo

To claim this, I am signing this object:

zach-brockway

# you can make a text file of request times (in ms, one number per line) and import it here, or you can use a probability distribution to simulate request times (see below where setting req_durations_in_ms)
# rq = read.table("~/Downloads/request_times.txt", header=FALSE)$V1

# argument notes:
# parallel_router_count is only relevant if router_mode is set to "intelligent"
# choice_of_two, power_of_two, and unicorn_workers_per_dyno are only relevant if router_mode is set to "naive"
# you can only select one of choice_of_two, power_of_two, and unicorn_workers_per_dyno

run_simulation = function(router_mode = "naive",
                          reqs_per_minute = 9000,

zach-brockway

#!/c/Python32/python.exe
import sys
import os.path
import xml.etree.ElementTree as ET

ns = '{http://schemas.microsoft.com/developer/msbuild/2003}'

filterTree = ET.parse(sys.argv[1]+".filters")
filterRoot = filterTree.getroot()
filterDict = dict()