NAME
Acme::Parataxis - Perl Coroutines Using Real OS Fibers via FFI
SYNOPSIS
use v5.40;
use Acme::Parataxis qw[:all];
$|++;
async {
say 'Main task started';
my $f1 = fiber {
say ' Task 1: Sleeping...';
await_sleep(1000);
return 'Coffee!';
};
my $f2 = fiber {
say ' Task 2: Calculating... (simulated CPU work)';
my $sum = 0;
for ( 1 .. 100 ) {
$sum += $_;
maybe_yield(); # Be a good neighbor
}
say ' Task 2: Complete. Will return ' . $sum;
return $sum;
};
# 'await' works on fibers and futures
say 'Result 1: ' . await($f1);
say 'Result 2: ' . await($f2);
};
DESCRIPTION
Acme::Parataxis implements a hybrid concurrency model for Perl, greatly inspired by the concurrency system for the
Wren programming language. It combines cooperative multitasking (fibers) with a
preemptive native thread pool.
Fibers are modern hardware's mechanism for lightweight concurrency. They are similar to threads but are cooperatively scheduled. While the OS may switch between threads at any time, a fiber only passes control when explicitly told to do so. This makes concurrency deterministic and easier to reason about. You (probably) don't have to worry about random context switches clobbering your data. Each fiber has its own stack and context, but they don't use OS thread resources. You can easily create thousands of them without stalling your system.
While this module lives in the Acme:: namespace due to its highly experimental origins (it manually manipulates
Perl's internal stacks and C context via FFI), it is designed to be a robust and highly functional concurrency
framework.
Core Concepts
Creating Fibers
All Perl code in this system runs within a fiber. When you start your script or call Acme::Parataxis::run, a "main"
fiber is active. You can create new fibers using spawn or by manually instantiating an Acme::Parataxis object:
my $fiber = Acme::Parataxis->new(code => sub {
say "I'm in a fiber!";
});
Creating a fiber does not run it immediately. It simply prepares the context and waits to be invoked.
Invoking Fibers
To run a fiber, you "call" it. This suspends the current fiber and executes the called one until it finishes or yields.
$fiber->call();
When the called fiber finishes, control returns to the fiber that called it. It is an error to call a fiber that is already done.
Yielding
Yielding is the "secret sauce" of fibers.
A yielded fiber passes control back to its caller but remembers its exact state, including all variables and the current instruction pointer. The next time it's called, it resumes exactly where it left off.
Acme::Parataxis->yield();
Communication (Passing Values)
Fibers can pass data back and forth through call and yield:
- Resuming with a value: Arguments passed to
$fiber->call(@args)are returned by theyield()call that suspended the fiber. - Yielding with a value: Arguments passed to
Acme::Parataxis->yield(@args)are returned to the caller by thecall()that resumed the fiber.
Full Coroutines
Fibers in Parataxis are "full coroutines." This means they can suspend from anywhere in the callstack. You can call
yield() from deeply nested functions, and the entire fiber stack will be suspended until the fiber is resumed.
Transferring Control
While call() and yield() manage a stack-like chain of execution, transfer() provides an unstructured way to
switch between fibers. When you transfer to a fiber, the current one is suspended, and the target fiber resumes. Unlike
call(), transferring does not establish a parent/child relationship. It's more like a goto for execution
contexts.
$other_fiber->transfer();
Fibers vs. Threads
In Parataxis, your Perl code always runs on a single OS thread. However, when you call an await_* function, the
current fiber is suspended, and the actual blocking work is performed on a different OS thread in a native pool.
Once the task completes, your fiber is automatically queued for resumption on the main thread.
API
While the classic object-oriented API is always available, Acme::Parataxis exports a set of functions (via the
:all tag) that provide a more modern, concise way to write concurrent code.
async { ... }
A convenience wrapper around run(). It starts the scheduler, executes the provided block as the main fiber, and
automatically calls stop() when the block completes.
async {
say "The scheduler is running!";
};
fiber { ... }
An alias for spawn(). It creates a new fiber and returns an Acme::Parataxis fiber object that can be awaited with
await() or ->await(), and also provides Future-style methods (result, on_ready).
my $f = fiber {
say "Hello from fiber!";
};
await( $thing )
A generic await function. It accepts either an Acme::Parataxis fiber object or an Acme::Parataxis::Future and
suspends the current fiber until the target is ready.
my $result = await($f);
await_sleep( $ms )
Suspends the current fiber for $ms milliseconds. This is a non-blocking operation that allows other fibers to run
while the current one is paused.
async {
say "Taking a nap...";
await_sleep(1000);
say "I'm awake!";
};
await_read( $fh, $timeout = 5000 )
Suspends the current fiber until the provided filehandle is ready for reading, or the timeout is reached.
async {
await_read($socket);
my $data = <$socket>;
say "Received: $data";
};
await_write( $fh, $timeout = 5000 )
Suspends the current fiber until the provided filehandle is ready for writing, or the timeout is reached.
async {
await_write($socket);
syswrite($socket, $message);
};
await_core_id()
Returns the ID of the CPU core currently executing the background task. This is a non-blocking operation that offloads the request to the thread pool and suspends the fiber until the result is ready.
async {
my $core = await_core_id();
say "Background task handled by CPU core: $core";
};
Scheduler Functions
The following functions are the primary interface for the integrated cooperative scheduler.
run( $code )
Starts the event loop and executes $code as the initial fiber. The loop continues to run as long as there are active
fibers or pending background tasks.
Acme::Parataxis::run(sub {
say 'The scheduler is running!';
});
spawn( $code )
Creates a new fiber and runs it. Returns an Acme::Parataxis fiber object that can be awaited with await() or ->await() and will eventually contain the fiber's return value.
my $future = Acme::Parataxis->spawn(sub {
return 'Hello from fiber #' . Acme::Parataxis->current_fid;
});
yield( @args )
Pauses the current fiber and returns control to the scheduler. If @args are provided, they are passed to the context
that next resumes this fiber. Arguments can be of any Perl data type.
$fiber->priority( [ $prio ] )
Get or set the scheduler priority of a fiber, Coro-style. Higher numbers are resumed first; fibers with equal priority keep the FIFO order they were enqueued in. The default priority is 0. Setting the priority of a fiber that is already queued immediately moves it to its new position in the run queue.
my $fast = Acme::Parataxis->spawn(sub { ... });
$fast->priority(10); # runs before any priority-0 fiber
stop()
Tells the scheduler to exit the loop after the current iteration. Note that this does not immediately terminate other fibers; it simply prevents the scheduler from starting new ones.
Thread Pool Configuration
Acme::Parataxis uses a native thread pool to handle blocking tasks. While it manages itself automatically, you can
tune its behavior using these functions.
set_max_threads( $count )
Sets the maximum number of worker threads the pool is allowed to spawn. By default, this is set to the number of logical CPU cores detected on your system (up to a hard limit of 64).
# Limit the pool to 4 threads
set_max_threads(4);
max_threads()
Returns the currently configured maximum thread pool size.
Manual Fiber Management
Advanced users can manage context switching themselves without using the integrated scheduler.
new( code => $sub )
Instantiates a new fiber. The code argument must be a subroutine reference.
my $fiber = Acme::Parataxis->new(code => sub {
my $arg = Acme::Parataxis->yield("Initial data");
return "Done with $arg";
});
call( @args )
Explicitly switches control to the fiber and passes @args. Arguments can be scalars, hash/array references, or
objects. This establishes a parent/child relationship: when the fiber yields or completes, control returns to the
caller.
transfer( @args )
A "symmetric" switch. Suspends the current context and moves directly to the target fiber. No parent/child relationship
is established. Like call, it supports passing arbitrary Perl data via @args.
Preemption
If you really must interrupt the normal flow of things, these functions will come in handy.
maybe_yield()
Increments an internal operation counter for the current fiber. If the counter reaches the threshold set by
set_preempt_threshold, the fiber automatically yields.
while (my $row = $sth->fetch) {
process($row);
Acme::Parataxis->maybe_yield(); # Cooperatively prevent starvation
}
set_preempt_threshold( $val )
Sets the number of maybe_yield increments before a forced yield occurs. Default is 0 (preemption disabled).
Class Methods
tid()
Returns the unique OS Thread ID of the main interpreter thread.
current_fid()
Returns the unique numeric ID of the currently executing fiber, or -1 if called from the "root" (main) context.
root()
Returns a proxy object representing the initial execution context. This is useful for transfer()ing control back to
the main thread from a symmetric coroutine.
fid()
Returns the unique numeric ID of the fiber object.
is_done()
Returns true if the fiber has finished execution (either by returning or dying). Once a fiber is done, its internal ID is released and it can no longer be called.
Integrating with Synchronous Code
To use synchronous modules (like HTTP::Tiny) in a non-blocking way, you can subclass their handle or transport
methods and use a while loop combined with yield('WAITING'). This ensures the fiber yields control until the
underlying I/O is ready.
# Example: A cooperative HTTP::Tiny subclass
{
package My::HTTP;
use parent 'HTTP::Tiny';
sub _open_handle {
my ($self, $request, $scheme, $host, $port, $peer) = @_;
return My::HTTP::Handle->new(
timeout => $self->{timeout},
keep_alive => $self->{keep_alive},
keep_alive_timeout => $self->{keep_alive_timeout}
)->connect($scheme, $host, $port, $peer);
}
sub request {
my ($self, $method, $url, $args) = @_;
my %new_args = %{ $args // {} };
my $orig_cb = $new_args{data_callback};
my $content = '';
$new_args{data_callback} = sub {
my ($data, $response) = @_;
if ($orig_cb) { return $orig_cb->($data, $response) }
$content .= $data;
return 1;
};
my $res = $self->SUPER::request($method, $url, \%new_args);
$res->{content} = $content unless $orig_cb;
return $res;
}
}
{
package My::HTTP::Handle;
use parent -norequire, 'HTTP::Tiny::Handle';
use Time::HiRes qw[time];
sub _do_timeout {
my ($self, $type, $timeout) = @_;
$timeout //= $self->{timeout} // 60;
my $start = time;
while (1) {
# Check for readiness NOW (0 timeout)
return 1 if $self->SUPER::_do_timeout($type, 0);
# Check for overall timeout
my $elapsed = time - $start;
return 0 if $elapsed > $timeout;
# Suspend fiber and wait for background I/O check
my $wait = ($timeout - $elapsed) > 0.5 ? 0.5 : ($timeout - $elapsed);
if ($type eq 'read') {
Acme::Parataxis->await_read($self->{fh}, int($wait * 1000));
} else {
Acme::Parataxis->await_write($self->{fh}, int($wait * 1000));
}
}
}
}
Examples
These are useful samples that should be modules in their own right but find their home here in documentation instead for now.
Cooperative Parallelism
This example demonstrates how to perform multiple HTTP requests concurrently on a single interpretation thread.
use Acme::Parataxis;
# ... (See My::HTTP implementation above) ...
Acme::Parataxis::run(sub {
my $http = My::HTTP->new(verify_SSL => 0);
my @urls = qw[http://example.com http://perl.org];
# Spawn tasks for each URL
my @futures = map {
my $url = $_;
Acme::Parataxis->spawn(sub { $http->get($url)->{status} })
} @urls;
# Collect results as they become ready
say "Status for $urls[$_]: " . $futures[$_]->await() for 0..$#urls;
});
Symmetric Producer/Consumer
A low-level example of passing control sideways between fibers.
my ($p, $c);
$p = Acme::Parataxis->new(code => sub {
for my $item (qw[Apple Banana Cherry]) {
say "Producer: Sending $item";
$c->transfer($item);
}
$c->transfer('DONE');
});
$c = Acme::Parataxis->new(code => sub {
my $item = Acme::Parataxis->yield(); # Initial wait
while (1) {
last if $item eq 'DONE';
say "Consumer: Eating $item";
$item = $p->transfer();
}
});
$c->call(); # Prime consumer
$p->call(); # Start producer
Futures
A common pattern for lightweight concurrency abstractions.
use Acme::Parataxis::Future;
my $future = Acme::Parataxis::Future->new;
# Register a callback
$future->on_ready(sub ($f) {
say 'Result: ' . $f->result;
});
# Set the result (from another fiber)
$future->set_result(42);
# Await in a fiber (suspends until ready)
my $value = $future->await;
A future represents a value that will be available at some point in the future. Futures are used to coordinate between
fibers: one fiber produces a result via set_result or set_error, and one or more consumers retrieve it via
result or await.
Semaphore
A simple integer counter that optionally blocks fibers when it reaches zero. There is no owner associated with a
semaphore, so one fiber can down it while another can up it, up may be called before down, and so on.
Blocked fibers are parked (they do not busy-wait) and are resumed in FIFO order as permits become available, exactly
like the futures used by await.
use Acme::Parataxis;
use Acme::Parataxis::Semaphore;
my $sem = Acme::Parataxis::Semaphore->new; # unlocked by default
async {
fiber { $sem->down }; # wait for a signal
$sem->up;
};
Channels
A simple message queue that allows you to send and receive data. If the channel is full, writers block; if it is empty, readers block. Both ends can be used by as many fibers as you want concurrently.
A channel of size 1 is a rendezvous point (no buffering: put waits for a matching get); to buffer one element
use size 2, and so on.
use Acme::Parataxis;
use Acme::Parataxis::Channel;
my $q = Acme::Parataxis::Channel->new( 4 );
async {
fiber { $q->put( $_ ) for 1 .. 8 }; # producers
say $q->get for 1 .. 8; # consumer
};
Signals
An object with a two-state flag and a FIFO queue of waiters. A fiber parked in wait does not busy-wait; it is
resumed by the scheduler when the signal fires.
use Acme::Parataxis;
use Acme::Parataxis::Signal;
my $sig = Acme::Parataxis::Signal->new;
async {
fiber { $sig->wait; say 'I rise!' };
$sig->send;
};
Best Practices & Gotchas
- Avoid Blocking Syscalls: Never call blocking
sleep()orsysread()on the main interpretation thread. Always use theawait_*equivalents to offload work to the pool. - Thread Safety: While Perl code remains single-threaded, background tasks run on separate OS threads. Shared C-level data (if accessed via FFI) must be mutex-protected.
- Stack Limits: Each fiber is allocated a virtual stack backed by mmap with a guard page. Physical memory is only consumed for pages the fiber actually touches, so this is cheap even for thousands of fibers. On Linux and FreeBSD the reservation is 64MB and made with `MAP_NORESERVE`; on macOS (which has no `MAP_NORESERVE`, so every mapping counts against the process memory budget) the reservation is 8MB -- still ample for deep recursion.
- Efficiency: The native thread pool is initialized dynamically upon the first asynchronous request. It starts with a small "seed" pool and grows on demand up to the configured limit. Worker threads use condition variables to sleep efficiently when idle, ensuring near-zero CPU usage when no background tasks are pending.
- Reference Cycles: Be careful when passing fiber objects into their own closures, as this can create memory leaks.
Gory Technical Details
Architectural Inspiration
The core concurrency model in Parataxis is heavily inspired by the Wren programming language, specifically its treatment of fibers as the primary unit of execution and its deterministic cooperative scheduling.
Stack Virtualization
On Unix-like systems, we use ucontext.h to manage stack and register state. On Windows, we leverage the native
Fiber API. In both cases, we perform heart surgery on the Perl interpreter by manually teleporting its internal
global pointers (the PL_* variables) between contexts.
Shared CVs and Pad Virtualization
A significant challenge in Perl green threads is the shared nature of PadLists and the global CvDEPTH counter. In
debug builds of Perl, calling a shared subroutine from multiple fibers can trigger internal assertions (like
AvFILLp(av) == -1). Parataxis includes a specialized workaround that surgically cleans the next landing pad before
every context switch to satisfy these assertions without clobbering active lexical state.
eval vs. try/catch
While feature 'try' is available in modern Perl, manually teleporting interpreter state can occasionally confuse the
compiler's expectations for stack unwinding. Standard eval { ... } remains the most predictable way to handle
exceptions within fibers.
Signal Handling
Not to be confused with Acme::Parataxis::Signal, true OS-level signals (like SIGINT) are delivered to the main
process thread. Perl handles these at 'safe points,' which in this module typically occur during a context switch
(yield, transfer, or call). If you receive an OS signal while a fiber is suspended, it will generally be processed when
the fiber is resumed and hits its next internal Perl opcode.
The 'Final Transfer' Requirement
In a symmetric coroutine model (using transfer()), fibers don't have a natural 'parent' to return to. I've added
fallback logic to return to the last_sender or the main thread on exit, but it's good practice to explicitly
transfer() back to a partner fiber or the root() context to ensure your application logic remains predictable.
Leaving a fiber to just 'fall off the end' is like walking out of a room without closing the door; eventually, the
draft will bother someone.
is_done() vs. Destruction
A fiber being is_done() simply means its Perl code has finished executing. The underlying C-level memory (stacks,
context, etc.) is not immediately freed until the Acme::Parataxis object is destroyed or the runtime performs its
final cleanup(). This is why you might see memory usage stay flat even after a fiber finishes, until the garbage
collector finally catches up with the object.
AUTHOR
Sanko Robinson https://github.com/sanko
LICENSE
Copyright (C) Sanko Robinson.
This library is free software; you can redistribute it and/or modify it under the terms found in the Artistic License 2.