Organisationsocaml-multicoresaturnbranch/add-lazy-queueBuild History

Build History for branch/add-lazy-queue

Builds (12)
Add a "lazy" queue This essentially uses a "lazy" semi-immutable queue implemented using a mutable spine that is updated incrementally such that every operation on the queue is O(1). The lazy queue is then wrapped as a single atomic. This results in a relatively space efficient concurrent queue. Performance also seems relatively good with the obvious caveat that as only a single atomic is used, that atomic is a contention point, which somewhat limits scalability compared to queues that have separate mutable head and tail atomics.
30fafa
Add a "lazy" queue This essentially uses a "lazy" semi-immutable queue implemented using a mutable spine that is updated incrementally such that every operation on the queue is O(1). The lazy queue is then wrapped as a single atomic. This results in a relatively space efficient concurrent queue. Performance also seems relatively good with the obvious caveat that as only a single atomic is used, that atomic is a contention point, which somewhat limits scalability compared to queues that have separate mutable head and tail atomics.
5fe246
Hmm...
b83355
Test
d36263
Add a "lazy" queue This queue essentially uses a "lazy" semi-immutable queue implemented using a mutable spine that is updated incrementally such that every operation on the queue is O(1). The lazy queue is then wrapped as a single atomic. This results in a relatively space efficient concurrent queue. Performance also seems relatively good with the obvious caveat that as only a single atomic is used, that atomic is a contention point, which somewhat limits scalability compared to queues that have separate mutable head and tail atomics.
0fe920
Test
98e59c
Test
da93d3
Add a "lazy" queue This queue essentially uses a "lazy" semi-immutable queue implemented using a mutable spine that is updated incrementally such that every operation on the queue is O(1). The lazy queue is then wrapped as a single atomic. This results in a relatively space efficient concurrent queue. Performance also seems relatively good with the obvious caveat that as only a single atomic is used, that atomic is a contention point, which somewhat limits scalability compared to queues that have separate mutable head and tail atomics.
e8d7dc
Add a "lazy" queue This queue essentially uses a "lazy" semi-immutable queue implemented using a mutable spine that is updated incrementally such that every operation on the queue is O(1). The lazy queue is then wrapped as a single atomic. This results in a relatively space efficient concurrent queue. Performance also seems relatively good with the obvious caveat that as only a single atomic is used, that atomic is a contention point, which somewhat limits scalability compared to queues that have separate mutable head and tail atomics.
6d5d28
Add a "lazy" queue This queue essentially uses a "lazy" semi-immutable queue implemented using a mutable spine that is updated incrementally such that every operation on the queue is O(1). The lazy queue is then wrapped as a single atomic. This results in a relatively space efficient concurrent queue. Performance also seems relatively good with the obvious caveat that as only a single atomic is used, that atomic is a contention point, which somewhat limits scalability compared to queues that have separate mutable head and tail atomics.
ca6096
Add a "lazy" queue This queue essentially uses a "lazy" semi-immutable queue implemented using a mutable spine that is updated incrementally such that every operation on the queue is O(1). The lazy queue is then wrapped as a single atomic. This results in a relatively memory efficient concurrent queue. Performance also seems relatively good with the obvious caveat that as only a single atomic is used, that atomic is a contention point, which somewhat limits scalability compared to queues that have separate mutable head and tail atomics.
da5b05
Add a "lazy" queue This queue essentially uses a "lazy" semi-immutable queue implemented using a mutable spine that is updated incrementally such that every operation on the queue is O(1). The lazy queue is then wrapped as a single atomic. This results in a relatively memory efficient concurrent queue. Performance also seems relatively good with the obvious caveat that as only a single atomic is used, that atomic is a contention point, which somewhat limits scalability compared to queues that have separate mutable head and tail atomics.
3f8375