Using locks in Perl with the Thread::Semaphore module helps manage multiple threads accessing shared resources. This can prevent race conditions and ensure data integrity. Here’s a simple example to demonstrate how to implement a semaphore lock in Perl.
use strict;
use warnings;
use threads;
use Thread::Semaphore;
# Initialize a semaphore with a count of 1 (binary semaphore)
my $semaphore = Thread::Semaphore->new(1);
# Shared resource
my $counter = 0;
# Subroutine to increment the counter safely
sub increment {
$semaphore->down; # Acquire lock
for (1..1000) {
$counter++;
}
$semaphore->up; # Release lock
}
# Create threads
my @threads;
for (1..10) {
push @threads, threads->create(\&increment);
}
# Wait for all threads to finish
$_->join() for @threads;
print "Final counter value: $counter\n";
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?