Daniel Sczepansky danskycode

Moved to git repository: https://github.com/denji/nginx-tuning

NGINX Tuning For Best Performance

For this configuration you can use web server you like, i decided, because i work mostly with it to use nginx.

Generally, properly configured nginx can handle up to 400K to 500K requests per second (clustered), most what i saw is 50K to 80K (non-clustered) requests per second and 30% CPU load, course, this was 2 x Intel Xeon with HyperThreading enabled, but it can work without problem on slower machines.

You must understand that this config is used in testing environment and not in production so you will need to find a way to implement most of those features best possible for your servers.

	import pyautogui, time, sys, os, win32api, win32gui, win32con, datetime, pyHook, pythoncom
	from optparse import OptionParser

	'''
	Python Automated Actions Script by Ian Mckay
	Version 0.1 - 20151217
	'''

	pyautogui.PAUSE = 0
	pyautogui.FAILSAFE = True

	<#
	.SYNOPSIS
	Resize an image
	.DESCRIPTION
	Resize an image based on a new given height or width or a single dimension and a maintain ratio flag.
	The execution of this CmdLet creates a new file named "OriginalName_resized" and maintains the original
	file extension
	.PARAMETER Width
	The new width of the image. Can be given alone with the MaintainRatio flag
	.PARAMETER Height

	# Shell command to refresh Safari
	# 1. Hook this into a shortcut in your favourite text editor
	# 2. Profit

	osascript -e 'tell application "Safari"' -e 'tell its first document' -e 'set its URL to (get its URL)' -e 'end tell' -e 'activate' -e 'end tell'

	-- Author: Michael-Keith Bernard
	-- Date: May 22, 2012
	-- Description: Various implementations of the Fibonacci sequence in Lua. Lua
	-- has native support for tail-call elimination which is why `tail_call` and
	-- `continuation` run in near constant time. For sufficiently large numbers of n
	-- you can start to see linear performace characteristics (particularly for the
	-- `continuation` implementation), but ultimately the `tail_call` implementation
	-- is an order of magnitude faster than iteration even for values of n as small
	-- as 500k.