source code
# The Computer Language Benchmarks Game
# https://salsa.debian.org/benchmarksgame-team/benchmarksgame/
#
# contributed by Karl von Laudermann
# modified by Jeremy Echols
# modified by Detlef Reichl
# modified by Joseph LaFata
# modified by Peter Zotov
# parallelised by Scott Leggett
# Thread.exclusive deprecated
require 'thread'
module MiniParallel
class Worker
def initialize(read, write)
@read, @write = read, write
end
def close_pipes
@read.close
@write.close
end
def work(index)
Marshal.dump(index, @write)
Marshal.load(@read)
end
end
def self.map(array, &block)
work_in_processes(
array,
[array.size, core_count].min,
&block
)
end
def self.core_count
@@core_count ||= IO.read("/proc/cpuinfo").scan(/^processor/).size
end
private
def self.work_in_processes(array, count, &block)
index = -1
results, threads = [], []
mx = Mutex.new
workers = create_workers(array, count, &block)
workers.each do |worker|
threads << Thread.new do
loop do
mx.synchronize do index += 1 end
break if index >= array.size
results[index] = worker.work(index)
end
worker.close_pipes
end
end
threads.each(&:join)
Process.waitall
results
end
def self.create_workers(array, count, &block)
workers = []
count.times do
workers << create_worker(array, workers, &block)
end
workers
end
def self.create_worker(array, started_workers, &block)
child_read, parent_write = IO.pipe
parent_read, child_write = IO.pipe
Process.fork do
started_workers.each(&:close_pipes)
parent_write.close
parent_read.close
process_incoming_jobs(child_read, child_write, array, &block)
child_read.close
child_write.close
end
child_read.close
child_write.close
Worker.new(parent_read, parent_write)
end
def self.process_incoming_jobs(read, write, array, &block)
until read.eof?
index = Marshal.load(read)
Marshal.dump(block.call(array[index]), write)
end
end
end
Size = ARGV.shift.to_i
puts "P4\n#{Size} #{Size}"
def row y
byte_acc = 0
bit_num = 0
res = []
ci = (2.0*y/Size)-1.0
x = 0
while x < Size
zrzr = zr = 0.0
zizi = zi = 0.0
cr = (2.0*x/Size)-1.5
escape = 0b1
z = 0
while z < 50
tr = zrzr - zizi + cr
ti = 2.0*zr*zi + ci
zr = tr
zi = ti
# preserve recalculation
zrzr = zr*zr
zizi = zi*zi
if zrzr+zizi > 4.0
escape = 0b0
break
end
z += 1
end
byte_acc = (byte_acc << 1) | escape
bit_num += 1
# Code is very similar for these cases, but using separate blocks
# ensures we skip the shifting when it's unnecessary, which is most
# cases.
if (bit_num == 8)
res << byte_acc.chr
byte_acc = 0
bit_num = 0
elsif (x == Size - 1)
byte_acc <<= (8 - bit_num)
res << byte_acc.chr
byte_acc = 0
bit_num = 0
end
x += 1
end
res.join
end
if MiniParallel.core_count > 1
print MiniParallel.map((0...Size).to_a){|y|row y}.join
else
(0...Size).each{|i|print row i}
end