npm install mutexThis is a keyed mutex. It abstracts over different Strategies for mutual exclusion, so you can choose your own tradeoffs.
IMPORTANT: Please read the section on correctness before using this module.
``sh`
npm install mutex
Contents
- Constructing Instances
- Strategies
- Channels
- Methods
- [Mutex.lock(String key, [Object options], [Function callback]) => Lock](#mutexlockstring-key-object-options-function-callback--lock)
- Mutex.unlock(Lock lock)
- Lock.isValidForDuration() => Boolean
- Lock.getKey() => String
- Lock.getTTL() => Number
- Examples
- Atomic Increments
- Sample Code: Performing Atomic Increments (Callbacks)
- Sample Code: Performing Atomic Increments (Promises)
- Performance
- Correctness
- Test Suite
- Fuzzer
- License
To use mutex you need to pick a Strategy. Distributed strategies require the use of a Channel. The easiest way to get started is to use the redis strategy.
`js
var mutex = require('mutex')
var uuid = require('uuid')
// Creating a non-distributed mutex with a redis server
var a = mutex({
id: uuid.v4()
, strategy: {
name: 'redis'
// optional, defaults to localhost
, connectionString: 'redis://127.0.0.1'
})
})
// Creating a distributed mutex with 5 nodes, using redis for communication
var b = mutex({
id: uuid.v4()
, strategy: {
name: 'raft'
// required: how many mutex instances you are creating
, clusterSize: 5
// required: pick any channel that gaggle supports
, channel: {
name: 'redis'
// the following options are specific to the channel you picked
, channelName: 'mypubsubchannel'
}
}
})
`
Strategy | Distributed? | Failure Tolerance | Notes
--------- | ------------ | ------------------------------------------------------------------------------------------------------- | ----------------
redis | No | Redis can't fail, but any number of processes can fail as locks automatically expire | Uses SET EX NX | Yes | Less than half of all processes can fail, or be out of contact because of network partitions. | Based on Raft
The distributed mutex is built on Conflux, which is in turn built on Gaggle, an implementation of the Raft consensus algorithm. This means that you can use any channel that Gaggle supports.
Once you've constructed an instance of Mutex, you can use it to acquire and release locks. All Mutex methods support callbacks or promises. Omit the callback parameter and the method will return a promise.
#### Mutex.lock(String key, [Object options], [Function callback]) => Lock
`jslock
m.lock('foobar', {
duration: 1000 // how long must the lock be valid for?
, maxWait: 5000 // how long to wait for another process before giving up?
}, function (err, lock) {
// is an opaque object with several methods documented belowMutex.unlock
// it is what you should hand as the first argument to
})
`jslock
// is the opaque object returned from Mutex.lock
m.unlock(lock, function (err) {})
`js`
if (lock.isValidForDuration(5000)) {
// critical section
}
else {
// toss out the lock, request a new one
}
`js`
lock.getKey()
Returns the key that the lock is for.
`js`
lock.getTTL()
Multiple processes are simultaneously trying to increment the same value in a database that only supports "GET" and "SET" commands. A situation like this might arise:
`
Process A:
1. GET x => 0
2. SET x 1
Process B:
1. GET x => 0
2. SET x 1
Result: x = 1
Expected: x = 2
`
This is known as the "lost update" problem. You can solve this problem with Mutex, which supports both callbacks and promises.
#### Sample Code: Performing Atomic Increments (Callbacks)
`js
var mutex = require('mutex')
, uuid = require('uuid')
, m = mutex({
id: uuid.v4()
, strategy: {
name: 'redis'
}
})
, db = require('your-hypothetical-database')
m.lock('myLock', { // You can create multiple locks by naming them
duration: 1000 // Hold the lock for no longer than 1 second
, maxWait: 5000 // Wait for no longer than 5s to acquire the lock
}, function (err, lock) {
// Handle any errors. No need to release the lock as it will
// automatically expire if the db.get or db.set commands failed.
// You should check if the lock is valid for the needed duration
// just before entering the critical section to protect against
// lock drift, garbage collection cycles, network delays...
if (lock.isValidForDuration(1000)) {
// Begin critical section
db.get('x', (err, val) => {
// Err handling omitted for brevity
db.set('x', val + 1, function (err) {
m.unlock('myLock', function (err) {
// End critical section
})
})
})
}
else {
// Error because the lock was not valid for the needed duration
}
})
`
#### Sample Code: Performing Atomic Increments (Promises)
`js
var mutex = require('mutex')
, m = mutex({
id: uuid.v4()
, strategy: {
name: 'redis'
}
})
, db = require('your-hypothetical-database')
m.lock('myLock', { // You can create multiple locks by naming them
duration: 1000 // Request a lock valid for at least 1 second
, maxWait: 5000 // Wait for no longer than 5s to acquire the lock
})
.then(lock => {
// You should check if the lock is valid for the needed duration
// just before entering the critical section to protect against
// lock drift, garbage collection cycles, network delays...
if (lock.isValidForDuration(1000)) {
// Begin critical section
return db.get('x')
.then(value => {
return db.set('x', value + 1)
})
// End critical section
.then(() => {
return m.unlock(lock)
})
}
else {
return Promise.reject(new Error('The lock was not valid for the needed duration'))
}
})
.catch(err => {
// Handle any errors. No need to release the lock as it will
// automatically expire if the db.get or db.set commands failed.
})
`
By enclosing the GET and SET commands within the critical section, we guarantee that updates are not lost.
Returns the UNIX timestamp that the lock will expire at.
Each test performs an asynchronous operation that takes approximately 70ms a hundred times. The "sequential" test is a single process performing all one hundred operations itself, in series. The "Worst Case" tests are ten processes trying to acquire the same lock before performing the task. The "Best Case" tests are ten processes acquiring different locks before performing the task.
`
Sequential - Baseline x 0.15 ops/sec ±0.35% (5 runs sampled)
Redis - Worst Case x 0.13 ops/sec ±2.55% (5 runs sampled)
Raft - Worst Case x 0.08 ops/sec ±6.34% (5 runs sampled)
Redis - Best Case x 0.63 ops/sec ±1.08% (6 runs sampled)
Raft - Best Case x 0.35 ops/sec ±1.47% (6 runs sampled)
Raft - Worst Case | ######################################## | 120.77 ms/op
Redis - Worst Case | ########################## | 78.03 ms/op
Sequential - Baseline | ###################### | 67.88 ms/op
Raft - Best Case | ########## | 28.72 ms/op
Redis - Best Case | ##### | 15.8 ms/op
`
Note that ms/operation can be much lower than the ~70ms each task takes when tasks are being performed in parallel.
You can run the benchmark suite with npm run benchmark, or run it ten times with npm run benchmarks (the results aren't very stable due to the randomness in Raft leader election).
This mutex should not be used if correctness is important to you. While this module is very good at compensating for garbage collection pauses and clock drift, you cannot be 100% certain that the lock you have acquired has expired because processes get paused for bizzare reasons out of your control. Please read Martin Kleppmann's blog post about distributed locking to better understand this.
If you can deal with a mutex that is very rarely wrong (<0.000001% of the time), then go ahead and use this.
Mutex has a comprehensive test suite, and releases always have 100% statement, branch, and function coverage.
`sh`You need to install Redis to run the tests!
brew install redisTo have launchd start redis now and restart at login:
brew services start redis
Or, if you don't want/need a background service you can just run:
redis-server /usr/local/etc/redis.confV
npm test
Mutex has a fuzzer can detect very subtle problems (such as those caused by clock drift / garbage collection pauses). You can run it with npm run fuzz`. It will keep running until a consistency issue is detected. The most subtle issues detected so far required up to fifteen hours of fuzzing.
Copyright (c) 2015 Ben Ng
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.